Missile defense method and system

Abstract

The invention discloses a missile defense method and system, and belongs to the technical field of missile defense. According to the method, a corresponding candidate killing chain set is allocated to each incoming missile according to the attribute of the incoming missile; then selecting a better attack node by taking maximization of the total hit rate of all the incoming missiles, minimization of the total weapon cost used by all the incoming missiles and guarantee of consistency of the number of weapons on the attack nodes of all the incoming missiles as targets; in order to maximize the total investigation time of all incoming missiles and ensure the consistency of the number of target channels of the investigation nodes of the incoming missiles, better investigation nodes are selected, so that a candidate killing chain set of each incoming missile is optimized, and a primary population with better performance is generated for a subsequent genetic algorithm; the method can avoid the generation of a local optimal solution, achieves the dynamic and accurate adjustment of the distribution strategy of the missile according to the real-time condition of the incoming missile, guarantees the interception success rate, and improves the utilization rate of defense resources.

Description

Technical Field

[0001] The present invention belongs to the field of missile defense technology, and more specifically, relates to a missile defense method and system. Background Art

[0002] With the rapid development of missile weapon technology, it has gradually become a core weapon in modern warfare. For the defender, in order to avoid missile attacks, it is necessary to effectively intercept the attacker's missiles and achieve anti-missile defense. Especially in a complex air threat environment, the enemy's missiles are of various types, fast and powerful, and may adopt complex strategies such as hypersonic flight and maneuvering evasion, which greatly increases the difficulty of interception. Therefore, it is of great significance to study a missile defense method and system.

[0003] Most existing missile defense methods rely on rules or empirical rules to allocate and defend missiles. Although these methods have certain defense capabilities, they do not fully consider the current situation and the characteristics of defense resources, do not coordinate defense resources and perform kill chain optimization in a timely and effective manner, and cannot reconcile the interception success rate and defense resource utilization rate. Summary of the invention

[0004] In view of the above defects or improvement needs of the prior art, the present invention provides a missile defense method and system, the purpose of which is to improve the utilization rate of defense resources while ensuring the interception success rate.

[0005] In order to achieve the above-mentioned object, in a first aspect, the present invention provides a missile defense method, comprising:

[0006] Obtain relevant information about incoming missiles, including the number of incoming missiles and the attributes of each incoming missile; the attributes include: the type, location, and direction of the incoming missile;

[0007] For each incoming missile, a corresponding candidate kill chain set is generated based on its attributes; the kill chain includes: reconnaissance node, control node and strike node;

[0008] Obtain the strike node set of each incoming missile; the strike node set is a set consisting of all strike nodes in the candidate kill chain set corresponding to the incoming missile; select a strike node from each strike node set to form a strike plan, select a strike plan that meets the strike target, and record the corresponding values ​​of P, V, and R, and then calculate the Nash equilibrium value of each strike node in each strike node set; wherein the strike targets include: maximizing the sum of the damage probabilities P of all incoming missiles, minimizing the sum of the weapon costs V used for all incoming missiles, and minimizing the variance R of the number of strike node weapons for each incoming missile;

[0009] Obtain a reconnaissance node set for each incoming missile; the reconnaissance node set is a set consisting of all reconnaissance nodes in the candidate kill chain set corresponding to the incoming missile; select a reconnaissance node from each reconnaissance node set to form a reconnaissance plan, select a reconnaissance plan that meets the reconnaissance target, and record the corresponding E and Z values, and then calculate the Nash equilibrium value of each reconnaissance node in each reconnaissance node set; wherein the reconnaissance targets include: maximizing the sum of the reconnaissance time E for all incoming missiles and minimizing the variance Z of the number of target channels of each reconnaissance node at the same time;

[0010] For each incoming missile: select N / 2 nodes with the smallest Nash equilibrium value from its attack node set and reconnaissance node set respectively to obtain the attack node subset and the reconnaissance node subset; prune the candidate kill chain set of the incoming missile, and only retain the kill chains of the attack nodes belonging to the attack node subset and the kill chains of the reconnaissance nodes belonging to the reconnaissance node subset, and calculate the Nash equilibrium value of each retained candidate kill chain; initialize the current population to the candidate kill chain set after pruning, and use the genetic algorithm to generate a new kill chain for the current population. The operation of generating a new population is repeated and iterated with the new population as the current population until the preset number of iterations is reached; and the Nash equilibrium value of each kill chain of the current population is calculated and recorded in each iteration, and the kill chain corresponding to the minimum Nash equilibrium value in all iterations is assigned to the incoming missile as the optimal kill chain; wherein the Nash equilibrium value of the kill chain is the sum of the Nash equilibrium values ​​of the strike node and the reconnaissance node on it; the fitness value used in the genetic algorithm is the inverse of the Nash equilibrium value of the kill chain; N is the preset population size;

[0011] The optimal kill chain of each incoming missile constitutes the current optimal missile allocation plan to achieve missile defense.

[0012] Further preferably, the expression of the strike target is:

[0013]

[0014]

[0015]

[0016] Where n is the number of incoming missiles; r is the total number of strike nodes after deduplication in the strike plan; m i is the number of weapons in the ith attack node after deduplication in the attack plan; i = 1, 2, ..., r; Indicates whether the incoming missile is within the effective attack range of the kth weapon at the i-th strike node. If so, otherwise is the probability of damage of the kth weapon at the i-th attack node to the j-th incoming missile; v ik is the kth weapon cost of the i-th attack node; is a decision variable, indicating whether the kth weapon of the i-th attack node attacks the j-th incoming target. If so, otherwise

[0017] Further preferably, the constraints for striking the target include:

[0018]

[0019]

[0020] Further preferably, the Nash equilibrium value of the lth strike node in the strike node set of a certain incoming missile is:

[0021]

[0022] Among them, P l is the probability of damage to the incoming missile by the lth strike node in the strike node set of a certain incoming missile; V l is the weapon cost used by the lth strike node in the strike node set of a certain incoming missile on the incoming missile; R l is the number of weapons at the lth strike node in the strike node set of a certain incoming missile.

[0023] Further preferably, the expression of the detection target is:

[0024]

[0025]

[0026] Where t is the number of non-repeated reconnaissance nodes in the reconnaissance scheme; n is the number of incoming missiles; a gj Is the jth incoming missile within the effective targeting range of the gth reconnaissance node? If so, then a gj =1; otherwise a gj =0; z g is the target channel number of the g-th reconnaissance node, g = 1, 2, …, t.

[0027] Further preferably, the constraints of the detection target include:

[0028]

[0029] Among them, y gjis a decision variable, which indicates the number of target channels provided by the g-th reconnaissance node after deduplication in the reconnaissance scheme for the attack of the j-th incoming missile.

[0030] Further preferably, the Nash equilibrium value of the hth reconnaissance node in the reconnaissance node set of a certain incoming missile is:

[0031]

[0032] Among them, E h is the detection time of the incoming missile by the hth detection node in the detection node set of the incoming missile; Z h is the target channel number of the hth reconnaissance node in the reconnaissance node set of a certain incoming missile.

[0033] Further preferably, the above genetic algorithm is a taboo genetic algorithm.

[0034] In a second aspect, the present invention provides a missile defense system, comprising: a memory and a processor, wherein the memory stores a computer program, and the processor executes the method provided in the first aspect of the present invention when executing the computer program.

[0035] In a third aspect, the present invention further provides a computer-readable storage medium, which includes a stored computer program, wherein when the computer program is executed by a processor, the device where the storage medium is located is controlled to execute the method provided in the first aspect of the present invention.

[0036] In general, the above technical solutions conceived by the present invention can achieve the following beneficial effects:

[0037] 1. The present invention provides a missile defense method, and designs a dynamic allocation mechanism. First, a corresponding candidate kill chain set is allocated to each incoming missile according to its attributes; then, a better strike node is selected with the goal of maximizing the total hit rate of all incoming missiles, minimizing the total weapon cost used for all incoming missiles, and ensuring the consistency of the number of weapons on the strike nodes for each incoming missile; a better reconnaissance node is selected with the goal of maximizing the total reconnaissance time for all incoming missiles and ensuring the consistency of the number of target channels of the reconnaissance nodes for each incoming missile, so as to optimize the candidate kill chain set of each incoming missile, so as to generate a primary population with better performance for a subsequent genetic algorithm, thereby avoiding the generation of a local optimal solution, realizing the dynamic and accurate adjustment of the missile allocation strategy according to the real-time situation of the incoming missile, and improving the utilization rate of defense resources while ensuring the interception success rate.

[0038] 2. The missile defense method provided by the present invention can handle multiple incoming missile targets at the same time and allocate resources according to actual conditions. By adopting a dynamic allocation mechanism, it is ensured that when dealing with multiple targets at the same time, the response speed can be effectively improved, and the rationality of resource allocation in the case of multiple targets is ensured, and problems such as resource overload or response delay will not occur, especially in a high-intensity battlefield environment, it can deal with multiple threat targets at the same time. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] Figure 1 A flowchart of a missile defense method provided by an embodiment of the present invention;

[0040] Figure 2 A detailed execution process diagram of the missile defense method provided by an embodiment of the present invention;

[0041] Figure 3 A diagram of the interception distribution result of 16 incoming missiles in uniform air directions provided by an embodiment of the present invention;

[0042] Figure 4 This is a diagram of the interception distribution results of 32 incoming missiles in uniform air directions provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0043] In order to make the purpose, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0044] In order to achieve the above objectives, firstly, Figure 1 As shown, the present invention provides a missile defense method, comprising:

[0045] 1) Obtain relevant information about incoming missiles, including the number of incoming missiles and the attributes of each incoming missile; the attributes include: the type, location, and direction of the incoming missile;

[0046] In an optional implementation, multiple sensors (including radar, satellite and infrared detectors, etc.) are used to obtain key information of incoming missiles in real time, such as the number of missiles, the type of each missile, the flight speed, the threat level, the real-time position, the flight trajectory, etc., for subsequent interception and optimization operations. The data can be processed through multi-source information fusion technology to improve the accuracy and robustness of the data.

[0047] Through multi-source fusion, the errors of single sensor data can be effectively avoided and the ability to accurately identify and track incoming missiles in complex combat environments can be improved.

[0048] 2) For each incoming missile, generate a corresponding candidate kill chain set based on its attributes; the kill chain includes: reconnaissance node, control node and strike node;

[0049] Real-time inventory of the status data of all air defense resources (such as air defense missiles and unmanned boats), including the number, location, range, damage probability and platform cost of each weapon. Through monitoring and calculation, the resources of the party are deployed and allocated in the most optimized way to quickly respond to battlefield needs. Through real-time updates, the rational use of resources is ensured to avoid waste or over-allocation of resources.

[0050] According to the information of the incoming missile and the status of its own resources, a kill chain is dynamically generated to deal with different missile threats. Each kill chain includes: tracking nodes, control nodes and strike nodes; among them, the tracking node is responsible for real-time locking of the target missile; the control node is used to allocate the corresponding air defense resources; the strike node is used to perform the actual interception task of the incoming missile.

[0051] It should be noted that when generating a corresponding candidate kill chain set for each incoming missile, corresponding reconnaissance nodes and strike nodes are selected for it according to its attributes, and combined with the control node to form multiple candidate kill chains, constituting the corresponding candidate kill chain set; wherein, the selected reconnaissance node satisfies that the incoming missile is within the reconnaissance range of the reconnaissance node (specifically, the position and the incoming direction of the incoming missile are both within the reconnaissance range of the reconnaissance node), and the selected strike node satisfies that the incoming missile is within the strike range of the strike node (specifically, the position and the incoming direction of the incoming missile are both within the strike range of the strike node, and the type of the incoming missile also belongs to the type of missile that the weapon loaded on the strike node can strike).

[0052] According to the threat level, type, real-time location and trajectory of the incoming missile, the appropriate defense strategy is automatically determined, a kill chain is dynamically generated for it, and the priority of each node is adjusted in real time to maximize the interception success rate and resource utilization.

[0053] 3) Select the best kill chain for each incoming missile from its candidate kill chain set to form the best missile allocation plan to achieve missile defense;

[0054] In an optional implementation, a real number encoding method is used to represent the solution to the problem to be optimized; let the total number of incoming targets be n, and the number of incoming targets of the jth attack is l j candidate kill chains, and (c1,c2,…,cn) represents a solution to the kill chain optimization problem. j (j=1,2,…,n), c j ∈[1,l j ] and c j∈Z, indicating that the jth incoming target selects the cth j If there are 8 incoming targets, the first gene in the individual code (2, 3, 4, 6, 1, 3, 5, 4) represents the selection of the second candidate kill chain for the first incoming missile.

[0055] like Figure 2 As shown, in an optional implementation manner, the process of selecting the best kill chain from the candidate kill chain set for each incoming missile to form the best missile allocation plan includes:

[0056] 3.1) Based on the candidate kill chain set of each incoming missile, two game algorithms are used as meta-games for pre-inspiration to generate excellent seeds as the initial population.

[0057] 3.2.1) Obtain the strike node set of each incoming missile; the strike node set is a set consisting of all strike nodes in the candidate kill chain set corresponding to the incoming missile; select a strike node from each strike node set to form a strike plan, select a strike plan that meets the strike target, and record the corresponding values ​​of P, V, and R, and then calculate the Nash equilibrium value of each strike node in each strike node set; wherein the strike targets include: maximizing the sum of the damage probabilities P of all incoming missiles, minimizing the sum of the weapon costs V used for all incoming missiles, and minimizing the variance R of the number of strike node weapons for each incoming missile;

[0058] Obtain a reconnaissance node set for each incoming missile; the reconnaissance node set is a set consisting of all reconnaissance nodes in the candidate kill chain set corresponding to the incoming missile; select a reconnaissance node from each reconnaissance node set to form a reconnaissance plan, select a reconnaissance plan that meets the reconnaissance target, and record the corresponding E and Z values, and then calculate the Nash equilibrium value of each reconnaissance node in each reconnaissance node set; wherein the reconnaissance targets include: maximizing the sum of the reconnaissance time E for all incoming missiles and minimizing the variance Z of the number of target channels of each reconnaissance node at the same time;

[0059] In an optional implementation manner, the expression for striking a target is:

[0060]

[0061]

[0062]

[0063] Where n is the number of incoming missiles; r is the total number of strike nodes after deduplication in the strike plan; m i is the number of weapons in the ith attack node after deduplication in the attack plan; i = 1, 2, ..., r; dikj Indicates whether the incoming missile is within the effective attack range of the kth weapon at the i-th strike node. If so, then d ikj =1; otherwise d ikj =0; p ikj is the probability of damage of the kth weapon at the i-th attack node to the j-th incoming missile; v ik is the kth weapon cost of the ith attack node; x ikj is a decision variable, indicating whether the kth weapon of the i-th attack node attacks the j-th incoming target. If so, then x ikj =1; otherwise x ikj =0.

[0064] It should be noted that by minimizing the variance of the number of weapons on the strike node for each incoming missile, the consistency of the number of weapons on the strike node for each incoming missile is ensured, thereby maximizing the remaining capacity of the strike node.

[0065] Furthermore, in an optional implementation manner, the constraints for striking the target include:

[0066] Each weapon carried by each strike node can only strike one incoming missile, that is:

[0067]

[0068] The number of weapons used by each strike node is less than or equal to the number of weapons it carries, that is,

[0069]

[0070] In an optional implementation manner, the Nash equilibrium value of the lth strike node in the strike node set of a certain incoming missile is:

[0071]

[0072] Among them, P l is the probability of damage to the incoming missile by the lth strike node in the strike node set of a certain incoming missile; V l is the weapon cost used by the lth strike node in the strike node set of a certain incoming missile on the incoming missile; R l is the number of weapons at the lth strike node in the strike node set of a certain incoming missile.

[0073] In an optional implementation, the expression of the detection target is:

[0074]

[0075]

[0076] Where t is the number of non-repeated reconnaissance nodes in the reconnaissance scheme; n is the number of incoming missiles; a gj Is the jth incoming missile within the effective targeting range of the gth reconnaissance node? If so, then a gj =1; otherwise a gj =0; z g is the target channel number of the g-th reconnaissance node, g = 1, 2, …, t.

[0077] It should be noted that by minimizing the variance of the number of target channels of each reconnaissance node, the consistency of the number of target channels of the reconnaissance node for each incoming missile is ensured, thereby maximizing the remaining capacity of the reconnaissance node.

[0078] In an optional implementation manner, the constraint condition of the reconnaissance target includes: the number of target channels used by each reconnaissance node is less than or equal to the number of target channels carried by it, specifically:

[0079]

[0080] Among them, y gj is a decision variable, which indicates the number of target channels provided by the g-th reconnaissance node after deduplication in the reconnaissance scheme for the attack of the j-th incoming missile.

[0081] In an optional implementation, the Nash equilibrium value of the hth reconnaissance node in the reconnaissance node set of a certain incoming missile is:

[0082]

[0083] Among them, E h is the detection time of the incoming missile by the hth detection node in the detection node set of the incoming missile; Z h is the target channel number of the hth reconnaissance node in the reconnaissance node set of a certain incoming missile.

[0084] 3.2.2) For each incoming missile, select N / 2 nodes with the smallest Nash equilibrium value from the attack node set and the reconnaissance node set of the incoming missile, respectively, to obtain the attack node subset and the reconnaissance node subset; prune the candidate kill chain set of the incoming missile, and only retain the kill chain where the attack node belongs to the attack node subset and the kill chain where the reconnaissance node belongs to the reconnaissance node subset, and calculate the Nash equilibrium value of each retained candidate kill chain;

[0085] Among them, the Nash equilibrium value of the kill chain is the sum of the Nash equilibrium values ​​of the attack node and the reconnaissance node on it; N is the preset population size, and in an optional implementation mode, the value is 100.

[0086] Population initialization is the first critical step in genetic algorithms, which involves generating an initial population, i.e., a set of potential solutions (chromosomes). The present invention adopts a heuristic initialization method, and performs pre-inspiration when generating the first generation population, and pre-selects the better individuals.

[0087] 3.3) For each candidate kill chain set of an incoming missile, a new population is generated using a genetic algorithm;

[0088] Specifically, for a candidate kill chain set of an incoming missile after deletion, the operation of generating a new population using a genetic algorithm includes the following steps:

[0089] 3.3.1) Initialize the current population corresponding to the incoming missile as the candidate kill chain set after its deletion;

[0090] 3.3.2) Generate a new population for the current population using a genetic algorithm;

[0091] It should be noted that the genetic algorithm used in the present invention can be any genetic algorithm, such as a basic genetic algorithm, a taboo genetic algorithm, etc., which is not limited here. Preferably, the taboo genetic algorithm is used in this embodiment, which mainly includes the following operations:

[0092] Selection: Roulette selection operation, taking the inverse of the Nash equilibrium value of the kill chain as the value of fitness, and selecting individuals with larger fitness values ​​with a greater probability.

[0093] Crossover: Two-point crossover method. Two cut points are randomly generated, and the matching chromosomes are exchanged with the fragments in the cut points to obtain new chromosomes. Specifically, the selected chromosomes are matched head to tail, and a number is randomly generated. If this number is less than the crossover probability, the two chromosomes are used as parent chromosomes to cross and generate two daughter chromosomes. The average fitness value of the parent is used as the expected level, and the fitness value of the parent chromosome is used as the taboo object. All fitness values ​​are stored in the taboo table. If the fitness value of the daughter chromosome is greater than the expected level, the daughter chromosome is retained. If the fitness value of the daughter chromosome is less than the expected level, check whether the fitness value of the daughter chromosome is in the taboo table. If it is not in the taboo table, the daughter chromosome is retained; otherwise, the best parent chromosome is selected to replace the daughter chromosome.

[0094] Mutation: Similarity is used to determine whether to perform a mutation operation. A uniform mutation method can be used to randomly generate the chromosome position to be mutated, and a random integer is used to perform a basic bit mutation at that position.

[0095] It should be noted that the individuals in the above operations refer to the kill chain in the population, the chromosomes also refer to the kill chain, and the exchanged fragments refer to the nodes in the kill chain.

[0096] 3.3.3) Update the current population to the new population, and repeat step 3.3.2) for iteration until the preset number of iterations M is reached; and calculate and record the Nash equilibrium value of each kill chain of the current population in each iteration; wherein, in an optional implementation manner, M is 100.

[0097] 3.3.4) Assign the kill chain corresponding to the minimum Nash equilibrium value under all iterations as the optimal kill chain to the incoming missile;

[0098] Among them, the fitness value used in the genetic algorithm is the inverse of the Nash equilibrium value of the kill chain. The fitness function of the genetic algorithm is also called the evaluation function. The fitness function is a key indicator used in the genetic algorithm to evaluate the quality of individuals and determines the pros and cons of each individual in the problem solution space. Through the fitness function, the genetic algorithm can measure the performance of individuals in the population and select which individuals can continue to reproduce based on their fitness.

[0099] Preferably, in each iteration, the minimum Nash equilibrium value of the individuals (kill chain) in each new generation of population is found. best , and only keep those that satisfy NashE best The individual (kill chain) corresponding to the Nash equilibrium value whose difference is less than 2ε; wherein ε is the Nash equilibrium solution factor, which takes a value of 0.01 in an optional implementation manner.

[0100] 3.3) The optimal kill chain of each incoming missile constitutes the current optimal missile allocation plan to achieve missile defense.

[0101] The above operations ensure that the missile allocation plan can be continuously optimized in a complex battlefield environment by avoiding local optimal solutions, and can dynamically respond to changes in the battlefield situation.

[0102] By scheduling tracking, controlling and attacking three types of nodes, a complete missile interception process is constructed, and the interception strategy is dynamically adjusted according to the actual situation. By introducing the kill chain, the missile interception process is managed in a refined manner, ensuring the efficient execution of the interception mission from detection to the final strike, which can ensure the maximum interception efficiency while minimizing the defense cost.

[0103] The present invention can handle multiple enemy missile targets at the same time. Specifically, it can detect the threat level and position of each target in real time and allocate resources according to actual conditions. By adopting a dynamic allocation mechanism, it is ensured that when dealing with multiple targets at the same time, the response speed can be effectively improved, and the rationality of resource allocation in the case of multiple targets is ensured, and problems such as resource overload or response delay will not occur. In particular, in a high-intensity battlefield environment, multiple threat targets can be dealt with at the same time.

[0104] In an optional implementation, after each mission, a mission report will be automatically generated, which includes key information such as missile allocation, interception success rate, cost-effectiveness evaluation, and resource consumption. The mission report is stored in real time in the database for subsequent defense mission analysis and optimization. Through the generation of mission reports, the system can continuously improve missile interception strategies and provide historical data support to help the defense system better adjust resource allocation and mission planning.

[0105] Among them, the cost-effectiveness evaluation can evaluate the cost-effectiveness of all defense resources to ensure the maximum resource utilization under limited resources. Specifically, the calculation formula of the cost-effectiveness ratio is:

[0106]

[0107] Among them, P hit is the missile’s hit probability; C platform The system is the platform cost; based on the calculated cost-effectiveness ratio, the more cost-effective air defense missiles are allocated first, ensuring that the interception efficiency is maintained while reducing resource waste. Through effective cost and effectiveness evaluation, the system can reduce resource waste and improve the economy of defense missions while ensuring the success rate of missions.

[0108] The present invention is applicable to various complex air defense combat scenarios, and has significant advantages in the following applications:

[0109] Aircraft carrier formation defense: In an aircraft carrier formation, the system can quickly respond to multi-target missile threats and efficiently allocate resources for interception.

[0110] Theater air defense: Facing high-density missile attacks, the system can ensure multi-task parallel processing and maintain efficient resource utilization.

[0111] Urban airspace defense: In urban airspace defense, the system can quickly identify threats and accurately intercept them to ensure urban safety.

[0112] In order to further illustrate the implementation effect of the present invention, the following example experiments are given:

[0113] Assume that in a certain air-to-air missile defense operation, the enemy has multiple incoming targets attacking our positions. In our defensive positions, 32 drones are used as reconnaissance nodes to provide targeting information, 14 unmanned boats and 1 destroyer are used as strike nodes to carry out air-to-air missile defense missions, and the destroyer is used as a command and control node. The incoming targets include LRASM anti-ship missiles and Tomahawk missiles. The composite detection range of each drone is 10-50km, the targeting range is 25km, and the altitude is 1km. Each unmanned boat is equipped with two types of weapons: short-range missiles and medium-range missiles, and each destroyer is equipped with three types of weapons: short-range missiles, medium-range missiles, and long-range missiles. The weapon configuration of each strike node is shown in Table 1, and the parameters of each weapon and the probability of damage to different incoming targets are shown in Table 2.

[0114] Table 1

[0115] Hit Node Number <![CDATA[U1~U 14 ]]> <![CDATA[U 15 ]]> Weapon Configuration <![CDATA[W1×32,W2×8]]> <![CDATA[W1×64,W2×32,W3×16]]>

[0116] Table 2

[0117] Weapon No. <![CDATA[W1]]> <![CDATA[W2]]> <![CDATA[W3]]> Weapon cost (millions) 3 8 10 Strike range(Km) 7 30 150 LRASM anti-ship missile damage probability 0.70 0.80 0.60 Tomahawk missile damage probability 0.75 0.85 0.65

[0118] In order to verify the effectiveness of the improved taboo genetic algorithm proposed in this paper, a kill chain optimization experiment was designed. The present invention constructed three maritime air-to-air missile defense cases and conducted experimental simulations on the uniform attack mode. In the present invention, the parameter population size N is set to 100, the maximum number of iterations M is set to 100, and the Nash equilibrium factor ε is set to 0.01. The number of incoming targets is set to 16 and 32 respectively. The final experimental simulation results are as follows: Figure 3 and Figure 4 As shown; among them, Figure 3 This is the result of interception allocation of 16 incoming missiles in uniform air direction. Figure 4 This is a diagram showing the interception distribution results of 32 incoming missiles in uniform air directions.

[0119] Through the detailed description and specific implementation of the above implementation methods, the effectiveness of the present invention has been verified. First, by acquiring the dynamic data of the enemy missile in real time and combining the state management of one's own defense resources, the system can effectively realize the accurate tracking, control and interception of the enemy missile. Secondly, by introducing the improved taboo genetic algorithm, the missile allocation strategy is intelligently optimized, ensuring that efficient interception task allocation is achieved in complex air defense scenarios with multiple targets and multiple tasks, while maximizing the cost-effectiveness of defense resources. In addition, the cost-effectiveness evaluation function ensures that the interception task achieves the best balance between economy and efficiency, avoiding waste of resources. Finally, the task report generation mechanism provides data support for subsequent task optimization, further improving the overall defense efficiency of the system. Therefore, the above implementation methods verify the technical advantages and practical value of the present invention in improving the anti-missile capability of the air defense system.

[0120] In a second aspect, the present invention provides a missile defense system, comprising: a memory and a processor, wherein the memory stores a computer program, and the processor executes the method provided in the first aspect of the present invention when executing the computer program.

[0121] Specifically, in an optional implementation, the missile defense system includes:

[0122] The enemy missile detection module is used to obtain information about incoming missiles, including the number of incoming missiles and the attributes of each incoming missile; the attributes include: the type, location, and direction of the incoming missile;

[0123] The defense module is used to execute the method provided by the first aspect of the present invention.

[0124] Preferably, in an optional embodiment, the missile defense system further comprises:

[0125] The air defense resource management module is responsible for managing the resources of its own missiles and unmanned boats, and recording the quantity, type, damage probability, range, platform cost, etc. of each defense weapon. By updating this data in real time, the system can dynamically monitor the status of each defense platform and ensure the rational allocation and use of resources.

[0126] Kill chain management module: used to generate a corresponding candidate kill chain set for each incoming missile based on its attributes; the kill chain includes: reconnaissance node, control node and strike node.

[0127] Mission report generation module: used to automatically generate a mission report after each interception mission is completed, recording the mission execution status in detail, including the missile allocation results, hit rate, cost-effectiveness evaluation, and resource consumption, in order to evaluate the overall performance of the system and provide optimization basis for future interception missions. Among them, the mission report can be stored in the database and used for subsequent mission analysis and improvement to enhance the long-term combat effectiveness of the defense system.

[0128] The relevant technical scheme is the same as the missile defense method provided in the first aspect of the present invention, and will not be described in detail here.

[0129] In a third aspect, the present invention further provides a computer-readable storage medium, which includes a stored computer program, wherein when the computer program is executed by a processor, the device where the storage medium is located is controlled to execute the method provided in the first aspect of the present invention.

[0130] The relevant technical scheme is the same as the missile defense method provided in the first aspect of the present invention, and will not be described in detail here.

[0131] It will be easily understood by those skilled in the art that the above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A missile defense method, characterized in that: include: Obtaining relevant information about incoming missiles, including the number of incoming missiles and the attributes of each incoming missile; the attributes include: the type, location, and direction of the incoming missiles; For each incoming missile, a corresponding candidate kill chain set is generated based on its attributes; the kill chain includes: reconnaissance node, control node and strike node; Obtain a strike node set for each incoming missile; the strike node set is a set consisting of all strike nodes in the candidate kill chain set corresponding to the incoming missile; select a strike node from each strike node set to form a strike plan, select a strike plan that meets the strike target, and record the corresponding values ​​of P, V, and R, and then calculate the Nash equilibrium value of each strike node in each strike node set; the strike target includes: maximizing the sum of the damage probabilities P of all incoming missiles, minimizing the sum of the weapon costs V used for all incoming missiles, and minimizing the variance R of the number of strike node weapons for each incoming missile; Obtain a reconnaissance node set for each incoming missile; the reconnaissance node set is a set consisting of all reconnaissance nodes in the candidate kill chain set corresponding to the incoming missile; select a reconnaissance node from each reconnaissance node set to form a reconnaissance plan, select a reconnaissance plan that meets the reconnaissance target, and record the corresponding E and Z values, and then calculate the Nash equilibrium value of each reconnaissance node in each reconnaissance node set; the reconnaissance target includes: maximizing the sum of the reconnaissance time E for all incoming missiles and minimizing the variance Z of the number of target channels of each reconnaissance node at the same time; For each incoming missile: select N / 2 nodes with the smallest Nash equilibrium value from its attack node set and reconnaissance node set respectively to obtain the attack node subset and the reconnaissance node subset; prune the candidate kill chain set of the incoming missile, and only retain the kill chains of the attack nodes belonging to the attack node subset and the kill chains of the reconnaissance nodes belonging to the reconnaissance node subset, and calculate the Nash equilibrium value of each retained candidate kill chain; initialize the current population to the candidate kill chain set after pruning, and use the genetic algorithm to generate a new seed for the current population. The operation of generating a new population is performed, and the new population is further used as the current population to repeatedly perform the operation of generating a new population until the preset number of iterations is reached; and the Nash equilibrium value of each kill chain of the current population is calculated and recorded in each iteration, and the kill chain corresponding to the minimum Nash equilibrium value in all iterations is assigned to the incoming missile as the optimal kill chain; wherein the Nash equilibrium value of the kill chain is the sum of the Nash equilibrium values ​​of the strike node and the reconnaissance node on it; the fitness value used in the genetic algorithm is the reciprocal of the Nash equilibrium value of the kill chain; N is the preset population size; The optimal kill chain of each incoming missile constitutes the current optimal missile allocation plan to achieve missile defense.

2. The missile defense method according to claim 1, characterized in that: The expression of the strike target is: Where n is the number of incoming missiles; r is the total number of strike nodes after deduplication in the strike plan; m i is the number of weapons in the ith attack node after deduplication in the attack plan; i = 1, 2, ..., r; Indicates whether the incoming missile is within the effective attack range of the kth weapon at the i-th strike node. If so, otherwise is the probability of damage of the kth weapon at the i-th attack node to the j-th incoming missile; v ik is the kth weapon cost of the i-th attack node; is a decision variable, indicating whether the kth weapon of the i-th attack node attacks the j-th incoming target. If so, otherwise 3. The missile defense method according to claim 2, characterized in that: The constraints of the strike target include:

4. The missile defense method according to any one of claims 1 to 3, characterized in that: The Nash equilibrium value of the lth attack node in the attack node set of a certain incoming missile is: Among them, P l is the probability of damage to the incoming missile by the lth strike node in the strike node set of a certain incoming missile; V l is the weapon cost used by the lth strike node in the strike node set of a certain incoming missile on the incoming missile; R l is the number of weapons at the lth strike node in the strike node set of a certain incoming missile.

5. The missile defense method according to claim 1, characterized in that: The expression of the reconnaissance target is: Among them, t is the number of non-repeated reconnaissance nodes in the reconnaissance plan; n is the number of incoming missiles; a gj Is the jth incoming missile within the effective targeting range of the gth reconnaissance node? If so, then a gj =1; otherwise a gj =0; z g is the target channel number of the g-th reconnaissance node, g = 1, 2, …, t.

6. The missile defense method according to claim 5, characterized in that: The constraints of the reconnaissance target include: Among them, y gj is a decision variable, which indicates the number of target channels provided by the g-th reconnaissance node after deduplication in the reconnaissance scheme for the attack of the j-th incoming missile.

7. The missile defense method according to claim 1, 5 or 6, characterized in that: The Nash equilibrium value of the hth reconnaissance node in the reconnaissance node set of a certain incoming missile is: Among them, E h is the detection time of the incoming missile by the hth detection node in the detection node set of the incoming missile; Z h is the target channel number of the hth reconnaissance node in the reconnaissance node set of a certain incoming missile.

8. The missile defense method according to claim 1, characterized in that: The genetic algorithm is a taboo genetic algorithm.

9. A missile defense system, characterized in that: include: A memory and a processor, wherein the memory stores a computer program, and the processor executes the method according to any one of claims 1 to 8 when executing the computer program.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes a stored computer program, wherein when the computer program is executed by a processor, the device where the storage medium is located is controlled to execute the method according to any one of claims 1 to 8.

Images