The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Optimal Path Planning using RRT* based Approaches: A Survey and Future Directions
Open accessAbstract
Optimal path planning refers to find the collision free, shortest, and smooth route between start and goal positions. This task is essential in many robotic applications such as autonomous car, surveillance operations, agricultural robots, planetary and space exploration missions. Rapidly-exploring Random Tree Star (RRT*) is a renowned sampling based planning approach. It has gained immense popularity due to its support for high dimensional complex problems. A significant body of research has addressed the problem of optimal path planning for mobile robots using RRT* based approaches. However, no updated survey on RRT* based approaches is available. Considering the rapid pace of development in this field, this paper presents a comprehensive review of RRT* based path planning approaches. Current issues relevant to noticeable advancements in the field are investigated and whole discussion is concluded with challenges and future research directions.
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Particle swarm optimization: An overview
Poli, R., Kennedy, J., & Blackwell, T. (2007) · Swarm Intelligence · doi:10.1007/s11721-007-0002-0 · Cited by 21,101
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
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
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
Dorigo, M., & Stützle, T. (2004) · The MIT Press eBooks · doi:10.7551/mitpress/1290.001.0001 · Cited by 3,330
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 comprehensive review of firefly algorithms
Fister, I., Fister, I., Yang, X.-S., & Brest, J. (2013) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2013.06.001 · Cited by 1,308
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
Gross motion planning—a survey
Hwang, Y. K., & Ahuja, N. (1992) · ACM Computing Surveys · doi:10.1145/136035.136037 · Cited by 826
A Survey of Motion Planning Algorithms from the Perspective of Autonomous UAV Guidance
Goerzen, C., Kong, Z., & Mettler, B. (2010) · Journal of Intelligent and Robotic Systems · doi:10.1007/s10846-009-9383-1 · Cited by 779
From Reeds and Shepp's to Continuous-Curvature Paths
Fraichard, T., & Scheuer, A. (2004) · IEEE Transactions on Robotics · doi:10.1109/tro.2004.833789 · Cited by 441
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
Optimal 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
Kinodynamic RRT*: Asymptotically optimal motion planning for robots with linear dynamics
Webb, D. J., & van den Berg, J. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6631299 · Cited by 409
Gammell, J. D., Srinivasa, S. S., & Barfoot, T. D. (2015) · Cited by 398
Garcia, M. A. P., Montiel, O., Castillo, O., Sepúlveda, R., & Melin, P. (2009) · Applied Soft Computing · doi:10.1016/j.asoc.2009.02.014 · Cited by 394
Sampling-Based Path Planning on Configuration-Space Costmaps
Jaillet, L., Cortés, J., & Siméon, T. (2010) · IEEE Transactions on Robotics · doi:10.1109/tro.2010.2049527 · Cited by 367
Planning Paths of Complete Coverage of an Unstructured Environment by a Mobile Robot
Zelinsky, A., Jarvis, R. A., Byrne, J., & Yuta, S.-I. (2007) · Cited by 305
Qureshi, A. H., & Ayaz, Y. (2015) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2015.02.007 · 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 functions based sampling heuristic for optimal path planning
Qureshi, A. H., & Ayaz, Y. (2016) · Autonomous Robots · doi:10.1007/s10514-015-9518-0 · Cited by 248
LQR-RRT*: Optimal sampling-based motion planning with automatically derived extension heuristics
Perez, A., Platt, R., Konidaris, G., Kaelbling, L., & Lozano-Perez, T. (2012) · 2012 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2012.6225177 · Cited by 225
Continuous Path Smoothing for Car-Like Robots Using B-Spline Curves
Elbanhawi, M., Simic, M., & Jazar, R. N. (2015) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-014-0172-0 · Cited by 190
Optimal Bidirectional Rapidly-Exploring Random Trees
Jordan, M., & Pérez, A. (2013) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 188
Optimal Path Planning in Complex Cost Spaces With Sampling-Based Algorithms
Devaurs, D., Siméon, T., & Cortés, J. (2015) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2015.2487881 · Cited by 157
Yang, K., Gan, S. K., & Sukkarieh, S. (2013) · Advanced Robotics · doi:10.1080/01691864.2013.756386 · Cited by 140
Rapidly-exploring random tree based memory efficient motion planning
Adiyatov, O., & Varol, H. A. (2013) · IEEE International Conference on Mechatronics and Automation (ICMA) · doi:10.1109/icma.2013.6617944 · Cited by 139
Jun-hao, L., & Lee, C. (2014) · Advances in Engineering Software · doi:10.1016/j.advengsoft.2014.09.006 · Cited by 137
Choudhury, S., Gammell, J. D., Barfoot, T. D., Srinivasa, S. S., & Scherer, S. (2016) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra.2016.7487615 · Cited by 116
Improving Motion-Planning Algorithms by Efficient Nearest-Neighbor Searching
Yershova, A., & LaValle, S. M. (2007) · IEEE Transactions on Robotics · doi:10.1109/tro.2006.886840 · Cited by 114
Spline-Based RRT Path Planner for Non-Holonomic Robots
Yang, K., Moon, S., Yoo, S., Kang, J., Doh, N. L., Kim, H. B., & Joo, S. (2013) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-013-9963-y · Cited by 109
Kinodynamic RRT*: Optimal Motion Planning for Systems with Linear Differential ConstraintsPreprint
Webb, D. J., & van den Berg, J. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.5088 · Cited by 100
Sampling-based robot motion planning: Towards realistic applications
Tsianos, K. I., Sucan, I. A., & Kavraki, L. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.08.002 · Cited by 99
Anytime, Dynamic Planning in High-dimensional Search Spaces
Ferguson, D., & Stentz, A. (2007) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2007.363166 · Cited by 78
A Survey of Motion Planning Algorithms from the Perspective of Autonomous UAV Guidance
Goerzen, C. L., Kong, Z., & Mettler, B. (2009) · Springer eBooks · doi:10.1007/978-90-481-8764-5_5 · Cited by 67
Incremental Phi*: incremental any-angle path planning on grids
Nash, A., Koenig, S., & Likhachev, M. A. (2009) · Scholarly Commons (University of Pennsylvania) · Cited by 63
Potential guided directional-RRT* for accelerated motion planning in cluttered environments
Qureshi, A. H., Iqbal, K. F., Qamar, S. M., Islam, F., Ayaz, Y., & Muhammad, N. (2013) · IEEE International Conference on Mechatronics and Automation (ICMA) · doi:10.1109/icma.2013.6617971 · Cited by 58
Zhu, D., Li, W., Yan, M., & Yang, S. X. (2014) · International Journal of Advanced Robotic Systems · doi:10.5772/56346 · Cited by 36
Efficient Trajectory Planning for WSN Data Collection with Multiple UAVs
Alejo, D., Cobano, J. A., Heredia, G., et al. (2015) · Studies in computational intelligence · doi:10.1007/978-3-319-18299-5_3 · Cited by 23
Motion Planning for Car-Like Robots Using Lazy Probabilistic Roadmap Method
Abraham Sánchez, L., Zapata, R., & B., J. A. A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46016-0_1 · Cited by 13
NRR: a nonholonomic random replanner for navigation of car-like robots in unknown environments
Masehian, E., & Kakahaji, H. (2014) · Robotica · doi:10.1017/s0263574713001276 · Cited by 9
StRRT-based path planning with PSO-tuned parameters for RoboCup soccer
Sameshima, K., Nakano, K., Funato, T., & Hosokawa, S. (2014) · Artificial Life and Robotics · doi:10.1007/s10015-014-0177-6 · Cited by 7
Cited by
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
Goal-Conditioned Model Simplification for 1-D and 2-D Deformable Object Manipulation
Wang, S., Leonetti, M., & Dogar, M. (2025) · IEEE Transactions on Robotics · doi:10.1109/tro.2025.3577052 · Cited by 4
“And as our method is independent of the planners used, we implement two widely used algorithms, Cross-Entropy Method (CEM [57]) and Rapidly-exploring Random Tree (RRT [58]), of which the former is optimization-based and the latter is search-based.”
Metadata
- Authors
- Noreen, I., Khan, A., & Habib, Z.
- Venue
- International Journal of Advanced Computer Science and Applications
- Published
- 2016
- Volume
- 7
- Issue
- 11
- ISSN
- 2156-5570 (ISSN-L)
- 2158-107X
- OpenAlex
- W2557741120
- Cited by
- 326
- References
- 48
- FWCI
- 8.21
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.