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

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Analysis of probabilistic roadmaps for path planning

Kavraki, L.E., Kolountzakis, M.N., Latombe, J.-C.·2002·Proceedings of IEEE International Conference on Robotics and Automation

Abstract

Provides an analysis of a path planning method which uses probabilistic roadmaps. This method has proven very successful in practice, but the theoretical understanding of its performance is still limited. Assuming that a path /spl gamma/ exists between two configurations a and b of the robot, we study the dependence of the failure probability to connect a and b on (i) the length of /spl gamma/, (ii) the distance function of /spl gamma/ from the obstacles, and (iii) the number of nodes N of the probabilistic roadmap constructed. Importantly, our results do not depend strongly on local irregularities of the configuration space, as was the case with previous analysis. These results are illustrated with a simple but illuminating example. In this example, we provide estimates for N, the principal parameter of the method, in order to achieve failure probability within prescribed bounds. We also compare, through this example, the different approaches to the analysis of the planning method.

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.1996.509171

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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

Cites

Show all 1 references

Cited by

See all 409

Metadata

Authors
Kavraki, L. E., Kolountzakis, M. N., & Latombe, J.-C.
Venue
Proceedings of IEEE International Conference on Robotics and Automation
Publisher
IEEE
Published
2002-12-23
Volume
4
Pages
3020-3025
ISSN
1050-4729 (ISSN-L)
OpenAlex
W2096636360
Cited by
409
References
1
FWCI
13.27
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: Analysis of probabilistic roadmaps for path planning. https://app.cochat.ai/papers/10.1109/robot.1996.509171
The paper
Kavraki, L. E., Kolountzakis, M. N., & Latombe, J.-C. (2002). Analysis of probabilistic roadmaps for path planning. Proceedings of IEEE International Conference on Robotics and Automation. https://doi.org/10.1109/robot.1996.509171

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.