Comparison Study of Path Planning and Collision Avoidance Algorithms for UAV Operations

In this work, Path planning and collision avoidance algorithms were studied, and the performance of multiple algorithms - A*, Dijkstra, Rapidly-exploring Random Tree (RRT) and Back and Forth were analysed. A comparative study of these algorithms has been done in the research by considering the parameters execution time and path length. The research leads to work on four different scenarios of obstacles under three cases with varying waypoints, efficient distribution of waypoints and a certain minimum waypoint common for all other scenarios. The research concludes that A star and Dijkstra’s algorithm give an optimal path but take high computational time, whereas RRT gives solutions quickly but the path is not optimal. The conclusion assists the selection of an optimal path-planning algorithm to achieve safe and efficient operation in dynamically changing environments.