K-M algorithm-based weapon-target distribution method and equipment, and medium

Abstract

The invention discloses a weapon-target allocation method based on a K-M algorithm. The weapon-target allocation method comprises the steps of performing initialization to obtain a weapon information matrix, a target information matrix, a missile target distance matrix and an allocation result recording matrix; based on the weapon information matrix, the target information matrix and the missile-target distance matrix, obtaining a damage probability matrix of the distributable weapons to the targets needing to be distributed; a round of K-M algorithm-based weapon-target distribution is carried out on the damage probability matrix, and a distribution result recording matrix, a weapon information matrix and a target information matrix are updated; if no weapon which can be used for redistribution exists or all targets can reach the set damage probability, weapon-target distribution is completed; and otherwise, repeating the above three steps until weapon-target distribution is completed. According to the method, on the basis of performing threat assessment on the targets and obtaining the damage probability requirements corresponding to the targets, the time complexity of the allocation algorithm is reduced, the operation efficiency is improved, and a relatively determined and consistent allocation result can be obtained after multiple times of operation.

Description

Technical Field

[0001] This application relates to the technical field of mission planning and auxiliary decision-making, and more specifically, to a weapon-target allocation method, device, and medium based on the K-M algorithm. Background Art

[0002] The weapon-target allocation problem is a relatively typical resource allocation problem, which involves how to reasonably allocate and utilize existing weapons, save resources while effectively striking enemy targets, and improve combat effectiveness.

[0003] In recent years, many experts and scholars have conducted a lot of research on such problems and made great progress. Zhang Yanfang et al. used the ant colony algorithm to solve the quasi-dynamic air defense weapon allocation problem; Li Zhenyu et al. used the improved ant colony algorithm to solve the air defense combat weapon target allocation problem; Yi Kai et al. studied the air defense target allocation method of multi-feature fusion and in-depth learning; Chang Xin et al. studied the intelligent multi-objective allocation method based on the genetic algorithm.

[0004] However, most of these studies are intelligent optimization methods. The intelligent algorithms have poor interpretability, slow convergence speed, strong dependence on the setting of initialization conditions and related parameters, and are prone to falling into local optimal solutions, and it is difficult to ensure the consistency of results after multiple runs. Summary of the Invention

[0005] In view of at least one defect or improvement requirement of the prior art, this application provides a weapon-target allocation method, device, and medium based on the K-M algorithm, which is used to overcome the technical defects of the existing intelligent algorithms, such as poor interpretability, slow convergence speed, strong dependence on the setting of initialization conditions and related parameters, and being prone to falling into local optimal solutions and it is difficult to ensure the consistency of results after multiple runs.

[0006] To achieve the above object, in the first aspect, this application provides a weapon-target allocation method based on the K-M algorithm, including:

[0007] Initialize to obtain an allocable weapon information matrix, a target information matrix to be allocated, a projectile-target distance matrix representing the distance between weapon ammunition and the target, and an allocation result record matrix;

[0008] Based on the weapon information matrix, the target information matrix, and the projectile-target distance matrix, obtain a damage probability matrix of the allocable weapons to the targets to be allocated;

[0009] Perform a round of weapon-target allocation based on the K-M algorithm on the damage probability matrix, and update the allocation result record matrix, the weapon information matrix, and the target information matrix;

[0010] If there are no weapons available for redistribution or all targets can reach the established damage probability, the weapon-target assignment is completed; otherwise, repeat the above three steps until the weapon-target assignment is completed.

[0011] Furthermore, the results of the initialization include:

[0012] Each row of the weapon information matrix represents the information of an available weapon. The first column represents the weapon number, and the second column represents the corresponding weapon type;

[0013] Each row of the target information matrix represents the information of a target to be assigned. The first column represents the target number, the second column represents the target type, the third column represents the expected damage probability of the target, the fourth column represents the damage probability that can be achieved by the assigned weapon to this target, and the fifth column represents the flag indicating whether this target has been assigned;

[0014] The matrix elements of the weapon-target distance matrix represent the distance between the weapon numbered i and the target numbered j in the three-dimensional space coordinate system;

[0015] The first column of the assignment result record matrix represents the weapon number, and the second column represents the target number, which is initialized as an empty matrix.

[0016] Furthermore, obtaining the damage probability matrix of the assignable weapons to the targets to be assigned based on the weapon information matrix, the target information matrix, and the weapon-target distance matrix includes:

[0017] Select the required data matrix according to the type of the weapon numbered i; the columns of each data matrix correspond to different target types, and the rows correspond to different weapon-target distances;

[0018] Determine which column value in the data matrix to use according to the type of the target numbered j;

[0019] Determine the row selected in the data matrix according to the actual weapon-target distance, and finally determine the damage probability for interpolation; the formula for calculating the damage probability matrix by interpolation method includes:

[0020]

[0021] where the type of the target numbered j is k; d q and d q+1 respectively represent the lower limit and the upper limit of the distance interval where the actual weapon-target distance is located; d ij represents the actual weapon-target distance between the weapon numbered i and the target numbered j in the three-dimensional space coordinate system; p q,k and p q+1,krespectively represent the theoretical damage probabilities corresponding to the lower limit of the distance interval and the upper limit of the distance interval when the type of the target numbered j is k; a ij represents the actual damage probability of the weapon numbered i to the target numbered j, which is the matrix element of the damage probability matrix.

[0022] Further, perform a round of weapon-target allocation based on the K-M algorithm on the damage probability matrix, and updating the allocation result record matrix includes:

[0023] Based on the damage probability matrix, obtain the allocation basis matrix;

[0024] Perform a round of weapon-target allocation based on the K-M algorithm for the allocation basis matrix to obtain the projectile-target matching matrix;

[0025] Update the allocation result record matrix according to the projectile-target matching matrix, the weapon information matrix and the target information matrix to obtain the allocation result record matrix for this round.

[0026] Further, perform a round of weapon-target allocation based on the K-M algorithm for the allocation basis matrix to obtain the projectile-target matching matrix, including:

[0027] The matrix elements of the allocation basis matrix are:

[0028]

[0029] where p j,need represents the damage probability required by the target numbered j;

[0030] Convert the allocation basis matrix into a probability complementary matrix, and the matrix elements of the probability complementary matrix are:

[0031] b ij = 1 - m ij ;

[0032] Performing a round of weapon-target allocation based on the K-M algorithm on the probability complementary matrix B to obtain the projectile-target matching matrix includes:

[0033] S1. Find the minimum value in each row of the probability complementary matrix B, subtract the corresponding minimum value from each row, then find the minimum value in each column, and subtract the corresponding minimum value from each column to obtain a new matrix B1;

[0034] S2. Cover all 0s with the fewest number of lines. If the number of lines is equal to n, the algorithm ends; otherwise, execute the next step;

[0035] S21. Find the independent 0;

[0036] S211. Find the rows or columns that have only one 0 element, and make corresponding assignments based on the 0 elements;

[0037] S2111. Set a vector to record the number of 0s in each row and each column of matrix B1;

[0038] S2112. Find the first value equal to 1 in the vector If it exists, record its corresponding row number i or column number j, and execute step S2113; otherwise, directly execute step S212;

[0039] S2113. Search for 0 elements in the i-th row of matrix B1, and record the column number j where they are located;

[0040] S2114. Add (i, j) to the initial assignment basis matrix;

[0041] S2115. Set all elements in the i-th row and j-th column of matrix B1 to the maximum value ∞;

[0042] S2116. Repeat steps S2111 - S2115;

[0043] S212. Delete the rows and columns where the assigned 0 elements are located;

[0044] S2121. Add the initial assignment basis matrix to the assigned weapon - target matching matrix;

[0045] S2122. If the number of assignments is equal to the number of weapons or targets to be assigned, the weapon - target assignment ends; otherwise, execute step S22;

[0046] S22. Tick;

[0047] S221. Tick the rows without independent 0s;

[0048] S222. Tick the columns where 0s are located in the ticked rows;

[0049] S223. Tick the rows corresponding to the independent 0s in all ticked columns;

[0050] S224. Repeat steps S221 - S223 until no more ticking is possible;

[0051] S23. Draw lines through the rows that are not ticked and the columns that are ticked;

[0052] S3. Find the minimum value of the uncovered elements, subtract the minimum value from all uncovered elements, add the minimum value to the elements where the two cross lines meet, repeat step S2 until the allocation is completed, and obtain the final warhead-target matching matrix; each row of the warhead-target matching matrix represents a group of allocations, the first element of each row represents the weapon number, and the second element of each row represents the target number.

[0053] Further, updating the weapon information matrix and the target information matrix includes:

[0054] Delete the allocated weapons from the weapon information matrix M mssl to obtain a new available weapon information matrix M mssl ';

[0055] Obtain the damage probability p j1 that can be achieved by the targets allocated in this round;

[0056] p j1 = 1 - (1 - p j,0 )(1 - p j,new );

[0057] where p j,0 is the damage probability that the allocated weapon can achieve for this target, and p j,new is the damage probability of the newly allocated weapon for this target;

[0058] Update the completion allocation flag Label j of the targets allocated in this round;

[0059]

[0060] where p j,need represents the damage probability required for the target numbered j.

[0061] Further, it also includes:

[0062] Based on the allocation basis matrix, considering the cost-effectiveness ratio of each weapon's real-time strike on each target, obtain the allocation basis matrix based on the cost-effectiveness ratio, specifically including:

[0063] Based on the threat level w j of the target numbered j and the target economic value b j , obtain the total value W j of the target numbered j:

[0064] W j = ω w ·w j + ω b ·b j ;

[0065] where ωw , ω b respectively represent the weight coefficients of the threat level and the target economic value;

[0066] If the cost of the weapon numbered i is denoted as c i , then the cost-effectiveness ratio s ij of the weapon numbered i hitting the target numbered j is:

[0067] s ij = W j / c i ;

[0068] The formula for obtaining the allocation basis matrix based on the cost-effectiveness ratio from the said allocation basis matrix includes:

[0069] m' ij = m ij * s ij ;

[0070] wherein, m ij represents the damage probability of the weapon numbered i to the target numbered j; m' ij represents the matrix element of the allocation basis matrix based on the cost-effectiveness ratio;

[0071] Obtain the weapon-target allocation result based on the maximum cost-effectiveness ratio according to the allocation basis matrix based on the cost-effectiveness ratio.

[0072] Furthermore, it further includes:

[0073] Expand the weapon numbers and weapon types in the weapon information matrix in sequence according to the number of ammunitions to solve the allocation problem of a weapon platform having multiple ammunitions of the same type;

[0074] and / or

[0075] Expand the weapon numbers and weapon types in the weapon information matrix in sequence according to the number of ammunitions of the corresponding types to solve the allocation problem of a weapon platform having multiple types and multiple ammunitions at the same time.

[0076] In a second aspect, the present application provides an electronic device, including at least one processing unit and at least one storage unit, wherein the storage unit stores a computer program, and when the computer program is executed by the processing unit, the processing unit can execute the steps of the weapon-target allocation method described in any one of the foregoing.

[0077] In a third aspect, the present application provides a storage medium, which stores a computer program executable by an access authentication device, and when the computer program runs on the access authentication device, the access authentication device can execute the steps of the weapon-target allocation method described in any one of the foregoing.

[0078] Generally speaking, compared with the prior art, the above technical solution conceived by this application can achieve the following beneficial effects:

[0079] (1) Based on threat assessment of targets and obtaining the damage probability requirements corresponding to each target, this application reduces the time complexity of the weapon-target assignment algorithm, improves the operation efficiency, and can obtain relatively definite and consistent assignment results after multiple runs.

[0080] (2) The weapon-target assignment method of this application is easy to expand. Through simple transformation, it can be used to solve the assignment problem of a weapon platform having multiple or multiple types of ammunition.

[0081] (3) The weapon-target assignment method of this application aims at the resource allocation problem of multiple types of ground weapons attacking multiple targets. Based on threat assessment of enemy targets and obtaining the damage probability requirements corresponding to each target, it can solve the practical problem of how to reasonably allocate the existing weapons on the battlefield and use the least number of weapons to obtain the maximum damage efficiency, which has strong practical guiding significance. BRIEF DESCRIPTION OF THE DRAWINGS

[0082] In order to more clearly illustrate the technical solutions in the embodiments of this application, the following will briefly introduce the drawings required in the embodiments. Obviously, the drawings in the following description are only some embodiments of this application. For those of ordinary skill in the art, without creative efforts, other drawings can also be obtained based on these drawings.

[0083] Figure 1 Schematic diagram of the weapon-target assignment problem provided by the embodiment of this application (the values on the connection lines represent the achievable damage probabilities, the numbers next to the targets are the required damage probabilities, and the black solid lines represent a distribution result that meets the requirements);

[0084] Figure 2 Core flowchart of a weapon-target assignment method based on the K-M algorithm provided by the embodiment of this application;

[0085] Figure 3 Detailed flowchart of a weapon-target assignment method based on the K-M algorithm provided by the embodiment of this application;

[0086] Figure 4 Schematic diagram for solving the initial value of the damage probability interpolation of the A-type weapon (weapon number is i) against target j provided by the embodiment of this application;

[0087] Figure 5 Matrix M provided by the embodiment of this application for solving the assignment problem of a weapon platform having multiple same-type ammunitions mssl Expansion schematic diagram;

[0088] Figure 6 Matrix M provided by the embodiment of the present application for solving the allocation problem of multiple types of ammunition for one weapon platform mssl Expansion schematic diagram;

[0089] Figure 7 (a) Schematic diagram of the matrix of weapon information to be allocated, the matrix of target information to be allocated, and the damage probability matrix of the allocable weapons to the targets to be allocated provided by the embodiment of the present application;

[0090] Figure 7 (b) Schematic diagram of the allocation result and the achievable damage probability of the target after allocation provided by the embodiment of the present application;

[0091] Figure 8 Block diagram of the electronic device provided by the embodiment of the present application suitable for implementing the weapon-target allocation method described above. Detailed implementation manners

[0092] In order to make the objectives, technical solutions and advantages of the present application clearer and more understandable, the present application will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application. In addition, the technical features involved in the various embodiments of the present application described below can be combined with each other as long as they do not conflict with each other.

[0093] Terms such as "first", "second" or "nth" in the specification, claims or drawings of the present application can be used to distinguish different objects and can also be used to describe a specific order. In addition, the terms "comprising" or "having" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product or device including a series of steps or units is not limited to the listed steps or units, but may optionally further include steps or units not listed, or may optionally further include other steps or units inherent to these processes, methods, products or devices.

[0094] As described in the background art section of the specification, existing intelligent algorithms have technical defects such as poor interpretability, slow convergence speed, high dependence on the setting of initialization conditions and related parameters, and being prone to falling into local optimal solutions and it is difficult to ensure the consistency of results after multiple runs. In view of this, the present application provides a weapon-target allocation method, device and medium based on the K-M algorithm to overcome the above-mentioned technical defects.

[0095] Refer to Figure 1, Weapon - Target Assignment (WTA) is an important part of the command decision - making process, which has a significant impact on improving the overall combat effectiveness. Its connotation refers to, based on the battlefield situation awareness, efficiently using the multi - type and multi - platform weapon resources of one's own side according to certain criteria and constraints, and by implementing reasonable allocation strategies, achieving the strike of multiple enemy targets and obtaining the best combat effect.

[0096] The K - M (Kuhn - Munkres) algorithm is developed on the basis of the Hungarian algorithm. To solve the maximum - weight matching problem of bipartite graphs in combinatorial optimization, its basic principle is: based on matrix transformation and marking operations, continuously find augmenting paths to adjust the matching, gradually increase the weight and quantity of the matching edges, and finally achieve the maximum - weight matching to realize the optimal allocation.

[0097] This application mainly focuses on the resource allocation problem of multiple types of ground weapons attacking multiple targets. It is mainly used to solve the practical problem of how to reasonably allocate the existing weapons on the battlefield and use the least number of weapons to obtain the maximum damage effectiveness on the basis of threat assessment of enemy targets and obtaining the damage probability requirements corresponding to each target.

[0098] Reference Figure 2 and Figure 3 , an embodiment of this application provides a weapon - target assignment method based on the K - M algorithm. The weapon - target assignment method may include the following steps.

[0099] Step 1: Initialize to obtain the assignable weapon information matrix, the target information matrix to be assigned, the bullet - target distance matrix representing the distance between weapon ammunition and targets, and the assignment result record matrix. The specific results of the initialization may include:

[0100] (1) Generate the assignable weapon information matrix M mssl , the weapon information matrix M mssl Each row of represents an available weapon information. The first column of the weapon information matrix M mssl represents the weapon number, and the second column of the weapon information matrix M mssl represents the corresponding weapon type (ammunition type). Reference Figures 5 - 7 .

[0101] (2) Generate the target information matrix M tgt , the target information matrix M tgt Each row of represents the information of an enemy target to be assigned. The first column of the target information matrix M tgt represents the target number, the second column represents the target type, the third column represents the expected target damage probability p expect , and the fourth column represents the achievable damage probability p of the assigned weapon to this targetachieve , the fifth column represents the identifier indicating whether the target has completed the allocation (0 means not completed, 1 means completed), refer to Figure 7 .

[0102] (3) Calculate the missile-target distance matrix M representing the distance between the weapon ammunition and the target dis (d ij , i = 1, …, n, j = 1, …, m):

[0103]

[0104] x i , y i , z i respectively represent the north-east-down position coordinates of the weapon w i in the geodetic coordinate system, x j , y j , z j respectively represent the north-east-down position coordinates of the target t j in the geodetic coordinate system, d ij represents the actual missile-target distance.

[0105] The north-east-down coordinate system (NED coordinate system) is a commonly used geodetic coordinate system, and its definition is as follows:

[0106] X-axis (north): Points to the geodetic north direction.

[0107] Y-axis (east): Points to the geodetic east direction.

[0108] Z-axis (down): Points to the center of the earth direction, usually used to represent altitude.

[0109] The NED coordinate system is widely used in navigation, geographic information system (GIS), aerospace, and robot navigation and other fields. For example, in the navigation of unmanned aerial vehicles, the NED coordinate system is used to describe the position and attitude of the unmanned aerial vehicle; in GIS, it is used to represent the spatial position of geographic features.

[0110] (4) The allocation result record matrix M assigned , its first column represents the weapon number, the second column represents the target number, and it is initialized as an empty matrix.

[0111] (5) Calculate the damage probability p′ that each target still needs j :

[0112]

[0113] Among them, p j,need represents the damage probability required for this target, p j,0 represents the damage probability that the allocated weapon can achieve for this target.

[0114] Step 2: Based on the weapon information matrix, the target information matrix, and the projectile-target distance matrix, obtain the damage probability matrix of the assignable weapons to the targets to be assigned.

[0115] In some embodiments, specifically, look up a table according to the weapon type and the target type, and then perform interpolation calculation based on the actual projectile-target distance d ij to obtain the damage probability a of weapon i to target j ij , and further obtain the damage probability matrix M damage (a ij ). More specifically, it includes:

[0116] Select the required data matrix according to the type of weapon i (weapon type, i.e., ammunition type). For example, for type A ammunition, use M A,damage , for type B ammunition, use M B,damage , for type C ammunition, use M C,damage , and so on. The columns of each data matrix correspond to different target types, and the rows correspond to different projectile-target distances. Refer to Figure 4 .

[0117] Determine which column value in the data matrix to use according to the type k of target j.

[0118] Determine the selected row according to the actual projectile-target distance d ij to finally determine the damage probability for interpolation.

[0119] For example: when the target type is k and the actual projectile-target distance d ∈ [6 km, 9 km], select p 2,k and p 3,k to calculate a ij .

[0120]

[0121] where d3 = 9 km and d2 = 6 km.

[0122] For the method of solving the initial value of the damage probability interpolation of type A weapon (weapon number i) to target j, see Figure 4 .

[0123] Step 3: Perform a round of weapon-target assignment based on the K-M algorithm on the damage probability matrix, and update the assignment result record matrix, the weapon information matrix, and the target information matrix. In some embodiments, it specifically includes:

[0124] (1) Based on the damage probability matrix, obtain the assignment basis matrix M(m ij ), and the specific formula includes:

[0125]

[0126] m ij That is, it is the matrix element of the allocation basis matrix M(m ij ).

[0127] For the allocation basis matrix M(m ij ), perform one round of weapon-target allocation based on the K-M algorithm to obtain the missile-target matching matrix M match . The first column of the missile-target matching matrix M match corresponds to the row numbers of the damage probability matrix M damage respectively, and is also the row number of the weapon information matrix M mssl ; The second column corresponds to the column numbers of the damage probability matrix M damage respectively, and is also the row number of the target information matrix M tgt . More specifically, it includes the following:

[0128] The K-M algorithm is applicable to solving the minimum weight matching problem, while the target allocation problem is a problem of preferentially allocating the maximum damage probability. Therefore, it is necessary to first transform the target allocation problem into a minimum weight allocation problem that can be solved by the K-M algorithm, and transform the allocation basis matrix M(m ij ) into a probability complementary matrix B(b ij ).

[0129] b ij =1 - m ij ;

[0130] b ij That is, it is the matrix element of the probability complementary matrix B(b ij ).

[0131] The solution steps for allocating the probability complementary matrix B(b ij ) include:

[0132] S1. Find the minimum value in each row of the probability complementary matrix B(b ij ), subtract the corresponding minimum value from each row, then find the minimum value in each column, and subtract the corresponding minimum value from each column to obtain a new matrix B1.

[0133] S2. Cover all 0s with the fewest number of lines. If the number of lines is equal to n, the algorithm ends; otherwise, execute the next step.

[0134] S21. Find the independent 0.

[0135] S211. Find the row (or column) with only one 0 element, and make the corresponding assignment according to the 0 element.

[0136] S2111. Set the vector to record the number of 0s in each row and column of the matrix B1.

[0137] S2112. Find the first value of 1 in the vector . If it exists, record the corresponding row number i (or column number j), and execute step S2113; otherwise, directly execute step S212.

[0138] S2113. Search for 0 elements in the i-th row of matrix B1 and record their column numbers j.

[0139] S2114. Add (i, j) to the initial assignment basis matrix M0.

[0140] S2115. Set all elements in the i-th row and j-th column of matrix B1 to the maximum value ∞.

[0141] S2116. Repeat steps S2111 - S2115.

[0142] S212. Delete the rows and columns where the assigned 0 elements are located.

[0143] S2121. Add the initial assignment basis matrix M0 to the assigned missile - target matching matrix M match .

[0144] S2122. If the number of assignments is equal to the number of weapons or targets to be assigned, the weapon - target assignment ends; otherwise, execute step S22.

[0145] S22. Tick.

[0146] S221. Tick the rows without independent 0s.

[0147] S222. Tick the columns where 0s are located in the ticked rows.

[0148] S223. Tick the rows corresponding to the independent 0s in all ticked columns.

[0149] S224. Repeat steps S221 - S223 until no more ticking is possible.

[0150] S23. Draw lines. Draw lines through the rows that are not ticked and the columns that are ticked.

[0151] S3. Find the minimum value of the uncovered elements, subtract the minimum value from all uncovered elements, add the minimum value to the elements at the intersections of the two drawn lines, repeat step S2 until the assignment is completed, and return the final missile - target matching matrix M match . Missile - target matching matrix M match (min(m, n)×2) is a matrix with min(m, n) rows and 2 columns. Each row represents a group of assignments. The first element in each row represents the row number of matrix B1 (corresponding to the weapon number), and the second element in each row represents the column number of matrix B1 (corresponding to the target number).

[0152] According to the projectile-target matching matrix M match , the weapon information matrix M mssl and the target information matrix M tgt to obtain the allocation match Match_New.

[0153] Then, add the allocation match Match_New to the allocation result and update the allocation result record matrix M assigned .

[0154] (2) Update the weapon information matrix M mssl . Delete the allocated weapons from the weapon information matrix M mssl to obtain a new available weapon information matrix M mssl '.

[0155] (3) Update the target information matrix M tgt . Update the damage probability and the allocation completion indication of the targets allocated in this round to obtain a new target information matrix M tgt ', which specifically includes:

[0156] Calculate the damage probability p j1 that can be achieved by the targets allocated this time:

[0157] p j1 = 1 - (1 - p j,0 )(1 - p j,new );

[0158] where p j,0 represents the damage probability that the allocated weapon can achieve for the target j, and p j,new represents the damage probability of the newly allocated weapon for the target j.

[0159] Update the allocation completion flag Label j of the targets allocated in this round:

[0160]

[0161] Step 4. If there are no weapons available for reallocation or all targets can achieve the established damage probability, then complete the weapon-target allocation; otherwise, repeat the above three major steps until the weapon-target allocation is completed.

[0162] In some embodiments, more specifically, determine whether the allocation is completed. If the weapon information matrix M mssl is empty (i.e., there are no weapons available for reallocation), or the fifth column of the target information matrix M tgt is all 1s (i.e., all targets can achieve the established damage probability), then complete the weapon-target allocation; otherwise, repeat Steps 1 to 3 until the weapon-target allocation is completed.

[0163] To verify the rationality and feasibility of the algorithm, 7 weapon platforms and 4 targets are required for simulation verification. First, perform initialization to generate 7 weapons and 4 targets, randomly obtain the types and positions of each weapon and target, calculate the distances between the ammunitions of each weapon and each target, and randomly generate the expected damage probabilities of each target; solve according to the algorithm implementation process proposed in this application to obtain the allocation result, as shown in Figure 7 as follows.

[0164] Based on threat assessment of the targets and obtaining the damage probability requirements corresponding to each target, this application reduces the time complexity of the weapon-target allocation algorithm, improves the operation efficiency, and can obtain relatively definite and consistent allocation results after multiple runs.

[0165] Preferably, to solve the allocation problem of a weapon platform having multiple ammunitions of the same type, it is only necessary to change the weapon information matrix M Figure 5 as shown in mssl , that is, expand the weapon numbers and ammunition types (weapon types) in the weapon information matrix M mssl in sequence according to the ammunition quantity.

[0166] Preferably, to solve the allocation problem of a weapon platform having multiple types and multiple ammunitions at the same time, the steps that need to be modified include:

[0167] First, change the weapon information matrix M Figure 6 as shown in mssl , that is, expand the weapon numbers and ammunition types in the weapon information matrix M mssl in sequence according to the quantity of the corresponding type of ammunition.

[0168] Secondly, in step 3, in the allocation result of the specific step "add Match_New to the allocation result and update the allocation result record matrix M assigned ", a column should be added to record the type of ammunition used.

[0169] The weapon-target allocation method of this application is convenient for expansion. Through simple transformation, it can be used to solve the allocation problem of a weapon platform having multiple or multiple types of ammunitions.

[0170] Preferably, this application can also be extended to solve the best cost-effectiveness WTA problem. On the basis of solving the allocation basis matrix M(m ij ) in step 3, considering the cost-effectiveness of each weapon's real-time strike on each target, obtain the allocation basis matrix M'(m' ij ), and the specific acquisition steps include:

[0171] Comprehensively consider the threat level w of target j jand the target economic value b j , calculate the total value of target j:

[0172] W j = ω w ·w j + ω b ·b j ;

[0173] Among them, ω w , ω b respectively represent the threat degree and the weight coefficient of the target economic value.

[0174] The cost of weapon i is recorded as c i , then the cost-effectiveness ratio of weapon i to strike target j is:

[0175] s ij = W j / c i ;

[0176] Considering the damage probability of weapon i to target j, the matrix element m' in the allocation basis matrix M' based on the cost-effectiveness ratio can be obtained ij :

[0177] m' ij = m ij *s ij ;

[0178] Among them, m ij represents the damage probability of weapon i to target j (i.e., the matrix element m ij ) in the allocation basis matrix M (m ij ), and s ij represents the cost-effectiveness ratio of weapon i to strike target j.

[0179] According to the allocation basis matrix M' (m' ij ) based on the cost-effectiveness ratio, the WTA result based on the maximum cost-effectiveness ratio can be obtained.

[0180] The weapon-target allocation method of this application aims at the resource allocation problem of ground multi-class weapons to strike multi-targets. On the basis of threat assessment of enemy targets and obtaining the damage probability requirements corresponding to each target, it can solve the practical problem of how to reasonably allocate the existing weapons on the battlefield and use the least number of weapons to obtain the maximum damage effectiveness, and has strong practical guiding significance.

[0181] This application proposes a weapon-target assignment method based on the K-M algorithm for the weapon-target assignment problem oriented to damage effectiveness, gives the detailed process and implementation steps of the algorithm implementation, and conducts simulation verification on the feasibility of the algorithm; finally, it also makes an adaptive extension discussion for other weapon-target assignment problems. The algorithm disclosed in this application has a certain degree of rationality and expandability.

[0182] Figure 8 A block diagram of an electronic device suitable for implementing the weapon-target assignment method described above according to an embodiment of the present application is schematically shown. Figure 8 The electronic device shown is only an example and should not impose any limitations on the functions and usage scope of the embodiments of the present application.

[0183] As Figure 8 shown, the electronic device 1000 described in this embodiment includes: a processor 1001, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 1002 or the program loaded from the storage section 1008 into the random access memory (RAM) 1003. The processor 1001 can include, for example, a general microprocessor (such as a CPU), an instruction set processor, and / or a related chipset, and / or a dedicated microprocessor (such as an application specific integrated circuit (ASIC)), and so on. The processor 1001 can also include on-board memory for caching purposes. The processor 1001 can include a single processing unit or multiple processing units for performing different actions of the weapon-target assignment method process according to the embodiments of the present application.

[0184] In the RAM 1003, various programs and data required for the operation of the electronic device 1000 are stored. The processor 1001, the ROM 1002, and the RAM 1003 are connected to each other through a bus 1004. The processor 1001 performs various operations of the weapon-target assignment method process according to the embodiments of the present application by executing the programs in the ROM 1002 and / or the RAM 1003. It should be noted that the program can also be stored in one or more memories other than the ROM 1002 and the RAM 1003. The processor 1001 can also perform various operations of the weapon-target assignment method process according to the embodiments of the present application by executing the programs stored in the one or more memories.

[0185] According to an embodiment of the present application, the electronic device 1000 may further include an input / output (I / O) interface 1005, and the input / output (I / O) interface 1005 is also connected to the bus 1004. The electronic device 1000 may further include one or more of the following components connected to the I / O interface 1005: an input portion 1006 including a keyboard, a mouse, etc.; an output portion 1007 including, for example, a cathode ray tube (CRT), a liquid crystal display (LCD), etc. and a speaker, etc.; a storage portion 1008 including a hard disk, etc.; and a communication portion 1009 including a network interface card such as a LAN card, a modem, etc. The communication portion 1009 performs communication processing via a network such as the Internet. The drive 1010 is also connected to the I / O interface 1005 as needed. A removable medium 1011, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 1010 as needed, so that a computer program read from it is installed into the storage portion 1008 as needed.

[0186] The weapon-target assignment method flow according to an embodiment of the present application can be implemented as a computer software program. For example, an embodiment of the present application includes a computer program product, which includes a computer program carried on a computer-readable storage medium, and the computer program includes program codes for executing the weapon-target assignment method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication portion 1009, and / or installed from the removable medium 1011. When the computer program is executed by the processor 1001, the above functions defined in the system of the embodiment of the present application are executed. According to an embodiment of the present application, the above-described systems, devices, apparatuses, modules, and / or units, etc. can be implemented by computer program modules.

[0187] An embodiment of the present application also provides a computer-readable storage medium, which may be included in the device / device / system described in the above embodiment, or may exist separately without being assembled into the device / device / system. The above computer-readable storage medium carries one or more programs, and when the above one or more programs are executed, the steps of the weapon-target assignment method according to the embodiment of the present application can be implemented.

[0188] According to an embodiment of the present application, the computer-readable storage medium may be a non-volatile computer-readable storage medium, for example, it may include but is not limited to: portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the above. In an embodiment of the present application, the computer-readable storage medium may be any tangible medium that contains or stores a program, and this program can be used by or in combination with an instruction execution system, device, or apparatus. For example, according to an embodiment of the present application, the computer-readable storage medium may include one or more memories other than the ROM 1002 and / or RAM 1003 described above.

[0189] It should be noted that in each embodiment of the present application, each functional module may be integrated in a processing module, or each module may exist physically alone, or two or more modules may be integrated in one module. The above integrated modules may be implemented in the form of hardware or in the form of software functional modules. When the above integrated module is implemented in the form of a software functional module and sold or used as an independent product, it may be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present application, in essence, or the part that contributes to the prior art, or all or part of this technical solution, may be embodied in the form of a software product.

[0190] The flowcharts and / or block diagrams in the accompanying drawings illustrate the possible architectures, functions, and operations of systems, methods, and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart and / or block diagram may represent a module, a program segment, or a part of code, and the above module, program segment, or part of code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the block may occur in a different order than marked in the accompanying drawings. It should also be noted that each block in the block diagram or flowchart, and the combination of blocks in the block diagram or flowchart, may be implemented by a dedicated hardware-based system for performing the specified functions or operations, or may be implemented by a combination of dedicated hardware and computer instructions.

[0191] Those skilled in the art will understand that the features recited in the various embodiments and / or claims of the present application can be combined and / or combined in various ways, even if such combinations or combinations are not explicitly recited in the present application. In particular, without departing from the spirit and teachings of the present application, the technical features recited in the various embodiments and / or claims of the present application can be combined and / or combined in various ways, and all such combinations and / or combinations fall within the scope of the present application.

[0192] Although the present application has been shown and described with reference to specific exemplary embodiments thereof, those skilled in the art should understand that various changes in form and detail can be made to the present application without departing from the spirit and scope of the present application as defined by the appended claims and their equivalents. Therefore, the scope of the present application should not be limited to the above embodiments, but should be determined not only by the appended claims, but also by the equivalents of the appended claims.

Claims

1. A weapon-target assignment method based on KM algorithm, characterized in that: include: Initialization is performed to obtain the allocable weapon information matrix, the target information matrix to be allocated, the projectile-target distance matrix representing the distance between the weapon and the target, and the allocation result record matrix; Based on the weapon information matrix, the target information matrix and the missile-target distance matrix, a damage probability matrix of the assignable weapons to the targets to be assigned is obtained; Performing a round of weapon-target allocation based on the KM algorithm on the damage probability matrix, and updating the allocation result record matrix, the weapon information matrix, and the target information matrix; If there are no weapons available for reallocation or all targets can achieve the specified destruction probability, the weapon-target allocation is completed; otherwise, the above three steps are repeated until the weapon-target allocation is completed.

2. The weapon-target allocation method according to claim 1, characterized in that: The results of initialization include: Each row of the weapon information matrix represents an available weapon information, the first column represents the weapon number, and the second column represents the corresponding weapon type; Each row of the target information matrix represents a target information to be assigned, the first column represents the target number, the second column represents the target type, the third column represents the target damage probability expectation, the fourth column represents the damage probability that the assigned weapon can reach to the target, and the fifth column represents the flag indicating whether the target has been assigned; The matrix elements of the missile-target distance matrix represent the distance between the weapon numbered i and the target numbered j in the three-dimensional space coordinate system; The first column of the allocation result record matrix represents the weapon number, the second column represents the target number, and is initialized to an empty matrix.

3. The weapon-target allocation method according to claim 2, characterized in that: The step of obtaining a damage probability matrix of the assignable weapons to the targets to be assigned based on the weapon information matrix, the target information matrix and the missile-target distance matrix comprises: Select the required data matrix according to the type of weapon numbered i; the columns of each data matrix correspond to different target types, and the rows correspond to different missile-target distances; Determine which column of the data matrix to use according to the type of the target numbered j; The selected row in the data matrix is ​​determined according to the actual missile-target distance, and the damage probability used for interpolation is finally determined; the formula for calculating the damage probability matrix by interpolation method includes: Among them, the type of the target numbered j is k; d q and d q+1 Respectively represent the lower limit and upper limit of the distance interval of the actual projectile-target distance; d ij represents the actual distance between the weapon numbered i and the target numbered j in the three-dimensional space coordinate system; p q,k and p q+1,k respectively represent the theoretical damage probability corresponding to the lower limit of the distance interval and the upper limit of the distance interval when the type of the target numbered j is k; a ij It represents the actual damage probability of the weapon numbered i to the target numbered j, which is the matrix element of the damage probability matrix.

4. The weapon-target allocation method according to claim 3, characterized in that: Performing a round of weapon-target allocation based on the KM algorithm on the damage probability matrix, and updating the allocation result record matrix includes: Based on the damage probability matrix, obtaining an allocation basis matrix; For the allocation basis matrix, a round of weapon-target allocation based on the KM algorithm is performed to obtain a missile-target matching matrix; According to the projectile-target matching matrix, the weapon information matrix and the target information matrix, the allocation result record matrix is ​​updated to obtain the allocation result record matrix of this round.

5. The weapon-target allocation method according to claim 4, characterized in that: For the allocation basis matrix, a round of weapon-target allocation based on the KM algorithm is performed to obtain the missile-target matching matrix including: The matrix elements of the allocation basis matrix are: Among them, j,need represents the required destruction probability of the target numbered j; The allocation basis matrix is ​​converted into a probability complementary matrix, and the matrix elements of the probability complementary matrix are: b ij =1-m ij ; Perform a round of weapon-target assignment based on the KM algorithm on the probability complementary matrix B to obtain the missile-target matching matrix including: S1, find the minimum value of each row of the probability complementary matrix B, subtract the corresponding minimum value from each row, then find the minimum value of each column, subtract the corresponding minimum value from each column, and get the new matrix B1; S2. Cover all 0s with the least number of strokes. If the number of strokes is equal to n, the algorithm ends; otherwise, proceed to the next step; S21, find independent 0; S211, find out the row or column with only one 0 element, and make corresponding assignments according to the 0 element; S2111, set vector Used to record the number of 0s in each row and column of matrix B1; S2112, find the vector The first value that is 1 in the result is recorded if it exists, and the corresponding row number i or column number j is executed, and step S2113 is executed; otherwise, step S212 is executed directly; S2113, search for the 0 element in the i-th row of matrix B1, and record the column number j where it is located; S2114, adding (ij) to the initial allocation basis matrix; S2115, set all elements in the i-th row and j-th column of the matrix B1 to the maximum value ∞; S2116, repeat steps S2111 to S2115; S212, delete the row and column where the assigned 0 element is located; S2121, adding the initial allocation basis matrix to the assigned projectile-target matching matrix; S2122, if the assigned number is equal to the number of weapons or targets to be assigned, the weapon-target allocation is completed, otherwise, step S22 is executed; S22, check; S221, check the rows without independent 0; S222, check the column where 0 is located in the checked row; S223, check the rows corresponding to independent 0s in all checked columns; S224, repeat steps S221 to S223 until no more ticks can be made; S23, draw a line through the unchecked rows and checked columns; S3. Find the minimum value of the uncovered elements, subtract the minimum value from all the uncovered elements, add the minimum value to the element where two lines intersect, and repeat step S2 until the allocation is completed to obtain the final projectile-target matching matrix; each row of the projectile-target matching matrix represents a set of allocations, the first element of each row represents the weapon number, and the second element of each row represents the target number.

6. The weapon-target allocation method according to claim 4, characterized in that: Updating the weapon information matrix and the target information matrix includes: From the weapon information matrix M mssl Delete the assigned weapons and get the new available weapon information matrix M mssl ′; Get the achievable damage probability p of the target allocated in this round j1 ; p j1 =1-(1-p j,0 )(1-p j,new ); Among them, p j,0 is the probability of damage that the assigned weapon can achieve on the target, p j,new The probability of damage to the target by the newly assigned weapon; Update the completion label of the target of this round of allocation j ; Among them, p j,need It represents the required destruction probability of the target numbered j.

7. The weapon-target allocation method according to claim 5, characterized in that: Also includes: Based on the allocation basis matrix, the cost-effectiveness ratio of each weapon in real-time attack on each target is considered to obtain an allocation basis matrix based on the cost-effectiveness ratio, which specifically includes: Based on the threat level w of the target numbered j j and target economic value b j , get the total value W of the target numbered j j : W j =ω w ·w j +oh b ·b j ; Among them, ω w ,ω b Respectively represent the weight coefficients of threat degree and target economic value; If the cost of weapon number i is c i , then the cost-effectiveness ratio of weapon number i to target number j is s ij for: s ij =W j / c i ; The formula for obtaining the allocation basis matrix based on the cost-effectiveness ratio based on the allocation basis matrix includes: m′ ij =m ij *s ij ; Among them, m ij represents the probability of damage of weapon number i to target number j; m′ ij Matrix elements representing the allocation basis matrix based on cost-effectiveness ratio; According to the allocation basis matrix based on the cost-effectiveness ratio, the weapon-target allocation result based on the maximum cost-effectiveness ratio is obtained.

8. The weapon-target allocation method according to claim 2, characterized in that: Also includes: Expand the weapon numbers and weapon types of the weapon information matrix in sequence according to the number of ammunition to solve the allocation problem of a weapon platform having multiple ammunitions of the same type; and / or The weapon numbers and weapon types of the weapon information matrix are expanded in sequence according to the number of corresponding types of ammunition to solve the allocation problem of a weapon platform having multiple types and multiple ammunitions at the same time.

9. An electronic device, characterized in that: The invention comprises at least one processing unit and at least one storage unit, wherein the storage unit stores a computer program, and when the computer program is executed by the processing unit, the processing unit is enabled to execute the steps of the weapon-target assignment method according to any one of claims 1 to 8.

10. A storage medium, characterized in that: It stores a computer program executable by an access authentication device. When the computer program runs on the access authentication device, the access authentication device is enabled to execute the steps of the weapon-target allocation method according to any one of claims 1 to 8.

Images