The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
The Gaussian sampling strategy for probabilistic roadmap planners
Abstract
Probabilistic roadmap planners (PRMs) form a relatively new technique for motion planning that has shown great potential. A critical aspect of PRM is the probabilistic strategy used to sample the free configuration space. In this paper we present a new, simple sampling strategy, which we call the Gaussian sampler, that gives a much better coverage of the difficult parts of the free configuration space. The approach uses only elementary operations which makes it suitable for many different planning problems. Experiments indicate that the technique is very efficient indeed.
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
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
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-citationOBPRM: an obstacle-based PRM for 3D workspaces
Amato, N. M., Bayazıt, O. B., Dale, L. K., Jones, C. A., & Vallejo, D. (1998) · Cited by 414
Randomized preprocessing of configuration for fast path planning
Kavraki, L., & Latombe, J.-C. (2002) · Proceedings of the 1994 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1994.350966 · Cited by 412
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 · doi:10.1109/robot.1996.509171 · Cited by 409
A randomized roadmap method for path and manipulation planning
Amato, N. M., & Wu, Y. (2002) · Proceedings of IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1996.503582 · Cited by 369
On Finding Narrow Passages with Probabilistic Roadmap Planners
(1998) · Robotics: The Algorithmic Perspective · doi:10.1201/9781439863886-18 · Cited by 307
A Random Sampling Scheme for Path Planning
Barraquand, J., Kavraki, L., Latombe, J.-C., Motwani, R., Li, T.-Y., & Raghavan, P. (1997) · The International Journal of Robotics Research · doi:10.1177/027836499701600604 · Cited by 277
Coordinated path planning for multiple robots
Švestka, P., & Overmars, M. H. (1998) · Robotics and Autonomous Systems · doi:10.1016/s0921-8890(97)00033-x · Cited by 270
Self-citationChoosing good distance metrics and local planners for probabilistic roadmap methods
Amato, N. M., Bayazit, O. B., Dale, L. K., Jones, C., & Vallejo, D. (2002) · Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146) · doi:10.1109/robot.1998.677043 · Cited by 184
Cited by
RRT-connect: An efficient approach to single-query path planning
Kuffner, J. J., & LaValle, S. M. (2000) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844730 · Cited by 3,555
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
Bohlin, R., & Kavraki, L. E. (2000) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844107 · Cited by 856
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
Randomized Kinodynamic Motion Planning with Moving Obstacles
Hsu, D., Kindel, R., Latombe, J.-C., & Rock, S. (2002) · The International Journal of Robotics Research · doi:10.1177/027836402320556421 · Cited by 771
On the Relationship between Classical Grid Search and Probabilistic Roadmaps
LaValle, S. M., Branicky, M. S., & Lindemann, S. R. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904045481 · Cited by 436
The bridge test for sampling narrow passages with probabilistic roadmap planners
Hsu, D., Jiang, T., Reif, J., & Sun, Z. (2004) · 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422) · doi:10.1109/robot.2003.1242285 · Cited by 355
On the Relationship between Classical Grid Search and Probabilistic Roadmaps
LaValle, S. M., & Branicky, M. S. (2004) · Springer Tracts in Advanced Robotics · doi:10.1007/978-3-540-45058-0_5 · Cited by 338
Visibility-based probabilistic roadmaps for motion planning
Siméon, T., Laumond, J.-P., & Nissoux, C. (2000) · Advanced Robotics · doi:10.1163/156855300741960 · Cited by 329
A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
Sánchez, G., & Latombe, J.-C. (2003) · Springer Tracts in Advanced Robotics · doi:10.1007/3-540-36460-9_27 · Cited by 313
Effective sampling and distance metrics for 3D rigid body path planning
Kuffner, J. J. (2004) · IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004 · doi:10.1109/robot.2004.1308895 · Cited by 269
Dynamically-Stable Motion Planning for Humanoid Robots
Kuffner, J. J., Kagami, S., Nishiwaki, K., Inaba, M., & Inoue, H. (2002) · Autonomous Robots · doi:10.1023/a:1013219111657 · Cited by 265
On the Probabilistic Foundations of Probabilistic Roadmap Planning
Hsu, D., Latombe, J.-C., & Kurniawati, H. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906067174 · Cited by 260
Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain
Yershova, A., Jaillet, L., Simeon, T., & LaValle, S. M. (2006) · Proceedings of the 2005 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2005.1570709 · Cited by 258
Metadata
- Authors
- Boor, V., Overmars, M. H., & van der Stappen, A. F.
- Venue
- Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C)
- Publisher
- IEEE
- Published
- 2003-01-20
- Volume
- 2
- Pages
- 1018-1023
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2107535513
- Cited by
- 541
- References
- 15
- FWCI
- 26.90
- 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
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.