A new method for unmanned aerial vehicle path planning in complex environments

Abstract To solve the problems of UAV path planning, such as low search efficiency, uneven path, and inability to adapt to unknown environments, this paper proposes A double-layer optimization A* and dynamic window method for UAV path planning. Firstly, the neighboring node clip-off rule is defined to optimize the node expansion mode of the A* algorithm, and the obstacle coverage model is designed to dynamically adjust the heurizing function of the A* algorithm to improve the path search efficiency. Then, the Bresenham algorithm is adopted for collision detection and critical path nodes are extracted to significantly reduce the number of path turning points. Secondly, a new tracking index is proposed to optimize the evaluation function of the dynamic window method to make the local path fit the global path further. By detecting the dangerous distance, the dynamic adaptive method of evaluation function weight is designed to improve the fixed weight of the dynamic window method. Finally, the key turning point of optimizing the A* algorithm is taken as the temporary target point to improve the DWA algorithm, and the local part follows the global part, and the fusion of the two algorithms is realized. Simulation results show that the proposed method can significantly improve the efficiency and smoothness of mobile robot path planning, enhance the real-time obstacle avoidance and adaptive ability of unknown environments, and better meet the requirements of complex planning tasks.