DIJKSTRA ALGORITHM USING UAV PATH PLANNING

The use of unmanned aerial vehicles (UAV) is increasing today. UAVs can be divided into two parts, which are remote controlled and can travel automatically due to a certain battery problem. Recent research has also focused on the development and application of new algorithms to autonomously control these vehicles and determine the shortest flight paths. Together with these researches, UAVs are used in many civil activities such as weather forecasts, environmental studies and traffic control. Three-dimensional (3D) path planning is an important issue for autonomously moving UAVs. The shortest path for Unmanned Aerial Vehicles (UAV) is determined by using two-dimensional (2D) path planning algorithms using the obstacles in the environment, and allows UAVs to perform their environmental tasks as soon as possible. The purpose of this study is to determine the shortest path to the target point and avoiding obstacles for UAVs using the Dijkstra algorithm. It was developed to evaluate the arrival time of the UAVs in the path planning algorithm with the simulation performed in the MATLAB program. In this study, the obstacles were defined for the purpose of the building with different heights and different widths and 2D and 3D models were carried out, assuming that the UAV flies at certain heights. In addition, the flight of the UAVs in the route planning determined in the real applications was carried out and the data such as battery consumption, amount of battery spent, speed, amount of travel were examined.