A weapon target allocation method and apparatus based on information entropy auction algorithm

By introducing the information entropy auction algorithm into the weapon target allocation algorithm, the revenue information entropy and profit space are calculated, and the strike cost matrix is ​​updated. This solves the problem of duplicate allocation in the traditional algorithm and achieves the stability and consistency of distributed computing results.

CN117933618BActive Publication Date: 2026-11-17THE 20TH RESEARCH INSTITUTE OF CHINA ELECTRONICS TECHNOLOGY GROUP CORP
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202410013758.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-01-04
Publication Date
2026-11-17
Estimated Expiration
2044-01-04

AI Technical Summary

Technical Problem

Traditional weapon target allocation algorithms based on auction mechanisms can lead to duplicate allocations when multiple weapons have the same profit margin for the same target, affecting the consistency of distributed computing results.

Method used

An information entropy auction algorithm is introduced, which updates the weapon target strike cost matrix by calculating the information entropy and profit space of the weapon target strike benefit vector, and iterates until it stabilizes to avoid duplicate allocation.

Benefits of technology

It effectively solves the problem of duplicate allocation, ensures the consistency of distributed computing results, and eliminates the randomness caused by algorithm failure.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117933618B_ABST
    Figure CN117933618B_ABST
Patent Text Reader

Abstract

This invention relates to a weapon target allocation method based on an information entropy auction algorithm. By introducing information entropy into the weapon target allocation algorithm, the weapon target attack cost matrix is ​​updated according to the information entropy and profit space of the weapon target attack benefit vector. The algorithm iterates until the weapon target attack cost matrix stabilizes. Based on the weapon target allocation result matrix at this point, the optimal target is allocated to each weapon. The method provided by this invention can solve the problem of duplicate allocation that may occur in traditional weapon allocation algorithms based on auction mechanisms. It eliminates randomness and effectively ensures the consistency of distributed computing results while avoiding algorithm failure.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of data processing technology, and in particular to a weapon target allocation method based on an information entropy auction algorithm. Background Technology

[0002] The weapon target allocation method based on the information entropy auction algorithm is an algorithm that allocates resources and tasks through bidding based on the information entropy auction mechanism. It can be effectively used to solve the problem of multi-weapon and multi-target allocation. In this algorithm, "weapon" is equivalent to "bidder" in the auction process, "target" is equivalent to "goods" in the auction process, "strike effectiveness" is equivalent to "goods value" in the auction process, "strike cost" is equivalent to "goods price" in the auction process, and "strike benefit" is equivalent to "bid benefit" in the auction process.

[0003] Traditional weapon target allocation algorithms based on auction mechanisms determine the update of weapon target strike costs by calculating the profit space between the optimal and suboptimal profits. However, when multiple weapons share the same optimal target and their profit space for that target is the same, the same target can be allocated to multiple weapons simultaneously, causing the algorithm to fail. To avoid this, a common practice is to add random numbers to the weapon target strike cost update formula. However, this randomness can lead to different results from repeated calculations, thus affecting the consistency of distributed computing results.

[0004] Therefore, how to eliminate randomness when the algorithm fails and effectively ensure the consistency of distributed computing results has become an urgent problem to be solved. Summary of the Invention

[0005] This invention provides a weapon target allocation method and a weapon target allocation device based on the information entropy auction algorithm, which at least solves the problem in the prior art that the algorithm fails when multiple weapons have the same optimal benefit for the same target and the profit space of these weapons for the same target is the same, causing the same target to be allocated by multiple weapons at the same time.

[0006] According to a first aspect of the present invention, a weapon target allocation method based on an information entropy auction algorithm is provided, comprising:

[0007] Obtain the strike effectiveness of each weapon against each target, generate a weapon strike effectiveness matrix against the target, and initialize the weapon target allocation result matrix and the weapon target strike cost matrix;

[0008] Based on the weapon target allocation result matrix, determine whether there are any unassigned weapons. In response to any unassigned weapon in the weapon target allocation result matrix, assign a target to the unassigned weapon.

[0009] Based on the strike effectiveness matrix and the weapon target strike cost matrix, the strike benefit of the unassigned weapon against each target is calculated, a strike benefit vector is generated, and based on the strike benefit vector, the target corresponding to the optimal benefit is assigned to the unassigned weapon, and the weapon target assignment result matrix is ​​updated.

[0010] Calculate the gain information entropy based on the strike gain vector of the unassigned weapon;

[0011] Based on the strike benefit vector, the profit space of the unallocated weapon is calculated based on the optimal and suboptimal benefits. Combining the benefit information entropy of the unallocated weapon, the strike cost of the unallocated weapon against the optimal benefit target is calculated, and the weapon target strike cost matrix is ​​updated.

[0012] Based on the updated weapon target strike cost matrix, the strike cost of all weapons against the optimal benefit target is obtained, and a strike cost vector is generated. If the strike cost of the unassigned weapon against the target is not the maximum value, the assignment of the target corresponding to the optimal benefit to the unassigned weapon is cancelled, and the weapon target allocation result matrix is ​​updated.

[0013] Based on the updated weapon target strike cost matrix, update the strike cost of the unassigned weapon against all targets;

[0014] The above query calculation process is executed repeatedly until all weapons have completed a query calculation. Then the current round of allocation ends. The convergence of the algorithm is judged. If the algorithm is not converged, the next round of allocation calculation is started, so that all weapons have not completed a query calculation. The above query calculation process is restarted. If the algorithm is converged, the weapon target allocation result matrix at this time is output.

[0015] Optionally, the initialization of the weapon target allocation result matrix and the weapon target strike cost matrix includes:

[0016] Set the elements in the weapon target allocation result matrix and the weapon target strike cost matrix to zero. The zero element in the weapon target allocation result matrix represents the initial state in which no target has been assigned to each weapon. The zero element in the weapon target strike cost matrix represents the initial state in which the initial strike cost of each weapon against each target is zero.

[0017] Optionally, based on the strike gain vector of the unassigned weapon, the gain information entropy is calculated, including:

[0018] Calculate the information entropy of weapon i's gains using the following formula:

[0019]

[0020]

[0021] Among them, e i For information entropy, i represents the weapon; j represents the target; g represents the information entropy of the profit. ij Let be the benefit of weapon i against target j; k is a constant related to the natural number N, where k can be set to 1 / ln(N).

[0022] According to a second aspect of the present invention, a weapon target allocation device based on an information entropy auction algorithm is provided, comprising:

[0023] The initialization module is configured to acquire the strike effectiveness of each weapon against each target, generate a weapon strike effectiveness matrix against the target, and initialize the weapon target allocation result matrix and the weapon target strike cost matrix.

[0024] The query and judgment module is configured to determine whether there are any unassigned weapons based on the weapon target allocation result matrix, and in response to any unassigned weapon in the weapon target allocation result matrix, to assign a target to the unassigned weapon.

[0025] The pre-allocation module is configured to calculate the attack benefits of the unallocated weapon on each target based on the attack effectiveness matrix and the weapon target attack cost matrix, generate an attack benefit vector, allocate the target corresponding to the optimal benefit to the unallocated weapon based on the attack benefit vector, and update the weapon target allocation result matrix.

[0026] The information entropy calculation module is configured to calculate the gain information entropy based on the strike gain vector of the unassigned weapon;

[0027] The cost calculation module is configured to calculate the profit space of the unallocated weapon based on the strike benefit vector, the optimal benefit and the second-best benefit, and the strike cost of the unallocated weapon against the optimal benefit target by combining the benefit information entropy of the unallocated weapon, and update the weapon target strike cost matrix.

[0028] The result verification module is configured to obtain the attack cost of all weapons against the optimal benefit target based on the updated weapon target attack cost matrix, generate an attack cost vector, and if the attack cost of the unassigned weapon against the target is not the maximum value, then cancel the assignment of the target corresponding to the optimal benefit to the unassigned weapon, and update the weapon target allocation result matrix.

[0029] The cost update module is configured to update the cost of the unassigned weapon against all targets based on the updated weapon target strike cost matrix;

[0030] The loop judgment module is configured to repeatedly execute the above query calculation process until all weapons have completed one query calculation. Then, the current round of allocation ends, and the convergence of the algorithm is judged. If the algorithm is judged not to converge, the next round of allocation calculation is entered, so that all weapons have not completed the query calculation, and the above query calculation process is restarted. If the algorithm is judged to converge, the weapon target allocation result matrix at this time is output.

[0031] Optionally, the initialization module includes:

[0032] Set the elements in the weapon target allocation result matrix and the weapon target strike cost matrix to zero. The zero element in the weapon target allocation result matrix represents the initial state in which no target has been assigned to each weapon. The zero element in the weapon target strike cost matrix represents the initial state in which the initial strike cost of each weapon against each target is zero.

[0033] Optionally, the information entropy calculation module includes:

[0034] Calculate the information entropy of weapon i's gains using the following formula:

[0035]

[0036]

[0037] Among them, e i For information entropy, i represents the weapon; j represents the target; g represents the information entropy of the profit. ij Let be the benefit of weapon i against target j; k is a constant related to the natural number N, where k can be set to 1 / ln(N).

[0038] This application provides a weapon target allocation method based on an information entropy auction algorithm. By introducing information entropy into the weapon target allocation algorithm, the weapon target attack cost matrix is ​​updated according to the information entropy and profit space of the weapon target attack benefit vector. The algorithm iterates until the weapon target attack cost matrix remains stable. Based on the weapon target allocation result matrix at this time, the optimal target is allocated to each weapon. This can solve the problem of duplicate allocation that may occur in traditional weapon target allocation algorithms based on auction mechanisms. While avoiding algorithm failure, it eliminates randomness and effectively ensures the consistency of distributed computing results.

[0039] The above description is only an overview of the technical solution of this application. In order to better understand the technical means of this application and to implement it in accordance with the contents of the specification, and to make the above and other objects, features and advantages of this application more obvious and understandable, the following are specific embodiments of this application. Attached Figure Description

[0040] Various other advantages and benefits will become apparent to those skilled in the art upon reading the following detailed description of preferred embodiments. The accompanying drawings are for illustrative purposes only and are not intended to limit the scope of this application. Furthermore, the same reference numerals denote the same parts throughout the drawings. In the drawings:

[0041] Figure 1 This is a schematic diagram of the structure of a traditional weapon target allocation method based on an auction algorithm provided in the embodiments of this specification;

[0042] Figure 2 This is a schematic diagram of the structure of a weapon target allocation system based on the information entropy auction algorithm provided in the embodiments of this specification;

[0043] Figure 3 This is a flowchart illustrating a weapon target allocation method based on the information entropy auction algorithm provided in the embodiments of this specification;

[0044] Figure 4 This is a block diagram of a weapon target allocation device based on an information entropy auction algorithm provided in the embodiments of this specification. Detailed Implementation

[0045] Exemplary embodiments of the invention will now be described in more detail with reference to the accompanying drawings. While exemplary embodiments of the invention are shown in the drawings, it should be understood that the invention may be implemented in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this invention will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.

[0046] The traditional weapon target allocation method based on auction algorithms includes the following steps.

[0047] S102: Determine if the current weapon has been assigned a target;

[0048] S104: Calculate the current weapon's attack benefit vector for all targets;

[0049] S106: Calculate the optimal and second-best returns for the current weapon, and calculate its profit margin;

[0050] S108: Update the cost of striking the target with the current weapon at the best profit;

[0051] S110: To achieve the optimal benefit objective for the current weapon allocation;

[0052] S112: Obtain the attack cost of all weapons against the target with the best benefit selected in step S110, and form an attack cost vector;

[0053] S114: In the strike cost vector described in step S112, if the strike cost of the current weapon against the optimal benefit target is not the highest strike cost, then the allocation result of the current weapon against the optimal benefit target is abandoned.

[0054] S116: Update the cost of attacking all targets with the current weapon. For each target, select the highest cost of attacking it with all weapons and use it as the cost of attacking that target with the current weapon.

[0055] S118: After completing the allocation calculation for all weapons in this round according to the above steps S102 to S116, compare the weapon target strike cost matrix of this round with that of the previous round. If they are equal, the auction ends. If they are not equal, return to step S102 to proceed to the next round of allocation.

[0056] See Figure 1 , Figure 1 This is a schematic diagram of the structure of a traditional weapon target allocation method based on an auction algorithm, as provided in the embodiments of this specification. Figure 1 As shown, it includes weapon A, weapon B, target C, and target D. According to... Figure 1 The efficiency matrix shown analyzes the traditional weapon target allocation method based on auction algorithms. If there exist weapons A and B with the same profit margin for a certain target C (the profit margin for weapon A for target C is 2-1=1, and the profit margin for weapon B for target C is 4-3=1), and target C is the optimal profit target for both weapon A and weapon B, then in each round of allocation, weapon A and weapon B will always allocate to target C, and the update result of the attack cost will always be the same. That is, in step S114, since the attack cost for weapon A and weapon B for target C is always the same, both weapon A and weapon B will determine that their attack cost for target C is the highest cost, and neither will give up the allocation. When the allocation termination condition in step S118 is met, target C will be allocated by weapon A and weapon B at the same time, causing the weapon target allocation algorithm to fail.

[0057] Currently, to avoid the failure of the aforementioned weapon target allocation algorithm, the proposed method is as follows: when updating the attack cost of the current weapon against the optimal target in step S108, a small random number is added to make the attack cost of weapon A and weapon B against target C different, thereby avoiding duplicate allocation. However, this randomness will lead to different results from repeated calculations, thus affecting the consistency of the distributed calculation results.

[0058] In view of this, the embodiments of this specification propose a weapon target allocation method based on the information entropy auction algorithm. By introducing information entropy, the weapon target attack cost matrix is ​​updated according to the information entropy and profit space of the weapon target attack benefit vector. The method is iterated until the weapon target attack cost matrix remains stable. Based on the weapon target allocation result matrix at this time, the optimal target is allocated to each weapon. This solves the problem of duplicate allocation that may occur in traditional distributed weapon target allocation methods. While avoiding algorithm failure, it eliminates randomness and effectively ensures the consistency of distributed computing results.

[0059] This specification provides a weapon target allocation method based on the information entropy auction algorithm, and a weapon target allocation device based on the information entropy auction algorithm, which will be described in detail in the following embodiments.

[0060] See Figure 2 , Figure 2 This is a schematic diagram of the structure of a weapon target allocation system based on the information entropy auction algorithm provided in the embodiments of this specification. Figure 2 As shown, the weapon target allocation system includes at least one weapon 202 and at least one target 204. It should be noted that the number of weapons should be greater than or equal to the number of targets. In actual allocation, one target is assigned to one weapon. Figure 2 As shown, by inputting at least one weapon and at least one target into the weapon target allocation system, a strike effectiveness matrix, an allocation result matrix, and a strike cost matrix are generated. Through continuous processing by the weapon target allocation system, the optimal target for each weapon is determined, and allocation results are generated, such as... Figure 2 As shown, target 2 is assigned to weapon 1, and target 1 is assigned to weapon 2.

[0061] The weapon target allocation system based on the information entropy auction algorithm provided in the embodiments of this specification introduces information entropy into the weapon target allocation algorithm. By updating the weapon target attack cost matrix according to the information entropy and profit space of the weapon target attack benefit vector, it can solve the problem of duplicate allocation that may occur in the traditional weapon target allocation algorithm based on the auction mechanism. While avoiding algorithm failure, it eliminates randomness and effectively ensures the consistency of distributed computing results.

[0062] See Figure 3 , Figure 3 This is a flowchart illustrating a weapon target allocation method based on the information entropy auction algorithm provided in the embodiments of this specification, specifically including the following steps.

[0063] Step S302: Obtain the strike effectiveness of each weapon against each target, generate the strike effectiveness matrix of the weapon against the target, and initialize the weapon target allocation result matrix and the weapon target strike cost matrix.

[0064] It should be noted that the strike effectiveness matrix here includes the strike effectiveness of each weapon against each target. In the embodiment of this specification, there are M weapons and N targets. The problem of allocating weapons and targets is solved based on an auction mechanism, where M ≥ N, that is, the number of weapons is greater than or equal to the number of targets, and each weapon can be allocated to at most one target. The strike effectiveness matrix of weapons against targets is denoted by W, and the representation of the strike effectiveness matrix W of weapons against targets is as follows.

[0065]

[0066] It should be noted that W here ij This indicates the effectiveness of weapon i against target j.

[0067] The weapon target allocation result matrix here assigns each weapon to a specific target. For example, after processing, the optimal target for weapon 1 is target b, and the optimal target for weapon 2 is target a. Therefore, in the weapon target allocation result matrix, weapon 1 corresponds to target b, and weapon 2 corresponds to target a. The weapon target allocation result matrix is ​​denoted by X, and the representation of the weapon target allocation result matrix X is as follows.

[0068]

[0069] It should be noted that X here ij A value of 1 indicates that target j is assigned to weapon i; otherwise, X ij It is 0.

[0070] The weapon target engagement cost matrix here includes the engagement cost of each weapon against each target. Let P represent the weapon target engagement cost matrix, and the representation of the weapon target engagement cost matrix is ​​as follows.

[0071]

[0072] It should be noted that P here ij This represents the cost of weapon i striking target j.

[0073] In the embodiments of this specification, the initialization of the weapon target allocation result matrix and the weapon target attack cost matrix includes:

[0074] Set the elements in the weapon target allocation result matrix and the weapon target strike cost matrix to zero. The zero element in the weapon target allocation result matrix represents the initial state in which no target has been assigned to each weapon. The zero element in the weapon target strike cost matrix represents the initial state in which the initial strike cost of each weapon against each target is zero.

[0075] In practical applications, let the obtained weapon strike effectiveness matrix against the target be as follows.

[0076]

[0077] The weapon target allocation result matrix X and the weapon target strike cost matrix P are initialized to obtain the following initialized weapon target allocation result matrix X and weapon target strike cost matrix P.

[0078]

[0079] Step S304: Based on the weapon target allocation result matrix, determine whether there are any unassigned weapon targets. In response to any unassigned weapon target in the weapon target allocation result matrix, assign a target to the unassigned weapon.

[0080] In this embodiment of the specification, the method for determining whether a weapon has been assigned a target in the weapon target allocation result matrix is ​​as follows: Suppose it is necessary to determine whether an unassigned weapon (hereinafter referred to as weapon i) has been assigned a target. Then, in the weapon target allocation result matrix, check whether there is a non-zero value in the i-th row. If there is a non-zero value, it means that weapon i has been assigned a target in the weapon target allocation matrix; if there is no non-zero value, it means that weapon i has not been assigned a target in the weapon target allocation matrix.

[0081] Following the previous example, for weapon i=1, its allocation result vector x1=[0 0], which has no non-zero values. Therefore, the following allocation calculation is performed for weapon 1.

[0082] Step S306: Based on the strike effectiveness matrix and the weapon target strike cost matrix, calculate the strike benefit of the unassigned weapon against each target, generate a strike benefit vector, assign the target corresponding to the optimal benefit to the unassigned weapon based on the strike benefit vector, and update the weapon target assignment result matrix.

[0083] By calculating the attack benefit of weapon i against all targets, the attack benefit vector of weapon i is obtained. In the embodiments of this specification, the attack benefit vector of weapon i is represented by g. i It means that, among them, g i The specific representation is: g i =[g i1 ,g i2 ,...,g iN ].

[0084] It should be noted that here g ij This represents the benefit of weapon i against target j. Specifically, the benefit g is generated based on the effectiveness and cost of weapon i against target j. ij Among them, the benefits of striking gij The calculation method is as follows.

[0085] g ij =w ij -p ij

[0086] Based on the strike benefit vector g i Let α(i) be the objective corresponding to the optimal benefit of weapon i. Update the allocation result of weapon i in the weapon objective allocation result matrix, that is, assign the optimal benefit objective α(i) to weapon i, and update the allocation result matrix X, that is, let x... ia(i) =1

[0087] Continuing with the previous example, for weapon i=1, based on the weapon target strike effectiveness matrix and the weapon target strike cost matrix, the strike benefit of weapon 1 against target 1 and target 2 is calculated, generating a strike benefit vector. That is, the strike benefit g allocated by weapon 1 to target 1 is calculated. 11 =2-0=2, similarly we can get the attack benefit vector of weapon 1 g1=[2 1], then the target corresponding to the optimal benefit of weapon 1 is target 1, update the allocation result matrix X, let x 11 It is 1 at this time.

[0088] Step S308: Calculate the gain information entropy based on the strike gain vector of the unassigned weapon.

[0089] It should be noted that the value of the profit information entropy here represents the degree of dispersion of the sample space; the larger the entropy value, the smaller the dispersion. In this embodiment, the profit information entropy of weapon i is represented by e. i express.

[0090] Specifically, based on the strike benefit vector, the benefit information entropy of weapon i is calculated, including:

[0091] Calculate the information entropy of weapon i's gains using the following formula:

[0092]

[0093]

[0094] Among them, e i Let g be the entropy of the benefit information corresponding to weapon i; i is the weapon; j is the target; g is the target information information entropy. ij Let be the benefit of weapon i against target j; k is a constant related to the natural number N, where k can be set to 1 / ln(N).

[0095] Using the previous example, for weapon i=1, its attack benefit vector g1=[2 1], substituting it into the above information entropy formula, we can obtain the information entropy of the attack benefit vector of weapon i=1 as: e1=0.9183.

[0096] Step S310: Based on the strike benefit vector, calculate the profit space of the unallocated weapon based on the optimal benefit and the second-best benefit, combine the benefit information entropy of the unallocated weapon, calculate the strike cost of the unallocated weapon against the optimal benefit target, and update the weapon target strike cost matrix.

[0097] In the embodiments of this specification, based on the attack benefit vector, the target corresponding to the optimal benefit of weapon i is denoted as α(i), and the target corresponding to the suboptimal benefit is denoted as β(i).

[0098] Specifically, the calculation method for the target α(i) is as follows.

[0099]

[0100] The objective β(i) is calculated as follows.

[0101]

[0102] Based on the optimal profit corresponding to the above objective α(i) and the suboptimal profit corresponding to the above objective β(i), the profit space corresponding to weapon i is calculated and represented by γ(i).

[0103] Specifically, the profit margin γ(i) is calculated as follows.

[0104] γ(i)=g iα(i) -g iβ(i)

[0105] Continuing with the previous example, for the attack benefit vector g1 = [2 1] of weapon i = 1, the target corresponding to the optimal value is the optimal target, i.e., α(1) = 1; the target corresponding to the suboptimal value is the suboptimal target, i.e., β(1) = 2. Therefore, for weapon i = 1, its profit space is calculated as γ(1) = 2 - 1 = 1.

[0106] In this embodiment of the specification, the weapon target strike cost matrix is ​​updated based on the profit margin and revenue information entropy, and the strike cost of weapon i against its optimal revenue target α(i) is updated.

[0107] Specifically, the cost of attacking weapon i against its optimal benefit target α(i) is updated according to the following formula.

[0108] p iα(i) =p iα(i) +γ(i)+(1-e i)×ε

[0109] Where, P on the left side of the equation iα(i) Let γ(i) be the cost of weapon i to strike its optimal profit target α(i) after the update; γ(i) be the profit margin corresponding to weapon i; e i Let ε be the entropy of the revenue information corresponding to weapon i; ε is the relaxation complementarity coefficient, which is a constant greater than 0. Essentially, it is used to control the update range of weapon strike cost. It can be taken as a small value to reflect that the weapon increases the strike cost against the target by a small margin.

[0110] Continuing with the previous example, taking ε = 0.01, we can update the cost of attacking weapon i = 1 against its optimal benefit target α(1) = 1 to p according to the above formula. 11 =0 + 1 + (1 - 0.9183) × 0.01 = 1.0008, update the weapon target strike cost matrix P, at this time

[0111] Step S312: Based on the updated weapon target strike cost matrix, obtain the strike cost of all weapons against the optimal benefit target, generate a strike cost vector, and if the strike cost of the unassigned weapon against the target is not the maximum value, cancel the assignment of the target corresponding to the optimal benefit to the unassigned weapon, and update the weapon target allocation result matrix.

[0112] It should be noted that the strike cost vector is the set of strike costs for all weapons against the optimal benefit target α(i). The strike cost vector of the optimal benefit target α(i) is represented by P. α(i) The specific forms of expression are as follows.

[0113]

[0114] In the embodiments of this specification, the attack cost vector p of target α(i) a(i) In the context, if the cost p of weapon i striking target α(i) is... iα(i) If the value is not the maximum, then cancel the assignment of weapon i to target α(i), and let x... ia(i) =0, and update the weapon target allocation result matrix X; otherwise, do not change the allocation result of weapon i to target α(i).

[0115] Continuing with the previous example, we obtain the strike cost vector for the optimal profit objective α(i) = 1, i.e. If the attack cost of weapon i=1 against target α(i)=1 is 1.0008, then the allocation result of weapon i=1 against target α(i)=1 is not changed.

[0116] Step S314: Based on the updated weapon target strike cost matrix, update the strike cost of the unassigned weapon against all targets.

[0117] In the embodiments of this specification, P is used. ij Let represent the cost of weapon i striking target j. Based on the updated cost matrix P, for each target j, calculate the maximum cost p of all weapons striking that target. maxj Update weapon i to increase the cost of attacking target j. ij =p maxj .

[0118] Continuing with the previous example, based on the current strike cost matrix It can be seen that for target j=1, the maximum cost p for all weapons to strike it is... max1 =1.0008, then update the attack cost p of weapon i=1 against target j=1. 11 =1.0008, similarly, the attack cost p of weapon i=1 against target j=2 can be updated. 12 =0, then the weapon target strike cost matrix is ​​updated to

[0119] Step S316: Repeat the above query calculation process until all weapons have completed one query calculation. Then the current round of allocation ends. Determine the convergence of the algorithm. If the algorithm is determined to be non-convergent, proceed to the next round of allocation calculation, so that all weapons have not completed the query calculation, and restart the above query calculation process. If the algorithm is determined to be convergent, output the weapon target allocation result matrix at this time.

[0120] It should be noted that the algorithm converges as follows: after completing the query and calculation of all weapons in this round, the updated strike cost matrix P is obtained. The weapon target strike cost matrix of this round is compared with that of the previous round. If they are equal, the algorithm converges. The weapon target allocation result matrix X at this time is the final weapon target allocation result given by the algorithm.

[0121] Following the previous example, in the first round of weapon target allocation, we first calculate the allocation result of weapon i=1 when i=1, and update its strike cost vector p1=[1.0008 0]. Similarly, we can update the allocation result of weapon i=2 when i=2, and update its strike cost vector p2=[1.00080]. At this point, the query calculation for all weapons is completed, the weapon target allocation for this round ends, and the convergence of the algorithm is judged.

[0122] After completing the first round of weapon target allocation, the strike cost matrix P is updated to... Because this attack cost matrix P is the same as the weapon target attack cost matrix of the previous round. Since they are different, the above operation needs to be repeated for a second round of allocation to obtain the updated strike cost matrix. Because the attack cost matrix P after the second round of updates is different from the weapon target attack cost matrix of the previous round... They are not the same, so the above operation needs to be repeated until the fourth round of weapon target allocation yields the updated strike cost matrix. Cost matrix for third-round weapon target strikes Since the results are identical, the algorithm can be determined to have converged, and the current weapon target allocation result matrix is ​​output. This is the final weapon target allocation result given by the algorithm, representing weapon 1 being assigned target 1 and weapon 2 being assigned target 2.

[0123] The weapon target allocation method based on the information entropy auction algorithm provided in the embodiments of this specification introduces information entropy into the weapon target allocation algorithm. Based on the information entropy and profit space of the weapon target attack benefit vector, the weapon target attack cost matrix is ​​updated. Through iterative iteration until the weapon target attack cost matrix remains stable, the optimal target is allocated to each weapon based on the weapon target allocation result matrix at this time. This can solve the problem of duplicate allocation that may occur in the traditional weapon target allocation algorithm based on the auction mechanism. While avoiding algorithm failure, it eliminates randomness and effectively ensures the consistency of distributed computing results.

[0124] See Figure 4 , Figure 4 This is a block diagram of a weapon target allocation device based on an information entropy auction algorithm provided in the embodiments of this specification, specifically including the following devices.

[0125] The initialization module 402 is configured to acquire the strike effectiveness of each weapon against each target, generate a weapon strike effectiveness matrix against the target, and initialize the weapon target allocation result matrix and the weapon target strike cost matrix.

[0126] The query and judgment module 404 is configured to determine whether there are any unassigned weapon targets based on the weapon target allocation result matrix, and in response to any unassigned weapon target in the weapon target allocation result matrix, to perform target allocation on the unassigned weapon.

[0127] The pre-allocation module 406 is configured to calculate the attack benefit of the unallocated weapon on each target based on the attack effectiveness matrix and the weapon target attack cost matrix, generate an attack benefit vector, allocate the target corresponding to the optimal benefit to the unallocated weapon based on the attack benefit vector, and update the weapon target allocation result matrix.

[0128] Information entropy calculation module 408 is configured to calculate the gain information entropy based on the strike gain vector of the unassigned weapon;

[0129] The cost calculation module 410 is configured to calculate the profit space of the unallocated weapon based on the strike benefit vector, the optimal benefit and the second-best benefit, and the strike cost of the unallocated weapon against the optimal benefit target by combining the benefit information entropy of the unallocated weapon, and update the weapon target strike cost matrix.

[0130] The result verification module 412 is configured to obtain the attack cost of all weapons against the optimal benefit target based on the updated weapon target attack cost matrix, generate an attack cost vector, and if the attack cost of the unassigned weapon against the target is not the maximum value, cancel the assignment of the target corresponding to the optimal benefit to the unassigned weapon, and update the weapon target allocation result matrix.

[0131] The cost update module 414 is configured to update the cost of the unassigned weapon against all targets based on the updated weapon target strike cost matrix;

[0132] The loop judgment module 416 is configured to repeatedly execute the above query calculation process until all weapons have completed one query calculation. Then, the current round of allocation ends, and the convergence of the algorithm is judged. If the algorithm is judged not to converge, the next round of allocation calculation is entered, so that all weapons have not completed the query calculation, and the above query calculation process is restarted. If the algorithm is judged to converge, the weapon target allocation result matrix at this time is output.

[0133] In one optional embodiment, the initialization module 402 includes:

[0134] Set the elements in the weapon target allocation result matrix and the weapon target strike cost matrix to zero. The zero element in the weapon target allocation result matrix represents the initial state in which no target has been assigned to each weapon. The zero element in the weapon target strike cost matrix represents the initial state in which the initial strike cost of each weapon against each target is zero.

[0135] In one optional embodiment, the information entropy calculation module 408 includes:

[0136] Calculate the information entropy of weapon i's gains using the following formula:

[0137]

[0138]

[0139] Among them, e i For information entropy, i represents the weapon; j represents the target; g represents the information entropy of the profit. ij Let be the benefit of weapon i against target j; k is a constant related to the natural number N, where k can be set to 1 / ln(N).

[0140] The weapon target allocation device based on the information entropy auction algorithm provided in the embodiments of this specification introduces information entropy into the weapon target allocation algorithm. Based on the information entropy and profit space of the weapon target attack benefit vector, the weapon target attack cost matrix is ​​updated. Through iterative iteration until the weapon target attack cost matrix remains stable, the optimal target is allocated to each weapon based on the weapon target allocation result matrix at this time. This can solve the problem of duplicate allocation that may occur in the traditional weapon allocation algorithm based on the auction mechanism. While avoiding algorithm failure, it eliminates randomness and effectively ensures the consistency of distributed computing results.

[0141] The above is an illustrative scheme of a computing device according to this embodiment. It should be noted that the technical solution of this computing device and the technical solution of the above method belong to the same concept, and all details not described in detail in the technical solution of the computing device can be referred to the description of the technical solution of the above method.

[0142] An embodiment of this specification also provides a computer-readable storage medium storing computer-executable instructions that, when executed by a processor, implement the steps of the above-described method.

[0143] The above is an illustrative scheme of a computer-readable storage medium according to this embodiment. It should be noted that the technical solution of this storage medium and the technical solution of the method described above belong to the same concept, and all details not described in detail in the technical solution of the storage medium can be referred to the description of the technical solution of the method described above.

[0144] It should be noted that, in the embodiments of this application, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element.

[0145] The sequence numbers of the embodiments in this application are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments.

[0146] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes several instructions to cause a terminal (which may be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0147] The embodiments of this application have been described above with reference to the accompanying drawings. However, this application is not limited to the specific embodiments described above. The specific embodiments described above are merely illustrative and not restrictive. Those skilled in the art can make many other forms under the guidance of this application without departing from the spirit and scope of the claims. All of these forms are within the protection scope of this application.

Claims

1. A weapon target allocation method based on the information entropy auction algorithm, characterized in that, Obtain the strike effectiveness of each weapon against each target, generate a weapon strike effectiveness matrix against the target, and initialize the weapon target allocation result matrix and the weapon target strike cost matrix; Based on the weapon target allocation result matrix, determine whether there are any unassigned weapons. In response to any unassigned weapon in the weapon target allocation result matrix, assign a target to the unassigned weapon. Based on the strike effectiveness matrix and the weapon target strike cost matrix, the strike benefit of the unassigned weapon against each target is calculated, a strike benefit vector is generated, and based on the strike benefit vector, the target corresponding to the optimal benefit is assigned to the unassigned weapon, and the weapon target assignment result matrix is ​​updated. Calculate the gain information entropy based on the strike gain vector of the unassigned weapon; Based on the strike benefit vector, the profit space of the unallocated weapon is calculated based on the optimal and suboptimal benefits. Combining the benefit information entropy of the unallocated weapon, the strike cost of the unallocated weapon against the optimal benefit target is calculated, and the weapon target strike cost matrix is ​​updated. Based on the updated weapon target strike cost matrix, the strike cost of all weapons against the optimal benefit target is obtained, and a strike cost vector is generated. If the strike cost of the unassigned weapon against the target is not the maximum value, the assignment of the target corresponding to the optimal benefit to the unassigned weapon is cancelled, and the weapon target allocation result matrix is ​​updated. Based on the updated weapon target strike cost matrix, update the strike cost of the unassigned weapon against all targets; The above query calculation process is repeated until all weapons have completed one query calculation. Then the current round of allocation ends. The convergence of the algorithm is judged. If the algorithm is judged not to converge, the next round of allocation calculation is entered, so that all weapons have not completed the query calculation. The above query calculation process is restarted. If the algorithm is judged to converge, the weapon target allocation result matrix at this time is output. The step of calculating the gain information entropy based on the strike gain vector of the unassigned weapons includes: Calculate the information entropy of weapon i's gains using the following formula: where e i is the information entropy of the payoff; i is the weapon; j is the target; g ij is the payoff of weapon i against target j; k is a constant related to the natural number N, where k can be set to 1 / ln(N).

2. The method of claim 1, wherein, The initialized weapon target allocation result matrix and weapon target attack cost matrix include: Set the elements in the weapon target allocation result matrix and the weapon target strike cost matrix to zero. The zero element in the weapon target allocation result matrix represents the initial state in which no target has been assigned to each weapon. The zero element in the weapon target strike cost matrix represents the initial state in which the initial strike cost of each weapon against each target is zero.

3. A weapon target allocation device based on an information entropy auction algorithm, characterized in that, The initialization module is configured to acquire the strike effectiveness of each weapon against each target, generate a weapon strike effectiveness matrix against the target, and initialize the weapon target allocation result matrix and the weapon target strike cost matrix. The query and judgment module is configured to determine whether there are any unassigned weapons based on the weapon target allocation result matrix, and in response to any unassigned weapon in the weapon target allocation result matrix, to assign a target to the unassigned weapon. The pre-allocation module is configured to calculate the attack benefits of the unallocated weapon on each target based on the attack effectiveness matrix and the weapon target attack cost matrix, generate an attack benefit vector, allocate the target corresponding to the optimal benefit to the unallocated weapon based on the attack benefit vector, and update the weapon target allocation result matrix. The information entropy calculation module is configured to calculate the gain information entropy based on the strike gain vector of the unassigned weapon; The cost calculation module is configured to calculate the profit space of the unallocated weapon based on the strike benefit vector, the optimal benefit and the second-best benefit, and the strike cost of the unallocated weapon against the optimal benefit target by combining the benefit information entropy of the unallocated weapon, and update the weapon target strike cost matrix. The result verification module is configured to obtain the attack cost of all weapons against the optimal benefit target based on the updated weapon target attack cost matrix, generate an attack cost vector, and if the attack cost of the unassigned weapon against the target is not the maximum value, then cancel the assignment of the target corresponding to the optimal benefit to the unassigned weapon, and update the weapon target allocation result matrix. The cost update module is configured to update the cost of the unassigned weapon against all targets based on the updated weapon target strike cost matrix; The loop judgment module is configured to repeatedly execute the above query calculation process until all weapons have completed one query calculation. Then the current round of allocation ends. The convergence of the algorithm is judged. If the algorithm is judged not to converge, the next round of allocation calculation is entered, so that all weapons have not completed the query calculation and the above query calculation process is restarted. If the algorithm is judged to converge, the weapon target allocation result matrix at this time is output. The information entropy calculation module includes: Calculate the information entropy of weapon i's gains using the following formula: where e i is the information entropy of the payoff; i is the weapon; j is the target; g ij is the payoff of weapon i against target j; k is a constant related to the natural number N, where k = 1 / ln(N) can be allowed.

4. The apparatus of claim 3, wherein, The initialization module includes: Set the elements in the weapon target allocation result matrix and the weapon target strike cost matrix to zero. The zero element in the weapon target allocation result matrix represents the initial state in which no target has been assigned to each weapon. The zero element in the weapon target strike cost matrix represents the initial state in which the initial strike cost of each weapon against each target is zero.

Citation Information

Patent Citations

  • Method for cooperatively searching water target by multiple unmanned aerial vehicles

    CN110262563A

  • Distributed sensor-weapon-target joint allocation method

    CN112149959A