![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
The Rapidly Exploring Random Tree Star (RRT*) is a probabilistically complete algorithm. It is recognized as a better path planning algorithm, but its path quality and path planning speed still have room for improvement. This paper proposes an improved RRT* algorithm based on alternative paths and triangular area sampling (ATS-RRT*). The alternative paths strategy generates multiple initial paths based on whether the sample points can communicate with the target points and set the path with the smallest cost as the final initial path, which can speed up the initial path planning and improve the initial path finding rate. The triangular area sampling strategy combines every three adjacent nodes to generate some triangle areas and corresponding half-triangle areas. The path quality can be improved quickly by limiting the sampling in these triangle areas. In addition, the direct connection strategy with triangle nodes and the tabu table using in the Rewire process also speeds up the algorithm. Experiments show that the speed of finding the initial path and the success rate of finding the suboptimal path are improved by 2.3 and 1.45 times respectively compared with RRT*, Quick-RRT*, and Informed + Quick-RRT*.
GRAPHICAL ABSTRACT
Disclosure statement
No potential conflict of interest was reported by the author(s).
Additional information
Funding
Notes on contributors
Zhi-wei Zhang
Zhi W. Zhang is a mechanical engineering student at Tianjin University of Technology.
Yun-wei Jia
Yun W. Jia is with the Tianjin University of Technology.
Qi-qi Su
Qi Q. Su is a mechanical engineering student at Tianjin University of Technology.
Xiao-tong Chen
Xiao T. Chen is a mechanical engineering student at Tianjin University of Technology.
Bang-peng Fu
Bang P. Fu is with the Tiandy Technologies Co., Ltd.