Abstract

This work proposes a path planning algorithm based on A∗and DWA to achieve global path optimization while satisfying security and speed requirements for unmanned aerial vehicles (UAV). The algorithm first preprocesses the map for irregular obstacles encountered by a UAV in flight, including grid preprocessing for arc-shaped obstacles and convex preprocessing for concave obstacles. Further, the standard A∗algorithm is improved based on UAV’s flight environment information and motion constraints. Further, the DWA algorithm’s limitations regarding local optimization and long planning time are mitigated by adaptively adjusting the evaluation function according to the UAV’s safety threshold, obstacles, and environment information. As a result, the global optimal path evaluation subfunction is constructed. Finally, the key points of the global path are selected as the subtarget points of the local path planning. Under the premise of the optimal path, the UAV real-time path’s efficiency and safety are effectively improved. The experimental results demonstrate that the path planning based on improved A∗and DWA algorithms shortens the path length, reduces the planning time, improves the UAV path smoothness, and enhances the safety of UAV path obstacle avoidance.

Highlights

  • Unmanned aerial vehicles (UAVs) are widely used in industry, life sciences, logistics, and other fields

  • Global path planning utilizes the environment map with known obstacles, while local path planning relies on the environment map with unknown obstacles

  • This work alleviates the shortcomings in terms of smoothness and security of the path planned using the standard A∗ algorithm and tackles the problem of the standard dynamic window algorithms (DWA) algorithm regarding its proneness to falling into a local optimum

Read more

Summary

Introduction

Unmanned aerial vehicles (UAVs) are widely used in industry, life sciences, logistics, and other fields. The authors verified the proposed algorithm’s effectiveness but only considering circular and rectangular no-fly zones It is more suitable for maps with ideal obstacle boundaries [12]. Huang et al proposed a coordinated path planning method for multiple UAVs based on k -order smoothing and constructed a complex environment composed of multiple threat sources. The studied literature regards the planning space as too perfect, rendering it impractical Such path planning algorithms are suitable for simple environmental maps. To support path planning in complex environments, this paper first studies the irregular obstacles that a UAV may encounter in a flight. The optimal, shortest path with greater smoothness from the start to the end is planned

Environment Modeling and Obstacle Pretreatment
Improved DWA
Fusion Algorithm
Simulation Experiment and Analysis
Simulation Studies on Path Planning with Known and Unknown Obstacles
Findings
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call