CN114048359A - Automatic matching and dynamic recommendation method and device for combat scheme - Google Patents

Automatic matching and dynamic recommendation method and device for combat scheme Download PDF

Info

Publication number
CN114048359A
CN114048359A CN202111176384.9A CN202111176384A CN114048359A CN 114048359 A CN114048359 A CN 114048359A CN 202111176384 A CN202111176384 A CN 202111176384A CN 114048359 A CN114048359 A CN 114048359A
Authority
CN
China
Prior art keywords
scheme
hit
candidate
schemes
list
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202111176384.9A
Other languages
Chinese (zh)
Other versions
CN114048359B (en
Inventor
王才红
陈豪
许馨月
宫树香
赵思聪
曹扬
吕乃冰
吴京辉
贾帅楠
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
26th Unit 96901 Unit Chinese Pla
Original Assignee
26th Unit 96901 Unit Chinese Pla
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 26th Unit 96901 Unit Chinese Pla filed Critical 26th Unit 96901 Unit Chinese Pla
Priority to CN202111176384.9A priority Critical patent/CN114048359B/en
Priority claimed from CN202111176384.9A external-priority patent/CN114048359B/en
Publication of CN114048359A publication Critical patent/CN114048359A/en
Application granted granted Critical
Publication of CN114048359B publication Critical patent/CN114048359B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/903—Querying
    • G06F16/9035—Filtering based on additional data, e.g. user or group profiles
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/901—Indexing; Data structures therefor; Storage structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
    • G06Q10/06393—Score-carding, benchmarking or key performance indicator [KPI] analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/26—Government or public services

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Data Mining & Analysis (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Primary Health Care (AREA)
  • Health & Medical Sciences (AREA)
  • Computational Linguistics (AREA)
  • General Health & Medical Sciences (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

A method and a device for automatically matching and dynamically recommending a combat scheme are provided. The automatic matching and dynamic recommendation method for the combat scheme comprises the following steps: defining a dynamic target to be hit, wherein a combat scheme of the dynamic target to be hit is stored in a case database in advance, and the scheme in the case database is hierarchically indexed; loading a plan library related to the dynamic target to be hit, and acquiring a candidate scheme list from the plan library; recommending a campaign from the candidate list.

Description

Automatic matching and dynamic recommendation method and device for combat scheme
Technical Field
The invention relates to the field of military operational research, in particular to an automatic matching and dynamic recommendation method and device for an operational scheme.
Background
With the development of equipment technologies such as weapons, detection, communication and the like, modern wars increasingly have the characteristics of large area, high dynamics, fast rhythm, strong confrontation and the like, particularly aiming at fighting tasks for hitting dynamic targets, the real-time requirement is remarkably improved, the perception space is enlarged, the space window of the fighting time is extremely compressed, the hitting tasks cannot be efficiently completed by a traditional 'person-in-loop' control mode, and a command information system with the capabilities of information real-time acquisition and processing, fighting opportunistic command decision making, resource effective management scheduling, system autonomous operation control and the like can be competent. Battle Management (BM) concepts and technologies have been introduced.
The general architecture of a conventional combat management system is shown in fig. 1, and includes decision-level, action-level and execution-level combat management. Under the condition of commanding the operation step by step, the decision-making stage operation management corresponds to an area-level command system, the action level corresponds to a travel (team) level command system, and the execution level corresponds to a specific operation unit, including terminals such as a firepower unit and a detection unit. The decision-level combat management forms a combat scheme according to the mission and the combat target decision; and the action-level combat management generates a task sequence based on the decision result, so that the execution-level combat management executes corresponding actions. Because the striking time of the dynamic target on the battlefield is passed instantly, the decision-making efficiency of planning and deciding the striking of the dynamic target by the decision-making level combat management is the key of success or failure.
Disclosure of Invention
The invention aims to provide an automatic matching and dynamic recommendation method and equipment for an operation scheme, which at least solve the problem of poor retrieval efficiency and accuracy of the operation scheme, realize the quick matching of available schemes matched with operation resources according to operation intentions and real-time situations, and can give recommendation sequencing according to decision intentions of commanders, thereby realizing the beneficial effect of quick decision.
According to an aspect of the present invention, at least one embodiment provides a method for automatically matching a combat plan and dynamically recommending the combat plan, which is suitable for hitting a dynamic target on a battlefield, and comprises: defining a dynamic target to be hit, wherein a combat scheme of the dynamic target to be hit is stored in a case database in advance, and the scheme in the case database is hierarchically indexed; loading a plan library related to the dynamic target to be hit, and acquiring a candidate scheme list from the plan library; recommending a campaign from the candidate list.
According to another aspect of the present invention, at least one embodiment further provides a combat scenario automatic matching and dynamic recommendation device, including: a processor adapted to implement instructions; and a memory adapted to store a plurality of instructions, the instructions adapted to be loaded and executed by the processor to: the invention relates to an automatic matching and dynamic recommending method for a combat scheme.
According to another aspect of the present invention, at least one embodiment further provides a system for automatically matching and dynamically recommending a combat scenario, including: the invention relates to an automatic matching and dynamic recommending device for a combat scheme.
According to another aspect of the present invention, at least one embodiment further provides a non-volatile storage medium readable by a computer, storing computer program instructions, which when executed by the computer, perform the above-mentioned automatic matching and dynamic recommendation method for a combat plan of the present invention.
By the method, the scheme in the case database is subjected to hierarchical indexing in advance based on the battlefield area and the key factors, the key factor sensitivity of the scheme in the scheme library is analyzed, the key factor hierarchical indexing is calculated to quickly give the scheme matching degree, the scheme comprehensive evaluation index is constructed according to the decision preference of a commander, and the recommendation sequence is dynamically generated, so that the quick scheme matching and the dynamic recommendation when the dynamic target to be hit is hit are realized.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the description in the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a schematic diagram of an overall architecture of a combat management system according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a recommendation device for a combat scenario according to an embodiment of the present invention;
fig. 3 is a flowchart of a recommendation method of a scenario according to an embodiment of the present invention.
Detailed Description
The technical solutions of the present invention will be described clearly and completely with reference to the accompanying drawings, and it should be understood that the described embodiments are some, but not all embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
In order to realize the fast and efficient task planning of the combat management system on the dynamic targets, a plan library-based fast planning and decision process is generally adopted, namely: a large number of schemes are planned in advance according to different battle scenes and battle resource plans before the beginning of a war to form a pre-arranged scheme library; when entering into war, according to the upper level combat intention, the latest dynamic target information and combat resource information, quickly matching available schemes from the pre-arranged scheme library and sequencing, and organizing troops to finish shooting preparation after a commander selects the schemes; before receiving a shooting command, when the current scheme is subjected to unexecutable risk due to large movement of the position of a dynamic target, matching available schemes in real time from a pre-scheme library accumulated before warfare according to continuously received dynamic target continuous dynamic information and real-time battlefield resource information, giving recommended ordering according to decision preference of a commander, and assisting the commander to adjust the fighting scheme on the fly; the above-mentioned process is implemented by rolling, and after receiving shooting command, the dynamic target can be quickly and effectively hit according to the scheme.
Therefore, in order to realize a rapid planning and decision-making process based on a plan library, two core problems need to be solved: firstly, designing a battle scene covering various possible dynamic targets to be hit as far as possible, and simulating a mass scheme according to the battle scene; secondly, available schemes matched with the fighting resources can be quickly matched according to the fighting intention and the real-time situation, and recommended sequencing can be given according to the decision intention of the commander, so that quick decision is realized. The main solution to the above core problem is to plan a mass scheme based on experience, and a case retrieval technology is provided in the prior art to solve the above core problem two.
The case retrieval technology is to find one or more cases which are most similar to the current problem from a case base. The core of the case retrieval technology is the strategy and method of case retrieval, and the most common traditional algorithms comprise a nearest neighbor method, an induction index method, a knowledge guidance method, a template retrieval strategy, a hierarchical model and the like. In recent years, with the continuous deepening of intelligent technology research and application, many new intelligent retrieval algorithms are emerging around the fields of medical treatment, electronic commerce, equipment maintenance and the like, such as multi-level scheme retrieval based on a multilayer feedforward neural network, scheme retrieval based on a probability similarity evaluation scale, scheme retrieval based on k neighbor and rough set, retrieval based on a tabu search algorithm and a graph structure, and two-level retrieval based on the combination of fuzzy classification and a nearest neighbor method. Although the method improves the case retrieval efficiency to a certain extent, the case retrieval method in the prior art is difficult to meet the use requirements due to the fact that the dynamic target plan library is large in size, the number of factors contained in each set of scheme is large, the levels are different, the importance is different, the factors are mutually related, and in addition, the continuous change of the position of the dynamic target puts higher requirements on the retrieval efficiency and the retrieval accuracy.
On the basis of the research findings, at least one embodiment of the invention provides an automatic matching and dynamic recommendation method for a combat scheme (referred to as a recommendation method for a combat scheme for short), which is suitable for an automatic matching and dynamic recommendation system for a combat scheme (referred to as a combat management system for short), improves the efficiency and accuracy of retrieval of the combat scheme, and is at least used for solving the second core problem. The above-described combat management system includes decision-level combat program recommendation devices that form a combat program based on mission objectives and combat goal decisions. The recommendation device 200 for the decision-level engagement scenario, as shown in fig. 2, includes: a processor 202; and a memory 204 configured to store computer program instructions adapted to be loaded by the processor and to execute the proposed method of engagement scenario developed by the present invention (which will be described in detail later). Optionally, at least one embodiment of the present invention further provides a non-volatile storage medium readable by a computer, storing computer program instructions, which when executed by the computer, perform a method for recommending a combat plan (which will be described in detail later) developed by the present invention.
The processor 202 may be any suitable processor, such as a central processing unit, a microprocessor, an embedded processor, and the like, and may employ an architecture such as X86, ARM, and the like. The memory 204 may be any suitable memory device, such as a non-volatile memory device, including but not limited to a magnetic memory device, a semiconductor memory device, an optical memory device, etc., and may be arranged as a single memory device, an array of memory devices, or a distributed memory device, which are not limited by embodiments of the present invention.
It will be appreciated by those of ordinary skill in the art that the above-described structure of the recommendation device 200 for a decision-level engagement scenario is merely illustrative and is not intended to limit the structure of the recommendation device 200 for a decision-level engagement scenario. For example, the recommendation device 200 for a decision-level combat scenario may also include more or fewer components (e.g., transmission devices) than shown in FIG. 2. The above-mentioned transmission device is used for receiving or transmitting data via a network. In one example, the transmission device is a Radio Frequency (RF) module, which is used to communicate with the internet in a wireless manner.
In the above operating environment, at least one embodiment of the present invention provides a recommendation method for a combat scheme, which is suitable for hitting a dynamic target in a battlefield, and is loaded and executed by the processor 202, and is at least used for improving efficiency and accuracy of combat scheme retrieval, and solving the second core problem. The dynamic target refers to a hitting object which has maneuvering capability and changes the spatial position with time on a battlefield. As shown in the flowchart of FIG. 3, the steps shown in the flowchart of the figure may be performed in a computer system such as a set of computer-executable instructions, and while a logical order is shown in the flowchart, in some cases the steps shown or described may be performed in an order different than here, the method may include the steps of:
step S301, a dynamic target to be hit is determined, wherein a combat scheme of the dynamic target to be hit is stored in a case database in advance, and the scheme in the case database is hierarchically indexed;
step S303, loading a plan library related to the dynamic target to be hit, and acquiring a candidate scheme list from the plan library;
in step S305, a battle plan is recommended from the candidate plan list.
It should be noted that each schema in the schema database is hierarchically indexed. Optionally, a hierarchical index of the plan database is pre-established based on a battlefield area and key factors, the battlefield is divided into a plurality of non-overlapping areas, and the key factors describe important attributes constituting a combat plan, such as an army, a combat zone, a weapon platform, an ammunition type, a target hit, a damage requirement, and the like, for example:
1. dividing the battlefield into Nr non-overlapping regions { R1，R2，…，RNrAnd establishing a scheme candidate list set T for each areajJ is more than or equal to 1 and less than or equal to Nr, and each set is an empty set at the beginning.
2. Go through all schemes S1，S2，…，SNsAnd battlefield area { R }1，R2，…，RNrIf scheme SkCan cover the battlefield region RjThen the scheme S is corresponded tokJoining a corresponding set Tj. The attack grouping refers to the grouping relation that a specific army uses a specific weapon to carry a specific ammunition to attack a specific target in a specific combat zone, namely:
Figure BDA0003295247280000071
min R angei≤min Dij≤max Dij≤max R angeiwhere M is the total number of attack groups, RangeiUsing range of weapon for ith attack consist, DijThe distance between the position of the unit grouped for the ith attack and any position in the jth battlefield area. As an example, Nr is 12, and the result of the candidate scenario corresponding to each battlefield area is shown in table 1:
TABLE 1 scheme candidate list set T corresponding to each battlefield areajExamples of the invention
Battlefield area serial number Set of candidate list of solutions Tj
1 0001，0002，…，4776，4780
2 0002，0004，…，4998，5000
… …
12 0001，0003，…，4991，4999
3. All key factors x for the scheme1，x2，…，xnCalculate its sensitivity, i.e.:
Figure BDA0003295247280000072
wherein, sensitivity (x)i)、wiAnd f (x)i) The sensitivity, the weight coefficient and the measurement method of the ith key factor are respectively.
4. All key factors are ranked in descending order of sensitivity value { x1，x2，…，xnAnd (4) satisfying: sensitivity (x)1)≥sensitivity(x2)≥…≥sensitivity(xn) Wherein x isk∈{x1，x2，…，xn}，1≤k≤n。
5. For each solution candidate list set TjJ is more than or equal to 1 and less than or equal to Nr, and hierarchical clustering is carried out according to key factors arranged in descending order, namely all schemes in the set are firstly clustered according to x1Clustering to obtain a plurality of subclasses, and then, according to the scheme in each subclass, obtaining a plurality of subclasses2Clustering is performed, proceeding in this manner until the preset is satisfied. An example is as follows, with respect to the set of pattern candidate lists TjThe hierarchical indexing was performed with the results shown in table 2:
TABLE 2 examples of results of hierarchical clustering of battlefield areas
Figure BDA0003295247280000081
In step S301, a dynamic target to be hit is specified, wherein a combat plan of the dynamic target to be hit is stored in a case database in advance, and the plans in the case database are hierarchically indexed. The dynamic target to be hit refers to an object to be hit which has maneuvering capability and the spatial position of which changes with time on a battlefield. Optionally, the upper level of the subject's operational intention defines the dynamic target to be hit and the damage requirement, and the upper level operational intention is illustrated in table 3:
TABLE 3 example of upper level operational intentions (operational mission data)
Figure BDA0003295247280000091
In step S303, a plan library related to the dynamic target to be hit is loaded, and a candidate plan list is acquired from the plan library.
Optionally, loading a plan library associated with the dynamic target to be hit may include: reading a plurality of sets of scheme data related to the dynamic target to be hit from a scheme database, wherein the plurality of sets of scheme data related to the dynamic target to be hit form a plan library of the dynamic target to be hit, and each set of scheme in the plan library comprises data of troops, places, hitting waves, weapon platforms, ammunition types, weapon numbers, attacked targets and the like. An example is as follows, a set of data of the dynamic target plan library to be hit is shown in table 4:
table 4 example of database of dynamic target plan to be hit
Figure BDA0003295247280000092
Optionally, obtaining the candidate solution list from the solution library may include: continuously acquiring real-time data of enemies, our feelings and/or battlefield environments, wherein the enemies comprise at least one of the type, the position, the positioning accuracy, the maneuvering speed, the maneuvering direction, the carrying countermeasures and the performance state, the deployment and the performance state of peripheral countermeasures, the feelings comprise at least one of the formation, the deployment position, the carrying weapons and ammunition conditions and the equipment state of an army, and the battlefield environments comprise at least one of the meteorological forecast information of army deployment regions, the meteorological forecast information of weapon airway and the meteorological forecast information of the region of an object to be struck; and acquiring a candidate scheme list of the dynamic target to be hit from a scheme library according to the real-time data.
For example, the latest information of the dynamic target to be hit is continuously received and loaded in real time from the information security department, and comprises the data of the type, the position, the positioning precision, the maneuvering speed, the maneuvering direction, the carrying countermeasures and the performance state, the deployment of the countermeasures and the performance state around the target, and the like. And continuously receiving and loading the latest state information of the army in real time from the command control department, wherein the latest state information comprises data of army formation, deployment position, weapon and ammunition carrying condition, equipment state and the like. The latest weather forecast information of the battlefield is continuously received and loaded in real time from a weather guarantee department, and the latest weather forecast information comprises the weather forecast information of the deployment region of the army, the weather forecast information of the weapon airway, the weather forecast information of the region where the dynamic target to be hit is located and other data. Example of enemy, my, and/or battlefield data, as shown in tables 5, 6, 7:
TABLE 5 examples of enemy data
Serial number Striking target Target grade Object type
1 L3 5 2
2 M3 4 3
TABLE 6I am data example
Figure BDA0003295247280000101
Figure BDA0003295247280000111
TABLE 7 battlefield data examples
Serial number Environmental attributes Specific grade
1 Weather (meteorology) 5
For example, according to the real-time data of the current position of the dynamic target to be hit, a candidate scheme set corresponding to a battlefield area where the dynamic target to be hit is located is selected, for the selected candidate scheme set, the category to which the feasible candidate scheme belongs is sequentially selected based on a hierarchical index structure of key factors until the last layer, and a candidate scheme set corresponding to the minimum subclass, that is, a candidate scheme list of the dynamic target to be hit, is obtained.
In step S305, a battle plan is recommended from the candidate plan list. Optionally, the available candidate solutions in the candidate solution list are screened by a first screen, where the first screen is an availability screen; secondly, screening matching candidate schemes in the available candidate schemes, wherein the second screening is a superiority and inferiority screening; and thirdly, screening the matched operation schemes in the candidate schemes, wherein the third screening is operation preference screening.
The first screening is availability screening, that is, availability screening is performed on all the schemes in the candidate scheme set corresponding to the minimum subclass. The usability screening sets available check items, and the available check items include: army availability, weapon type satisfaction, weapon attack scope satisfaction, weapon firing safety, number of targets hit, target level hit, target type hit, target damage requirement, ammunition type availability, countermeasure satisfaction, weather satisfaction, and/or route threat situation. The above-described check term calculation does not need to be repeated for the check terms that have been calculated as the key factors in step S302. Thus, the available candidates in the first filtered candidate list may include: the candidate list is checked for availability based on the available check terms. The usability screening is shown in Table 8:
table 8 example of results of scheme availability checks
Figure BDA0003295247280000121
For example, check for troops availability. For the teams used by the scheme, it is checked whether the sum of the number of weapons used by each team exceeds the number of weapons available, i.e.:
Figure BDA0003295247280000122
Figure BDA0003295247280000123
wherein, a1The results are calculated for the military availability check items,
Figure BDA0003295247280000124
i is 1, …, N is the sum of the number of weapons used by the ith team, and N is the number of teams used by the current scheme; MaxD (maximum numerical data interchange) deviceiAnd i is 1, …, and N is the number of currently available weapons for the ith army.
For example, weapon type satisfaction is checked. For each attack grouping of the scheme, it is checked whether the weapon type is consistent with the weapon type currently armed by the army, i.e.:
Figure BDA0003295247280000125
Figure BDA0003295247280000126
wherein, a2Calculating the result of the weapon type satisfaction check item, wherein M is the total number of attack groups, and if the weapon type of the attack groups is consistent with the weapon type of the current army equipment, WQi0, otherwise WQi＝1。
For example, weapon attack range satisfaction is checked. For each attack grouping of the scheme, it is checked whether the target of attack is within the scope of attack of the weapon, i.e.:
Figure BDA0003295247280000127
Figure BDA0003295247280000131
wherein, a3Calculating results for weapon attack range satisfaction check items, M is the total number of attack groups,
Figure BDA0003295247280000132
Figure BDA0003295247280000133
is the geographic location coordinates of the troops,
Figure BDA0003295247280000134
to hit the geographical location coordinates of the target, D (ZC)i，MBi) Is the distance of the troop from the target,
Figure BDA0003295247280000135
and
Figure BDA0003295247280000136
respectively, the minimum range and the maximum range of the weapon.
For example, the weapon firing safety is checked. For each attack consist of the scenario, it is checked whether the weapon flight path passes through the no-pass zone, i.e.:
Figure BDA0003295247280000137
Figure BDA0003295247280000138
wherein, a4Calculating the result of the weapon shooting safety check item, wherein M is the total number of attack groups, and JX is the time when the weapon flight path passes through the passing-prohibited areai0, otherwise JXi＝1。
For example, the number of hit targets is checked. Aiming at the targets hit by the scheme, checking whether the number of hit dynamic targets exceeds the hit number of the dynamic targets to be hit required by the upper level, namely:
Figure BDA0003295247280000139
wherein, a5Checking the result of the item calculation for the number of dynamic objects to be struck, s0S is the number of striking targets required by the upper level.
For example, the hit target level is checked. For the target hit by the scheme, checking whether the hit target level covers the hit target level required by the upper level, namely:
Figure BDA00032952472800001310
Figure BDA00032952472800001311
wherein, a6Calculating results for hit target level check items, JB0The JB is a set formed by the target levels of attack in the scheme and the battle requirement target levels.
For example, the hit target type is checked. For the target hit by the scheme, it is checked whether the hit target type covers the hit target type required by the upper level, that is:
Figure BDA0003295247280000141
Figure BDA0003295247280000142
wherein, a7To hit the target type check item calculation result, LX0LX is a set of batting target types required by the battle.
For example, a hit target damage requirement is checked. Aiming at the targets hit by the scheme, whether the damage requirements of the hit targets are consistent with the combat requirements is checked, namely:
Figure BDA0003295247280000143
Figure BDA0003295247280000144
wherein, a8Checking the item calculation result for the damage requirement of the hit target, wherein N is the total number of the hit targets, and HS is used if the damage requirement of the hit targets is consistent with the combat requirementi0, otherwise HSi＝1。
For example, the ammunition type availability is checked. For each attack grouping of the scheme, it is checked whether the type of ammunition used by the scheme is consistent with the type of ammunition currently equipped by the army, i.e.:
Figure BDA0003295247280000145
wherein, a9Calculating the result of the ammunition type availability check item, wherein M is the total number of attack groups, and if the ammunition type of the attack groups is equal to the armyThe currently equipped ammunition types are consistent, then ZDBi0, otherwise ZDBiThe number of weapons used to group the attack. Calculating the total number b of ammunition types needing to be replaced in the scheme9Namely:
Figure BDA0003295247280000146
for example, the countermeasure satisfaction is checked. For each attack grouping of the scheme, it is checked whether the type of countermeasure used by the weapon of the scheme is consistent with the type of countermeasure used by the weapon currently armed by the army, i.e.:
Figure BDA0003295247280000147
wherein, a10The result is calculated for the satisfaction check term of the type of countermeasure, M is the total number of attack marshalling, and ZD is the number of attacks marshalling if the type of countermeasure in the attack marshalling is consistent with the type of countermeasure used by the weapon currently armed by the armyi0, otherwise ZDiThe number of weapons used is grouped for the attack. When the countermeasure used by the weapon is not consistent with the requirement, the total number of countermeasures that the scheme needs to be replaced is calculated, namely:
Figure BDA0003295247280000151
wherein, b10The total number of countermeasures that need to be replaced for a solution.
For example, weather satisfaction is checked. And aiming at the meteorological conditions corresponding to the scheme, checking whether the meteorological conditions are consistent with those of the current task, namely:
Figure BDA0003295247280000152
wherein, a11For weather satisfaction check term calculation results, QX0QX is the weather level in the scenario and the current forecasted weather level. Calculating the meteorological grade deviation condition, namely: b11＝|QX-QX0L wherein b11Is the degree of deviation of the meteorological scale.
For example, a route threat situation is checked. For each attack group, checking whether the weapon flight path passes through an interception area pre-deployed by an enemy,namely:
Figure BDA0003295247280000153
Figure BDA0003295247280000154
wherein, a12Calculating the result of the inspection item for the air route threat situation, wherein M is the total number of attack marshalling, and if the weapon flight path of the attack marshalling does not pass through the interception area, LJi0, otherwise LJiThe number of passes through the interception area is grouped for the attack. Calculating the total number b of the interception areas passed by the scheme12Namely:
Figure BDA0003295247280000155
the second screening is a merit screening. This dominance and disadvantage screening sets up the evaluation index, and the evaluation index includes: availability comprehensive matching degree, battlefield situation and superior intention matching degree evaluation, control time evaluation, countermeasure capacity evaluation, task completion time evaluation, total resource consumption evaluation and/or deployment adjustment cost evaluation. Thus, the second screening of available candidates for a matching candidate may include: and evaluating the superiority and inferiority of the available candidate schemes based on the evaluation indexes.
For example, usability integrated matching degree evaluation. Calculating the comprehensive matching degree P of each scheme of the available candidate schemes in the first screening candidate scheme listmatchAnd dividing the scheme into three categories according to the calculation result of the comprehensive matching degree: pmatchScheme 1 is class I, representing fully available; 0<Pmatch<Scheme 1 is class II, which stands for available after conditioning; pmatch<Scheme 0 is class III, representing not available. Alternatively, P may be selectedmatchK with the highest value1And (4) calculating the matching values of the schemes for the current battlefield situation and the superior intention one by one.
Figure BDA0003295247280000161
λjIs a weight coefficient; v. of1＝PmatchWherein v is1Computing results for the comprehensive degree of match evaluation term。
For example, control time evaluation. Calculating the time for the dynamic target to be struck to be out of the effective attack range of the weapon, namely:
Figure BDA0003295247280000162
wherein v is2And the calculation result of the evaluation item for the control time, M is the total number of attack groups,
Figure BDA0003295247280000163
is the geographic location coordinates of the troops,
Figure BDA0003295247280000164
to hit the geographical location coordinates of the target, D (ZC)i，MBi) Is the distance of the troop from the target,
Figure BDA0003295247280000165
and
Figure BDA0003295247280000166
respectively the minimum range and the maximum range of the weaponiThe maximum travel speed of the target is struck for the attack consist.
For example, an ability to fight assessment. Calculating the comprehensive confrontation capacity of the scheme, namely:
Figure BDA0003295247280000167
Figure BDA0003295247280000168
wherein v is3For the results of the countervailing ability evaluation term calculations, M is the total number of attack consists,
Figure BDA0003295247280000169
the ability of the weapon complement countermeasures used to group the attack to cope with the interception threat.
For example, task completion time assessment. Calculating the total time for the solution to complete the task, namely:
Figure BDA00032952472800001610
wherein v is4Evaluating the result for the task completion time, M being the total number of attack marshalls, roundiGrouping the associated transmission sub-sequences for attack, D (ZC)i，MBi) Is the distance between the army and the target, and L is the maximum range of the weapon.
Such as a total resource consumption assessment. Calculating the fighting resource consumption condition of the scheme, namely:
Figure BDA00032952472800001611
wherein v is5Calculating the result of the total resource consumption evaluation item, N is the number of weapon platforms used, DiTotal number of weapons used for each attack consist, ViIs the value weight of the weapon.
For example, deployment adjustment cost evaluation. Calculating the cost required to be paid by troops for deployment or weapon state adjustment when the executing scheme is changed into the current scheme, namely: v. of6＝ω1nBD+ω2nWQ+ω3nZDB+ω4nZDWherein v is6Adjusting cost evaluation term computation results for deployment, ωiWhere i is 1, 2, 3, 4 is a weight coefficient, and n isBD、nWQ、nZDB、nZDThe number of adjustments needed for the army, weapon platform, ammunition and countermeasure, respectively.
The third screening is the battle preference screening. The battle preference screening sets priority elements, and the priority elements comprise: matching degree, firepower control time, guidance capability, task execution time, total resource consumption and deployment adjustment cost. Thus, the third screening of matching candidate schemes for the target engagement scheme may include: calculating comprehensive recommendation degree P of the scheme according to the priority elements of the commanderrecommendAccording to the comprehensive recommendation degree P from all the matching candidate schemesrecommendDescending order of values, selecting K2(K2≤K1) And the other is taken as a recommended scheme.
For example, the director prefers a high match priority, namely:
Figure BDA0003295247280000171
Figure BDA0003295247280000172
the commander prefers that the firepower control time is long, namely:
Figure BDA0003295247280000173
Figure BDA0003295247280000174
the commander prefers to have strong guidance capability, namely:
Figure BDA0003295247280000175
Figure BDA0003295247280000176
the director preference is that the task execution time is short-first, namely:
Figure BDA0003295247280000177
the preference of the commander is that the total consumption of resources is less preferred, namely:
Figure BDA0003295247280000178
the director preference adjusts the low-cost priority for deployment, namely:
Figure BDA0003295247280000179
there is no particular preference, namely:
Figure BDA00032952472800001710
Figure BDA00032952472800001711
wherein,
Figure BDA00032952472800001712
and the weight coefficient of the s-th evaluation index in the t-th recommendation preference is obtained.
The recommended scenario after the second and third screening is shown in table 9:
table 9 example of recommended scenario results
Figure BDA00032952472800001713
Figure BDA0003295247280000181
In summary, the method for recommending the combat plan provided by the invention can be said to be a method for automatically matching and dynamically recommending the plan based on hierarchical clustering of key factors and decision preference, and can improve the efficiency of searching, matching and recommending the plan by more than 160 times, thereby greatly improving the efficiency of matching and recommending the plan in a massive plan library and realizing real-time and dynamic planning of striking dynamic targets.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.

Claims (10)

1. A recommendation method of a combat plan is suitable for hitting dynamic targets on a battlefield, and is characterized by comprising the following steps:
defining a dynamic target to be hit, wherein a combat scheme of the dynamic target to be hit is stored in a case database in advance, and the scheme in the case database is hierarchically indexed;
loading a plan library related to the dynamic target to be hit, and acquiring a candidate scheme list from the plan library;
recommending a campaign from the candidate list.
2. The recommendation method of claim 1, wherein recommending a combat scenario from the list of candidate scenarios comprises:
a first screening of available candidates in a candidate list, wherein the first screening is an availability screening;
secondly, screening matching candidate schemes in the available candidate schemes, wherein the second screening is a superiority and inferiority screening;
and thirdly, screening the matched operation schemes in the candidate schemes, wherein the third screening is operation preference screening.
3. The recommendation method of claim 2, the availability filter setting available check items, the available check items comprising: the method comprises the following steps of troop availability, weapon type satisfaction, weapon attack range satisfaction, weapon shooting safety, hit target number, hit target grade, hit target type, hit target damage requirement, ammunition type availability, countermeasure satisfaction, weather satisfaction and airway threat situation, wherein available candidates in a first screening candidate list comprise:
performing availability checking on the candidate list based on available checking terms, wherein:
checking the troops used by the schemes in the candidate scheme list, and judging whether the sum of the number of weapons used by the troops exceeds the available number of weapons; and/or
Checking attack groups of the schemes in the candidate scheme list, and judging whether the weapon type is consistent with the weapon type of the current army equipment; and/or
Checking attack grouping of the schemes in the candidate scheme list, and judging whether the dynamic target to be hit is in a weapon attack range; and/or
Checking attack groups of the schemes in the candidate scheme list, and judging whether a weapon flight path passes through a passing prohibition area or not; and/or
Checking hit targets of the schemes in the candidate scheme list, and judging whether the number of hit targets exceeds the required number of hit dynamic targets to be hit; and/or
Checking the hit target of the scheme in the candidate scheme list, and judging whether the hit target level covers the required dynamic target level to be hit; and/or
Checking the hit target of the scheme in the candidate scheme list, and judging whether the hit target type covers the required dynamic target type to be hit; and/or
Checking hit targets of the schemes in the candidate scheme list, and judging whether damage requirements of the hit targets are consistent with combat requirements; and/or
Checking attack grouping of the schemes in the candidate scheme list, and judging whether the ammunition type used by the schemes is consistent with the ammunition type currently equipped by the army; and/or
Checking the attack groups of the schemes in the candidate scheme list, and judging whether the countermeasure types of the weapons used by the schemes are consistent with the countermeasure types used by the weapons currently equipped by the army; and/or
Checking the weather condition corresponding to the scheme in the candidate scheme list, and judging whether the weather condition is consistent with the weather condition of the current task; and/or
And checking attack groups of the schemes in the candidate scheme list, and judging whether the weapon flight path passes through an interception area pre-deployed by an enemy.
4. The recommendation method according to claim 2, wherein the merit screening sets an evaluation index including: the method comprises the following steps of availability comprehensive matching degree, control time evaluation, countermeasure capacity evaluation, task completion time evaluation, total resource consumption evaluation and deployment adjustment cost evaluation, wherein the second screening of matching candidate schemes in available candidate schemes comprises the following steps:
and evaluating the superiority and inferiority of the available candidate schemes based on the evaluation indexes, wherein:
evaluating the matching values of the available candidate schemes for the current battlefield situation and the superior intention; and/or
Evaluating the time of the available candidate scheme for the dynamic target to be hit to be out of the effective attack range of the weapon; and/or
Evaluating the capability of the weapon complete set countermeasure used by the available candidate scheme attack grouping to deal with the interception threat; and/or
Evaluating a total time for completion of the task for the available candidate solutions; and/or
Evaluating the combat resource consumption of the available candidate schemes; and/or
The available candidate solutions are evaluated for the cost of the arming or weapon state adjustment required after the solution change being performed.
5. The recommendation method of claim 2, the combat preference filter setting a priority element, the priority element comprising: matching degree, firepower control time, guidance capacity, task execution time, total resource consumption and deployment adjustment cost, wherein the fighting scheme in the third screening and matching candidate scheme comprises the following steps:
acquiring the comprehensive recommendation degree of the matching candidate scheme according to the priority factors of the commander;
and recommending a combat scheme according to the comprehensive recommendation degree.
6. The recommendation method of claim 1, wherein loading a plan library associated with the dynamic target to hit comprises:
and reading a plurality of sets of schemes related to the dynamic target to be hit from the scheme database.
7. The recommendation method of claim 1, wherein obtaining the list of candidate solutions from the solution library comprises:
continuously acquiring real-time data of enemies, conditions and/or battlefield environments, wherein the enemies comprise at least one of types, positions, positioning accuracy, maneuvering speed, maneuvering direction, carrying countermeasures and performance states, and deployment and performance states of peripheral countermeasures, the conditions of the enemies comprise at least one of army formation, deployment positions, carrying weapons and ammunition conditions and equipment states, and the battlefield environments comprise at least one of army deployment regional weather forecast information, weapon airway weather forecast information and weather forecast information of areas where objects to be struck are located;
and acquiring a candidate scheme list of the dynamic target to be hit from a scheme library according to the real-time data.
8. The recommendation method of claim 1, wherein specifying a dynamic target to hit comprises;
the upper level of the affected war intention defines the dynamic target to be hit and the damage requirement.
9. The recommendation method of claim 1, pre-building a hierarchical index of the solution database based on battlefield areas and key factors, wherein the battlefield is divided into a plurality of non-overlapping areas, the key factors include army, battle territory, weapon platform, ammunition type, target strike and/or damage requirement elements, further comprising:
establishing a scheme candidate list set for each battlefield area;
and clustering the schemes in the scheme candidate list set according to key factors to obtain a plurality of subclasses so as to establish a hierarchical index of a scheme database.
10. A recommendation device for a combat scenario, comprising:
a processor adapted to implement instructions; and
a memory adapted to store a plurality of instructions, the instructions adapted to be loaded and executed by the processor: a recommendation method for a combat program as claimed in any one of claims 1 to 9.
CN202111176384.9A 2021-10-09 Automatic matching and dynamic recommending method and equipment for combat scheme Active CN114048359B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111176384.9A CN114048359B (en) 2021-10-09 Automatic matching and dynamic recommending method and equipment for combat scheme

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111176384.9A CN114048359B (en) 2021-10-09 Automatic matching and dynamic recommending method and equipment for combat scheme

Publications (2)

Publication Number Publication Date
CN114048359A true CN114048359A (en) 2022-02-15
CN114048359B CN114048359B (en) 2024-11-15

Family

ID=

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114863049A (en) * 2022-05-19 2022-08-05 广州贵博地理信息技术有限公司 Sand table battle processing method and system based on geographic information
CN115840840A (en) * 2023-02-20 2023-03-24 中国电子科技集团公司第二十八研究所 Situation awareness plan optimal selection ordering method for learning focus
CN115854784A (en) * 2023-02-17 2023-03-28 中国人民解放军96901部队 Double-gear rolling task planning method
CN115964640A (en) * 2022-10-06 2023-04-14 北京理工大学 Improved template matching-based secondary target clustering method

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110271822A1 (en) * 2010-05-04 2011-11-10 Makor Issues And Rights Ltd. Automatic Real Time Command and Control System
CN111339240A (en) * 2020-02-10 2020-06-26 北京达佳互联信息技术有限公司 Object recommendation method and device, computing equipment and storage medium
CN111598321A (en) * 2020-05-09 2020-08-28 中国电子科技集团公司第二十八研究所 Information-driven combat management system and method
CN113112079A (en) * 2021-04-19 2021-07-13 中国人民解放军96901部队26分队 Task allocation method based on heuristic dynamic deepening optimization algorithm
CN113139697A (en) * 2021-05-12 2021-07-20 中国人民解放军军事科学院评估论证研究中心 Intelligent force correlation method based on combat simulation
CN113255916A (en) * 2021-05-31 2021-08-13 成都卡莱博尔信息技术股份有限公司 Using method of combat knowledge system and combat decision auxiliary method
CN113469853A (en) * 2021-05-13 2021-10-01 航天科工空间工程发展有限公司 Method for accelerating command control of fighting and artificial intelligence device

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110271822A1 (en) * 2010-05-04 2011-11-10 Makor Issues And Rights Ltd. Automatic Real Time Command and Control System
CN111339240A (en) * 2020-02-10 2020-06-26 北京达佳互联信息技术有限公司 Object recommendation method and device, computing equipment and storage medium
CN111598321A (en) * 2020-05-09 2020-08-28 中国电子科技集团公司第二十八研究所 Information-driven combat management system and method
CN113112079A (en) * 2021-04-19 2021-07-13 中国人民解放军96901部队26分队 Task allocation method based on heuristic dynamic deepening optimization algorithm
CN113139697A (en) * 2021-05-12 2021-07-20 中国人民解放军军事科学院评估论证研究中心 Intelligent force correlation method based on combat simulation
CN113469853A (en) * 2021-05-13 2021-10-01 航天科工空间工程发展有限公司 Method for accelerating command control of fighting and artificial intelligence device
CN113255916A (en) * 2021-05-31 2021-08-13 成都卡莱博尔信息技术股份有限公司 Using method of combat knowledge system and combat decision auxiliary method

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114863049A (en) * 2022-05-19 2022-08-05 广州贵博地理信息技术有限公司 Sand table battle processing method and system based on geographic information
CN114863049B (en) * 2022-05-19 2023-05-23 广州贵博地理信息技术有限公司 Sand table combat processing method and system based on geographic information
CN115964640A (en) * 2022-10-06 2023-04-14 北京理工大学 Improved template matching-based secondary target clustering method
CN115964640B (en) * 2022-10-06 2023-09-12 北京理工大学 Improved template matching-based secondary target grouping method
CN115854784A (en) * 2023-02-17 2023-03-28 中国人民解放军96901部队 Double-gear rolling task planning method
CN115854784B (en) * 2023-02-17 2023-09-19 中国人民解放军96901部队 Double-gear rolling task planning method
CN115840840A (en) * 2023-02-20 2023-03-24 中国电子科技集团公司第二十八研究所 Situation awareness plan optimal selection ordering method for learning focus

Similar Documents

Publication Publication Date Title
Yu et al. A knee-guided differential evolution algorithm for unmanned aerial vehicle path planning in disaster management
CN113255916A (en) Using method of combat knowledge system and combat decision auxiliary method
WO2002101594A2 (en) Method and apparatus for determining and assessing information to be collected based on information-theoretic measures
CN101893441A (en) Unmanned aerial vehicle flight path optimization method based on deviation maximization and grey correlation analysis
CN107944694A (en) A kind of equipment Safeguard operational process analysis method towards operational performance
Radovanović et al. Application of the fuzzy AHP-VIKOR hybrid model in the selection of an unmanned aircraft for the needs of tactical units of the armed forces
Gazibey et al. Interaction among the Criteria Affecting Main Battle Tank Selection: An Analysis with DEMATEL Method.
Stodola et al. Model of optimal cooperative reconnaissance and its solution using metaheuristic methods
Dağıstanlı Induced generalized intuitionistic fuzzy OWA operator on GRA method for evaluation of self-propelled artillery system: Ammunition based computer assisted military experiment
CN111369101A (en) Task planning method based on double-layer particle swarm optimization
CN114048359B (en) Automatic matching and dynamic recommending method and equipment for combat scheme
CN114048359A (en) Automatic matching and dynamic recommendation method and device for combat scheme
CN113177583A (en) Aerial target clustering method
Feng et al. Research on Threat Assessment evaluation model based on improved CNN algorithm
CN106851689B (en) Multifactor method for allocating tasks in wireless sensor and actor network
CN106996789B (en) Multi-airborne radar cooperative detection airway planning method
Longyue et al. Optimal index shooting policy for layered missile defense system
CN114529205B (en) Mosaic warfare system capacity demand satisfaction evaluation method and related equipment
Deng et al. Interference resource scheduling algorithm based on potential game for UAV cooperative combat
Bisht et al. APSO Based Automated Planning in Constructive Simulation.
SHAMAMI et al. A HYBRID BA-VNS ALGORITHM FOR SOLVING THE WEAPON TARGET ASSIGNMENT CONSIDERING MOBILITY OF RESOURCES.
Naseem et al. Real-time decision support system for resource optimization & management of threat evaluation and weapon assignment engineering in air defence
Song et al. Air Defense Deployment of Anti-reconnaissance Based on Immune Optimization Algorithm with Nested Double Particle Swarm
Kebir et al. A multi-agent model for countering terrorism
Yingying et al. Evaluation of UAV reconnaissance scheme based on grey multi-level synthesis method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant