Journal
IEEE ACCESS
Volume 10, Issue -, Pages 7664-7674Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2021.3139534
Keywords
Path planning; Costs; Autonomous aerial vehicles; Heuristic algorithms; Planning; Turning; Q-learning; Unmanned aerial vehicle; quality-oriented path planning; A* algorithm; reinforcement learning; hierarchical planning
Categories
Funding
- USA National Science Foundation [1757828, 1822137, 2050869]
- Direct For Computer & Info Scie & Enginr
- Division Of Computer and Network Systems [1822137] Funding Source: National Science Foundation
- Division Of Computer and Network Systems
- Direct For Computer & Info Scie & Enginr [2050869] Funding Source: National Science Foundation
- Division of Computing and Communication Foundations
- Direct For Computer & Info Scie & Enginr [1757828] Funding Source: National Science Foundation
Ask authors/readers for more resources
This study proposes a global-local hybrid UAV path planning algorithm, establishes a three-dimensional UAV path planning model through theoretical and mathematical methods, improves the A* algorithm, and adds a dynamic exploration factor to effectively solve the problem of UAV path planning, improving path quality.
Unmanned aerial vehicles (UAVs) are playing an increasingly important role in people's daily lives due to their low cost of operation, low requirements for ground support, high maneuverability, high environmental adaptability, and high safety. Yet UAV path planning under various safety risks, such as crash and collision, is not an easy task, due to the complicated and dynamic nature of path environments. Therefore, developing an efficient and flexible algorithm for UAV path planning has become inevitable. Aimed at quality-oriented UAV path planning, this paper is designed to analyze UAV path planning from two aspects: global static planning and local dynamic hierarchical planning. Through a theoretical and mathematical approach, a three-dimensional UAV path planning model was established. Based on the A* algorithm, the search strategy, the step size, and the cost function were improved, and the OPEN set was simplified, thereby shortening the planning time and greatly improving the execution efficiency of the algorithm. Moreover, a dynamic exploration factor was added to the exploration mechanism of Q-learning to solve the exploration-exploitation dilemma of Q-learning to adapt to the local dynamic path adjustment for UAVs. The global-local hybrid UAV path planning algorithm was formed by combining the two. The simulation results indicate that the proposed planning model and algorithm can efficiently solve the problem of UAV path planning, improve the path quality, and can be a significant reference for solving other problems related to path planning, such as the reliability, security, and safety of UAV, when embedded into the heuristic function of the proposed algorithm.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available