Path Planning Based on the Improved RRT Algorithm for the Mining Truck

• Published in: Computers, materials & continua Vol. 71; no. 2; pp. 3571 - 3587
• Main Authors: Wang, Dong, Zheng, Shutong, Ren, Yanxi, Du, Danjie
• Format: Journal Article
• Language: English
• Published: Henderson Tech Science Press 2022
• Subjects: Algorithms; Greedy algorithms; Interpolation; Iterative methods; Obstacle avoidance; Path planning; Path tracking; Simulation; Steering
• ISSN: 1546-2226; 1546-2218; 1546-2226
• DOI: 10.32604/cmc.2022.022183

Planning a reasonable driving path for trucks in mining areas is a key point to improve mining efficiency. In this paper, a path planning method based on Rapidly-exploring Random Tree Star (RRT*) is proposed, and several optimizations are carried out in the algorithm. Firstly, the selection process of growth target points is optimized. Secondly, the process of selecting the parent node is optimized and a Dubins curve is used to constraint it. Then, the expansion process from tree node to random point is optimized by the gravitational repulsion field method and dynamic step method. In the obstacle detection process, Dubins curve constraint is used, and the bidirectional RRT* algorithm is adopted to speed up the iteration of the algorithm. After that, the obtained paths are smoothed by using the greedy algorithm and cubic B-spline interpolation. In addition, to verify the superiority and correctness of the algorithm, an unmanned mining vehicle kinematic model in the form of front-wheel steering is developed based on the Ackermann steering principle and simulated for CoppeliaSim. In the simulation, the Stanley algorithm is used for path tracking and Reeds-Shepp curve to adjust the final parking attitude of the truck. Finally, the experimental comparison shows that the improved bidirectional RRT* algorithm performs well in the simulation experiment, and outperforms the common RRT* algorithm in various aspects.