Unmanned aerial vehicle path planning based on A algorithm and its variants in 3d environment

Finding a safe and optimum path from the source node to the target node, while preventing collisions with environmental obstacles, is always a challenging task. This task becomes even more complicated when the application area includes Unmanned Aerial Vehicle (UAV). This is because UAV follows an aerial path to reach the target node from the source node and the aerial paths are defined in 3D space. A* (A-star) algorithm is the path planning strategy of choice to solve path planning problem in such scenarios because of its simplicity in implementation and promise of optimality. However, A* algorithm guarantees to find the shortest path on graphs but does not guarantee to find the shortest path in a real continuous environment. Theta* (Theta-star) and Lazy Theta* (Lazy Theta-star) algorithms are variants of the A* algorithm that can overcome this shortcoming of the A* algorithm at the cost of an increase in computational time. In this research work, a comparative analysis of A-star, Theta-star, and Lazy Theta-star path planning strategies is presented in a 3D environment. The ability of these algorithms is tested in 2D and 3D scenarios with distinct dimensions and obstacle complexity. To present comparative performance analysis of considered algorithms two performance metrices are used namely computational time which is a measure of time taken to generate the path and path length which represents the length of the generated path.