The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Robot Motion Planning: A Distributed Representation Approach
Abstract
We propose a new approach to robot path planning that consists of building and searching a graph connecting the local minima of a potential function defined over the robot's configuration space. A planner based on this approach has been implemented. This planner is consider ably faster than previous path planners and solves prob lems for robots with many more degrees of freedom (DOFs). The power of the planner derives both from the "good" properties of the potential function and from the efficiency of the techniques used to escape the local min ima of this function. The most powerful of these tech niques is a Monte Carlo technique that escapes local min ima by executing Brownian motions. The overall approach is made possible by the systematic use of distributed rep resentations (bitmaps) for the robot's work space and configuration space. We have experimented with the plan ner using several computer-simulated robots, including rigid objects with 3 DOFs (in 2D work space) and 6 DOFs (in 3D work space) and manipulator arms with 8, 10, and 31 DOFs (in 2D and 3D work spaces). Some of the most significant experiments are reported in this article.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“RRT is faster than PRM and both are probabilistically complete [257], which means a path that satisfies the given conditions will be guaranteed to be found with enough runtime.”
From A Survey of Autonomous Driving: Common Practices and Emerging Technologies (2020) · cites this paper as [257]
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
Image analysis and mathematical morphology
(1982) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(82)90078-8 · Cited by 8,151
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 · cited 2×
“For example, a widely used heuristics consists of guiding the robot along the negated gradient of an artificial potential field (Khatib 1986).”
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
Self-citationImage Analysis and Mathematical Morphology.
Diggle, P. J., & Serra, J. (1983) · Biometrics · doi:10.2307/2531038 · Cited by 3,894
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457
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
Research works printed but not linked: 16
- Barnard, S.T., 1988, Computer Vision, 2
- Barraquand, J., 1988, Markovian random fields in computer vision: Applications to seismic data understanding
- Barraquand, J., Proc. of the 4th IEEE Int. Symp. on Intelligent Control
- Barraquand, J., 1989, Robot Motion Planning: A Distributed Representation Approach. Report no. STAN-CS-89-1257
- Brooks, R.A., Proc. of the 8th Int. Joint Conf. on Artificial Intelligence
- Faverjon, B., Proc. of the IEEE Int. Conf. on Robotics and Automation
- Faverjon, B., Proc. of the IEEE Int. Conf. on Robotics and Automation
- Faverjon, B., Proc. of the IEEE Int. Conf. on Automation and Robotics
- Koditschek, D.E., Proc. of the IEEE Int. Conf. on Robotics and Automation
- Laugier, C., 1985, Int. Conf. on Advanced Robotics.
- Lumelsky, V., Proc. of the 26th IEEE Conf. on Decision and Control
- Métivier, C., 1990, Run-time statistical analysis of a robot motion planning algorithm. Internal technical note. Robotics Laboratory, Dept. of Computer Science
- O'Donnell, P.A., Proc. of the IEEE Int. Conf. on Robotics and Automation
- Ó'Dúnlaing, C., Proc. of the 15th ACM Symp. on the Theory of Computing
- Reif, J.H., 1979, Science, 421
- Rimon, E., Proc. of the IEEE Int. Conf. on Robotics and Automation
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-citationSampling-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
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
A Survey of Autonomous Driving: Common Practices and Emerging Technologies
Yurtsever, E., Lambert, J., Carballo, A., & Takeda, K. (2020) · IEEE Access · doi:10.1109/access.2020.2983149 · Cited by 1,889
“Randomized Potential Planner (RPP) [252] is one of the earliest SBP approaches, where random walks are generated for escaping local minimums.”
BackgroundMethodNumerical potential field techniques for robot path planning
Barraquand, J., Langlois, B., & Latombe, J.-C. (1992) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.148426 · Cited by 889
Self-citation
Metadata
- Authors
- Barraquand, J., & Latombe, J.-C.
- Affiliations
- Stanford University (US)
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 1991-12
- Volume
- 10
- Issue
- 6
- Pages
- 628-649
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W1978301848
- Cited by
- 995
- References
- 46
- Citations by year
- 2026: 7 · 2025: 11 · 2024: 17 · 2023: 9 · 2022: 18 · 2021: 32 · 2020: 28 · 2019: 23 · 2018: 23 · 2017: 19 · 2016: 37 · 2015: 21 · 2014: 24 · 2013: 24 · 2012: 20
- FWCI
- 37.68
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- journals.sagepub.com/page/policies/text-and-data-mining-license (tdm)
- Locations
- The International Journal of Robotics Research (publishedVersion)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Robotic Path Planning Algorithms
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Keywords
- robot path planning, motion planning, distributed representations, bitmaps, potential function, local minima, Monte Carlo methods, Brownian motion, configuration space, high-degree-of-freedom robots, robot manipulators
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Robot Motion Planning: A Distributed Representation Approach. https://app.cochat.ai/papers/10.1177/027836499101000604
- The paper
- Barraquand, J., & Latombe, J.-C. (1991). Robot Motion Planning: A Distributed Representation Approach. The International Journal of Robotics Research. https://doi.org/10.1177/027836499101000604
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.