The article is devoted to the actual theme of the present, namely, optimization and improvement of methods and techniques of planning the route of an unmanned aerial vehicle. In article the analysis of a modern condition of development of unmanned aerial vehicles and a circle of tasks which are assigned to them is spent. A number of unresolved tasks are defined, to the construction of the unmanned aerial vehicle route depending on the nature of the tasks. It is analyzed, what main tactical and technical characteristics of the unmanned aerial vehicle and target load influence on the route planning. The approaches to constructing the unmanned aerial vehicle route using graph theory were reviewed and their advantages and disadvantages were analyzed. The capabilities of known approaches to optimize the unmanned aerial vehicle route have been determined and one of the analyzed algorithms for finding the shortest route has been selected for further implementation. Multi-criteria optimization methods, namely cluster analysis, have been analyzed and those that are suitable for the given conditions have been highlighted. Among all clustering algorithms selected and proposed in the future work relevant to the optimization of unmanned aerial vehicle flight. Proposed an improved method that combines clustering (using the algorithm Forel-2 and K-MEANS) and optimization on the graph (using a modified algorithm Little`s), which optimizes the unmanned aerial vehicle flight route by the criterion of its minimum length. A practical calculation of the improved method for the selected unmanned aerial vehicle and its target load has been performed and shows how the unmanned aerial vehicle route will change compared to the known methods. The main results obtained and directions for further research on the optimization of the unmanned aerial vehicle route to solve the task.
Unmanned Aerial Vehicle Route Planning in the Presence of a Threat Environment Based on a Virtual Globe Platform
