A method and device for automatic matching and dynamic recommendation of combat plans

By calculating the sensitivity of key factors in the hierarchical index in the case database and the plan database and dynamically generate recommendation sorting, the problem of poor retrieval efficiency and accuracy of dynamic target strike schemes in traditional combat management systems is solved, and the beneficial effect of rapid decision-making is achieved.

CN114048359BActive Publication Date: 2024-11-15中国人民解放军96901部队26分队
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111176384.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-10-09
Publication Date
2024-11-15
Estimated Expiration
2041-10-09

AI Technical Summary

Technical Problem

When traditional combat management systems face dynamic target strikes, the program retrieval efficiency and accuracy are poor, making it difficult to quickly match available solutions that match combat resources, and it is difficult to give recommendations based on the commander's decision-making intentions, resulting in inefficient decision-making.

Method used

By hierarchically indexing the combat plans for dynamic targets to be attacked in the case database, loading the relevant plan database, calculating the sensitivity of key factors, building comprehensive evaluation indicators of the plan, dynamically generating recommendation sorting, and achieving rapid solution matching and recommendation.

Benefits of technology

It greatly improves the efficiency and accuracy of combat plan retrieval, can quickly match available solutions that match combat resources in a massive plan database, and give recommendations according to the commander's decision-making preferences to achieve rapid decision-making.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114048359B_ABST
    Figure CN114048359B_ABST
Patent Text Reader

Abstract

A method and device for automatic matching and dynamic recommendation of combat plans. The method comprises: clarifying a dynamic target to be attacked, wherein the combat plan of the dynamic target to be attacked is pre-stored in a case database, and the plans in the case database are hierarchically indexed; loading a plan library related to the dynamic target to be attacked, and obtaining a list of candidate plans from the plan library; and recommending a combat plan from the list of candidate plans.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to the field of military operations research, and in particular to a method and device for automatic matching and dynamic recommendation of combat plans. Background Art

[0002] With the development of weapons, detection, communication and other equipment technologies, modern warfare is increasingly characterized by large areas, high dynamics, fast tempo, and strong confrontation. Especially for combat missions against dynamic targets, the real-time requirements are significantly improved, the perception space is expanded, and the combat time and space window is extremely compressed. The traditional "man in the loop" control method is no longer able to efficiently complete the strike mission. Only command information systems with the capabilities of real-time information acquisition and processing, improvisation of combat command and decision-making, effective resource management and scheduling, and autonomous system operation control can be competent. The concept and technology of Battle Management (BM) came into being.

[0003] The overall architecture of the traditional combat management system is as follows: Figure 1 As shown in the figure, the system includes decision-making level, action level and execution level combat management. In the case of step-by-step command and operation, the decision-making level combat management corresponds to the regional command system, the action level corresponds to the brigade (regiment) level command system, and the execution level corresponds to specific combat units, including terminals such as firepower units and detection units. The decision-making level combat management forms a combat plan based on the mission and combat goal decisions; the action-level combat management generates a task sequence based on the decision results for the execution-level combat management to perform corresponding actions. Since the opportunity to strike dynamic targets on the battlefield is fleeting, the efficiency of decision-making level combat management in planning and making decisions on the strikes on dynamic targets is the key to success or failure. Summary of the invention

[0004] The purpose of the present invention is to provide a method and device for automatic matching and dynamic recommendation of combat plans, which at least solves the problem of poor efficiency and accuracy in combat plan retrieval, and can quickly match available plans that match combat resources according to combat intentions and real-time situations, and can give recommended rankings based on the commander's decision intentions, thereby achieving the beneficial effect of rapid decision-making.

[0005] According to one aspect of the present invention, at least one embodiment provides a method for automatic matching and dynamic recommendation of combat plans, which is suitable for attacking dynamic targets on the battlefield, including: clarifying the dynamic target to be attacked, wherein the combat plan of the dynamic target to be attacked is pre-stored in a case database, and the plans in the case database are hierarchically indexed; loading a plan library related to the dynamic target to be attacked, and obtaining a list of candidate plans from the plan library; and recommending a combat plan from the list of candidate plans.

[0006] According to another aspect of the present invention, at least one embodiment also provides a device for automatic matching and dynamic recommendation of combat plans, including: a processor, suitable for implementing various instructions; and a memory, suitable for storing multiple instructions, wherein the instructions are suitable for being loaded and executed by the processor: the above-mentioned method for automatic matching and dynamic recommendation of combat plans of the present invention.

[0007] According to another aspect of the present invention, at least one embodiment further provides a system for automatic matching and dynamic recommendation of combat plans, including: the above-mentioned automatic matching and dynamic recommendation device for combat plans of the present invention.

[0008] According to another aspect of the present invention, at least one embodiment further provides a computer-readable non-volatile storage medium that stores computer program instructions. When the computer executes the program instructions, the above-mentioned method for automatic matching and dynamic recommendation of combat plans of the present invention is executed.

[0009] Through the above method, the plans in the case database are pre-indexed based on the battlefield area and key factors, the key factor sensitivity of the plans in the plan library is analyzed, and the key factor hierarchical index is calculated to quickly give the plan matching degree, and the comprehensive evaluation index of the plan is constructed according to the commander's decision-making preference and the recommended ranking is dynamically generated, realizing rapid plan matching and dynamic recommendation when striking dynamic targets to be struck. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings in the following description are some implementation methods of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0011] Figure 1 is a schematic diagram of the overall architecture of a combat management system according to an embodiment of the present invention;

[0012] Figure 2 is a schematic diagram of recommended equipment for a combat scheme according to an embodiment of the present invention;

[0013] Figure 3 It is a flow chart of a method for recommending a combat plan according to an embodiment of the present invention. DETAILED DESCRIPTION

[0014] The technical solution of the present invention will be described clearly and completely below in conjunction with the accompanying drawings. Obviously, the described embodiments are only 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.

[0015] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0016] In order to achieve rapid and efficient task planning for dynamic targets in the combat management system, a rapid planning and decision-making process based on a plan library is generally adopted, namely: before the start of the war, a large number of plans are prepared in advance according to different combat scenarios and combat resource assumptions to form a plan library; when entering the war, according to the superior's combat intentions, the latest dynamic target information and combat resource information, the available plans are quickly matched and sorted from the plan library, and the commander organizes the troops to complete the shooting preparation after selecting the plan; before receiving the shooting order, when the dynamic target position moves significantly and the current plan will face the risk of being unexecutable, according to the continuous dynamic intelligence of the dynamic target continuously received, combined with real-time battlefield resource information, the available plans are matched in real time from the plan library accumulated before the war, and the recommended ranking is given according to the commander's decision-making preference to assist the commander in adjusting the combat plan on the spot; the above process is executed in a rolling manner until the shooting order is received, and the dynamic target is quickly and effectively hit according to the plan.

[0017] It can be seen that in order to achieve a rapid planning and decision-making process based on the plan library, two core problems need to be solved: first, to design as many possible engagement scenarios as possible to cover dynamic targets to be attacked, and to formulate a large number of plans based on the engagement scenarios; second, to be able to quickly match available plans that match combat resources based on combat intent and real-time situation, and to be able to give recommended rankings based on the commander's decision intent, so as to achieve rapid decision-making. The main solution to the above core problem one is to formulate a large number of plans based on experience, and a case retrieval technology is provided in the prior art for the above core problem two.

[0018] The case retrieval technology is to find one or more cases that are most similar to the current problem from the case library. The core of the above case retrieval technology is the strategy and method of case retrieval. The most commonly used ones include the nearest neighbor method, inductive indexing method, knowledge-guided method, template retrieval strategy and hierarchical model and other traditional algorithms. In recent years, with the continuous deepening of intelligent technology research and application, many new intelligent retrieval algorithms have emerged in the fields of medical care, e-commerce, equipment maintenance, etc., such as multi-level solution retrieval based on multi-layer feedforward neural network, solution retrieval based on probability similarity evaluation scale, solution retrieval based on k-nearest neighbor and rough set, retrieval based on taboo search algorithm and graph structure, and two-level retrieval based on fuzzy classification and nearest neighbor method. Although the above methods have improved the efficiency of case retrieval to a certain extent, due to the huge volume of dynamic target plan library, each set of plans contains a large number of factors, different levels, different importance and interrelationships between factors, and the constant change of dynamic target position puts forward higher requirements for retrieval efficiency and accuracy, resulting in the case retrieval methods of existing technologies being difficult to meet the use requirements.

[0019] Based on the above research findings, at least one embodiment of the present invention provides a method for automatic matching and dynamic recommendation of combat plans (hereinafter referred to as the combat plan recommendation method), which is applicable to the automatic matching and dynamic recommendation system for combat plans (hereinafter referred to as the combat management system), improves the efficiency and accuracy of combat plan retrieval, and is at least used to solve the above core problem 2. The above combat management system includes a decision-level combat plan recommendation device, which forms a combat plan based on the mission and combat goal decision. The decision-level combat plan recommendation device 200, such as Figure 2 As shown, it includes: a processor 202; and a memory 204, which is configured to store computer program instructions, and the computer program instructions are suitable for being loaded by the processor and executing the recommended method for the combat plan developed by the present invention (which will be described in detail later). Optionally, at least one embodiment of the present invention also provides a computer-readable non-volatile storage medium, which stores computer program instructions, and when the computer executes the program instructions, the recommended method for the combat plan developed by the present invention is executed (which will be described in detail later).

[0020] The processor 202 may be any suitable processor, for example, implemented in the form of a central processing unit, a microprocessor, an embedded processor, etc., and may adopt an architecture such as X86, ARM, etc. The memory 204 may be any suitable storage device, for example, a non-volatile storage device, including but not limited to a magnetic storage device, a semiconductor storage device, an optical storage device, etc., and may be arranged as a single storage device, a storage device array, or a distributed storage device, which is not limited in the embodiments of the present invention.

[0021] Those skilled in the art will appreciate that the structure of the above-mentioned decision-level combat plan recommendation device 200 is only for illustration and does not limit the structure of the decision-level combat plan recommendation device 200. For example, the decision-level combat plan recommendation device 200 may also include Figure 2 The transmission device is used to receive or send data via a network. In one embodiment, the transmission device is a radio frequency (RF) module, which is used to communicate with the Internet wirelessly.

[0022] In the above operating environment, at least one embodiment of the present invention proposes a method for recommending a combat plan, which is applicable to attacking dynamic targets on the battlefield, and is loaded and executed by the processor 202, at least for improving the efficiency and accuracy of combat plan retrieval, and solving the above core problem 2. The above dynamic target refers to an attack target on the battlefield that has mobility and whose spatial position changes over time. Figure 3 The flowchart of the recommended method of the combat plan shown in the accompanying drawings should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although the logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in a different order than here. The method may include the following steps:

[0023] Step S301, identifying the dynamic target to be attacked, wherein the combat plan of the dynamic target to be attacked is pre-stored in a case database, and the plans in the case database are hierarchically indexed;

[0024] Step S303, loading a plan library related to the dynamic target to be attacked, and obtaining a list of candidate plans from the plan library;

[0025] Step S305, recommending an operational plan from the candidate plan list.

[0026] It should be noted that each plan in the plan database is hierarchically indexed. Optionally, a hierarchical index of the plan database is pre-established based on the battlefield area and key factors. The battlefield is divided into multiple non-overlapping areas. The key factors describe important attributes of the combat plan, such as troops, combat areas, weapon platforms, ammunition types, strike targets, damage requirements, etc. For example:

[0027] 1. Divide the battlefield into Nr non-overlapping areas {R 1 , R 2 , …, R Nr}, and establish a candidate list set T for each region j , 1≤j≤Nr, initially, each set is an empty set.

[0028] 2. Traverse all solutions {S 1 , S 2 , …, S Ns} and battlefield area {R 1 , R 2 , …, R Nr}, if Scheme S k The attack range of each attack group can cover the battlefield area R j , then the corresponding solution S k Add the corresponding set T j The above-mentioned attack formation refers to the formation relationship of a specific force using specific weapons and carrying specific ammunition to attack a specific target in a specific combat area, namely: min Range i ≤min D ij ≤max D ij ≤max Range i , where M is the total number of attack groups, Range i The range of the weapon used by the i-th attack group, D ij is the distance between the position of the troops of the i-th attack formation and any position in the j-th battlefield area. For example, Nr = 12, and the candidate solutions corresponding to each battlefield area are shown in Table 1:

[0029] Table 1 Set of candidate lists of solutions corresponding to each battlefield area T j Example

[0030] Battlefield area number <![CDATA[Set T of solution candidate lists j > 1 0001,0002,…,4776,4780 2 0002,0004,…,4998,5000 … … 12 0001,0003,…,4991,4999

[0031] 3. For all key factors of the solution {x 1 , x 2 , …, x n}, calculate its sensitivity, that is: Among them, sensitivity (x i ), w i and f(x i ) are the sensitivity, weight coefficient and measurement method of the ith key factor respectively.

[0032] 4. Arrange all key factors in descending order of sensitivity {x 1 , x 2 , …, x n}, satisfying: sensitivity(x 1 )≥sensitivity(x 2 )≥…≥sensitivity(x n ), where x k ∈{x1 , x 2 , …, x n}, 1≤k≤n.

[0033] 5. For each candidate list set T j , 1≤j≤Nr, hierarchical clustering is performed according to the key factors in descending order, that is, all the solutions in the set are first clustered according to x 1 Clustering is performed to obtain several subclasses, and then the solutions in each subclass are divided according to x 2 Clustering is performed, and this process is continued until the preset conditions are met. For example, for the candidate list set T j Perform hierarchical indexing, and the results are shown in Table 2:

[0034] Table 2 Example of hierarchical clustering results for each battlefield area

[0035]

[0036] In step S301, the dynamic target to be hit is identified, wherein the combat plan for the dynamic target to be hit is pre-stored in the case database, and the plan in the case database is hierarchically indexed. The above-mentioned dynamic target to be hit refers to an object to be hit that has mobility on the battlefield and whose spatial position changes over time. Optionally, the dynamic target to be hit and the damage requirements are identified by receiving the superior combat intent. An example of the superior combat intent is shown in Table 3:

[0037] Table 3 Example of superior combat intent (combat mission data)

[0038]

[0039] In step S303, a plan library related to the dynamic target to be attacked is loaded, and a list of candidate plans is obtained from the plan library.

[0040] Optionally, loading a plan library related to a dynamic target to be struck may include: reading multiple sets of plan data related to the dynamic target to be struck from a plan database, wherein the multiple sets of plan data related to the dynamic target to be struck constitute a plan library of the dynamic target to be struck, wherein each set of plans in the plan library includes data such as troops, positions, strike waves, weapon platforms, ammunition types, number of weapons, and targets to be attacked. An example is as follows, a set of plan library data for a dynamic target to be struck is shown in Table 4:

[0041] Table 4 Example of data in the dynamic target plan library to be attacked

[0042]

[0043] Optionally, obtaining a list of candidate plans from the plan library may include: continuously obtaining real-time data on the enemy situation, our situation and / or battlefield environment, wherein the enemy situation includes at least one of the type of dynamic target to be struck, its location, positioning accuracy, maneuvering speed, maneuvering direction, carried countermeasure equipment and performance status, and surrounding countermeasure equipment deployment and performance status; our situation includes at least one of troop composition, deployment location, carried weapons and ammunition, and equipment status; and the battlefield environment includes at least one of weather forecast information for troop deployment areas, weapon route weather forecast information, and weather forecast information for the area where the target to be struck is located; obtaining a list of candidate plans for dynamic targets to be struck from the plan library based on real-time data.

[0044] For example, continuously receive and load in real time the latest intelligence information of dynamic targets to be hit from the intelligence support department, including data such as target type, location, positioning accuracy, maneuvering speed, maneuvering direction, carried countermeasure equipment and performance status, deployment and performance status of countermeasure equipment around the target, etc. Continuously receive and load in real time the latest status information of the troops from the command and control department, including data such as troop composition, deployment location, weapons and ammunition carried, equipment status, etc. Continuously receive and load in real time the latest weather forecast information of the battlefield from the meteorological support department, including data such as weather forecast information of the troop deployment area, weather forecast information of weapon routes, and weather forecast information of the area where the dynamic targets to be hit are located. Examples of enemy situation, our situation and / or battlefield data are shown in Tables 5, 6, and 7:

[0045] Table 5 Example of enemy situation data

[0046] Serial number Target Target level Target Type 1 L3 5 2 2 M3 4 3

[0047] Table 6 Example of my sentiment data

[0048]

[0049]

[0050] Table 7 Battlefield data example

[0051] Serial number Environment properties Specific level 1 meteorological 5

[0052] For example, based on the real-time data of the current location of the dynamic target to be hit, a set of candidate solutions corresponding to the battlefield area where the dynamic target to be hit is located is selected. For the selected set of candidate solutions, based on the hierarchical index structure of key factors, the categories to which feasible candidate solutions belong are selected in turn until the last layer, and a set of candidate solutions corresponding to the smallest subclass is obtained, that is, a list of candidate solutions for the dynamic target to be hit.

[0053] In step S305, an operational plan is recommended from the candidate plan list. Optionally, the available candidate plans in the candidate plan list are first screened, wherein the first screening is availability screening; the matching candidate plans in the available candidate plans are second screened, wherein the second screening is pros and cons screening; and the operational plans in the matching candidate plans are third screened, wherein the third screening is operational preference screening.

[0054] The first screening is the availability screening, that is, the availability screening is performed on all the solutions in the candidate solution set corresponding to the smallest subclass. The above availability screening sets available check items, and the available check items include: troop availability, weapon type satisfaction, weapon attack range satisfaction, weapon shooting safety, number of strike targets, strike target level, strike target type, strike target damage requirements, ammunition type availability, countermeasure satisfaction, meteorological satisfaction and / or route threat conditions. For the above check item calculation, there is no need to repeat the calculation for the check items that have been calculated as key factors in step S302. Therefore, the available candidate solutions in the first screening candidate solution list may include: performing an availability check on the candidate solution list based on the available check items. An example of availability screening is shown in Table 8:

[0055] Table 8 Example of solution availability check results

[0056]

[0057] For example, check the availability of troops. For the troops used in the plan, check whether the sum of the number of weapons used by each troop exceeds the number of available weapons, that is: Among them, a 1 Calculates the results for the troop availability check item, i=1, ..., N is the total number of weapons used by the i-th unit, and N is the number of units mobilized in the current plan; MaxD i , i=1,…, N is the number of weapons currently available to the i-th unit.

[0058] For example, check the weapon type satisfies. For each attack group in the plan, check whether the weapon type is consistent with the weapon type currently equipped by the troops, that is: Among them, a 2 is the calculation result of the weapon type satisfaction check item, M is the total number of attack groups, if the weapon type of the attack group is consistent with the weapon type currently equipped by the unit, then WQ i =0, otherwise WQ i =1.

[0059] For example, check the weapon attack range satisfaction. For each attack group in the plan, check whether the target is within the weapon attack range, that is: Among them, a 3 is the calculation result of the weapon attack range satisfaction check item, M is the total number of attack groups, The geographical coordinates of the troops. is the geographical coordinates of the target, D(ZC i , M.B. i ) is the distance between the unit and the target, and The minimum and maximum ranges of the weapon, respectively.

[0060] For example, check the safety of weapon shooting. For each attack formation in the plan, check whether the weapon flight path passes through the prohibited area, that is: Among them, a 4 is the calculation result of the weapon shooting safety check item, M is the total number of attack formations, if the weapon flight path passes through the prohibited area, then JX i =0, otherwise JX i =1.

[0061] For example, check the number of targets to be hit. For the targets to be hit in the plan, check whether the number of dynamic targets to be hit exceeds the number of dynamic targets to be hit required by the superior, that is: Among them, a 5 is the calculation result of the check item of the number of dynamic targets to be hit, s 0 is the number of targets in the plan, and s is the number of targets required by the superior.

[0062] For example, check the target level. For the target to be attacked in the plan, check whether the target level covers the target level required by the superior, that is: Among them, a 6 The calculation result of the strike target level check item, JB 0 It is a set of target levels in the plan, and JB is a set of target levels required by the operation.

[0063] For example, check the target type. For the target to be attacked in the plan, check whether the target type covers the target type required by the superior, that is: Among them, a 7 Calculation result for the target type check item, LX 0 is a set of target types in the plan, and LX is a set of target types required by the operation.

[0064] For example, check the damage requirements of the target. For the target to be attacked in the plan, check whether the damage requirements of the target are consistent with the combat requirements, that is: Among them, a 8 is the calculation result of the damage requirement check item of the strike target, N is the total number of strike targets, if the damage requirement of the strike target is consistent with the combat requirement, then HS i =0, otherwise HS i =1.

[0065] For example, check the availability of ammunition types. For each attack group in the plan, check whether the type of ammunition used in the plan is consistent with the type of ammunition currently equipped by the troops, that is: Among them, a 9 is the calculation result of the ammunition type availability check item, M is the total number of attack groups, if the ammunition type of the attack group is consistent with the ammunition type currently equipped by the unit, then ZDB i =0, otherwise ZDB i The number of weapons used for this attack formation. The total number of ammunition types that need to be replaced in the calculation plan b 9 ,Right now:

[0066] For example, check the countermeasures for each attack group in the plan, check whether the countermeasures used by the weapons in the plan are consistent with the countermeasures used by the weapons currently equipped by the troops, that is: Among them, a 10 is the calculation result of the countermeasure type satisfaction check item, M is the total number of attack formations, if the countermeasure type of the attack formation is consistent with the countermeasure type used by the weapons currently equipped by the troops, then ZD i =0, otherwise ZD i The number of weapons used for this attack formation. When the countermeasures used by the weapons are inconsistent with the requirements, the total number of countermeasures that need to be replaced in the calculation plan is: Among them, b 10 The total number of countermeasures that need to be replaced for the solution.

[0067] For example, check the weather satisfaction. Check whether the weather conditions corresponding to the plan are consistent with the weather conditions of the current task, that is: Among them, a 11 is the calculation result of the meteorological satisfaction check item, QX 0 is the meteorological level in the plan, QX is the current forecasted meteorological level. Calculate the meteorological level deviation, that is: b 11 =|QX-QX 0 |, where b 11 is the weather level deviation.

[0068] For example, check the route threat situation. For each attack formation, check whether the weapon flight path passes through the enemy's pre-deployed interception area, that is: Among them, a 12 is the calculation result of the route threat situation check item, M is the total number of attack formations, if the attack formation's weapon flight path does not pass through the interception area, then LJ i =0, otherwise LJ i The number of interception areas that the attack group passes through. The total number of interception areas that the calculation plan passes through b 12 ,Right now:

[0069] The second screening is the pros and cons screening. The pros and cons screening sets evaluation indicators, which include: comprehensive availability matching, battlefield situation and superior intention matching evaluation, control time evaluation, confrontation capability evaluation, task completion time evaluation, total resource consumption evaluation and / or deployment adjustment cost evaluation. Therefore, the second screening of matching candidate solutions among available candidate solutions may include: evaluating the pros and cons of available candidate solutions based on the evaluation indicators.

[0070] For example, the comprehensive matching degree of availability is evaluated. Calculate the comprehensive matching degree P of each available candidate solution in the first screening candidate solution list. match According to the comprehensive matching calculation results, the solutions are divided into three categories: P match =1 is Class I, which means it is fully available; 0 <P match The scheme with a value <1 is Class II, which means it can be used after adjustment; P match The solution <0 is Class III, which means it is not available. Optionally, you can choose P match The highest value K 1 The matching value of each plan (or all plans) to the current battlefield situation and the superior's intention is calculated one by one. λ j is the weight coefficient; v 1 =P match , where v 1 Calculation result of comprehensive matching evaluation item.

[0071] For example, control time evaluation. Calculate the time it takes for a dynamic target to leave the effective attack range of the weapon, that is: Among them, v 2 is the calculation result of the control time evaluation item, M is the total number of attack groups, The geographical coordinates of the troops. is the geographical coordinates of the target, D(ZC i , M.B. i ) is the distance between the unit and the target, and The minimum and maximum ranges of the weapon, velocity i The maximum speed at which an attack group can strike a target.

[0072] For example, the evaluation of adversarial capability. The comprehensive adversarial capability of the calculation scheme is: Among them, v 3 is the result of the countermeasure capability evaluation, M is the total number of attack groups, The ability to provide countermeasures to the weapons used by the attack formation to deal with interception threats.

[0073] For example, task completion time evaluation. Calculate the total time for the solution to complete the task, that is: Among them, v 4 is the calculation result of the task completion time evaluation item, M is the total number of attack groups, round i is the launch wave sequence of the attack formation, D(ZC i , M.B. i ) is the distance between the unit and the target, and L is the maximum range of the weapon.

[0074] For example, the total resource consumption assessment. Calculate the operational resource consumption of the plan, that is: Among them, v 5 is the result of the total resource consumption evaluation, N is the number of weapon platforms used, D i is the total number of weapons used by each attack group, V i The value weight of the weapon.

[0075] For example, deployment adjustment cost assessment. Calculate the cost of changing from the currently executed plan to the current plan due to the deployment of troops or the adjustment of weapon status, that is: v 6 =ω 1 n BD +ω 2 n WQ +ω 3 n ZDB +ω 4 n ZD , where v 6 is the calculation result of the deployment adjustment cost evaluation item, ω i , i=1, 2, 3, 4 are weight coefficients, n BD 、n WQ 、n ZDB 、n ZD These are the numbers that need to be adjusted for troops, weapon platforms, ammunition, and countermeasures.

[0076] The third screening is the combat preference screening. The combat preference screening sets priority factors, which include: matching degree, fire control time, guidance capability, mission execution time, total resource consumption, and deployment adjustment cost. Therefore, the target combat plan in the third screening matching candidate plan can include: calculating the comprehensive recommendation degree P of the plan according to the commander's priority factors recommend , from all matching candidate solutions according to the comprehensive recommendation degree P recommend In descending order of values, select K 2 (K 2 ≤K 1 ) as the recommended solution.

[0077] For example, the commander's preference is to prioritize high matching, that is: The commander's preference is to give priority to the longer fire control time, that is: The commander's preference is to prioritize strong guidance capabilities, namely: The commander's preference is to prioritize the shortest mission execution time, that is: The commander's preference is to prioritize the total resource consumption, that is: The commander's preference is to prioritize deployment with low adjustment cost, that is: No particular preference, i.e.: in, is the weight coefficient of the sth evaluation indicator in the tth recommendation preference.

[0078] After the second and third screenings, examples of recommended solutions are shown in Table 9:

[0079] Table 9 Example of results of recommended solutions

[0080]

[0081]

[0082] To sum up, the combat plan recommendation method provided by the present invention can be said to be an automatic matching and dynamic recommendation method for plans based on hierarchical clustering of key factors and decision preferences. It can improve the efficiency of plan retrieval, matching and recommendation by more than 160 times, greatly improving the efficiency of plan matching and recommendation under a massive plan library, and realizing real-time and dynamic planning of strikes on dynamic targets to be struck.

[0083] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or replace some or all of the technical features therein with equivalents. However, these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for recommending a combat plan, suitable for attacking dynamic targets on the battlefield, characterized in that: include: Determine the dynamic target to be attacked, wherein the combat plan of the dynamic target to be attacked is pre-stored in a case database, and the plans in the case database are hierarchically indexed; Loading a plan library related to the dynamic target to be attacked, and obtaining a list of candidate plans from the plan library; recommending a combat plan from the list of candidate plans; A hierarchical index of the solution database is pre-established based on battlefield areas and key factors, wherein the battlefield is divided into multiple non-overlapping areas, and the key factors include troops, combat areas, weapon platforms, ammunition types, strike targets and / or damage requirements combat elements, and also include: Establish a candidate list of options for each battlefield area; Clustering the solutions in the solution candidate list set according to key factors to obtain a number of subclasses, thereby establishing a hierarchical index of the solution database; Wherein, obtaining a list of candidate solutions from the plan library includes: Continuously acquire real-time data on the enemy situation, our situation and / or battlefield environment, wherein the enemy situation includes at least one of the type of dynamic target to be attacked, its location, positioning accuracy, maneuvering speed, maneuvering direction, carried countermeasure equipment and performance status, and surrounding countermeasure equipment deployment and performance status; the our situation includes at least one of the troop composition, deployment location, carried weapons and ammunition, and equipment status; and the battlefield environment includes at least one of weather forecast information for the troop deployment area, weather forecast information for the weapon route, and weather forecast information for the area where the target to be attacked is located; Obtain a list of candidate plans for dynamic targets to be attacked from the plan library based on real-time data; The recommended operational plans from the candidate plan list include: First screening available candidate solutions in the candidate solution list, wherein the first screening is availability screening; Second, screening the matching candidate solutions among the available candidate solutions, wherein the second screening is a screening of advantages and disadvantages; The third filter matches the operational plans among the candidate plans, wherein the third filter is an operational preference filter.

2. The recommendation method according to claim 1, wherein the availability screening sets available check items, and the available check items include: Force availability, weapon type satisfaction, weapon attack range satisfaction, weapon shooting safety, number of targets, target level, target type, target damage requirements, ammunition type availability, countermeasure satisfaction, weather satisfaction, route threat conditions, among which the available candidate solutions in the first screening candidate solution list include: A usability check is performed on the candidate solution list based on available check items, wherein: Check the troops used in the candidate solutions to determine whether the total number of weapons used by the troops exceeds the number of available weapons; and / or Check the attack formation of the plan in the candidate plan list to determine whether the weapon type is consistent with the weapon type currently equipped by the troops; and / or Check the attack grouping of the solutions in the candidate solution list to determine whether the dynamic target to be attacked is within the weapon attack range; and / or Checking the attack formations in the candidate list to determine whether the weapon flight path passes through a prohibited area; and / or Checking the targets to be struck by the solutions in the candidate solution list to determine whether the number of targets to be struck exceeds the required number of dynamic targets to be struck; and / or Checking the targets hit by the solutions in the candidate solution list to determine whether the level of the hit targets covers the required level of the dynamic targets to be hit; and / or Checking the targets to be attacked by the solutions in the candidate solution list to determine whether the types of the targets to be attacked cover the required types of dynamic targets to be attacked; and / or Checking the targets to be struck in the candidate solutions list to determine whether the damage requirements of the targets to be struck are consistent with the operational requirements; and / or Check the attack formation of the plan in the candidate plan list to determine whether the type of ammunition used in the plan is consistent with the type of ammunition currently equipped by the troops; and / or Check the attack formations of the solutions in the candidate solution list to determine whether the countermeasure types of the weapons used in the solutions are consistent with the countermeasure types used by the weapons currently equipped by the troops; and / or Check the meteorological conditions corresponding to the solutions in the candidate solution list to determine whether they are consistent with the meteorological conditions of the current task; and / or Check the attack formation of the plan in the candidate plan list to determine whether the weapon flight path passes through the enemy's pre-deployed interception area.

3. According to the recommendation method of claim 1, the merit screening sets evaluation indicators, and the evaluation indicators include: Comprehensive availability matching, control time evaluation, confrontation capability evaluation, task completion time evaluation, total resource consumption evaluation, and deployment adjustment cost evaluation. The matching candidate solutions in the second screening of available candidate solutions include: The available candidate solutions are evaluated based on the evaluation indicators, where: Evaluate the matching value of available candidate solutions to the current battlefield situation and superior intentions; and / or Evaluate the time it takes for the candidate solutions to move dynamic targets out of the weapon's effective range; and / or Assess the ability of candidate attack formations to use weapons and countermeasures to counter interception threats; and / or Estimating the total time it would take to complete the task using the candidate solutions; and / or Assess the operational resource implications of available alternatives; and / or Evaluate the cost of changing the available candidate options from the one currently being implemented due to adjustments in troop deployment or weapon status.

4. The recommendation method according to claim 1, wherein the operational preference screening sets priority factors, and the priority factors include: Matching degree, fire control time, guidance capability, mission execution time, total resource consumption, deployment adjustment cost, among which, the combat plans in the third screening matching candidate plan include: Obtain the comprehensive recommendation of matching candidate solutions based on commanders’ priority factors; Recommend combat plans based on the comprehensive recommendation level.

5. The recommendation method according to claim 1, wherein: Loading the plan library related to the dynamic target to be attacked includes: Multiple sets of plans related to the dynamic targets to be attacked are read from the plan database.

6. The recommendation method according to claim 1, wherein: The dynamic targets to be attacked include: Receive combat intent from superiors and clarify dynamic targets to be struck and damage requirements.

7. A recommended equipment for a combat plan, including: a processor adapted to implement the instructions; as well as A memory, suitable for storing a plurality of instructions, wherein the instructions are suitable for being loaded and executed by a processor: a method for recommending a combat plan as described in any one of claims 1-6.