RU2682374C1 - Effective strategy selection method in the different formations combat actions - Google Patents

Abstract

FIELD: information technologies.SUBSTANCE: invention relates to the field of digital computing systems for processing of the input information about the opposing sides combat means characteristics. In the method, the own combat assets and each of the enemy formation means indicators values initial data are supplemented with information on the enemy formations fire damage intensities flows, each of which is equal to the product of the combat weapons in the group number by the fire damage intensity, calculating each enemy formations firing intensity flows relative contributions and performing the simultaneous combat with enemy formations simulation first stage with the own impact flow distribution in proportion to the each enemy formations firing intensity flows relative contributions until the time comes, at which by each enemy formation combat superiority coefficients values become equal, and performing the simulation second stage until the enemy formations combat assets remnants final destruction with the own remaining combat assets and destroyed enemy assets fixation.EFFECT: technical result is provision of the simultaneous combat with enemy formations two-stage simulation, taking into account of the formation's combat weapons characteristics heterogeneity.1 cl, 3 tbl, 3 dwg

Description

The invention relates to digital computing, and in particular to digital computing systems for processing input information about the characteristics of the combat assets of the warring parties, its transformation, choosing an effective strategy, evaluating the results of combat confrontation (victory, defeat, parity), with the determination of their losses and the damage inflicted on the enemy damage with any completeness of reconnaissance about the coordinates of the combat assets of the warring factions, can be used by the command staff of the Armed Forces in the process of learning and relearning of the command and staff exercises, and directly to the planning group fighting (DB) of diverse groups.

A known method [1-5], which reveals the dynamics of the battle and allows you to name the future winner. However, there is no known method of conducting a battle against heterogeneous groups with an assessment of its effectiveness. In the cited sources, firstly, the battle against a party consisting of heterogeneous groups is not considered. Secondly, the price of the victory achieved is not estimated; there is no quantitative assessment of causing maximum damage to the enemy when defeated by him. The third drawback is the existing shift in emphasis towards the ratio of the number of sides of the parties, without taking into account the heterogeneity of the groups and the way of choosing rational strategies to destroy the groups.

The technical result consists in the implementation of a two-stage simulation of simultaneous combat with enemy groupings, taking into account the heterogeneity of the characteristics of combat assets of the groupings, which allows to increase the efficiency of destruction of enemy combat assets.

Previously [6–10], the authors considered group DBs taking into account the heterogeneity in terms of the intensity of fire destruction, heterogeneity in providing the warring parties with reconnaissance about the coordinates of the combat forces of the groups, which affect the choice of rational strategies, and another type of heterogeneity associated with the possibility of defeating additional neighboring combat forces in one shot . In contrast to the known methods, the increase in combat effectiveness (effectiveness) of group combat (GB) is carried out due to:

- accounting for the heterogeneity of the BSR of the opposing parties;

- the choice of a rational strategy for maintaining GB;

- evaluation of the results of the upcoming battle before it is held.

Almost all approaches lead to the additional preservation of their BSS based on the results of the database by party A, based on the choice of a rational strategy. In the event that the choice of a rational strategy does not give an acceptable result, it is necessary to develop a new, more effective strategy, acceptable for different types of providing the parties with intelligence about the coordinates of the enemy’s BSR.

According to the invention, this problem is solved by the method in which the initial data of the values of the indicators of their combat assets and means of each of the enemy’s groupings are recorded in a memory block, characterized in that the initial data is supplemented by information about the flows of intensities of fire destruction of enemy groups, each of which is equal to the product the number of combat assets in the group by the intensity of the fire defeat, calculate the relative contributions of the flow of fire intensities of each enemy group and wasp The first stage of simulating a simultaneous battle with enemy groupings with the distribution of their influence flow is proportional to the relative contributions of the fire intensity flows of each enemy grouping until the time comes when the values of combat superiority coefficients for each enemy grouping become equal, and the second stage of modeling is carried out until the final destruction of the remaining combat means of enemy groupings with fixation of their remaining combat assets and destroyed x enemy funds.

Let the initial data of group A and the opposing group B ₁ and B _{2 are} presented in table. 1. In columns 1-4 of table 1 shows the source data of the indicators of the BSR of the warring factions. Column 5 shows that the groups have the first type of heterogeneity [6-10], because products of the intensities of fire destruction P ₁ and P ₂ BSR parties

not equal to each other. The second type of heterogeneity is different intelligence support about the coordinates of the opposing sides of the BSR, considered in four possible database scenarios.

The 6th column shows the initial values of combat superiority coefficients k ₁ (0) = 2.17 and k ₂ (0) = 3.71 at t = 0, which shows that side A has the greatest combat superiority over group B ₂ compared to group In ₁ .

The choice of the sequence of conducting a group battle (GB) from a mathematical point of view is equivalent to the justification of the battle strategy. In the literature [6-10] the following GB strategies are considered:

• Strategy S ₀ {A; B ₁ ∩ B ₂ } of one-stage group combat (OGB), when side A is fighting with group B ₁ with part r ₁ M of its military assets and grouping with the remaining part (1-r ₁ ) M Bsr In ₂ . The battle continues until the complete and simultaneous destruction of both groups.

• Strategy S ₁₂ {A; B ₁ B ₂ } or S ₂₁ {A; B ₂ , B ₁ } of a two-stage group battle (DGB), in which side A at the 1st stage selects one of the groups (B ₁ or B ₂ ) and fights by all means until it is completely destroyed, at the second stage it destroys another group (B ₂ or B ₁ ). Note that the enemy’s grouping, according to which, at the first stage, side A does not fire, defeats the BSR of side A.

A rational strategy is understood as a strategy, the choice of which leads to the maximum destruction of the opposing side’s BSR.

The dynamics of a one-stage GB in the absence of information about the coordinates of the BSR is described by differential equations (1.1) - (1.5), in which

(1.1) - change in the balances of the BSR of party A;

(1.2) - change in the remnants of the Bsr grouping In ₁

(1.3) - change in the remnants of the Bsr grouping In ₂ ;

(1.4) - initial conditions for maintaining GB;

(1.5) - the current values of the BSR when maintaining the GB;

- интенсивности поражающих выстрелов БСр группировки B_i (λ_i) и стороны А (μ_i) по группировке B_i;

- the intensity of the striking shots of the BSR group B _i (λ _i ) and side A (μ _i ) according to the group B _i ;

0≤t≤t _∞ - time of one-stage battle;

t _∞ - end of the database stage;

r ₁ , (0≤r ₁ ≤1) - relative value proportional to the number

BSR r ₁ * m [t] allocated by side A to destroy the group ₁ cm.

(1.2);

(1-r ₁ ), (1≥1-r ₁ ≥0) is a relative value proportional to the number of BSP (1-r ₁ * m (t)) allocated by side A to destroy group B ₂ , see (1.3) ;

m (t) / M is the factor supplementing equation (1.1) in the absence of intelligence about the coordinates of the Bp of group A at side B;

n ₁ (t) / N ₁ is the factor supplementing equation (1.2) in the absence of intelligence about the coordinates of the Bp group B ₁ at side A;

n ₂ (t) / N ₂ is the factor supplementing equation (1.3) in the absence of intelligence about the coordinates of the Bp of grouping B ₂ at side A.

The solution of equations (1) for any moment t _i is conveniently obtained using the Mathematica software package for various initial data. The model adopted the initial data presented in table 1, close to the example given in [1].

GB output results are:

• BSR residues at side А М _∞ = m (t _∞ ) and at side В N _∞ = n _l (t _∞ ) + n ₂ (t _∞ ) after completion of the database, shown in table 2, (4th column);

• graphs of the dynamics of changes in the BSR in the process of GB, Fig. 1-3.

Arguments affecting the results of GB are:

• strategies: S ₀ , S ₁₂ and S ₂₁ ;

• absence (-), presence (+) of the groups of parties of intelligence on the coordinates of the enemy’s BSR.

Let us analyze the influence of the choice of strategies used by party A under various scenarios of providing intelligence for the groupings of parties A and B on the results of GB by solving equations (1) given in Table 1. 2, Art. four.

Analysis of column 4 of the table. 2 allows you to draw the following conclusions:

■ Scenarios 1 and 2: the presence of intelligence on the A ⁺ side (lines 1-4, 5-8) creates an opportunity for her to defeat the enemy with any strategy. However, the choice of an irrational strategy S ₂₁ (tab. 2, p. 2,3; 6,7) compared with the choice of a rational strategy S ₁₂ leads to an additional loss of side-sided attacks by side A by 19% (see formulas (2.1) - (2.4) )

■ Scenario 3: with the mutual absence of intelligence between parties A and B (p. 9-12), the choice of an irrational strategy S ₂₁ (Table 2, p. 10) compared to the choice of a rational strategy S ₁₂ (tab. 2, p. 12 ), unlike scenarios 1 and 2, leads to the defeat of side A: M _∞ (S ₂₁ , A ^- , B ^- ) = 0, N _∞ (S ₂₁ , A ^- , B ^- ) = 23;

■ Scenario 4: if there is no reconnaissance on side A and if side B has (p. 13-16), it will defeat side A when it chooses any strategy.

An analysis of the results of the strategies described in scenarios 3 and, especially, 4 shows the loss of side A, which leads to the need for measures to find new opportunities, in particular, the development of a new strategy that will be more effective than already known.

The two-stage GB strategy proposed by the authors should lead, firstly, to a greater destruction of the number of enemy BSSs, and secondly, to an increase in the number of saved BSSs compared to the strategies already discussed in [6-10].

The essence of the new two-stage strategy S ₀₀ with a higher level of combat effectiveness lies in the fact that at the 1st stage side A fights with groups B ₁ and B ₂ not until they are completely destroyed, but before the leveling of combat superiority coefficients (KBP)

side A with respect to the groups B ₁ and B ₂ with fixing the alignment time t *, see Fig. 1, 2. The initial initial values of KBP before the start of the battle are shown in table. 1, column 6, and are equal to k ₁ (0) = 2.17, k ₂ (0) = 3.71. Over the course of the battle, the KBP values will vary with time tk ₁ (t)> k ₁ (0), k ₂ (t)> k ₂ (0) and at some point in time t *, at the intersection (Fig. 2), to equality (3).

Values of KBP depending on the time t of the battle are written in the form:

At the 1st stage, the calculation of the relative fluxes of fire intensities according to two groups B ₁ and B _{2 will be} performed according to the formulas:

The first stage of effective databases is completed when the KBP equality k ₁ (t) = k ₂ (t) = k (t *) shown in FIG. 2, at t = t *. It can be seen from the graph that k ₁ (t) represents an increasing function, which, when another function of the KBP crosses, k ₂ (t) at t = t * becomes equal to it. Therefore, determining t *, we can use the situation when for t <t * the relation k ₁ (t) <k ₂ (t) is observed, and for t> t * k ₁ (t)> k ₂ (t).

By changing the value of t * in the interval Δt: t * ± Δt, it is possible to achieve the equality k ₁ (t) = k ₂ (t) = k (t *), which speaks of finding t = t *, at which the first stage of the battle is completed strategies S ₀₀

For the 4th scenario, the worst for side A, (see Fig. 2), we automatically obtain the initial data (6) for conducting the 2nd stage of the strategy S ₀₀ battle

From the moment of time t * = 4.538, we carry out a change of strategies from S ₀ to S ₀₀ , i.e. the firing of all remaining BSR on both groups B ₁ and B ₂ (see (5)), with the distribution of fire power, characterized by the coefficient

providing a one-time defeat of both groups B ₁ and B ₂ in the second stage. Note that at the first stage, the coefficient r ₁ (0) = 0.728. At the same time, the increase in BSR residues when applying the new strategy S ₀₀ according to scenario 4 was M _∞ = 29 (Table 3, p. 20).

In the table. Figure 3 shows the results of the battle when using the new strategy S ₀₀ for all scenarios 1-4 (p. 6, 11, 16, 21), which shows its superiority over the well-known strategies S ₀ , S ₁₂ and S ₂₁ for scenarios 2- four.

So, the proposed method allows to obtain the claimed technical result of increasing the combat effectiveness (effectiveness) of group combat.

The authors' solution of various examples for groups with different initial data revealed:

- the ability to control the outcome of the battle, without resorting to the development of new BSR, which is expensive and long-term, without using their quantitative buildup, which is not always possible and always not operational;

- the need to model various types of heterogeneity, their competent accounting with the ability to choose a developed strategy allows you to achieve the highest levels of combat effectiveness in the shortest possible time.

It is possible to implement the proposed method, at the first stage, using a computer for military-industrial control systems, at the second, in the form of a programmed device.

Used sources

1. Ventzel E.S. Introduction to operations research. - M .: Owls. Radio, 1964, 391 p.

2. Abchuk V.A., Matveychuk F.A., Tomashevsky L.P. Equations of battle dynamics / Handbook of Operations Research. - M: Military Publishing House of the Ministry of Defense of the USSR, 1979, p. 322-325.

3. Ivanov P.I. et al. Fundamentals and application of applied mathematics methods in military affairs. - Monino: VVA them. Yu.A. Gagarina, 1991.S. 186-224.

4. Ivanilov V.Yu., Ogaryshev V.F., Pavlovsky Yu.N., Conflict imitation. - M.: VTs RAS, 1993, 196 p.

5. Zhirov A.Yu. Military applied mathematics. The probabilistic basis for evaluating the effectiveness of combat and support actions of aviation. - Monino: VVA them. Yu.A. Gagarina, 2004.S. 80-118.

6. Chernoscutov A.I. et al. (RU). , G06F 17/00, G0F 5/04, F41G 7/34, F41G 7/00.

7. Chernoscutov A.I. et al. (RU). The method and device for selecting a strategy in the combat operations of heterogeneous groups is patented No. 2467382, G06F 17/00.

8. Chernoscutov A.I. et al. (RU). Патент G06F 17/00, G0F 5/04, F41G 7/34.

9. Chernoscutov A.I. et al. (RU). The method of evaluating the impact of the delay in entering the reserve in the fighting of the ных heterogeneous groups ’, G06F, 17/00.

10. Chernoskutov A.I., Sprengel A.V., Sitkevich A.V. A method and apparatus for processing information used to select rational strategies in the fighting of diverse groups. Patent No. 2571613 G06F, 17/00, 17/13, G06Q 10/06.

Claims (1)

A method of two-stage simulation of simultaneous combat with enemy groupings, taking into account the heterogeneity of the characteristics of the combat weapons of the groupings, which consists in the fact that the initial data of the values of the indicators of their combat weapons and means of each of the enemy’s groups are recorded in a memory unit, characterized in that the initial data is supplemented by information about the intensity streams fire destruction of enemy groupings, each of which is equal to the product of the number of military assets in the group and the intensity of fire destruction, in They calculate the relative contributions of the streams of fire intensities of each enemy grouping and carry out the first stage of simulating a simultaneous battle with enemy groups with the distribution of their influence flux proportionally to the relative contributions of the streams of fire intensities of each enemy grouping before the time when the values of combat superiority coefficients for each enemy grouping become equal, and carry out the second stage of modeling until the final destruction of the remnants b evyh means enemy forces with fixing its remaining combat weapons and means of destruction of the enemy.

Images