A method is proposed for solving the problem of automation of the selection process of flight path to the target of strike aircraft. The problem reduces to the problem of finding the shortest path on a graph. The formal description of the motion of strike aircraft to the target. An approach to estimating the amount of fuel that must be spent to achieve the goal . The shortest distance between vertices of the graph is found using Dijkstra's algorithm. An example of the proposed method for choosing the route of flight to the target Su -24. Using this method it is possible the development of automation in the process of selecting a route perspective complex of automation of command and control attack aircraft.
flight control, strike aircraft, Dijkstra's algorithm, routing, route, air traffic control