Potential-Field-RRT: A Path-Planning Algorithm for UAVs Based on Potential-Field-Oriented Greedy Strategy to Extend Random Tree

Abstract

This paper proposes a random tree algorithm based on a potential field oriented greedy strategy for the path planning of unmanned aerial vehicles (UAVs). Potential-field-RRT (PF-RRT) discards the defect of traditional artificial potential field (APF) algorithms that are prone to fall into local errors, and introduces potential fields as an aid to the expansion process of random trees. It reasonably triggers a greedy strategy based on the principle of field strength descending gradient optimization, accelerating the process of random tree expansion to a better region and reducing path search time. Compared with other optimization algorithms that improve the sampling method to reduce the search time of the random tree, PF-RRT takes full advantage of the potential field without limiting the arbitrariness of random tree expansion. Secondly, the path construction process is based on the principle of triangle inequality for the root node of the new node to improve the quality of the path in one iteration. Simulation experiments of the algorithm comparison show that the algorithm has the advantages of fast acquisition of high-quality initial path solutions and fast optimal convergence in the path search process. Compared with the original algorithm, obtaining the initial solution using PF-RRT can reduce the time loss by 20% to 70% and improve the path quality by about 25%. In addition, the feasibility of PF-RRT for UAV path planning is demonstrated by actual flight test experiments at the end of the experiment.