Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 247

The DOI matches its Crossref record.

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

Abstract

A stochastic technique is described for planning collision-free paths of robots with many degrees of freedom (DOFs). The algorithm incrementally builds a graph connecting the local minima of a potential function defined in the robot's configuration space and concurrently searches the graph until a goal configuration is attained. A local minimum is connected to another one by executing a random motion that escapes the well of the first minimum, succeeded by a gradient motion that follows the negated gradient of the potential function. All the motions are executed in a grid shown through the robot's configuration space. The random motions are implemented as random walks which are known to converge toward Brownian motions when the steps of the walks tend toward zero. The local minima graph is searched using a depth-first strategy with random backtracking. In the technique, the planner does not explicitly represent the local-minima graph. The path-planning algorithm has been fully implemented and has run successfully on a variety of problems involving robots with many degrees of freedom.>

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/robot.1990.126256

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 247

Metadata

Authors
Barraquand, J., & Latombe, J.-C.
Venue
Proceedings., IEEE International Conference on Robotics and Automation
Published
2002-12-04
Pages
1712-1717
ISSN
1050-4729 (ISSN-L)
OpenAlex
W2147798571
Cited by
247
References
0
FWCI
14.48
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Monte-Carlo algorithm for path planning with many degrees of freedom. https://app.cochat.ai/papers/10.1109/robot.1990.126256
The paper
Barraquand, J., & Latombe, J.-C. (2002). A Monte-Carlo algorithm for path planning with many degrees of freedom. Proceedings., IEEE International Conference on Robotics and Automation. https://doi.org/10.1109/robot.1990.126256

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.