The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Numerical potential field techniques for robot path planning
Abstract
An approach to robot path planning that consists of incrementally building a graph connecting the local minima of a potential field defined in the robot's configuration space and concurrently searching this graph until a goal configuration is attained is proposed. Unlike the so-called global path planning methods, this approach does not require an expensive computation step before the search for a path can actually start, and it searches a graph that is usually much smaller than the graph searched by the so-called local methods. A collection of effective techniques to implement this approach is described. They are based on the use of multiscale pyramids of bitmap arrays for representing both the robot's workspace and configuration space. This distributed representation makes it possible to construct potential fields numerically, rather than analytically. A path planner based on these techniques has been implemented. Experiments with this planner show that it is both very fast and capable of handling many degrees of freedom.>
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Probability, Random Variables, and Stochastic Processes.
Abrahams, J., & Papoulis, A. (1984) · Journal of the American Statistical Association · doi:10.2307/2288754 · Cited by 16,226
Probability, Random Variables, and Stochastic Processes
Miller, I. (1966) · Technometrics · doi:10.1080/00401706.1966.10490365 · Cited by 8,452
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
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
Self-citationRandom variables and stochastic processes
Larson, H. J., & Shubert, B. O. (1979) · Wiley eBooks · Cited by 4,640
Image Analysis and Mathematical Morphology.
Diggle, P. J., & Serra, J. (1983) · Biometrics · doi:10.2307/2531038 · Cited by 3,894
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
Černý, V. (1985) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940812 · Cited by 3,436
Data Structures and Algorithms
(2003) · Series on software engineering and knowledge engineering · doi:10.1142/9789812791245 · Cited by 2,117
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
Data Structures and Algorithms
Wirth, N. (1984) · Scientific American · doi:10.1038/scientificamerican0984-60 · Cited by 1,418
The complexity of robot motion planning
Canny, J. (1988) · Medical Entomology and Zoology · Cited by 1,375
Robot Motion Planning: A Distributed Representation Approach
Barraquand, J., & Latombe, J.-C. (1991) · The International Journal of Robotics Research · doi:10.1177/027836499101000604 · Cited by 995
Self-citationPrinciples of artificial intelligence
McDermott, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90026-0 · Cited by 814
Schwartz, J. T., & Sharir, M. (1983) · Advances in Applied Mathematics · doi:10.1016/0196-8858(83)90014-3 · Cited by 801
Toward Efficient Trajectory Planning: The Path-Velocity Decomposition
Kant, K., & Zucker, S. W. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500304 · Cited by 753
Erdmann, M., & Lozano-Pérez, T. (1987) · Algorithmica · doi:10.1007/bf01840371 · Cited by 736
A subdivision algorithm in configuration space for findpath with rotation
Brooks, R. A., & Lozano-Perez, T. (1985) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1985.6313352 · Cited by 550
Generalization of Voronoi Diagrams in the Plane
Lee, D. T., & Drysdale, III (1981) · SIAM Journal on Computing · doi:10.1137/0210006 · Cited by 312
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
Planning, geometry, and complexity of robot motion
Schwartz, J. T., Sharir, M., & Hopcroft, J. E. (1986) · Cited by 217
A search algorithm for motion planning with six degrees of freedom
Donald, B. R. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90069-5 · Cited by 216
Erdmann, M., & Lozano-Perez, T. (1986) · Proceedings. 1986 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1986.1087401 · Cited by 208
New heuristic algorithms for efficient hierarchical path planning
Zhu, D. J., & Latombe, J.-C. (1991) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.68066 · Cited by 191
Self-citationThe 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
Ó'Dúnlaing, C., Sharir, M., & Yap, C. K. (1983) · doi:10.1145/800061.808750 · Cited by 146
Strategies for Solving Collision-free Trajectories Problems for Mobile and Manipulator Robots
Gouzenes, L. (1984) · The International Journal of Robotics Research · doi:10.1177/027836498400300403 · Cited by 138
Robot planning and control via potential functions
Koditschek, D. E. (1989) · ScholarlyCommons (University of Pennsylvania) · Cited by 130
Small Random perturbation of dynamical systems with reflecting boundary
Anderson, R. F., & Orey, S. (1976) · Nagoya Mathematical Journal · doi:10.1017/s0027763000017232 · Cited by 122
The construction of analytic diffeomorphisms for exact robot navigation on star worlds
Rimon, E., & Koditschek, D. E. (2003) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1989.99962 · Cited by 85
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
Self-citationA fast path planner for a car-like indoor mobile robot
Latombe, J. (1991) · National Conference on Artificial Intelligence · Cited by 61
Self-citationObject level programming of industrial robots
Faverjon, B. (1986) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1986.1087412 · Cited by 55
Experiments in the dynamic and strategic control of cooperating manipulators
Schneider, S. A. (1990) · Cited by 37
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
Self-citationRandomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Real-Time Motion Planning for Agile Autonomous Vehicles
Frazzoli, E., Dahleh, M. A., & Feron, E. (2002) · Journal of Guidance, Control, and Dynamics · doi:10.2514/2.4856 · Cited by 830
Simulating Humans: Computer Graphics, Animation, and Control
Badler, N. I., Phillips, C. B., & Webber, B. L. (1993) · Oxford University Press eBooks · doi:10.1093/oso/9780195073591.001.0001 · Cited by 751
Safety-enhanced UAV path planning with spherical vector-based particle swarm optimization
Phung, M. D., & Ha, Q. P. (2021) · Applied Soft Computing · doi:10.1016/j.asoc.2021.107376 · Cited by 565
Metadata
- Authors
- Barraquand, J., Langlois, B., & Latombe, J.-C.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1992
- Volume
- 22
- Issue
- 2
- Pages
- 224-241
- ISSN
- 0018-9472 (ISSN-L)
- OpenAlex
- W2053407718
- Cited by
- 889
- References
- 35
- FWCI
- 11.92
- 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.