RU2734171C1 - Method for optimum adaptation of an air target intercept route when a group of air defence systems is in the area of flights - Google Patents

Abstract

FIELD: automated control systems.

SUBSTANCE: invention relates to automated control systems and can be used in the interest of increasing the probability of intercepting an air target in the presence of ADS grouping in the area of flights. Algorithms are used to search for safe corridors of passage through a zone of defeat of group ADS, calculation of elements of optimal route for overcoming of ADS group strike zone and elements of optimal route of interception at specified approach algorithm with target. Method is based on formation of two types of possible routes calculated at different values of heading angle of speed of interceptor (ϕ) for known approach algorithms with the target (s₁, s₂, s₃), as well as on determination in this group of optimally adapted intercept route providing minimum penetration of intercepted target into protected airspace. First type of possible routes includes routes of intercepting

passing by the hazardous zone and not requiring adaptation, and to the second one – adapted composite routes M₁ passing through the hazardous zone when using the safe corridor.

EFFECT: safety of overcoming the ADS group strike area and reduction of the air target penetration distance into the protected space.

1 cl, 7 dwg

Description

The invention relates to automated control systems and can be used to increase the probability of intercepting an air target in the presence of a grouping of anti-aircraft missile systems (SAM) in the flight area.

In modern military conflicts, a significant role is played by the confrontation between manned aircraft and ground-based air defense systems. At the same time, in areas of combat contact, both a local (focal) fire zone and a continuous zone of fire of an air defense missile system with multiple overlaps can be created. This necessitates improving the methods of adapting the flight route to difficult tactical conditions, in particular, in the interests of increasing the likelihood of the interceptor withdrawing into the area of use of the weapon.

One of the most common ways of obtaining this result is bypassing the affected area of ground-based air defense systems, "borrowed" from the long-term practice of flying around dangerous zones or zones with unfavorable conditions. The known method of trajectory control of aircraft (AC) with flying around areas with unfavorable meteorological conditions (patent RU 2490170, publication date 05/27/2013). In the framework of the known method, the boundary of the danger zone is approximated by a circle, and the route of its overflight is formed in the form of a corrected course based on traditional guidance methods. The parameters are determined either at the control room or directly on board the aircraft. Correction of the aircraft heading begins when the distance from the aimed aircraft to the center of the danger zone becomes less than a certain value. However, the use of the known method for safely bypassing the affected area of the air defense missile system grouping very significantly lengthens the flight route, which especially complicates the implementation of a time balance when intercepting an air target.

The prototype of the present invention is a method for adaptive route control of a manned vehicle (patent RU 2568161, publication date 10/27/2014).

The basis of the known method of adaptive - route control for a given dislocation of a grouping of air defense missile systems with a known spatial distribution of the probability density of aircraft destruction is the calculation of a flight route that provides the minimum flight hazard achievable with a limited onboard fuel supply. For this purpose, the area available for flights is divided into identical discretes with dimensions Δх × Δу, and the route is approximated by a set of straight sections between the centers of neighboring discretes. In this case, the end point of each section of the route is placed in the center of one of the five nearest discretes, in which the probability density of aircraft destruction reaches the value that is the smallest for the listed alternative options.

The main reason that impedes the implementation of the known method of adaptive-route control (prototype) is the difficulty of obtaining explicitly the coordinate dependence of the spatial density of the probability of aircraft damage. This is due to the fact that the danger of an aircraft being hit at any point in the dangerous zone is determined not by coordinates, but by the total duration of the aircraft's stay within the boundaries of the dangerous zone. In addition, in the case of an established information interaction in the SAM grouping, the aircraft, after a short stay in the affected area of one complex, can be fired upon immediately after entering the affected area of another complex. The danger of aircraft destruction increases rapidly during the flight and practically does not depend on coordinates.

The second disadvantage of the prototype is the alleged universalism of the flight route of the manned vehicle and the lack of its connection to the type of task being performed. This significantly limits the rationality of choosing a route optimization indicator.

The noted drawbacks are eliminated in the proposed method for optimal adaptation of the interception route, for the implementation of which actual information is used about the composition and locations of the air defense missile system, the limiting radii of the affected area for the entire range of altitudes of the interceptor's flight, as well as the coordinate and speed parameters of the flight route of the air target - the aggressor.

The objective of the present invention is to increase the probability of intercepting an air target in the presence of an air defense missile system in the flight area.

The technical result of the present invention is to ensure the safety of overcoming the affected area of the SAM group and to reduce the penetration range of the air target into the protected space.

The algorithm for safely overcoming a composite affected area is based on finding a safe corridor to bypass the dangerous zone and building a route to overcome the affected area.

Examples of safe corridors bypassing the affected area of the grouping of three air defense missile systems located at points O ₁ , O ₂ and O ₃ are shown in Fig. 1, where (a) in the presence of a gap between the affected zones, (b) in the absence of a gap between the affected zones, and their borders are highlighted with a bold dotted line. The boundaries of the affected area of the complexes are conventionally indicated by circles. The condition for the existence of a safe corridor between neighboring air defense systems is the fulfillment of the inequality:

where r _i (h) is the radius of the horizontal section of the affected area of the i-th air defense missile system at height h;

R _i - removal of the center of the affected area of the i-th air defense missile system from point A;

α _i - azimuth angle between the segments AO _i and AO _{i + 1} ;

b ₀ is a given constant.

The minimum length of the route between points A and B will have if it includes two tangents to the boundary of the affected area of the air defense missile system, drawn from points A and B, and the arc conjugate with them EQ (Fig. 2).

The coordinates of the "nodal" points of the route E (x _e , y _e ) and Q (x _q , y _q ) are determined using the given properties ΔAEO _i and ΔBQO _i .

where x _a , y _a - coordinates of point A;

Similar expressions for the coordinates of point B can be obtained by replacing the indices a and e in formulas (2) by b and q, respectively.

Using the known coordinates of the nodal points, the total length of the curve AEQB (L) is estimated by the following expression:

Expressions (1) - (3) are the basis for choosing the optimal route to reduce the danger and the duration of the interceptor's flight when crossing the dangerous zone. A block diagram of the algorithm for calculating the elements of the optimal route to overcome the affected areas of the air defense missile system, including three blocks, is shown in Fig. 3.

The presented algorithm ensures the adaptation of the route of overcoming to the given configuration of the affected area of the group of air defense missile systems and its smooth conjugation with the complementary route of interception.

The relevance of reducing the penetration range of an air target into protected airspace (hereinafter referred to as the penetration range) is due to the need to intercept an air carrier of air-to-ground missiles before launching cruise missiles, that is, at the earliest possible stages of its flight. The technical prerequisites for early interception are created by an increase in the detection range of air targets by modern air defense information systems and the launch range of domestic air-to-air missiles.

When solving practical problems of constructing an interception route, a simplified heuristic approach is widely used, based on the use of the independence of the optimal movement of the aircraft in the vertical plane from the nature of its movement in the horizontal plane, as well as energy optimal programs for changing the altitude and flight speed on each segment of the route for a specific operating mode of the engine. and a given aircraft flight profile.

The proposed algorithm for optimizing the route of intercepting an air target includes determining the analytical dependence of the penetration range of an intercepted target on the averaged values of altitude and flight speed on each route segment, as well as the choice of an option that provides the minimum target penetration range into protected airspace, with a variation in the length of the balanced segment and the range air-to-air missile launch.

Typical schemes of interception routes for direct interception, maneuver and attack into the front hemisphere of the target, as well as maneuver and attack into the rear hemisphere of the target are shown in Fig. 4, where:

a) - route scheme for direct interception;

b) - route scheme for maneuvering and attacking the front hemisphere of the target;

c) - route scheme for maneuvering and attacking the rear hemisphere of the target;

А - the beginning of the aircraft route;

С - initial position of the target;

РМ - balance section of the route;

CG - target penetration range;

MD is the area where the interceptor maneuvers;

H - position of the aircraft at the time of launching the rocket;

G - the position of the target at the time of its hit by an air-to-air missile.

In the interests of obtaining an analytical dependence of the penetration range of an intercepted target on the parameters of the interception route, a balance section of the RM was introduced into its composition.

при этом оценивается выражением:The optimal route of direct interception is built in the form of a segment of a straight line, the length of three sections of which is determined by the flight performance of the aircraft and does not depend on the speed and direction of the target. Target penetration range

in this case it is evaluated by the expression:

ν _i , t _i - average speed and duration of the interceptor flight in the i-th segment,

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

ν ₃ , ν _p are the average flight speeds of the target and the rocket, respectively.

The advantages of the chosen scheme of the direct interception route (Fig. 4a) include the existence of an exact solution (4), which is not universal. The scope of its application is determined by the fulfillment of the closed condition ΔACG.

The equations formalizing the conditions for the closedness of triangles when using the maneuver (Figs. 4b, 4c), in addition to unknown time and speed characteristics, also include the heading angle of the interceptor velocity (ϕ) and its trigonometric functions. As a result, the systems of equations that determine the values of the interception route parameters when using the maneuver are transcendental.

оценивают в виде функции от параметра:To eliminate the difficulties that have arisen, the heading angle is used as a parameter, and the penetration range when attacking the front hemisphere of the target

evaluated as a function of the parameter:

ν _p , ν _in , ν _i, R ₀ , β, θ - given initial data.

Within the framework of this approach, when maneuvering and attacking the rear hemisphere of the target, the following estimate of the penetration range was obtained:

таких, что:The minimum penetration depth of an air target is achieved at the parameter values

such that:

It should be noted that the condition for the realizability of solutions (5) and (6) is the simultaneous fulfillment of the inequalities:

The physical meaning of conditions (8) is that the target detection range (R) should not exceed the maximum possible value (R _pre ), and the missile launch range (r) should not go beyond the range determined by its minimum and limiting values.

The presented formula expressions (4) - (6) make it possible to obtain numerical estimates of the aircraft route elements when using three algorithms for the approach of an interceptor with an air target. A block diagram of the algorithm for calculating the elements of the optimal interception route that minimizes the target penetration range is shown in Fig. five.

The presented algorithm provides optimization of the aircraft route in terms of the penetration range of an air target, which is not a hard limitation. For optimization, any route indicator can be used that critically affects the performance of the flight goal and can be represented as an explicit function of the speed and duration of the flight on the route segments. In particular, the following indicators can be used - the range or duration of the interceptor flight, the flight range of an air-to-air missile, etc.

The algorithms shown in FIG. 3 and 5 are intended for use in different flight phases, and each of them is realized in "autonomous" mode.

The proposed method is implemented as follows. To implement the proposed method for optimal adaptation of the route of intercepting an air target while being in the flight area of the air defense missile group, the following are used:

- algorithms for finding a safe corridor and calculating the elements of the optimal route to overcome the affected area of the air defense missile system;

- algorithms for calculating the elements of the optimal interception route for a given approach to the target algorithm.

проходящие мимо опасной зоны и не требующие адаптации, а ко второму - адаптированные составные маршруты M₁, проходящие через опасную зону при использовании безопасных коридоров.The proposed method is based on the formation of a group of two types of possible routes, calculated for different values of the interceptor heading angle (ϕ) for known rendezvous algorithms with the target (s ₁ , s ₂ , s ₃ ), as well as on the determination of the optimally adapted interception route in this group , providing minimal penetration of the intercepted target into the protected airspace. The first type of possible routes includes interception routes

passing by the danger zone and not requiring adaptation, and to the second - adapted multiple routes M ₁ , passing through the danger zone when using safe corridors.

и M₁ представлен на фиг. 6.Typical composition of a group of initial interception routes to form a group of routes

and M ₁ is shown in FIG. 6.

The main initial data for constructing possible interception routes presented in Fig. 6 are:

A - initial position of the interceptor;

B - initial position of an air target moving in a straight line at a constant speed;

circles 14-17 - horizontal sections of the affected area of the SAM group at a given height;

Safe corridor bypassing the affected area - the passage between the local affected areas 15 and 16.

FIG. 6 shows two types of interception routes:

unadapted interception routes 1, 2, 3, 6, 7 and 8;

adapted compound routes, each of which combines the route to overcome the affected area 5 and one of the group of complementary routes 9, 10, 11, 12 and 13.

входят только маршруты 1 и 8, проходящие мимо опасной зоны.Routes 1 and 2 were calculated using a maneuver and an attack into the rear hemisphere of the target for different values of the interceptor heading angle. FIG. 6, there are only two such routes, but in real conditions, depending on the conditions, their number can vary from 0 to several dozen. Route 3 is a direct intercept route that exists in the singular. Routes 6, 7 and 8 were calculated using a maneuver and an attack into the front hemisphere of the target for different values of the interceptor heading angle. The number of routes of this type can also vary in the range from 0 to several tens, depending on the initial data, including the value of the discrete change in the heading angle of the interceptor speed. The composition of the routes

only routes 1 and 8 that pass the hazardous area are included.

The common part of the adapted composite routes is the optimal route to overcome the affected area of the SAM grouping (in Fig. 6 - AC), smoothly turning into one of the complementary interception routes (9, 10, 11, 12, and 13). At the same time, the overcoming route passes through a safe corridor between adjacent affected zones 14 and 15 and has the minimum length among all curves that do not pass through the danger zone and connect points A and C. Complementary interception routes 9 and 10 are calculated using a maneuver and an attack into the rear hemisphere targets for different values of the interceptor heading angle, routes 12 and 13 - when using a maneuver and attack into the front hemisphere of the target for different values of the heading speed angle, and route 11 is a direct interception route. The number of possible interception routes using a maneuver, given some initial data, can vary from zero to several tens.

и М₁, позволяют в качестве оптимально адаптированного выделить адаптированный составной маршрут, объединяющий маршрут преодоления зоны поражения 5 и дополняющий маршрут 9.Comparison of target penetration depth values obtained using interception routes

and M ₁ , allow us to select an adapted compound route as an optimally adapted one, combining the route to overcome the affected area 5 and complementing route 9.

The depth of target penetration deep into the protected area is used as an indicator of optimization of interception routes, and, as the analysis showed, this depth is proportional to the duration of the interceptor's flight. This opens up the possibility, when choosing the optimal route to overcome the affected area M _0, to choose the one that has the minimum duration.

The implementation of the proposed method includes performing the following sequence of actions (Fig. 7).

Input of the initial data 1 is performed, including the composition, characteristics and coordinates of the points of deployment of the air defense missile system, the values of the duration and speed of the interceptor flight on the main sections of the route, as well as the coordinates, direction and speed of the target that invaded the protected airspace.

For the given initial data, the coordinates of the boundaries of the horizontal section of the affected area of the SAM group 2 are determined. Next, the elements of the group of interception routes are calculated for the given approach algorithms for the purpose of 3, while the routes based on the use of the maneuver are also calculated for a discrete series of values of the interceptor heading angle. In the absence of realizable interception routes, the values of the altitude and speed indicators of the interceptor flight are changed and the previously performed calculations are repeated. Such iterations are repeated until at least one interception route is found for which the feasibility conditions are satisfied. The necessary calculations are based on formulas (4) - (6).

Define a subset of interception routes that do not cross the border of the affected area of the air defense missile system grouping 4. The parameters of the routes for which this criterion is met are transferred to block 8.

Next, they search for a safe corridor to overcome the affected area 5 and calculate the bypass route 6, inscribed in a safe corridor and having a minimum length. These procedures are based on formulas (2) - (3) and the flowchart shown in FIG. 3.

The parameters of complementary interception routes are calculated for the given approach algorithms for target 7, while the coordinates of the beginning of the complementary interception routes are calculated based on the already known parameters of the bypass route. The parameters of routes based on the use of the maneuver are calculated when the interceptor velocity heading angle changes within the possible range of values, and a route is selected from this array, at which the minimum penetration range into the protected airspace is achieved with the given approach algorithm with the target. The basis for calculating the modified routes are formulas (4) - (6) and the block diagram of the algorithm shown in Fig. five.

A complete set of possible interception routes is formed and the optimally adapted interception route 8 is selected from them, which provides the shortest penetration range of the air target into the protected space.

As conditions for the implementation of the proposed method, it is necessary to perform the following activities:

- development of models of special software that ensure the automatic execution of the entire sequence of procedures outlined above, at the stages of planning (preparation) and conduct of hostilities;

- creation of a mock-up of a high-performance computing complex, providing calculations in real conditions of high dynamics of the tactical situation. According to the available data, the performance of the complex should be at least 4 orders of magnitude higher than the performance of a modern computer with a standard configuration. Based on the features of the application of the proposed method, it is also necessary to ensure high reliability (fault tolerance) of the computing complex. The most suitable technology that provides the most low-budget implementation of the stated requirements is clustering of computing resources of a distributed group of servers. On this basis, powerful computing systems (clusters) are being created, the performance of which can be increased in a very wide range, and fault tolerance can be brought to the level of "five nines" (99.999%);

- conjugation of a computer complex with information and communication means, ensuring the relevance of intelligence data on the composition and deployment of the air defense missile group. Information means should ensure continuous monitoring of the air situation in the flight area, the dimensions of which exceed the tactical range of modern aircraft, and update the coordinate information at a rate of 10 to 60 seconds. And the communication means must support the stable operation of the productive channel for the secure transfer of data on board the aircraft.

The existence of corridors for safely bypassing the dangerous zone of the grouping of anti-aircraft missile systems, which is supposed to be used in the proposed method, is due to the significant dependence of the radius of the horizontal section of the affected area of any ground air defense system on the height of this section above the ground. Consequently, a continuous zone of destruction of a grouping of air defense missile systems can be created only in a given interval of flight altitudes, while outside this range, the group zone of destruction is divided into a set of non-intersecting local zones. Knowing the characteristics and location of the air defense missile system, as well as the characteristics of the landscape of the surrounding area, it is possible to determine the limiting radius of destruction for different heights.

To assess the feasibility of the proposed method, a mock-up of the hardware-software complex for the automated formation of the flight route of the aircraft under the conditions of the focal structure of the air defense was developed using the above algorithms for approaching the target.

The research results indicate the possibility of automatic formation of the flight route, which is the basis for the implementation of the proposed method. On the whole, the magnitude of the positive effect obtained by adapting the route is very sensitive to the deployment and composition of the enemy air defense grouping.

Claims (5)

Optimum adaptation interception route process air target while in the area of flight SAM groups containing border coordinate calculation lesion groups SAM area horizontal cross-sectional geometry which is at a height h above the ground approximated by circles with centers coincident with the points SAM dislocation radii r _i (h ) and moving away from the beginning of the interception route at a distance R _i , the formation of a group of interception routes

calculated for the given algorithms of approach to the target (direct interception s ₁ , maneuver and attack into the front hemisphere of the target s ₂ , as well as maneuver and attack into the rear hemisphere of the target s ₃ ) and passing by the affected area, calculation of adapted flight routes М ₁ (s) , as well as choosing the most optimal from the group of routes {

М ₁ (s)}, characterized in that the route group

include a direct intercept route

if it exists and does not cross the affected area, and along one route of the two route groups

calculated for the approach algorithms s ₂ and s ₃ at discrete values of the interceptor heading angle, with the minimum flight duration among the routes of its group, and the group of adapted flight routes M ₁ (s) includes multiple routes, each of which consists of the optimal route to overcome the zone defeat of the SAM group M ₀ passing through the safe corridor between the affected zones of the i-th and (i + 1) -th SAM systems, for which, at given distances R _i , azimuthal angles α _i , constant b ₀ and radii r _i (h) on height h _m the inequality

in this case, the geometry of the route to overcome the affected area of the air defense missile system group for each safe corridor consists of two tangents drawn from the starting point of the interception routes

and the start points of complementary interception routes m (s), and the arc connecting them, inscribed in the boundaries of the safe corridor, and as the optimal route from the calculated overcoming routes for the found safe corridors, a route with the minimum flight duration is selected, and one of the group of complementary routes to intercept an air target m (s _i ), starting at the end point of the route to overcome M ₀ and ending at the point of use of weapons, as well as one of the group of complementary routes of interception m (s _i ), which includes the route of direct interception m (s ₁ ) and along one route m (s ₁ ) and m (s ₂ ), providing the minimum flight duration among all complementary routes with the corresponding approach algorithm, and the optimally adapted interception route is selected from the route group {

M ₁ (s)} based on the condition of minimizing the target penetration range into the protected airspace, estimated using a simplified analytical dependence on the characteristics of the routes

and m (s _i ).

Images