A Systematic Review of Rapidly Exploring Random Tree RRT Algorithm for Single and Multiple Robots

• Published in: Cybernetics and information technologies : CIT Vol. 24; no. 3; pp. 78 - 101
• Main Authors: Muhsen, Dena Kadhim, Raheem, Firas Abdulrazzaq, Sadiq, Ahmed T.
• Format: Journal Article
• Language: English
• Published: Sofia Sciendo 01.09.2024; De Gruyter Poland
• Subjects: Algorithm; Evolution; Multiple robots; Path planning; Robotics
• ISSN: 1314-4081; 1311-9702; 1314-4081
• DOI: 10.2478/cait-2024-0026

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.