The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
On the Probabilistic Foundations of Probabilistic Roadmap Planning
Open accessAbstract
Why is probabilistic roadmap (PRM) planning probabilistic? How does the probability measure used for sampling a robot’s configuration space affect the performance of a PRM planner? These questions have received little attention to date. This paper tries to fill this gap and identify promising directions to improve future planners. It introduces the probabilistic foundations of PRM planning and examines previous work in this context. It shows that the success of PRM planning depends mainly and critically on favorable “visibility” properties of a robot’s configuration space. A promising direction for speeding up PRM planners is to infer partial knowledge of such properties from both workspace geometry and information gathered during roadmap construction, and to use this knowledge to adapt the probability measure for sampling. This paper also shows that the choice of the sampling source—pseudo-random or deterministic—has small impact on a PRM planner’s performance, compared with that of the sampling measure. These conclusions are supported by both theoretical and empirical results.
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.
Integrity signals
Registry
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.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
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 · cited 3×
“To illustrate, Figure 6 compares the average running times of three versions of BasicPRM with distinct sampling strategies: the uniform strategy (whose sampling measure π is uniform over C), the Gaussian strategy of [4], and the two-phase connectivity expansion strategy of [27].”
BackgroundMethodSelf-citationThe Art of Computer Programming. Volume 2: Seminumerical Algorithms.
Taussky, O., & Knuth, D. E. (1970) · The American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,822
Proceedings. 1985 IEEE International Conference on Robotics and Automation
(1985) · doi:10.1109/robot.1985 · Cited by 3,673
Random Number Generation and Quasi-Monte Carlo Methods.
Collings, B. J., & Niederreiter, H. (1993) · Journal of the American Statistical Association · doi:10.2307/2290359 · Cited by 2,884
Random Number Generation and Quasi-Monte Carlo Methods
Niederreiter, H. (1992) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970081 · Cited by 2,770
Introduction to Protein Structure
Branden, C. I., & Tooze, J. (2012) · Garland Science eBooks · doi:10.1201/9781136969898 · Cited by 2,382
Principles of Robot Motion: Theory, Algorithms, and Implementations
Choset, H., & Latombe, J. (2005) · Medical Entomology and Zoology · Cited by 2,031
Self-citationAn Introduction to Computational Learning Theory
Kearns, M. J., & Vazirani, U. (1994) · doi:10.7551/mitpress/3897.001.0001 · Cited by 1,697
Handbook of discrete and computational geometry
(1998) · Choice Reviews Online · doi:10.5860/choice.35-5707b · Cited by 1,456
Cited by
The Open Motion Planning Library
Sucan, I. A., Moll, M., & Kavraki, L. E. (2012) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2012.2205651 · Cited by 1,616
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
Heuristic approaches in robot path planning: A survey
Mac, T. T., Copot, C., Tran, D. T., & De Keyser, R. (2016) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2016.08.001 · Cited by 641
Janson, L., Schmerling, E., Clark, A., & Pavone, M. (2015) · The International Journal of Robotics Research · doi:10.1177/0278364915577958 · Cited by 576
Path Planning for the Mobile Robot: A Review
Zhang, H.-Y., Lin, W.-M., & Chen, A.-X. (2018) · Symmetry · doi:10.3390/sym10100450 · Cited by 447
Metadata
- Authors
- Hsu, D., Latombe, J.-C., & Kurniawati, H.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2006-07
- Volume
- 25
- Issue
- 7
- Pages
- 627-643
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W1971355878
- Cited by
- 260
- References
- 49
- FWCI
- 17.25
- Type
- journal article
- Language
- en
- Open access
- green
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: On the Probabilistic Foundations of Probabilistic Roadmap Planning. https://app.cochat.ai/papers/10.1177/0278364906067174
- The paper
- Hsu, D., Latombe, J.-C., & Kurniawati, H. (2006). On the Probabilistic Foundations of Probabilistic Roadmap Planning. The International Journal of Robotics Research. https://doi.org/10.1177/0278364906067174
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.