# Algorithms for optimizing the aircraft flight route

### Abstract

### Keywords

#### For citation:

Marusin V.S., Ponamarev O.P., Stolyarov O.G., Temerev O.P. Algorithms for optimizing the aircraft flight route. *Journal of «Almaz – Antey» Air and Space Defence Corporation*. 2019;(1):98-104.
https://doi.org/10.38013/2542-0542-2019-1-98-104

## Introduction

Optimization of aircraft (A/C) flight route with regard to the real environment in the flight area comes down to a variational problem and, if generally formulated, does not have any comprehensive solution. Constant development of aviation engineering and technologies and extension of aviation equipment applications justify the need for finding new algorithmic solutions in order to improve the operational air force effectiveness.

Analysis of recent experience gained in military exercises and conflicts proves the relevance of the problem related to plotting the aircraft flight route with regard to danger arising when an aircraft has to fly in an anti-aircraft weapon engagement zone (friendly and enemy missile engagement zones), as well as the need to reduce the penetration range for a target flying into the prohibited airspace.

## Danger area avoidance route calculation algorithm

Flight risk assessment for an aircraft flying in the operational area of surface-to-air missile complexes (SAMC) shows that the longer an aircraft stays in the kill zone, the more dramatically the density of aircraft destruction probability increases [1]. Besides, with well-organized information exchange between anti-aircraft missile systems deployed as a formation, an aircraft which stayed for a short time in the kill zone controlled by one SAMC, may be intercepted by a missile right after entering the kill zone controlled by another missile complex.

Thus, the risk of shooting down an aircraft during flight in the kill zone cannot be assessed properly by means of the probability theory. The most efficient way to reduce the risk is to bypass the danger area along its outer boundary. The corresponding algorithms to calculate a route of flying around a stationary kill zone with a convex smooth boundary are described in [2][3][4]. However, there is a significant loss of efficiency of known solutions in case of more complex geometry of the danger area boundary, which is formed when

a SAMC formation is deployed in the flight area (hereinafter referred to as the area of joint responsibility).

The developed algorithm can be used to fly around either a separate kill zone or a kill zone within the area of joint responsibility under surveillance of several missile complexes. This

algorithm is based on procedures intended for searching a safe corridor and plotting the shortest flight route.

Fig. 1 shows variants of safe corridors to fly around a formation consisting of three surface-toair missile complexes deployed at points О_{1}, О_{2 }and О_{3},. The geometry of the local kill zone’s boundary is represented as an approximate circle.

**Fig. 1**. Variants of safe corridors to fly around a kill zone in the area of joint responsibility if there is a gap (a) or no gap (b)

The dotted line designates a safe corridor with a gap between the local zones АВ1В (Fig. 1, a). The following inequality shall be satisfied as the condition for a safe corridor:

where R_{i} - distance from the centre of the kill zone of the i-th SAMC to point A;

α_{i} - azimuth angle between segments АО_{i} and АО_{i}_{+1};

r_{i} (Н) - radius of the horizontal section of the kill zone of the i-th SAMC at altitude H;

b_{0} - selected constant determining the width of the safe flight corridor.

If there is no gap in the kill zone at altitude H, it is reasonable to investigate if the condition (1) is satisfied at a higher altitude. If the condition (1) is not satisfied for the entire flight altitude range, flying around a gapless kill zone along its left or right boundary (lines АВ_{2}В and АВ3В in Fig. 1, b) is the only option to meet flight safety requirements. A high-priority fly-around corridor shall be selected in accordance with the predetermined criteria.

After a safe corridor is selected, we shall calculate parameters of the shortest A/C flight route from point A to point B (Fig. 2), which is based on curve ACDB. This curve comprises the

segments of two lines tangent to the boundary of the SAMC kill zone and originating from points A and B, plus the arc of the circle adjoint to these segments.

**Fig. 2.** Geometry of the shortest curve to fly around a danger area

Based on selected properties ААСО and ΔBDO let us estimate the coordinates of flight route nodal points C(x_{c},y_{c}) and D(x_{d},y_{d}):

We will obtain the similar expressions for the coordinates of point D by changing x_{a} and y_{а} in the formulae (2) to x_{b} and y_{b} respectively.

With the known coordinates of nodal points, we can estimate the entire length of curve ACDB (L), using the following expression:

The expressions (1)–(3) are the basis for optimizing the aircraft flight route to fly around a local kill zone or a kill zone within the area of joint responsibility. The calculation algorithm block diagram is shown in Fig. 3.

**Fig. 3.** Block diagram showing the algorithm for calculating the elements of the best suitable route to fly around the kill zone controlled by a SAMC formation

The represented algorithm allows to optimize the aircraft flight route to fly around a danger area irrespective of its boundary geometry. The effective use of a calculated route largely depends on the accuracy of information on the quantity and location of SAMC, maximum flight range of surface-to-air missiles, and on the validity of constant b_{0} selection.

The optimization algorithm is also applicable for calculating the flight route to fly around a danger area associated with a man-made disaster or hazardous natural phenomena.

## Air target interception route calculation algorithm

As an air-to-surface missile carrying aircraft needs to be intercepted before launching cruise missiles, i. e. at early phases of its flight, this results in the urgent problem related to the reduction of penetration range of an air target entering the protected airspace (hereinafter – penetration range). Technological prerequisites for implementing the early interception concept enable early detection of air targets by air defence information facilities and allow to increase the launch range of domestic air-to-air missiles.

In practice, to accomplish tasks involving route plotting for missile guidance, if high accuracy is not required, the simplified heuristic approach is widely used [5][6]. This approach is

based on the following:

- the most suitable motion of an aircraft in the vertical plane does not depend on the behaviour of aircraft motion in the horizontal plane;
- minimum-energy programs for flight altitude change and speed control on each flight leg for specific engine performance mode and the set aircraft flight profile.

With regard to the approach described above, we have developed an aircraft flight route optimization algorithm based on the following: determination of the analytical dependence of

the penetration range of an intercepted target on averaged values of aircraft flight altitude and speed on each flight leg; selection of an option that ensures the minimum range of target penetration into the prohibited airspace with a variable length of the balanced segment and a variable airto-air missile launch range.

Standard flight route patterns for direct interception, manoeuvre and head-on engagement, as well as for manoeuvre and tail-chase engagement are shown in Fig. 4.

**Fig. 4**. Aircraft route patterns in case of direct interception (а), in case of manoeuvre and head-on engagement (b) in case of manoeuvre and tail-chase engagement (c): A – aircraft flight origin; C – initial target location; P – balanced flight leg origin; CG – target penetration range; MD – flight leg with aircraft manoeuvre; H – aircraft position at missile launch; G – position of target when hit by air-to-air missile

To determine the analytical dependence of the penetration range of an intercepted target, the route includes balanced segment PM, variable length of which ensures better flexibility of the interception route parameters.

Representation of the route as a combination of segments with fixed (AP, MD, DH) and variable lengths allows to create a system of equations for various target approach algorithms. Such a system of equations is based on formalization of the basic triangle closure condition in order to determine unknown elements of an aircraft flight route. According to the preliminary analysis, the best suitable aircraft flight route in case of direct interception can be plotted as a line segment, with the length of two segments to be determined depending on aircraft performance, but irrespective of target flight speed and direction [7]. In order to estimate the target penetration range ( ) rпр in case of direct interception, we will obtain the following expression:

V_{i}, t_{i} - interceptor’s average speed and time in flight in the i-th segment, i =

S - initial distance between the target and the interceptor (segment AC in Fig. 4);

v_{3}, v_{p} - average flight speeds of the target and the missile, respectively.

One of the advantages of the selected route pattern in case of direct interception shown in Fig. 4 (a) is a possibility to find an accurate solution (4). The resulting value of the penetration range is not a comprehensive solution and its application is limited to the condition that allows to implement a straight flight route of the aircraft.

In addition to unknown time and speed

characteristics, the equations formalizing triangle closure conditions in case of manoeuvring (Fig. 4, b, c) include both angle φ itself with the unknown value and its trigonometric functions. As a result, certain equations that determine interception route elements in case of manoeuvring become transcendental equations.

To overcome the ensuing complications, the penetration range in case of head-on engagement () has been obtained in the form of the function of parameter φ:

V_{i}, t_{i}, R_{0}, β, θ - preset initial data.

As for manoeuvring and tail-chase engagement, the similar procedure for calculating the penetration range has given the following estimate:

Further steps to determine elements of the best suitable interception route in case of manoeuvring shall include the following procedures: calculation of numerical values r_{пр} (φ) for ф∈[ф_{min}, ф_{mах} ]; calculation of values ; calculation of route elements at .

Results of calculation of relationship are shown in Fig. 5.

**Fig. 5.** Angular dependence of penetration range for manoeuvre and tail-chase engagement

The behaviour of the represented curve indicates that if ϕ varies within ±20° of the value at which the minimum target penetration range is achieved, an increase in the range itself does

not exceed 10 % of the minimum value. Therefore, when determining the extreme value of the penetration range, it is reasonable to use sample spacing Δφ ∈ [1°, 10°].

The expressions (4)–(6) allow to obtain numerical estimates of the aircraft flight route when using three aircraft-to-air-target approach algorithms. Fig. 6 shows a block diagram of the

route elements calculation algorithm that allows to minimize the target penetration range.

**Fig. 6.** Block diagram of the route elements calculation algorithm to minimize the air target penetration range

This algorithm ensures optimization of the aircraft flight route by the air target penetration range, which is not a strict limitation. The scope of application of the algorithm is determined by the possibility of formalization of the optimization parameter represented as a function of route elements, the analytical dependence of which on initial data can be determined within the scope of the approach proposed above. In particular, the parameters such as aircraft flight range, airto-air missile flight range, etc. are used for flight route optimization.

In general, the scope of correct application of the algorithm is determined by initial data values, at which the solutions (4)–(6) are available.

## Conclusion

The above-mentioned algorithms are intended to be used on various flight legs and can function independently of one another. This gives an opportunity for shared or stand-alone usage of the algorithms when calculating a general aircraft flight route.

The problem is solved in a deterministic formulation; therefore, the application of algorithms is available only if monitoring of accumulated errors is implemented (for example, in case of target position extrapolation).

The proposed algorithms for calculating route elements prove that a solution of practical importance can be found in case of incomplete formalization of the problem regarding aircraft flight route optimization. Implementation of algorithms improves computational efficiency and enables multiple recalculations of fight route characteristics in case of accumulation of errors, which may be caused, for example, by non-uniform and unequal target motion or by a change of tactical situation during interceptor flight. The algorithms can be used by air traffic control tower (command centre) personnel or in aircraft onboard systems for automation of the said calculations or for operations of air traffic controllers (combat control officers) and aircraft crew operators.

### About the Authors

**V. S. Marusin**Russian Federation

**O. P. Ponamarev**Russian Federation

**O. G. Stolyarov**Russian Federation

**O. P. Temerev**Russian Federation

### Review

#### For citation:

Marusin V.S., Ponamarev O.P., Stolyarov O.G., Temerev O.P. Algorithms for optimizing the aircraft flight route. *Journal of «Almaz – Antey» Air and Space Defence Corporation*. 2019;(1):98-104.
https://doi.org/10.38013/2542-0542-2019-1-98-104