Heterogeneous cluster target firepower attack task allocation method and system

Abstract

The invention provides a heterogeneous cluster target firepower attack task allocation method and system, and the method comprises the steps: detecting the type, shape and purpose of each single target in a to-be-attacked heterogeneous cluster target, and carrying out the processing, and obtaining the battlefield value of each single target; evaluating according to the property information to obtain the type and quantity of applicable ammunition, and taking the attack task of the applicable ammunition as a to-be-auctioned commodity; the types and the number of ammunitions of a life-accepting unit are counted, and each ammunition serves as a bidder in an auction algorithm; traversing ammunition of a life unit to obtain striking advantages and benefits of striking different single targets by each ammunition; selecting the attack task with the maximum attack income as an auction object, and updating the task quotation of the bidder; distributing a striking task to the ammunition corresponding to the bidder with the highest auction quotation; and circularly executing the distribution of the striking task until the distribution of the striking task is completed or the ammunition is consumed. According to the method, the technical problems that heterogeneous cluster target attack tasks are difficult to allocate and the adaptability to attack task changes is low are solved.

Description

Technical Field

[0001] The present invention relates to the field of combat application of weapon systems, and in particular to a method and system for allocating firepower strike tasks to heterogeneous cluster targets. Background Art

[0002] In the modern army system, long-range precision firepower is an important part of the army firepower system. With the support of high technology, the nature of future wars is rapidly developing towards informationization, intelligence, and unmanned warfare. In this context, the targets that firepower needs to strike are gradually changing from single-nature targets to heterogeneous cluster targets including steel-concrete protection bodies, armored vehicles, simple fortifications, and manpower. The effectiveness of traditional single-type concentrated firepower strikes can no longer meet the needs of effectively destroying the above-mentioned heterogeneous cluster targets. At present, both barreled artillery and rocket launchers are equipped with a variety of ammunition and have the ability to use different types of ammunition to carry out long-range precision strikes on targets of different properties. For example, the existing invention patent application document "An Intelligent Method for Matching Ammunition and Targets" with publication number CN114282382A is a method for realizing intelligent matching of ammunition and targets, including the following steps: S1: Establishing a target value assessment model based on principal component analysis; S2: Establishing a target threat level assessment model; S3: Establishing an ammunition value assessment model; S4: Constructing a projectile-target matching model based on the target value assessment model, the target threat level assessment model, and the ammunition value assessment model; S5: Using a genetic algorithm to solve the projectile-target matching model to obtain a projectile-target matching result. And the existing invention patent application document "A Close Air Fire Support System and Method" with publication number CN113093601A, the existing system includes a measuring device, a main control device and a command device; the measuring device is used to measure the target information of the target and send it to the main control device, the target information includes the target distance and azimuth; the main control device is used to obtain three-dimensional coordinates according to the target information, and generate a fire support brief according to the three-dimensional coordinates and send it to the command device; the command device is used to confirm the fire support brief, and allocate different aircraft according to the fire support brief, and different aircraft carry out fire strikes on the target according to the three-dimensional coordinates. However, due to the ever-changing battlefield situation, in addition to the planned tasks, the received fire strike tasks usually also include unplanned tasks. In unplanned tasks, the types of ammunition carried by combat troops are difficult to fully support the heterogeneous cluster target strike requirements. Therefore, it is urgent to propose a method for allocating fire strike tasks for heterogeneous cluster targets in unplanned tasks.

[0003] In summary, the existing technology has technical problems such as difficulty in allocating strike tasks for heterogeneous cluster targets and low adaptability to changes in strike tasks. Summary of the invention

[0004] The technical problem to be solved by the present invention is: how to solve the technical problems of difficulty in allocating strike tasks for heterogeneous cluster targets and low adaptability to changes in strike tasks in the prior art.

[0005] The present invention adopts the following technical solution to solve the above technical problem: the method for assigning firepower strike tasks to heterogeneous cluster targets includes:

[0006] S1. According to the reconnaissance results, obtain the type, shape and purpose information of each individual target in the heterogeneous cluster target to be attacked;

[0007] S2. Based on the type, property and usage information of the single target, the battlefield value VA of the current single target is obtained. j ;

[0008] S3, based on the type information and property information, evaluate and obtain the type and quantity of applicable ammunition for the single target described in S2, and accordingly use the strike mission of each applicable ammunition as the commodity to be auctioned in the auction algorithm;

[0009] S4. Count the types and quantities of ammunition of the ordered unit, and use each round of ammunition of the ordered unit as a bidder in the auction algorithm;

[0010] S5. traverse the ammunition of the ordered unit, and seek the strike advantage and strike benefit of each round of ammunition against different single targets;

[0011] S6. Selecting the strike task with the largest strike benefit as the auction object, and updating the task bid of the bidder;

[0012] S7. Allocate the strike mission to the ammunition corresponding to the bidder with the highest bid;

[0013] S8. If all bidders are assigned strike tasks after the task allocation of this round is completed and there is no conflict between them, then this round of auction ends;

[0014] S9, looping through steps S5 to S8 until the strike mission is assigned or the ammunition is consumed.

[0015] Compared with the prior art, the present invention has the following advantages: the present invention adopts an auction algorithm to allocate firepower strike tasks to heterogeneous cluster targets, and realizes the task allocation of using different types of ammunition to carry out firepower strikes on individual targets of different properties in heterogeneous cluster targets. The present invention obtains the strike advantages of different ammunition on individual targets of different properties based on the battlefield value of individual targets of different properties, the quantitative applicability of different types of ammunition, and the time to complete the strike, and finally uses an auction algorithm to complete the task allocation of firepower strikes on individual targets of different properties in heterogeneous cluster targets. The present invention can provide troop commanders with an effective decision-making method for firepower strikes on unplanned heterogeneous cluster targets, which is more efficient in finding the global optimal solution and more applicable to the ever-changing battlefield environment.

[0016] In a more specific technical solution, in step S2, the associated parameters of battlefield value include: target type set, target strike capability set, target strike range set, target tactical intention set, and corresponding value ranges are set for the associated parameters.

[0017] In a more specific technical solution, step S4 includes:

[0018] S41. When the number of ammunition of the applicable ammunition type carried by the ordered unit is greater than the applicable number of ammunition, the excess number of ammunition of the current type shall be used as the bidder;

[0019] S42. When the number of ammunition of the applicable ammunition type carried by the ordered unit is less than or equal to the number of applicable ammunition, each round of ammunition of the applicable ammunition type carried by the ordered unit shall be a separate bidder.

[0020] In a more specific technical solution, in step S5, the initial task quotation P j Set to 0.

[0021] In a more specific technical solution, in step S5, the following logic is used to calculate the strike advantage A ij :

[0022] A ij =λ1·VA j +λ2·EF ij +λ3 / TI ij , (λ1+λ2+λ3=1)

[0023] Where, EF ij is the quantitative suitability of bidder i to single target j, which is related to the damage effectiveness of bidder i to single target j. ij The preparation time required for bidder i to attack single target j.

[0024] The auction algorithm used in the present invention has the advantages of fast optimization speed and applicability to complex multi-task allocation compared to global optimization algorithms such as genetic algorithms and particle swarm optimization algorithms. Therefore, the auction algorithm used to solve the problem of firepower strike task allocation for heterogeneous cluster targets has the unique advantage of making quick decisions in a rapidly changing battlefield situation. Compared with global optimization algorithms such as genetic algorithms and particle swarm optimization algorithms that seek global optimal solutions, it is more efficient and more applicable to the ever-changing battlefield environment.

[0025] In a more specific technical solution, in step S5, the following logic is used according to the attack advantage A ij , calculate the attack benefit:

[0026] A ij -P j

[0027] Where P j Quote for the task.

[0028] In a more specific technical solution, in step S5, the preset mapping table is used to obtain the quantitative suitability EF of each type of bullet to strike different single targets. ij , and obtain the task quotation based on it.

[0029] In a more specific technical solution, in step S6, the task quotation is obtained using the following logic:

[0030] P′ j =P j +[(A ij -P j )-(A ij* -P j* )]+ε

[0031] Where P j Indicates the current bid of the auction object, A ij -P j A represents the benefit obtained by attacking task j with the best benefit, ij* -P j* represents the benefit obtained by attacking the task j* with the second-best benefit, and ε is a fixed positive number.

[0032] The present invention adopts an auction algorithm to allocate firepower strike tasks for heterogeneous cluster targets, and realizes the task allocation of using different types of ammunition to carry out firepower strikes on individual targets of different properties in heterogeneous cluster targets. The present invention obtains the strike advantages of different ammunition on individual targets of different properties based on the battlefield value of individual targets of different properties, the target quantitative applicability of different types of ammunition, and the time to complete the strike, and finally uses an auction algorithm to complete the task allocation of firepower strikes on individual targets of different properties in heterogeneous cluster targets.

[0033] In a more specific technical solution, the fire strike task allocation system for heterogeneous cluster targets includes:

[0034] The single target information acquisition module is used to obtain the type information, shape information and usage information of each single target in the heterogeneous cluster target to be attacked according to the reconnaissance results;

[0035] A battlefield value acquisition module is used to process and obtain the battlefield value of the current single target according to the single target type information, property information and use information. The battlefield value acquisition module is connected to the single target information acquisition module;

[0036] The module for determining the single target to be struck evaluates the type and quantity of applicable ammunition according to the property information, and uses the strike mission of the applicable ammunition as the commodity to be auctioned in the auction algorithm. The module for determining the single target to be struck is connected to the module for obtaining the single target information;

[0037] The strike ammunition determination module is used to count the types and quantities of ammunition of the ordered unit, and use each round of ammunition of the ordered unit as a bidder in the auction algorithm;

[0038] The strike advantage and benefit obtaining module is used to traverse the ammunition of the ordered unit and obtain the strike advantage and strike benefit of each round of ammunition to strike different single targets. The strike advantage and benefit obtaining module is connected to the strike ammunition determination module;

[0039] An ammunition information update module is used to select the strike mission with the greatest strike benefit as the auction object and update the task bid of the bidder. The ammunition information update module is connected to the strike advantage and benefit obtaining module;

[0040] A strike task allocation module is used to allocate strike tasks to the ammunition corresponding to the bidder with the highest bid, and the strike task allocation module is connected to the ammunition information update module;

[0041] The loop module is used to execute the strike mission cyclically until the strike mission assignment is completed or the ammunition is consumed, and is connected to the strike advantage and benefit obtaining module.

[0042] Compared with the prior art, the present invention has the following advantages: the present invention adopts an auction algorithm to allocate firepower strike tasks to heterogeneous cluster targets, and realizes the task allocation of using different types of ammunition to carry out firepower strikes on individual targets of different properties in heterogeneous cluster targets. The present invention obtains the strike advantages of different ammunition on individual targets of different properties based on the battlefield value of individual targets of different properties, the quantitative applicability of different types of ammunition, and the time to complete the strike, and finally uses an auction algorithm to complete the task allocation of firepower strikes on individual targets of different properties in heterogeneous cluster targets. The present invention can provide troop commanders with an effective decision-making method for firepower strikes on unplanned heterogeneous cluster targets, which is more efficient in finding the global optimal solution and more applicable to the ever-changing battlefield environment.

[0043] The auction algorithm used in the present invention has the advantages of fast optimization speed and applicability to complex multi-task allocation compared to global optimization algorithms such as genetic algorithms and particle swarm optimization algorithms. Therefore, the auction algorithm used to solve the problem of firepower strike task allocation for heterogeneous cluster targets has the unique advantage of making quick decisions in a rapidly changing battlefield situation. Compared with global optimization algorithms such as genetic algorithms and particle swarm optimization algorithms that seek global optimal solutions, it is more efficient and more applicable to the ever-changing battlefield environment.

[0044] The present invention adopts an auction algorithm to allocate firepower strike tasks for heterogeneous cluster targets, and realizes the task allocation of using different types of ammunition to carry out firepower strikes on individual targets of different properties in heterogeneous cluster targets. The present invention obtains the strike advantages of different ammunition on individual targets of different properties based on the battlefield value of individual targets of different properties, the target quantitative applicability of different types of ammunition, and the time to complete the strike, and finally uses an auction algorithm to complete the task allocation of firepower strikes on individual targets of different properties in heterogeneous cluster targets.

[0045] The present invention solves the technical problems existing in the prior art of difficulty in allocating strike tasks for heterogeneous cluster targets and low adaptability to changes in strike tasks. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] Figure 1 This is a schematic diagram of the basic steps of the method for allocating firepower strike tasks to heterogeneous cluster targets according to Example 1 of the present invention. DETAILED DESCRIPTION

[0047] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in combination with the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0048] Example 1

[0049] like Figure 1 As shown, the method for assigning firepower strike tasks to heterogeneous cluster targets provided by the present invention includes the following basic steps:

[0050] S1. Obtain the type, nature and purpose of each individual target included in the heterogeneous cluster target to be attacked based on the reconnaissance results;

[0051] In this embodiment, according to the reconnaissance results, the heterogeneous cluster targets to be attacked are airport cluster targets, which include the following single targets: 1 airport control tower, a steel-concrete structure, regarded as single target 1; 3 concentrated armored transport vehicles, armored protection bodies, regarded as single target 2 as a whole; 2 aircraft hangars with dispersed settings and parked aircraft, steel-concrete structures, regarded as single targets 3 and 4 respectively; 2 concentrated exposed fighter jets, armored protection bodies, regarded as single target 5 as a whole; 20 exposed and gathered operating personnel, exposed manpower, regarded as single target 6 as a whole; 1 airport runway, a steel-concrete structure, regarded as single target 7; 2 dispersed simple fortifications, brick-concrete structures, regarded as single targets 8 and 9 respectively.

[0052] Table 1 Battlefield value assignment query table

[0053]

[0054] S2. Obtain the battlefield value VA of all individual targets according to the type, nature, and purpose of each individual target in the heterogeneous cluster target j ;

[0055] In this embodiment, the battlefield value VA of the single target j is j It is obtained by querying a battlefield value query table prepared in advance based on expert opinions. In this embodiment, the value range is {1, 2, 3, 4}.

[0056] In this embodiment, the battlefield value query table includes the following factors affecting battlefield value assignment: (1) target type set CA, including command and control units and important military facilities CA1, firepower units CA2, and logistics units CA3, corresponding to the value ranges {1, 2, 3} respectively; (2) target strike capability set AB, including strong strike capability AB1 and weak strike capability AB2, corresponding to the value ranges {1, 2} respectively; (3) target strike range set RA, including our side within the target strike range RA1 and our side outside the target strike range RA2, corresponding to the value ranges {1, 2} respectively; (4) target tactical intention set IN, including the target intends to strike us IN1, the target is about to implement maneuver evasive strike IN2, and the target is in a state where our intention has not yet been detected IN3, corresponding to the value ranges {1, 2, 3} respectively. In this embodiment, the battlefield value query table obtained according to tactical principles and expert opinions is shown in Table 1. According to the properties of each single target in the heterogeneous cluster target to be struck, query Table 1 to obtain the battlefield value of each single target {VA j} is {4, 2, 4, 4, 3, 1, 4, 2, 2}.

[0057] S3. According to the properties of a single target in the heterogeneous cluster target, the type of ammunition suitable for attacking the target and the number of ammunition of the type required to destroy the target are evaluated, and each ammunition strike mission against the single target is used as the commodity to be auctioned in the auction process;

[0058] In this embodiment, after evaluation, the applicable types of ammunition for each single target and the number of corresponding types of ammunition required for damage are shown in Table 2. In theory, 13 penetrating bombs, 3 submunitions, and 3 fragmentation bombs / fuel-air explosives are required to complete the firepower strike damage mission. The strike missions are allocated as follows: strike missions No. 1-2 (penetrating bombs, target No. 1), strike missions No. 3-4 (submunitions, target No. 2), strike missions No. 5-7 (penetrating bombs, target No. 3), strike missions No. 8-10 (penetrating bombs, target No. 4), strike mission No. 11 (submunitions, target No. 5), strike mission No. 12 (fragmentation bombs / fuel-air explosives, target No. 6), strike missions No. 13-17 (penetrating bombs, target No. 7), strike mission No. 18 (fragmentation bombs / fuel-air explosives, target No. 8), and strike mission No. 19 (fragmentation bombs / fuel-air explosives, target No. 9).

[0059] Table 2 Projectile-target matching table

[0060] Monomer target number Applicable ammunition type Number of rounds required to damage 1 Penetrating projectile 2 2 Cluster bomb 2 3 Penetrating projectile 3 4 Penetrating projectile 3 5 Cluster bomb 1 6 Fragmentation bomb / fuel-air bomb 1 7 Penetrating projectile 5 8 Fragmentation bomb / fuel-air bomb 1 9 Fragmentation bomb / fuel-air bomb 1

[0061] S4. Count the number and types of ammunition carried by the ordered troops. If the number of a certain type of ammunition carried can meet the total number of ammunition required in step S3, the excess number of ammunition of this type will be used as a bidder to participate in the subsequent auction; if the number of a certain type of ammunition cannot meet the total number of ammunition required in step S3, each round of this type of ammunition carried will be used as a bidder to participate in the auction of the strike mission of this type of ammunition. After the auction is completed, the remaining strike missions of this type of ammunition will enter the subsequent auction and be auctioned by other types of ammunition.

[0062] In this embodiment, the ordered troops carry a total of 7 penetrating bombs, 5 submunitions, and 20 lethal explosive bombs. First, the 7 penetrating bombs carried by the troops participate in the bidding for the 13 penetrating bomb strike missions as bidders, and the remaining 6 penetrating bomb strike missions enter the next round of auction as auction items; 3 of the 5 submunitions carried are randomly selected to complete the No. 3-4 and No. 11 submunition strike missions, and the remaining 2 submunitions enter the next round of auction as bidders; 3 of the 20 lethal explosive bombs carried are randomly selected to complete the No. 12, 18, and 19 lethal explosive bomb / fuel-air explosive bomb strike missions, and the remaining 17 lethal explosive bombs enter the next round of auction as bidders.

[0063] In this embodiment, the first round of auction is conducted first, and the commodities to be auctioned are strike missions No. 1-2, 5-10, and 13-17, and the bidders are 7 penetrating bombs.

[0064] S5. Traverse the ammunition carried by the troops and calculate the strike advantage A of each round of ammunition in performing different strike missions. ij , calculate the attack benefit A ij -P j , where P j is the task price;

[0065] In this embodiment, in step S5, the initial task price P j Set to 0.

[0066] In this embodiment, in step S5, the attack advantage A ij The calculation formula is A ij =λ1·VA j +λ2·EF ij +λ3 / TI ij , (λ1+λ2+λ3=1). In the formula, EF ij is the quantitative suitability of bidder i to single target j, which is related to the damage effectiveness of bidder i to single target j. ij is the preparation time required for bidder i to attack single target j, and λ1, λ2, and λ3 are weight coefficients.

[0067] In this embodiment, the weight coefficients λ1, λ2, and λ3 are obtained based on the comprehensive scores of expert opinions;

[0068] In this embodiment, the strike benefit A is calculated based on the strike advantage. ij -P j , where P j is the task quotation, and the task quotation of all single targets is initially set to 0. In this embodiment, the quantitative applicability EF of each type of bomb to attack different single targets ij The mapping tables are shown in Table 3. The time required for each type of ammunition to strike is mainly affected by the ammunition preparation time. In this embodiment, TI ij All are assigned a value of 1. In addition, in this embodiment, the weight coefficients {λ1,λ2,λ3} obtained based on the comprehensive evaluation of expert opinions are {0.55,0.35,0.1}. After calculation, the strike advantage A of each round of ammunition for strike missions 1-2, 5-10, and 13-17 is ij Both are 3.7.

[0069] Table 3 Quantitative applicability mapping table

[0070]

[0071] S6. Select the task with the largest strike profit as the auction object and update the task quotation;

[0072] In this embodiment, in step S6, the task quotation formula is P′ j =P j +[(A ij -P j )-(A ij* -P j* )]+ε. In the task quotation formula, P j Indicates the current bid of the auction object, A ij -P j A represents the benefit obtained by attacking task j with the best benefit, ij* -P j* represents the benefit obtained by attacking the task j* with the second-best benefit, and ε is a fixed positive number. In this embodiment, ε can be, for example, 0.05.

[0073] S7. Allocate the task to the bidder with the highest bid in this round of bidding;

[0074] S8. If all bidders are assigned strike tasks after the task allocation of this round is completed and there is no conflict between them, then this round of auction ends;

[0075] S9. Repeat S5-S8 until all strike missions are assigned or all ammunition is consumed, and the algorithm ends.

[0076] In this embodiment, the second round of auction begins. The items to be auctioned are strike missions No. 10, 13-17, and the bidders are 2 submunitions and 17 fragmentation bombs.

[0077] In this embodiment, the aforementioned step S5 is repeatedly executed. The time required for each type of ammunition to strike is mainly affected by the ammunition preparation time. In this embodiment, TI ij All are assigned a value of 1. In addition, in this embodiment, the weight coefficients {λ1,λ2,λ3} obtained based on the comprehensive evaluation of expert opinions are {0.55,0.35,0.1}. After calculation, the strike advantage A of each round of ammunition in executing strike missions 13-17 is ij As shown in Table 4.

[0078] Table 4 Mapping table of strike advantage in the second round of auction

[0079]

[0080] In this embodiment, the aforementioned step S6 is repeatedly executed, and the task with the largest strike profit is again selected as the auction object, and the task quotation is updated.

[0081] In this embodiment, the aforementioned step S7 is repeatedly executed to repeatedly assign the task to the bidder with the highest bid in this round of bidding;

[0082] In this embodiment, the aforementioned step S8 is repeatedly performed, and when all bidders have obtained strike mission assignments after the current round of task assignments are completed and there is no conflict between them, the current round of auction ends. In this round, the ammunition that has not been awarded a strike mission continues to enter the next round of auction.

[0083] In this embodiment, the aforementioned steps S5 to S8 are repeated until all strike missions are assigned or all ammunition is consumed, the algorithm ends, and the assignment of all carried ammunition is completed to achieve maximum strike effectiveness.

[0084] In summary, the present invention adopts an auction algorithm to allocate tasks for fire strikes on heterogeneous cluster targets, and realizes the task allocation of using different types of ammunition to carry out fire strikes on individual targets of different properties in heterogeneous cluster targets. The present invention obtains the strike advantages of different ammunition on individual targets of different properties based on the battlefield value of individual targets of different properties, the quantitative applicability of different types of ammunition, and the time to complete the strike, and finally uses an auction algorithm to complete the task allocation of fire strikes on individual targets of different properties in heterogeneous cluster targets. The present invention can provide troop commanders with an effective decision-making method for fire strikes on unplanned heterogeneous cluster targets, which is more efficient in finding the global optimal solution and more applicable to the ever-changing battlefield environment.

[0085] The auction algorithm used in the present invention has the advantages of fast optimization speed and applicability to complex multi-task allocation compared to global optimization algorithms such as genetic algorithms and particle swarm optimization algorithms. Therefore, the auction algorithm used to solve the problem of firepower strike task allocation for heterogeneous cluster targets has the unique advantage of making quick decisions in a rapidly changing battlefield situation. Compared with global optimization algorithms such as genetic algorithms and particle swarm optimization algorithms that seek global optimal solutions, it is more efficient and more applicable to the ever-changing battlefield environment.

[0086] The present invention adopts an auction algorithm to allocate firepower strike tasks for heterogeneous cluster targets, and realizes the task allocation of using different types of ammunition to carry out firepower strikes on individual targets of different properties in heterogeneous cluster targets. The present invention obtains the strike advantages of different ammunition on individual targets of different properties based on the battlefield value of individual targets of different properties, the target quantitative applicability of different types of ammunition, and the time to complete the strike, and finally uses an auction algorithm to complete the task allocation of firepower strikes on individual targets of different properties in heterogeneous cluster targets.

[0087] The present invention solves the technical problems existing in the prior art of difficulty in allocating strike tasks for heterogeneous cluster targets and low adaptability to changes in strike tasks.

[0088] The above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. However, these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for assigning firepower strike tasks to heterogeneous cluster targets, characterized in that: The method comprises: S1. According to the reconnaissance results, obtain the type, shape and purpose information of each individual target in the heterogeneous cluster target to be attacked; S2. According to the single target type information, the property information and the usage information, the battlefield value VA of the current single target is obtained by processing j ; S3, evaluating and obtaining the type and quantity of applicable ammunition for the single target according to the type information and the property information, and accordingly using the strike mission of each round of the applicable ammunition as a commodity to be auctioned in the auction algorithm; S4, counting the types and quantities of ammunition of the ordered unit, and taking each round of ammunition of the ordered unit as a bidder in the auction algorithm; S5, traversing the ammunition of the commanded unit, and obtaining the strike advantage and strike benefit of firing the ammunition to strike different single targets; S6, selecting the strike task with the largest strike benefit as the auction object, and updating the task bid of the bidder; S7, allocating the strike mission to the ammunition corresponding to the bidder with the highest bid; S8. If after the assignment of tasks in this round is completed, all bidders are assigned with strike tasks and there is no conflict between them, then this round of auction ends; S9, looping through steps S5 to S8 until the strike mission is assigned or the ammunition is consumed.

2. The method for assigning firepower strike tasks to heterogeneous cluster targets according to claim 1 is characterized in that: In step S2, the associated parameters of the battlefield value include: a target type set, a target strike capability set, a target strike range set, and a target tactical intention set, and corresponding value ranges are set for the associated parameters.

3. The method for assigning firepower strike tasks to heterogeneous cluster targets according to claim 1 is characterized in that: The step S4 comprises: S41, when the quantity of the ammunition of the applicable ammunition type carried by the ordered unit is greater than the quantity of applicable ammunition, the excess number of the current ammunition type is used as the bidder; S42. When the quantity of the ammunition of the applicable ammunition type carried by the ordered unit is less than or equal to the quantity of applicable ammunition, each round of ammunition of the applicable ammunition type carried by the ordered unit shall be used as the bidder.

4. The method for assigning firepower strike tasks to heterogeneous cluster targets according to claim 1 is characterized in that: In step S5, the initial task quotation P j Set to 0.

5. The method for assigning firepower strike tasks to heterogeneous cluster targets according to claim 1 is characterized in that: In step S5, the attack advantage A is calculated using the following logic: ij : A ij =λ1·VA j +λ2·EF ij +λ3 / TI ij Where, EF ij is the quantitative suitability of bidder i to single target j, which is related to the damage effectiveness of bidder i to single target j. ij The preparation time required for bidder i to attack single target j.

6. The method for assigning firepower strike tasks to heterogeneous cluster targets according to claim 1 is characterized in that: In step S5, the following logic is used according to the attack advantage A. ij , calculate the attack benefit: A ij -P j Where P j Quote for the task.

7. The method for assigning firepower strike tasks to heterogeneous cluster targets according to claim 5 is characterized in that: Using the preset mapping table, the quantitative applicability EF of each type of bullet against different single targets is obtained. ij , and obtain the task quotation based on it.

8. The method for assigning firepower strike tasks to heterogeneous cluster targets according to claim 1 is characterized in that: In step S6, the task quotation is obtained using the following logic: P.S j ′sP j +[(A ij -P j )-(A ij* -P j* )]+ε Where P j Indicates the current bid of the auction object, A ij -P j represents the benefit obtained by attacking task j with the best benefit, represents the benefit obtained by attacking the task j* with the second-best benefit, and ε is a fixed positive number.

9. A fire strike task allocation system for heterogeneous cluster targets, characterized in that the system comprises: The single target information acquisition module is used to obtain the type, shape and purpose information of each single target in the heterogeneous cluster target to be attacked based on the reconnaissance results; A battlefield value acquisition module, used for processing and obtaining the battlefield value of the current single target according to the single target type information, the property information and the use information, wherein the battlefield value acquisition module is connected to the single target information acquisition module; A module for determining a single target to be struck is used to evaluate the type and quantity of applicable ammunition according to the property information, and to use the strike mission of the applicable ammunition as a commodity to be auctioned in the auction algorithm. The module for determining a single target to be struck is connected to the module for acquiring information of the single target; A strike ammunition determination module, used to count the types and quantities of ammunition of the ordered unit, and use each round of ammunition of the ordered unit as a bidder in the auction algorithm; A strike advantage and benefit obtaining module, used for traversing the ammunition of the ordered unit, and obtaining the strike advantage and strike benefit of each shot of the ammunition to strike different single targets, the strike advantage and benefit obtaining module is connected to the strike ammunition determination module; An ammunition information updating module, used for selecting the strike task with the largest strike benefit as the bidding object, and updating the task bid of the bidder, wherein the ammunition information updating module is connected to the strike advantage and benefit obtaining module; A strike task allocation module, used for allocating the strike task to the ammunition corresponding to the bidder with the highest bid, the strike task allocation module being connected to the ammunition information updating module; A loop module is used to execute the strike mission cyclically until the strike mission is assigned or the ammunition is consumed, and is connected to the strike advantage and benefit obtaining module.

Images