Unmanned Aerial Vehicles Flight Trajectory Optimisation on the Basis of Variational Enequality Algorithm and Projection Method

This article formulates the optimization problem that arises in determining the unmanned aerial vehicles flight trajectory and presents the decision making method for determining its optimal length and optimal number of peaks. By analyzing the formulation of the obtained problem, it is established that the flight path is a function of the number of vertices. It is shown that the basic equilibrium conditions for a model satisfy finite-dimensional variational inequalities. The qualitative properties of the solution methods are presented, as well as a calculation scheme that uses the abstract network structure that underlies this task.