The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Exact robot navigation using artificial potential functions
Abstract
A methodology for exact robot motion planning and control that unifies the purely kinematic path planning problem with the lower level feedback controller design is presented. Complete information about a freespace and goal is encoded in the form of a special artificial potential function, called a navigation function, that connects the kinematic planning problem with the dynamic execution problem in a provably correct fashion. The navigation function automatically gives rise to a bounded-torque feedback controller for the robot's actuators that guarantees collision-free motion and convergence to the destination from almost all initial free configurations. A formula for navigation functions that guide a point-mass robot in a generalized sphere world is developed. The simplest member of this family is a space obtained by puncturing a disk by an arbitrary number of smaller disjoint disks representing obstacles. The other spaces are obtained from this model by a suitable coordinate transformation. Simulation results for planar scenarios are provided.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894
The complexity of robot motion planning
Canny, J. (1988) · Medical Entomology and Zoology · Cited by 1,375
Time-Optimal Control of Robotic Manipulators Along Specified Paths
Bobrow, J. E., Dubowsky, S., & Gibson, J. S. (1985) · The International Journal of Robotics Research · doi:10.1177/027836498500400301 · Cited by 1,315
Real-time obstacle avoidance for fast mobile robots
Borenstein, J., & Koren, Y. (1989) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.44033 · Cited by 1,258
Resolved-acceleration control of mechanical manipulators
Luh, J., Walker, M., & Paul, R. (1980) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1980.1102367 · Cited by 1,203
Automatic Synthesis of Fine-Motion Strategies for Robots
Lozano-Pérez, T., Mason, M. T., & Taylor, R. H. (1984) · The International Journal of Robotics Research · doi:10.1177/027836498400300101 · Cited by 898
Schwartz, J. T., & Sharir, M. (1983) · Advances in Applied Mathematics · doi:10.1016/0196-8858(83)90014-3 · Cited by 801
Robot navigation functions on manifolds with boundary
Koditschek, D. E., & Rimon, E. (1990) · Advances in Applied Mathematics · doi:10.1016/0196-8858(90)90017-s · Cited by 567
Self-citationVillani, V (2011) · Springer eBooks · doi:10.1007/978-3-642-11102-0 · Cited by 564
Real-time obstacle avoidance using harmonic potential functions
Kim, J.-O., & Khosla, P. K. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.143352 · Cited by 522
Path planning using Laplace's equation
Connolly, C. I., Burns, J. B., & Weiss, R. (2002) · Proceedings., IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1990.126315 · Cited by 483
Treatise on Natural Philosophy
Thomson, W., Baron, K., & Tait, P. G. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511703928 · Cited by 451
Generalized Poincare's Conjecture in Dimensions Greater Than Four
Smale, S. (1961) · The Annals of Mathematics · doi:10.2307/1970239 · Cited by 428
Global path planning using artificial potential fields
Warren, C. W. (2003) · Proceedings, 1989 International Conference on Robotics and Automation · doi:10.1109/robot.1989.100007 · Cited by 370
Treatise on Natural Philosophy
Thomson, W., & Tait, P. G. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511703935 · Cited by 329
Dynamical Systems: Stability Theory and Applications
Bhatia, N. P., & Szegö, G. P. (1967) · Lecture Notes in Mathematics · doi:10.1007/bfb0080630 · Cited by 315
Solid Modeling: Current Status and Research Directions
G. Requicha, A., & Voelcker, H. (1983) · IEEE Computer Graphics and Applications · doi:10.1109/mcg.1983.263271 · Cited by 301
A Monte-Carlo algorithm for path planning with many degrees of freedom
Barraquand, J., & Latombe, J.-C. (2002) · Proceedings., IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1990.126256 · Cited by 247
Handey: A robot system that recognizes, plans, and manipulates
Lozano‐Pérez, T., Jones, J. L., Mazer, E., O'Donnell, P. A., Grimson, W. E. L., Tournassoud, P., & Lanusse, A. (2005) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1987.1087847 · Cited by 160
The Construction of Analytic Diffeomorphisms for Exact Robot Navigation on Star Worlds
Rimon, E., & Koditschek, D. E. (1991) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1991-1012512-x · Cited by 154
Self-citationLocal obstacle avoidance for mobile robots based on the method of artificial potentials
Tilove, R. B. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1990.126041 · Cited by 141
High speed robot control and obstacle avoidance using dynamic potential functions
Newman, W. S., & Hogan, N. (2005) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1987.1088046 · Cited by 105
Robot motion planning with many degrees of freedom and dynamic constraints
Barraquand, J., Langlois, B., & Latombe, J. (1991) · International Symposium on Robotics · Cited by 80
Exact robot navigation in geometrically complicated but topologically simple spaces
Romon, E., & Koditschek, D. E. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1990.126291 · Cited by 41
Self-citation
Cited by
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343
Sampling-based algorithms for optimal motion planning
Karaman, S., & Frazzoli, E. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406761 · Cited by 5,275
Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
Olfati-Saber, R. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.864190 · Cited by 5,037
Dynamical Movement Primitives: Learning Attractor Models for Motor Behaviors
Ijspeert, A. J., Nakanishi, J., Hoffmann, H., Pastor, P., & Schaal, S. (2013) · Neural Computation · doi:10.1162/neco_a_00393 · Cited by 1,598
Flocking in Fixed and Switching Networks
Tanner, H. G., Jadbabaie, A., & Pappas, G. J. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.895948 · Cited by 1,431
Metadata
- Authors
- Rimon, E., & Koditschek, D. E.
- Venue
- IEEE Transactions on Robotics and Automation
- Published
- 1992
- Volume
- 8
- Issue
- 5
- Pages
- 501-518
- ISSN
- 1042-296X (ISSN-L)
- OpenAlex
- W2110144538
- Cited by
- 1,835
- References
- 24
- FWCI
- 9.08
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.