Method of Automated Flight Route Planning for Unmanned Aerial Vehicles to Search for Stationary Objects

Abstract

the spectrum of use of unmanned aerial vehicles (UAVs) is steadily increasing. This necessitates the automated planning of their routes and the implementation of intelligent control methods. The search (confirmation of status) of stationary objects has the Traveling Salesman Problem, provided the equilibrium of objects and unlimited flight of UAVs. In practice, there are situations where the UAVs range is limited and the fixed objects have different weights. The method of planning UAVs flight routes is given in such conditions. It reduces to solving an optimization problem on a fully connected graph. Further research should be aimed at the implementation of UAVs intelligent control methods based on the results of detection (confirmation of state) of a stationary object and group (collective) UAVs control.