Application of Shortest Path Algorithms in Forming the Flight Route of an Unmanned Aerial Vehicle

Abstract

Problem definition. Unmanned aerial vehicles are used in all fields of activity, in particular for monitoring (reconnaissance). However, modern methods of controlling them do not allow for automated formation of the flight route, taking into account the importance of monitoring objects from the position of effective application of the target load. To eliminate this disadvantage, it is proposed to use algorithms for finding shortest paths underlying routing protocols in telecommunication networks. The aim of the work is research on the routing of an unmanned aerial vehicle under enemy countermeasures (adverse conditions), as well as the development of an automated formation of the flight route. Methods used The elements of the scientific and methodological apparatus of graph theory, the theory of the effectiveness of purposeful processes and the theory of probability were used. Result: The directions of modification of Dijkstra and Bellman-Ford algorithms in the direction of their application in the routing of an unmanned aerial vehicle are shown. Practical significance: The results obtained will increase the efficiency of using the target load of an unmanned aerial vehicle when performing various classes of tasks