The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Global path planning using artificial potential fields
Abstract
The author describes a path planning technique for robotic manipulators and mobile robots in the presence of stationary obstacles. The planning consists of applying potential fields around configuration-space obstacles and using these fields to select a safe path for the robot to follow. The advantage of using potential fields in path planning is that they offer a relatively fast and effective way to solve for safe paths around obstacles. In the proposed method of path planning, a trial path is chosen and then modified under the influence of the potential field until an appropriate path is found. By considering the entire path, the problem of being trapped in a local minimum is greatly reduced, allowing the method to be used for global planning. The algorithm was tried with success on many different realistic planning problems. By way of illustration, the algorithm is applied to a two-dimensional revolute manipulator, a mobile robot capable of translation only, and a mobile robot capable of both translation and rotation.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Impedance Control: An Approach to Manipulation: Part I—Theory
Hogan, N. (1985) · Journal of Dynamic Systems, Measurement, and Control · doi:10.1115/1.3140702 · Cited by 3,673
An algorithm for planning collision-free paths among polyhedral obstacles
Lozano-Pérez, T., & Wesley, M. A. (1979) · Communications of the ACM · doi:10.1145/359156.359164 · Cited by 2,304
Real-time obstacle avoidance for manipulators and mobile robots
Khatib, O. (2005) · Proceedings. 1985 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1985.1087247 · Cited by 1,757
Exact robot navigation by means of potential functions: Some topological considerations
Koditschek, D. (2005) · Proceedings. 1987 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1987.1088038 · Cited by 345
Integrated path planning and dynamic steering control for autonomous vehicles
Krogh, B., & Thorpe, C. (1986) · Proceedings. 1986 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1986.1087444 · Cited by 259
Using Backprojections for Fine Motion Planning with Uncertainty
Erdmann, M. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500102 · Cited by 252
Superquadric artificial potentials for obstacle avoidance and approach
Khosla, P., & Volpe, R. (2003) · Proceedings. 1988 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1988.12323 · Cited by 237
Symbolic Error Analysis and Robot Planning
Brooks, R. A. (1982) · The International Journal of Robotics Research · doi:10.1177/027836498200100403 · Cited by 226
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
Cited by
Exact robot navigation using artificial potential functions
Rimon, E., & Koditschek, D. E. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.163777 · Cited by 1,835
Motion planning with sequential convex optimization and convex collision checking
Schulman, J., Duan, Y., Ho, J., Lee, A., Awwal, I., Bradlow, H., Pan, J., Patil, S., Goldberg, K., & Abbeel, P. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914528132 · Cited by 866
Gross motion planning—a survey
Hwang, Y. K., & Ahuja, N. (1992) · ACM Computing Surveys · doi:10.1145/136035.136037 · Cited by 826
Dynamic Motion Planning for Mobile Robots Using Potential Field Method
Ge, S. S., & Cui, Y. J. (2002) · Autonomous Robots · doi:10.1023/a:1020564024509 · Cited by 803
Robot Collisions: A Survey on Detection, Isolation, and Identification
Haddadin, S., De Luca, A., & Albu-Schaffer, A. (2017) · IEEE Transactions on Robotics · doi:10.1109/tro.2017.2723903 · Cited by 791
Real-time obstacle avoidance using harmonic potential functions
Kim, J.-O., & Khosla, P. (2002) · Proceedings. 1991 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1991.131683 · Cited by 559
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
Finding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization
Schulman, J., Ho, J., Lee, A., Awwal, I., Bradlow, H., & Abbeel, P. (2013) · Robotics: Science and Systems IX · doi:10.15607/rss.2013.ix.031 · Cited by 430
A depth space approach to human-robot collision avoidance
Flacco, F., Kroger, T., De Luca, A., & Khatib, O. (2012) · 2012 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2012.6225245 · Cited by 428
Elastic Strips: A Framework for Motion Generation in Human Environments
Brock, O., & Khatib, O. (2002) · The International Journal of Robotics Research · doi:10.1177/027836402128964189 · Cited by 352
Roadmap-Based Path Planning - Using the Voronoi Diagram for a Clearance-Based Shortest Path
Bhattacharya, P., & Gavrilova, M. (2008) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2008.921540 · Cited by 312
Neural Network Dynamics for Path Planning and Obstacle Avoidance
Glasius, R., Komoda, A., & Gielen, S. C. A. M. (1995) · Neural Networks · doi:10.1016/0893-6080(94)e0045-m · Cited by 289
Manipulator control with superquadric artificial potential functions: theory and experiments
Volpe, R., & Khosla, P. (1990) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.61211 · Cited by 254
Singletary, A., Klingebiel, K., Bourne, J., Browning, A., Tokumaru, P., & Ames, A. (2021) · 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros51168.2021.9636670 · Cited by 182
Metadata
- Authors
- Warren, C. W.
- Venue
- Proceedings, 1989 International Conference on Robotics and Automation
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2003-01-07
- Pages
- 316-321
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2116966230
- Cited by
- 370
- References
- 17
- FWCI
- 5.18
- Type
- conference paper
- 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.