The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic
Open accessAbstract
Rapidly-exploring random trees (RRTs) are popular in motion planning because they find solutions efficiently to single-query problems. Optimal RRTs (RRT*s) extend RRTs to the problem of finding the optimal solution, but in doing so asymptotically find the optimal path from the initial state to every state in the planning domain. This behaviour is not only inefficient but also inconsistent with their single-query nature.
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
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
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
Sampling-based algorithms for optimal motion planning
Karaman, S., & Frazzoli, E. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406761 · Cited by 5,275
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
A Least Squares Estimate of Satellite Attitude
Wahba, G. (1965) · SIAM Review · doi:10.1137/1007077 · Cited by 1,116
Anytime Motion Planning using the RRT*
Karaman, S., Walter, M. R., Perez, A., Frazzoli, E., & Teller, S. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980479 · Cited by 881
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
Koenig, S., Likhachev, M. A., & Furcy, D. (2004) · Artificial Intelligence · doi:10.1016/j.artint.2003.12.001 · Cited by 662
Approaches for heuristically biasing RRT growth
Urmson, C., & Simmons, R. (2004) · Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453) · doi:10.1109/iros.2003.1248805 · Cited by 334
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
Ferguson, D., & Stentz, A. (2006) · 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2006.282100 · Cited by 234
Optimal Bidirectional Rapidly-Exploring Random Trees
Jordan, M., & Pérez, A. (2013) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 188
Use of relaxation methods in sampling-based algorithms for optimal motion planning
Arslan, O., & Tsiotras, P. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6630906 · Cited by 181
Sampling heuristics for optimal motion planning in high dimensions
Akgun, B., & Stilman, M. (2011) · 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2011.6095077 · Cited by 158
Rapidly-exploring roadmaps: Weighing exploration vs. refinement in optimal motion planning
Alterovitz, R., Patil, S., & Derbakova, A. (2011) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2011.5980286 · Cited by 102
Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2014) · arXiv (Cornell University) · Cited by 41
Self-citationCBUG: A Quadratically Competitive Mobile Robot Navigation Algorithm
Gabriely, Y., & Rimon, E. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2006237 · Cited by 28
CBUG: A Quadratically Competitive Mobile Robot Navigation Algorithm
Gabriely, Y., & Rimon, E. (2006) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2005.1570409 · Cited by 5
Cited by
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
Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2015) · 2015 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2015.7139620 · Cited by 416
Self-citationResearch Advances and Challenges of Autonomous and Connected Ground Vehicles
Eskandarian, A., Wu, C., & Sun, C. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2019.2958352 · Cited by 381
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
Metadata
- Authors
- Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D.
- Venue
- 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems
- Publisher
- IEEE
- Published
- 2014-09
- Pages
- 2997-3004
- OpenAlex
- W1976930960
- Cited by
- 1,207
- References
- 18
- FWCI
- 14.78
- 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.