The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
RRT*-SMART: A Rapid Convergence Implementation of RRT*
Open accessAbstract
Many sampling based algorithms have been introduced recently. Among them Rapidly Exploring Random Tree (RRT) is one of the quickest and the most efficient obstacle free path finding algorithm. Although it ensures probabilistic completeness, it cannot guarantee finding the most optimal path. Rapidly Exploring Random Tree Star (RRT*), a recently proposed extension of RRT, claims to achieve convergence towards the optimal solution thus ensuring asymptotic optimality along with probabilistic completeness. However, it has been proven to take an infinite time to do so and with a slow convergence rate. In this paper an extension of RRT*, called as RRT*-Smart, has been prposed to overcome the limitaions of RRT*. The goal of the proposecd method is to accelerate the rate of convergence, in order to reach an optimum or near optimum solution at a much faster rate, thus reducing the execution time. The novel approach of the proposed algorithm makes use of two new techniques in RRT*–Path Optimization and Intelligent Sampling. Simulation results presented in various obstacle cluttered environments along with statistical and mathematical analysis confirm the efficiency of the proposed RRT*-Smart algorithm.
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
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
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
Rapidly-exploring random trees : a new tool for path planning
LaValle, S. M. (1998) · Cited by 3,704
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
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
Rapidly-Exploring Random Trees: Progress and Prospects
(2001) · Algorithmic and Computational Robotics · doi:10.1201/9781439864135-43 · Cited by 1,146
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
A potential field approach to path planning
Hwang, Y. K., & Ahuja, N. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.127236 · Cited by 684
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
PATH PLANNING IN EXPANSIVE CONFIGURATION SPACES
HSU, D., LATOMBE, J.-C., & MOTWANI, R. (1999) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195999000285 · Cited by 266
Multipartite RRTs for Rapid Replanning in Dynamic Environments
Zucker, M., Kuffner, J., & Branicky, M. (2007) · Proceedings 2007 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2007.363553 · Cited by 263
A Sampling-Based Tree Planner for Systems With Complex Dynamics
Sucan, I. A., & Kavraki, L. E. (2011) · IEEE Transactions on Robotics · doi:10.1109/tro.2011.2160466 · Cited by 151
Massively parallelizing the RRT and the RRT
Bialkowski, J., Karaman, S., & Frazzoli, E. (2011) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2011.6095053 · Cited by 108
Path shortening and smoothing of grid-based path planning with consideration of obstacles
Kanehara, M., Kagami, S., Kuffner, J., Thompson, S., & Mizoguhi, H. (2007) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2007.4414077 · Cited by 27
Cited by
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
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
Metadata
- Authors
- Nasir, J., Islam, F., Malik, U., Ayaz, Y., Hasan, O., Khan, M., & Muhammad, M. S.
- Venue
- International Journal of Advanced Robotic Systems
- Publisher
- SAGE Publications
- Published
- 2013-01-01
- Volume
- 10
- Issue
- 7
- ISSN
- 1729-8806 (ISSN-L)
- 1729-8814
- OpenAlex
- W2142156433
- Cited by
- 257
- References
- 15
- FWCI
- 7.06
- Type
- journal article
- Language
- en
- Open access
- gold
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.