An improved RRT algorithm for robot path planning based on path expansion heuristic sampling

• Published in: Journal of computational science Vol. 67; p. 101937
• Main Authors: Ding, Jun, Zhou, Yinxuan, Huang, Xia, Song, Kun, Lu, Shiqing, Wang, Lusheng
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.03.2023
• Subjects: Heuristic sampling; Narrow corridor; Path planning; RRT; Path planning; Narrow corridor; Heuristic sampling; RRT
• DOI: 10.1016/j.jocs.2022.101937
• ISSN: 1877-7503

Rapidly-exploring Random Tree Star (RRT*) algorithm and its variants based on random sampling can provide a collision-free and asymptotic optimal solution for many path planning problems. However, many RRT* based variants have low sampling efficiency and slow convergence rate in the environment which consists of long corridors, due to a large number of iterations are required in sampling critical nodes. To overcome this problem, the paper proposes the Expanding Path RRT* (EP-RRT*) based on heuristic sampling in path expansion area. By combining the greedy heuristic of Rapidly exploring Random Tree (RRT)-Connect, EP-RRT* quickly explores the environment in order to find a feasible path, and then expands it to obtain the heuristic sampling area. It iteratively searches in the heuristic sampling area which also changes with the continuous optimization of the path, and finally obtains an optimal or suboptimal path connecting starting point and target point. Comparisons of EP-RRT* with RRT* and Informed RRT* in four simulation environments verify that EP-RRT* improves the node utilization, accelerates the convergence rate, and obtains a better path for the same number of iterations. •Propose a sampling-based asymptotically optimal path planning algorithm.•A greedy heuristic search strategy is introduced into the RRT* algorithm.•A path-expanding method for reducing the sampling area is presented.•Rapid convergence to path solution in narrow and maze environments.