Unmanned Aerial Vehicle Path-Planning Method Based on Improved P-RRT* Algorithm
Xing Xu, Feifan Zhang, Yun Zhao
Abstract
This paper proposed an improved potential rapidly exploring random tree star (P-RRT*) algorithm for unmanned aerial vehicles (UAV). The algorithm has faster expansion and convergence speeds and better path quality. Path planning is an important part of the UAV control system. Rapidly exploring random tree (RRT) is a path-planning algorithm that is widely used, including in UAV, and its altered body, P-RRT*, is an asymptotic optimal algorithm with bias sampling. The algorithm converges slowly and has a large random sampling area. To overcome the above drawbacks, we made the following improvements. First, the algorithm used the direction of the artificial potential field (APF) to determine whether to perform greedy expansion, increasing the search efficiency. Second, as the random tree obtained the initial path and updated the path cost, the algorithm rejected high-cost nodes and sampling points based on the heuristic cost and current path cost to speed up the convergence rate. Then, the random tree was pruned to remove the redundant nodes in the path. The simulation results demonstrated that the proposed algorithm could significantly decrease the path cost and inflection points, speed up initial path obtaining and convergence, and is suitable for the path planning of UAVs.