Shortest Path Selection for UAVS using 3-D Coordinates with Collision Avoidance System

Abstract

Unmanned Aerial Vehicle) also known as Drones and classified as Autonomous Aircraft and Remotely Piloted Aircraft. An UAV is an aircraft without having a human piloted aboard. It is usually used for the military and special operation application but also used in growing number of applications. UAV referred for the mission that are too deadly, unclean or the risky one. There are different names for the aircraft like UAS (Unpiloted Air System), UAV (Unpiloted Aerial Vehicle), RPAS (Remote Piloted Aircraft Systems) and model aircraft. In the existing solution there is a routing problem in UAV that has been addressed. The problem is referred to as the CCURP i.e. communication constrained UAV Routing Problem. To solve the CCURP problem, the shortest paths between targets are computed by mean of a graph transformation system. The major problem with the existing system is that, it is not capable to calculate the shortest path between the two points. Also, it is does not evaluate the points of collision and the existing solution is not compatible with the 3-D position of the UAVs. The existing routing algorithm and collision avoidance method does not evaluate the 3-D positions of the UAVs. The proposed algorithm will calculate the shortest path and helps to evaluate the 3-D position of the UAV. The point of collision will be clearly defined and avoided. The parameter used while observations are Delay, Accuracy, Probability of failures, and Throughput. General Terms: Shortest Path Algorithm, Routing.