The Offered algorithm of the decision of the problem of the leaving the flying machine in point begin attacks to overland purpose in horizontal plane with co-ordination of the type of the maneuver with requirements of the crew members. The Algorithm is built on прямом method decisions of the problem to optimization on time of the moving the plane. Direct and curves areas to paths are chosen as local-optimum. The Problem to optimization under constant velocity of the moving the plane is reduced to problem of the optimization on minimum of the length to paths. The Straight line and curve with minimum radius provide the minimum lengths a path between two points and at tumbling on determined corner accordingly. Possibility of the building of the maneuver is provided in algorithm with amount area to paths before five. Overloading the plane for calculation is considered constant and equal certain equivalent, which takes into account as here greatly allowed importance, so and possibility to here realization for limited time. Searching for optimum parameter is conducted итерационным by method.
combat maneuvering plane, overland purpose, maneuver, algorithm