The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Anytime Motion Planning using the RRT*
Open accessAbstract
The Rapidly-exploring Random Tree (RRT) algorithm, based on incremental sampling, efficiently computes motion plans. Although the RRT algorithm quickly produces candidate feasible solutions, it tends to converge to a solution that is far from optimal. Practical applications favor "anytime" algorithms that quickly identify an initial feasible plan, then, given more computation time available during plan execution, improve the plan toward an optimal solution. This paper describes an anytime algorithm based on the RRT* which (like the RRT) finds an initial feasible solution quickly, but (unlike the RRT) almost surely converges to an optimal solution. We present two key extensions to the RRT% committed trajectories and branch-and-bound tree adaptation, that together enable the algorithm to make more efficient use of computation time online, resulting in an anytime algorithm for real-time implementation. We evaluate the method using a series of Monte Carlo runs in a high-fidelity simulation environment, and compare the operation of the RRT and RRT* methods. We also demonstrate experimental results for an outdoor wheeled robotic vehicle.
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
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
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Dubins, L. E. (1957) · American Journal of Mathematics · doi:10.2307/2372560 · Cited by 3,045
Stanley: The robot that won the DARPA Grand Challenge
Thrun, S., Montemerlo, M., Dahlkamp, H., Stavens, D., Aron, A., Diebel, J., Fong, P., Gale, J., Halpenny, M., Hoffmann, G., et al. (2006) · Journal of Field Robotics · doi:10.1002/rob.20147 · Cited by 2,237 · cited 1×
“For example, robotic cars [10] spend no more than a few seconds to plan a path before driving toward the goal, which may take several minutes.”
BackgroundReal-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
Self-citationComplexity of the mover's problem and generalizations
Reif, J. H. (1979) · 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · doi:10.1109/sfcs.1979.10 · Cited by 765
Incremental Sampling-based Algorithms for Optimal Motion Planning
Karaman, S., & Frazzoli, E. (2010) · Robotics: Science and Systems VI · doi:10.15607/rss.2010.vi.034 · Cited by 680
Self-citationOptimal kinodynamic motion planning using incremental sampling-based methods
Karaman, S., & Frazzoli, E. (2010) · 49th IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5717430 · Cited by 416
Self-citationThe Robot That Won the DARPA Grand Challenge
Thrun, S. (2007) · Cited by 406
Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts
Latombe, J.-C. (1999) · The International Journal of Robotics Research · doi:10.1177/02783649922067753 · Cited by 264
Cited by
A Review of Motion Planning Techniques for Automated Vehicles
Gonzalez, D., Perez, J., Milanes, V., & Nashashibi, F. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2498841 · Cited by 1,670
Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2014) · 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2014.6942976 · Cited by 1,207
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
Computing Systems for Autonomous Driving: State of the Art and Challenges
Liu, L., Lu, S., Zhong, R., Wu, B., Yao, Y., Zhang, Q., & Shi, W. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3043716 · Cited by 450
Learning Sampling Distributions for Robot Motion Planning
Ichter, B., Harrison, J., & Pavone, M. (2018) · 2018 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2018.8460730 · Cited by 370
Autonomous driving system: A comprehensive survey
Zhao, J., Zhao, W., Deng, B., Wang, Z., Zhang, F., Zheng, W., Cao, W., Nan, J., Lian, Y., & Burke, A. F. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.122836 · Cited by 361
A Novel Hybrid Particle Swarm Optimization Algorithm for Path Planning of UAVs
Yu, Z., Si, Z., Li, X., Wang, D., & Song, H. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3182798 · Cited by 352
Sampling-based robotic information gathering algorithms
Hollinger, G. A., & Sukhatme, G. S. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364914533443 · Cited by 334
Optimal Path Planning using RRT* based Approaches: A Survey and Future Directions
Noreen, I., Khan, A., & Habib, Z. (2016) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2016.071114 · Cited by 326
Jeong, I.-B., Lee, S.-J., & Kim, J.-H. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.01.032 · Cited by 306
Asymptotically optimal sampling-based kinodynamic planning
Li, Y., Littlefield, Z., & Bekris, K. E. (2016) · The International Journal of Robotics Research · doi:10.1177/0278364915614386 · Cited by 262
RRT*-SMART: A Rapid Convergence Implementation of RRT*
Nasir, J., Islam, F., Malik, U., Ayaz, Y., Hasan, O., Khan, M., & Muhammad, M. S. (2013) · International Journal of Advanced Robotic Systems · doi:10.5772/56718 · Cited by 257
Potential information fields for mobile robot exploration
Vallvé, J., & Andrade-Cetto, J. (2015) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2014.08.009 · Cited by 50
“The trajectory to the chosen frontier was computed with an RRT* optimal planner [8].”
MethodAGENT: A Benchmark for Core Psychological Reasoning
Shu, T., Bhandwaldar, A., Gan, C., Smith, K. A., Liu, S., Gutfreund, D., Spelke, E., Tenenbaum, J. B., & Ullman, T. D. (2021) · arXiv · doi:10.48550/arxiv.2102.12321 · Cited by 34
A Comprehensive Review of Path-Planning Algorithms for Planetary Rover Exploration
Miao, Q., & Wei, G. (2025) · Remote Sensing · doi:10.3390/rs17111924 · Cited by 13
“…for planetary rovers, such as the A* algorithm, which is suitable for global path planning [22], Rapidly exploring Random Tree (RRT) algorithm [23], genetic algorithms (GAs) [24,25], and algorithms suitable for local path planning like the dynamic window approach (DWA) [26], D* algorithm [9],…”
Metadata
- Authors
- Karaman, S., Walter, M. R., Perez, A., Frazzoli, E., & Teller, S.
- Venue
- 2011 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2011-05
- Pages
- 1478-1483
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2112271657
- Cited by
- 881
- References
- 17
- FWCI
- 17.94
- Type
- conference paper
- 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
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.