The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Quick-RRT*: Triangular inequality-based implementation of RRT* with improved initial solution and convergence rate
Abstract
The Rapidly-exploring Random Tree (RRT) algorithm is a popular algorithm in motion planning problems. The optimal RRT (RRT*) is an extended algorithm of RRT, which provides asymptotic optimality. This paper proposes Quick-RRT* (Q-RRT*), a modified RRT* algorithm that generates a better initial solution and converges to the optimal faster than RRT*. Q-RRT* enlarges the set of possible parent vertices by considering not only a set of vertices contained in a hypersphere, as in RRT*, but also their ancestry up to a user-defined parameter, thus, resulting in paths with less cost than those of RRT*. It also applies a similar technique to the rewiring procedure resulting in acceleration of the tendency that near vertices share common parents. Since the algorithm proposed in this paper is a tree extending algorithm, it can be combined with other sampling strategies and graph-pruning algorithms. The effectiveness of Q-RRT* is demonstrated by comparing the algorithm with existing algorithms through numerical simulations. It is also verified that the performance can be further enhanced when combined with other sampling strategies.
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
LaValle, S. M. (2006) · Cited by 4,177
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
Principles of Robot Motion: Theory, Algorithms, and Implementations
Choset, H., & Latombe, J. (2005) · Medical Entomology and Zoology · Cited by 2,149
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
Optimal and Efficient Path Planning for Partially Known Environments
Stentz, A. (1997) · Intelligent Unmanned Ground Vehicles · doi:10.1007/978-1-4615-6325-9_11 · Cited by 1,233
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
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
Koenig, S., Likhachev, M. A., & Furcy, D. (2004) · Artificial Intelligence · doi:10.1016/j.artint.2003.12.001 · Cited by 662
Janson, L., Schmerling, E., Clark, A., & Pavone, M. (2015) · The International Journal of Robotics Research · doi:10.1177/0278364915577958 · Cited by 576
Robotics and Automation, 2009. ICRA '09. IEEE International Conference on
Chli, M., & Davison, A. J. (2009) · CiteSeer X (The Pennsylvania State University) · Cited by 506
Theta*: Any-Angle Path Planning on Grids
Daniel, K., Nash, A., Koenig, S., & Felner, A. (2010) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2994 · Cited by 465
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
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
Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2015) · Cited by 398
Theta*: Any-angle path planning on grids
Daniel, K., Nash, A., Koenig, S., & Felner, A. (2007) · Cited by 334
Improved fast replanning for robot navigation in unknown terrain
Koenig, S., & Likhachev, M. (2003) · Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292) · doi:10.1109/robot.2002.1013481 · Cited by 294
Ferguson, D., Kalra, N., & Stentz, A. (2006) · Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006. · doi:10.1109/robot.2006.1641879 · Cited by 272
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
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
Real-Time Randomized Path Planning for Robot Navigation
Bruce, J., & Veloso, M. M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45135-8_23 · Cited by 236
Ferguson, D., & Stentz, A. (2006) · 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2006.282100 · Cited by 234
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
Off-line programming of an industrial robot for manufacturing
Mitsi, S., Bouzakis, K. ‐., Mansour, G., Sagris, D., & Maliaris, G. (2004) · The International Journal of Advanced Manufacturing Technology · doi:10.1007/s00170-003-1728-5 · Cited by 127
Robotics and Automation, 2006. ICRA 2006. Proceedings 2006 IEEE International Conference on
Kudoh, S., Komura, T., & IKEUCHI, K. (2006) · CiteSeer X (The Pennsylvania State University) · Cited by 123
Intelligent Robots and Systems (IROS), 2013 IEEE/RSJ International Conference on
Martínez-Carranza, J., Calway, A. D., & Mayol-Cuevas, W. W. (2013) · Cited by 82
On Parallel RRTs for Multi-robot Systems
Carpin, S., & Pagello, E. (2002) · Cited by 70
Quad-RRT: A real-time GPU-based global path planner in large-scale real environments
Hidalgo‐Paniagua, A., Bandera, J. P., Ruiz-de-Quintanilla, M., & Bandera, A. J. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.01.035 · Cited by 38
An intelligent framework for simulating robot-assisted surgical operations
Valencia‐García, R., Martínez‐Béjar, R., & Gasparetto, A. (2005) · Expert Systems with Applications · doi:10.1016/j.eswa.2004.12.003 · Cited by 18
Cited by
Review of Autonomous Path Planning Algorithms for Mobile Robots
Qin, H., Shao, S., Wang, T., Yu, X., Jiang, Y., & Cao, Z. (2023) · Drones · doi:10.3390/drones7030211 · Cited by 322
PQ-RRT*: An improved path planning algorithm for mobile robots
Li, Y., Wei, W., Gao, Y., Wang, D., & Fan, Z. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113425 · Cited by 277
Metadata
- Authors
- Jeong, I.-B., Lee, S.-J., & Kim, J.-H.
- Venue
- Expert Systems with Applications
- Publisher
- Elsevier BV
- Published
- 2019-06
- Volume
- 123
- Pages
- 82-90
- ISSN
- 0957-4174 (ISSN-L)
- OpenAlex
- W2909688514
- Cited by
- 306
- References
- 32
- FWCI
- 7.37
- Type
- journal article
- 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.