The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain
Abstract
Sampling-based planners have solved difficult problems in many applications of motion planning in recent years. In particular, techniques based on the Rapidly-exploring Random Trees (RRTs) have generated highly successful single-query planners. Even though RRTs work well on many problems, they have weaknesses which cause them to explore slowly when the sampling domain is not well adapted to the problem. In this paper we characterize these issues and propose a general framework for minimizing their effect. We develop and implement a simple new planner which shows significant improvement over existing RRT-based planners. In the worst cases, the performance appears to be only slightly worse in comparison to the original RRT, and for many problems it performs orders of magnitude better.
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
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
LaValle, S. M. (2006) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546877 · Cited by 5,211
Self-citationLaValle, S. M. (2006) · Cited by 4,177
Self-citationRapidly-exploring random trees : a new tool for path planning
LaValle, S. M. (1998) · Cited by 3,704
Self-citationRRT-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
Self-citationRapidly-Exploring Random Trees: Progress and Prospects
(2001) · Algorithmic and Computational Robotics · doi:10.1201/9781439864135-43 · Cited by 1,146
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
Real-Time Motion Planning for Agile Autonomous Vehicles
Frazzoli, E., Dahleh, M. A., & Feron, E. (2002) · Journal of Guidance, Control, and Dynamics · doi:10.2514/2.4856 · Cited by 830
Path planning in expansive configuration spaces
Hsu, D., Latombe, J.-C., & Motwani, R. (2002) · Proceedings of International Conference on Robotics and Automation · doi:10.1109/robot.1997.619371 · Cited by 552
The Gaussian sampling strategy for probabilistic roadmap planners
Boor, V., Overmars, M. H., & van der Stappen, A. F. (2003) · Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C) · doi:10.1109/robot.1999.772447 · Cited by 541
OBPRM: 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
MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space
Wilmarth, S. A., Amato, N. M., & Stiller, P. F. (2003) · Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C) · doi:10.1109/robot.1999.772448 · 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
On Finding Narrow Passages with Probabilistic Roadmap Planners
(1998) · Robotics: The Algorithmic Perspective · doi:10.1201/9781439863886-18 · Cited by 307
Manipulation Planning with Probabilistic Roadmaps
Siméon, T., Laumond, J.-P., Cortés, J., & Sahbani, A. (2004) · The International Journal of Robotics Research · doi:10.1177/0278364904045471 · Cited by 274
OBPRM: An Obstacle-Based PRM for 3D Workspaces
(1998) · Robotics: The Algorithmic Perspective · doi:10.1201/9781439863886-19 · Cited by 246
Randomized path planning for linkages with closed kinematic chains
Yakey, J. H., LaValle, S. M., & Kavraki, L. E. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.976030 · Cited by 179
Self-citationCoordinated motion planning for multiple car-like robots using probabilistic roadmaps
Svestka, P., & Overmars, M. H. (2002) · Proceedings of 1995 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1995.525508 · Cited by 165
A framework for using the workspace medial axis in PRM planners
Holleman, C., & Kavraki, L. E. (2000) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2000.844795 · Cited by 151
Multilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems
Sekhavat, S., Svestka, P., Laumond, J., & Overmars, M. H. (1998) · The International Journal of Robotics Research · doi:10.1177/027836499801700803 · Cited by 141
Resolution complete rapidly-exploring random trees
Cheng, P., & LaValle, S. M. (2003) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2002.1013372 · Cited by 135
Self-citationA random loop generator for planning the motions of closed kinematic chains using PRM methods
Cortés, J., Siméon, T., & Laumond, J. (2003) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2002.1014856 · Cited by 133
Mazer, E., Ahuactzin, J.-M., & Bessìère, P. (1998) · Journal of Artificial Intelligence Research · doi:10.1613/jair.468 · Cited by 127
Sampling-Based Motion Planning under Kinematic Loop-Closure Constraints
Cortés, J., & Siméon, T. (2005) · Springer tracts in advanced robotics · doi:10.1007/10991541_7 · Cited by 115
Incrementally reducing dispersion by increasing Voronoi bias in RRTs
Lindemann, S. R., & LaValle, S. M. (2004) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2004.1308755 · Cited by 94
Self-citationMotion planning a aerial robot using rapidly-exploring random trees with dynamic constraints
Kim, J. W., & Ostrowski, J. P. (2004) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2003.1241920 · Cited by 89
Efficient nearest neighbor searching for motion planning
Atramentov, A., & LaValle, S. M. (2003) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2002.1013429 · Cited by 88
Self-citationPlanning Collision‐Free Reaching Motions for Interactive Object Manipulation and Grasping
Kallmann, M. E., Aubel, A., Abacı, T., & Thalmann, D. (2003) · Computer Graphics Forum · doi:10.1111/1467-8659.00678 · Cited by 83
Randomized Path Planning for a Rigid Body Based on Hardware Accelerated Voronoi Sampling
Pisula, C. (2001) · A K Peters/CRC Press eBooks · doi:10.1201/9781439864135-40 · Cited by 63
Computer aided motion: Move3D within MOLOG
Siméon, T., Laumond, J., Geem, C. V., & Cortés, J. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2001.932822 · Cited by 26
Cited by
Real-Time Motion Planning With Applications to Autonomous Urban Driving
Kuwata, Y., Karaman, S., Teo, J., Frazzoli, E., How, J. P., & Fiore, G. (2009) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2008.2012116 · Cited by 889
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
Neural RRT*: Learning-Based Optimal Path Planning
Wang, J., Chi, W., Li, C., Wang, C., & Meng, M. Q.-H. (2020) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2020.2976560 · Cited by 555
Path Planning for Autonomous Mobile Robots: A Review
Sánchez-Ibáñez, J. R., Pérez-del-Pulgar, C. J., & García-Cerezo, A. (2021) · Sensors · doi:10.3390/s21237898 · Cited by 462
A survey on vision-based UAV navigation
Lu, Y., Xue, Z., Xia, G.-S., & Zhang, L. (2018) · Geo-spatial Information Science · doi:10.1080/10095020.2017.1420509 · Cited by 448
Metadata
- Authors
- Yershova, A., Jaillet, L., Simeon, T., & LaValle, S. M.
- Venue
- Proceedings of the 2005 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2006-01-18
- Pages
- 3856-3861
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2157543942
- Cited by
- 258
- References
- 31
- FWCI
- 12.16
- 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.