A Systematic Review of Rapidly Exploring Random Tree RRT Algorithm for Single and Multiple Robots
Published Online: Sep 19, 2024
Page range: 78 - 101
Received: Mar 20, 2024
Accepted: Aug 13, 2024
DOI: https://doi.org/10.2478/cait-2024-0026
Keywords
© 2024 Dena Kadhim Muhsen et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Recent advances in path-planning algorithms have transformed robotics. The Rapidly exploring Random Tree (RRT) algorithm underpins autonomous robot navigation. This paper systematically examines the uses and development of RRT algorithms in single and multiple robots to demonstrate their importance in modern robotics studies. To do this, we have reviewed 70 works on RRT algorithms in single and multiple robot path planning from 2015 to 2023. RRT algorithm evolution, including crucial turning points and innovative techniques, have been examined. A detailed comparison of the RRT Algorithm versions reveals their merits, limitations, and development potential. The review’s identification of developing regions and future research initiatives will enable roboticists to use RRT algorithms. This thorough review is essential to the robotics community, inspiring new ideas, helping problem-solving, and expediting single- and multi-robot system development. This highlights the necessity of RRT algorithms for autonomous and collaborative robotics advancement.