CN109255491A - A kind of cooperative air-defense mission planning method and system of many types of antiaircraft weapon - Google Patents

A kind of cooperative air-defense mission planning method and system of many types of antiaircraft weapon Download PDF

Info

Publication number
CN109255491A
CN109255491A CN201811160508.2A CN201811160508A CN109255491A CN 109255491 A CN109255491 A CN 109255491A CN 201811160508 A CN201811160508 A CN 201811160508A CN 109255491 A CN109255491 A CN 109255491A
Authority
CN
China
Prior art keywords
interception
weapon
air defense
target
constraint
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
CN201811160508.2A
Other languages
Chinese (zh)
Other versions
CN109255491B (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.)
Shanghai Institute of Electromechanical Engineering
Original Assignee
Shanghai Institute of Electromechanical Engineering
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 Shanghai Institute of Electromechanical Engineering filed Critical Shanghai Institute of Electromechanical Engineering
Priority to CN201811160508.2A priority Critical patent/CN109255491B/en
Publication of CN109255491A publication Critical patent/CN109255491A/en
Application granted granted Critical
Publication of CN109255491B publication Critical patent/CN109255491B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • 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/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • 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

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Tourism & Hospitality (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Marketing (AREA)
  • General Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (AREA)
  • Game Theory and Decision Science (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Aiming, Guidance, Guns With A Light Source, Armor, Camouflage, And Targets (AREA)

Abstract

The present invention provides a kind of cooperative air-defense mission planning method and system of many types of antiaircraft weapon, according to the performance indicator of many types of antiaircraft weapon and the track of aerial target, estimate each weapon to the interception initial time of each target, interception finish time, interception number, determine all kinds of constraint conditions, using numerical optimisation algorithms, plan multiple weapons to the interception timing of multiple targets in controlled situation, the cooperative air-defense task indicated with " period-weapon-target " corresponding relationship is obtained, optimal interception fighting effect is reached.The present invention is suitable for the mission plan of many types of antiaircraft weapon, commander's aid decision, Operational Capability Assessment etc..

Description

Collaborative air defense task planning method and system for multi-type air defense weapons
Technical Field
The invention relates to the field of air defense, calculation and calculation, in particular to a collaborative air defense task planning method and system for a multi-type air defense weapon.
Background
Modern air defense systems generally comprise multiple weapons, which form a full-air-space and multi-layer fire distribution system combining high altitude, hollow and low altitude and long-distance, medium-range and short-range. Because the performance of different air defense weapons is different and the number of the air defense weapons and the capability of resisting multiple targets are limited, the combat tasks of the multiple air defense weapons need to be reasonably planned, the fire power is reasonably distributed, and the optimal combat effect is achieved.
Mission planning is a Dynamic Weapon-Target Allocation Problem that divides the total engagement time into a series of time periods long enough to allow all or part of the Weapon to shoot the Target and see the effect until shooting cannot be continued in each time period (see Patrick A Hosei, et al. 2.1990, research report "Some analytical Results for the Dynamic weather-Target Allocation Problim"). The dynamic weapon-target distribution problem is generally solved by adopting a staged optimization mode, a task scheme expressed by a corresponding relation of time period-weapon-target is formed, and research is carried out on ground attack (see ballistic science report of Yangqisong and the like, 2 nd 2017, 'ground attack weapon-target distribution modeling and decision making'), missile defense (fire scheduling in double-layer fire cooperative counter-guidance operation in system engineering and electronic technology, 2016 and 8 th, shaojian and the like), naval vessel air defense (command control and simulation, 3 rd stage 2015 and sequential strategy-based naval vessel formation multistage fire distribution, the like) and the like as application backgrounds. However, human factors are introduced into the division of the fighting time period, so that firepower gaps among all stages are easily caused, especially for air defense mission planning, a plurality of targets often cannot enter the intercepting areas of different weapons simultaneously according to the optimal condition, and the different weapons shoot different targets at different times, so that the division of the time period is determined by the longest shooting time, and partial weapons with shorter shooting time lose the opportunity of shooting other targets. In view of the above problems, a new cooperative air defense mission planning method for multiple types of air defense weapons needs to be researched.
Disclosure of Invention
Aiming at the defects in the prior art, the invention aims to provide a collaborative air defense task planning method and a collaborative air defense task planning system for a multi-type air defense weapon.
According to the invention
A collaborative air defense mission planning method for a multi-type air defense weapon comprises the following steps:
an estimation step: estimating the interception starting time, the interception ending time and the interception times of each weapon on each target according to the performance index and each target track of each weapon;
a constraint determining step: determining the quantity constraint of the targets intercepted by the weapons at the same time, the quantity constraint of the weapons intercepted by the targets at the same time, the interception times constraint of the targets and the interception favorable degree of the weapons to the targets;
matrix establishment: establishing an interception starting time matrix, an interception ending time matrix and an interception profitability matrix of each weapon on each target according to the result of the estimation step and the result of the constraint determination step;
a conversion step: converting the collaborative air defense task planning problem of the multi-type air defense weapon into a constrained optimization problem according to the established matrix, wherein the optimization index is the total interception profitability, and the constraint comprises non-time conflict constraint and interception frequency constraint;
solving: and solving the constrained optimization problem by adopting a numerical optimization algorithm to obtain a collaborative air defense task planning scheme of the multi-type air defense weapon.
Preferably, in the constraint determination step, the interception profitability of each weapon on each target is determined by the probability q of each weapon killing each targetijDetermining according to weapon WiFor target TjNumber of interception nijAnd the killing probability q calculation of each interception, namely:
preferably, in the matrix establishing step, the number of weapons W is n, the number of targets T is m, and the interception start time matrix T of each target by each weapon0Intercept end time matrix TfThe interception profitability matrix Q has the form:
in the formula, tij0Representative weapon WiFor target TjInterception start time, tijfRepresentative weapon WiFor target TjInterception end time of qijRepresentative weapon WiFor target TjThe degree of interception is favorable.
Preferably, in the solving step, a numerical optimization algorithm is used to solve the constrained optimization problem, and the obtained optimal solution D has the following form:
in the formula (d)ij0 or 1, dij1 represents in [ tij0,tijf]By weapon W during time periodiIntercept target Tj，dij0 represents in [ tij0,tijf]Weapon in time period WiNot intercepting target Tj。
Preferably, in the converting step, the time-conflict-free constraint is expressed as:
C(T0*D,Tf*D)-NW0 or less and C ((T)0*D)T,(Tf*D)T)-NT≤0
In the formula, an operator represents that the elements with the same row and column in two matrixes with the same dimension are multiplied respectively;
function C (T)0*D,TfD) for T, respectively0D and TfCalculating non-zero elements t for each row of Dij0And tijfSeveral time periods t of representationij0,tijf]G of the overlapping timesiUsing all giForm a column vector [ g1g2…gn]T；
Column vector NW＝[nW1nW2…nWn]TElement n thereofWiFrom weapons WiSimultaneously intercepting target quantity constraint decisions;
function C ((T)0*D)T,(Tf*D)T) Represents, respectively, to T0D and TfFor each column of D, calculating the non-zero element tij0And tijfSeveral time periods t of representationij0,tijf]Number of overlapping kiUsing all kiForm a column vector [ k1k2…km]T；
Column vector NT＝[nT1nT2…nTm]TElement n thereofTjBy the pair of targets TjWhile intercepting the weapon quantity constraint decision.
Preferably, in the converting step, the interception number constraint is expressed as:
I1×n×(NI*D)-R≥0
in the formula I1×nIs an n-dimensional row vector with elements of 1; n is a radical ofIIs an n x m dimensional matrix with elements nijFrom weapons WiFor target TjDetermining the interception times; r is an m-dimensional row vector of which the element R isjBy the pair of targets TjIs determined by the interception number constraint.
Preferably, in the step of converting, the total interception profitability is expressed as:
I1×n×(Q*D)×Im×1
in the formula Im×1Is an m-dimensional column vector with elements of 1.
Preferably, the constrained optimization problem is represented as:
namely, a matrix D with an element of 0 or 1 is searched for, the time conflict-free constraint and the interception frequency constraint are met, the benefit degree of total interception is maximized, and a triplet (T)0、TfD) collaborative air defense mission planning for multiple types of air defense weapons, i.e. "time slot-weapon-target" correspondenceIs described.
The invention provides a collaborative air defense mission planning system of a multi-type air defense weapon, which comprises the following steps:
an estimation module: estimating the interception starting time, the interception ending time and the interception times of each weapon on each target according to the performance index and each target track of each weapon;
a constraint determination module: determining the quantity constraint of the targets intercepted by the weapons at the same time, the quantity constraint of the weapons intercepted by the targets at the same time, the interception times constraint of the targets and the interception favorable degree of the weapons to the targets;
a matrix building module: establishing an interception starting time matrix, an interception ending time matrix and an interception profitability matrix of each weapon on each target according to the estimation result and the constraint determination result;
a conversion module: converting the collaborative air defense task planning problem of the multi-type air defense weapon into a constrained optimization problem according to the established matrix, wherein the optimization index is the total interception profitability, and the constraint comprises non-time conflict constraint and interception frequency constraint;
a solving module: and solving the constrained optimization problem by adopting a numerical optimization algorithm to obtain a collaborative air defense task planning scheme of the multi-type air defense weapon.
Preferably, in the constraint determination module, the interception profitability of each weapon on each target and the killing probability q of each weapon on each targetijDetermining according to weapon WiFor target TjNumber of interception nijAnd the killing probability q calculation of each interception, namely:
compared with the prior art, the invention has the following beneficial effects:
1) in the prior art, the combat stages are divided firstly, and then targets are distributed for weapons in each stage, so that firepower gaps among the combat stages are easily caused; according to the interception time periods of each target by each weapon, the time periods which have no time conflict and meet the requirement of shooting times are combined to form the cooperative air defense task of multiple weapons, so that the fighting capacity of each type of air defense weapon can be fully exerted, and the orderly connection of air defense fire power is realized.
2) The method has no time conflict constraint, considers the limitation of the multi-target capability of the weapon on the firepower, and is suitable for two shooting requirements that one target is shot by a plurality of weapons (such as antiaircraft guns need to be shot simultaneously to form a bullet screen) and one target is shot by only one weapon (such as air defense missiles, and mutual interference of different weapons is avoided), and the method has wider applicability.
3) The interception times constraint of the invention considers the requirement of minimum interception times of each target, ensures that each target has enough interception chance and killing probability, and can avoid the extreme condition that the beneficial degree of total interception is maximized, but the target is in fire prevention due to insufficient shooting times of individual targets.
4) The interception times of the invention restricts the favorable interception degree of each weapon to each target, and can be determined by the killing probability, the inverse number of the interception time and/or the interception cost-effectiveness ratio, so as to realize the optimization target of shortest engagement time and/or the maximum interception cost-effectiveness ratio, meet the requirements of different combat missions, and the method has better flexibility.
Drawings
Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments with reference to the following drawings:
FIG. 1 is a flow chart of a collaborative air defense mission planning method for a multiple-type air defense weapon according to the present invention;
FIG. 2 is an application scenario of an embodiment of the present invention.
Detailed Description
The present invention will be described in detail with reference to specific examples. The following examples will assist those skilled in the art in further understanding the invention, but are not intended to limit the invention in any way. It should be noted that it would be obvious to those skilled in the art that various changes and modifications can be made without departing from the spirit of the invention. All falling within the scope of the present invention.
As shown in fig. 1, the cooperative air defense mission planning method for a multiple-type air defense weapon provided by the present invention includes:
an estimation step: estimating the interception starting time, the interception ending time and the interception times of each weapon on each target according to the performance index and each target track of each weapon;
a constraint determining step: determining the quantity constraint of the targets intercepted by the weapons at the same time, the quantity constraint of the weapons intercepted by the targets at the same time, the interception times constraint of the targets and the interception favorable degree of the weapons to the targets;
matrix establishment: establishing an interception starting time matrix, an interception ending time matrix and an interception profitability matrix of each weapon on each target according to the result of the estimation step and the result of the constraint determination step;
a conversion step: converting the collaborative air defense task planning problem of the multi-type air defense weapon into a constrained optimization problem according to the established matrix, wherein the optimization index is the total interception profitability, and the constraint comprises non-time conflict constraint and interception frequency constraint;
solving: and solving the constrained optimization problem by adopting a numerical optimization algorithm to obtain a collaborative air defense task planning scheme of the multi-type air defense weapon.
Wherein,in the constraint determining step, the interception profitability of each weapon on each target and the killing probability q of each weapon on each targetijDetermining according to weapon WiFor target TjNumber of interception nijAnd the killing probability q calculation of each interception, namely:
in the matrix establishing step, the number of the weapons W is n, the number of the targets T is m, and the interception starting time matrix T of each weapon to each target0Intercept end time matrix TfThe interception profitability matrix Q has the form:
in the formula, tij0Representative weapon WiFor target TjInterception start time, tijfRepresentative weapon WiFor target TjInterception end time of qijRepresentative weapon WiFor target TjThe degree of interception is favorable.
In the solving step, a numerical optimization algorithm is adopted to solve the constrained optimization problem, and the obtained optimal solution D has the following form:
in the formula (d)ij0 or 1, dij1 represents in [ tij0,tijf]By weapon W during time periodiIntercept target Tj，dij0 represents in [ tij0,tijf]Weapon in time period WiNot intercepting target Tj。
In the conversion step, the time conflict-free constraint is expressed as:
C(T0*D,Tf*D)-NW0 or less and C ((T)0*D)T,(Tf*D)T)-NT≤0
In the formula, an operator represents that the elements with the same row and column in two matrixes with the same dimension are multiplied respectively;
function C (T)0*D,TfD) for T, respectively0D and TfCalculating non-zero elements t for each row of Dij0And tijfSeveral time periods t of representationij0,tijf]G of the overlapping timesiUsing all giForm a column vector [ g1g2…gn]T；
Column vector NW＝[nW1nW2…nWn]TElement n thereofWiFrom weapons WiSimultaneously intercepting target quantity constraint decisions;
function C ((T)0*D)T,(Tf*D)T) Represents, respectively, to T0D and TfFor each column of D, calculating the non-zero element tij0And tijfSeveral time periods t of representationij0,tijf]Number of overlapping kiUsing all kiForm a column vector [ k1k2…km]T；
Column vector NT＝[nT1nT2…nTm]TElement n thereofTjBy the pair of targets TjWhile intercepting the weapon quantity constraint decision.
The intercept number constraint is expressed as:
I1×n×(NI*D)-R≥0
in the formula I1×nIs an n-dimensional row vector with elements of 1; n is a radical ofIIs an n x m dimensional matrix with elements nijFrom weapons WiFor target TjNumber of interceptionDetermining; r is an m-dimensional row vector of which the element R isjBy the pair of targets TjIs determined by the interception number constraint.
The total interception profitability is expressed as:
I1×n×(Q*D)×Im×1
in the formula Im×1Is an m-dimensional column vector with elements of 1.
The constrained optimization problem is represented as:
namely, a matrix D with an element of 0 or 1 is searched for, the time conflict-free constraint and the interception frequency constraint are met, the benefit degree of total interception is maximized, and a triplet (T)0、TfAnd D) representing a collaborative air defense mission planning scheme of the multi-type air defense weapon, namely the corresponding relation of time period-weapon-target.
On the basis of the cooperative air defense mission planning method of the multi-type air defense weapon, the invention also provides a cooperative air defense mission planning system of the multi-type air defense weapon, which comprises the following steps:
an estimation module: estimating the interception starting time, the interception ending time and the interception times of each weapon on each target according to the performance index and each target track of each weapon;
a constraint determination module: determining the quantity constraint of the targets intercepted by the weapons at the same time, the quantity constraint of the weapons intercepted by the targets at the same time, the interception times constraint of the targets and the interception favorable degree of the weapons to the targets;
a matrix building module: establishing an interception starting time matrix, an interception ending time matrix and an interception profitability matrix of each weapon on each target according to the estimation result and the constraint determination result;
a conversion module: converting the collaborative air defense task planning problem of the multi-type air defense weapon into a constrained optimization problem according to the established matrix, wherein the optimization index is the total interception profitability, and the constraint comprises non-time conflict constraint and interception frequency constraint;
a solving module: and solving the constrained optimization problem by adopting a numerical optimization algorithm to obtain a collaborative air defense task planning scheme of the multi-type air defense weapon.
The embodiment is suitable for processing an application scene that 3 air defense missile weapons intercept 5 air targets, and the protection scope of the patent is not limited by the specific implementation of the embodiment.
The embodiment relates to collaborative air defense mission planning of two types of 3 air defense missile weapons, and the application scene is shown in FIG. 2; the 3 air defense missile weapons are respectively W1、W2、W3Weapon W2And W3Belonging to the same model and having the same performance, weapon W1Belonging to another type, its performance and weapon W2And W3In contrast, the solid line sector area in FIG. 2 indicates W1、W2、W3The interception range of; targets are respectively T1、T2、T3、T4、T5The course of which is shown by the dashed line with arrows in fig. 2.
With reference to fig. 1, the embodiment of the present invention is specifically described as follows:
step 1: and estimating the interception starting time, the interception ending time and the interception times of each weapon on each target according to the performance indexes of each weapon and each target track. According to the target T1、T2、T3、T4、T5Speed and its trajectory crossing weapon W1、W2、W3Length of interception Range, estimate weapon W1、W2、W3For target T1、T2、T3、T4、T5The interception start time and the interception end time are shown in the following table:
TABLE 1 interception Start time (unit: s)
T1 T2 T3 T4 T5
W1 4 3 3 3 5
W2 10 9 11 0 0
W3 0 14 12 12 15
TABLE 2 intercept finish time (unit: s)
T1 T2 T3 T4 T5
W1 10 9 11 11 15
W2 15 15 16 0 0
W3 0 18 18 18 18
According to the interception starting time and the interception ending time and the target T1、T2、T3、T4、T5Velocity and weapon W1、W2、W3Velocity of the fired interceptor projectile, estimating weapon W1、W2、W3For target T1、T2、T3、T4、 T5The number of interception is shown in the following table:
TABLE 3 number of intercepts
T1 T2 T3 T4 T5
W1 3 3 3 3 4
W2 2 3 2 0 0
W3 0 2 3 2 1
Step 2: and determining the quantity constraint of the simultaneously intercepted targets of the weapons, the quantity constraint of the simultaneously intercepted weapons of the targets, the number constraint of the intercepted targets and the favorable degree of the interception of the weapons to the targets. According to the weapon W1、W2、W3Performance of which the simultaneous interception target number constraint is n respectivelyW1＝3、nW2＝2、nW32; according to W1、W2、W3For air-defense missile weapons, for avoiding mutual interference between weapons, for target T1、T2、T3、T4、T5The constraint of the number of the simultaneously intercepted weapons is n respectivelyT1＝1、nT2＝1、nT3＝1、nT4＝1、nT51 is ═ 1; assume target T2、T3Is greater than the target T5Degree of threat, target T5Is greater than the target T1、T4The more times the target with higher threat degree is intercepted, according to the target T1、T2、T3、T4、T5Degree of threat of, set to target T1、T2、 T3、T4、T5The interception times are respectively restricted as r1＝2、r2＝4、r3＝4、r4＝2、r53; the probability of one-time interception and killing of the weapon on the target is set to be 0.6, and the interception profitability of the weapon on the target is calculated according to the interception times as shown in the following table:
TABLE 4 advantageous degree of interception
T1 T2 T3 T4 T5
W1 0.94 0.94 0.94 0.94 0.97
W2 0.84 0.94 0.84 0 0
W3 0 0.84 0.94 0.84 0.6
And step 3: and establishing an interception starting time matrix, an interception ending time matrix and an interception profitability matrix of each weapon on each target. According to the calculation results of the interception starting time, the interception ending time and the interception profitability in the steps, an interception starting time matrix T0Intercept end time matrix TfThe interception profitability matrix Q is as follows:
and 4, step 4: and converting the collaborative air defense task planning problem into a constrained optimization problem, wherein the optimization index is the total interception profitability, and the constraint comprises non-time conflict constraint and interception frequency constraint. The constrained optimization problem is represented by the calculation of the previous steps as:
in the formula: d is a 3X 5 dimensional matrix with an element Dij0 or 1, the value of which is to be optimized; t is0、TfQ is a 3 x 5 dimensional matrix as described in step 3; n is a radical ofWIs a 3-dimensional column vector, NTIs a 5-dimensional column vector, NIIs a 3 × 5 dimensional matrix, and R is a 5 dimensional row vector with the following values:
I1×nis a 3-dimensional row vector, Im×1Is a 5-dimensional column vector whose values are as follows:
and 5: and solving the constrained optimization problem by adopting a numerical optimization algorithm to obtain a collaborative air defense task planning scheme of the multi-type air defense weapon. In this embodiment, a genetic algorithm is used to solve the constrained optimization problem, and the optimal solution is obtained as follows:
then the triplet (T)0、TfAnd D) representing a cooperative air defense mission scheme of the multi-type air defense weapon, which specifically comprises the following steps:
to W1Assign it to intercept T from 3s to 9s2Intercepting T in 3 s-11 s3Intercepting T in 5 s-15 s5；
To W2Assign it to intercept T between 10s and 15s1Intercepting T in 9 s-15 s2；
To W3Assign it to intercept T from 12s to 18s3Intercepting T in 12 s-18 s4；
In the above task scheme, W1The number of the intercepted targets does not exceed 3, W2And W3The number of simultaneously intercepted targets does not exceed 2A plurality of; for T1、T2、T3、T4、T5The number of simultaneously intercepted weapons per target does not exceed 1; for T1、T2、T3、T4、T5The interception times are respectively 2 times, 6 times, 2 times and 4 times; the above conditions satisfy the time conflict-free constraint and the interception times constraint, the total interception profitability is 6.41, and the maximized optimization target is realized.
Those skilled in the art will appreciate that, in addition to implementing the system and its various devices, modules, units provided by the present invention as pure computer readable program code, the system and its various devices, modules, units provided by the present invention can be fully implemented by logically programming method steps in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Therefore, the system and various devices, modules and units thereof provided by the invention can be regarded as a hardware component, and the devices, modules and units included in the system for realizing various functions can also be regarded as structures in the hardware component; means, modules, units for performing the various functions may also be regarded as structures within both software modules and hardware components for performing the method.
The foregoing description of specific embodiments of the present invention has been presented. It is to be understood that the present invention is not limited to the specific embodiments described above, and that various changes or modifications may be made by one skilled in the art within the scope of the appended claims without departing from the spirit of the invention. The embodiments and features of the embodiments of the present application may be combined with each other arbitrarily without conflict.

Claims (10)

1. A collaborative air defense mission planning method for a multi-type air defense weapon is characterized by comprising the following steps:
an estimation step: estimating the interception starting time, the interception ending time and the interception times of each weapon on each target according to the performance index and each target track of each weapon;
a constraint determining step: determining the quantity constraint of the targets intercepted by the weapons at the same time, the quantity constraint of the weapons intercepted by the targets at the same time, the interception times constraint of the targets and the interception favorable degree of the weapons to the targets;
matrix establishment: establishing an interception starting time matrix, an interception ending time matrix and an interception profitability matrix of each weapon on each target according to the result of the estimation step and the result of the constraint determination step;
a conversion step: converting the collaborative air defense task planning problem of the multi-type air defense weapon into a constrained optimization problem according to the established matrix, wherein the optimization index is the total interception profitability, and the constraint comprises non-time conflict constraint and interception frequency constraint;
solving: and solving the constrained optimization problem by adopting a numerical optimization algorithm to obtain a collaborative air defense task planning scheme of the multi-type air defense weapon.
2. The collaborative air defense mission planning method for multiple types of air defense weapons according to claim 1 wherein, in the constraint determination step, the interception profitability of each target by each weapon, the probability of destruction q of each target by each weapon, isijDetermining according to weapon WiFor target TjNumber of interception nijAnd the killing probability q calculation of each interception, namely:
3. the cooperative air defense mission planning method for multiple types of air defense weapons according to claim 2, wherein in the matrix establishing step, the number of weapons W is n, the number of targets T is m, and the interception start time matrix T of each weapon on each target0Intercept end time matrix TfThe interception profitability matrix Q has the form:
in the formula, tij0Representative weapon WiFor target TjInterception start time, tijfRepresentative weapon WiFor target TjInterception end time of qijRepresentative weapon WiFor target TjThe degree of interception is favorable.
4. A collaborative air defense mission planning method for a polytype air defense weapon according to claim 3, characterized in that in the solving step, a numerical optimization algorithm is used to solve the constrained optimization problem, and the obtained optimal solution D has the following form:
in the formula (d)ij0 or 1, dij1 represents in [ tij0,tijf]By weapon W during time periodiIntercept target Tj，dij0 represents in [ tij0,tijf]Weapon in time period WiNot intercepting target Tj。
5. The cooperative air defense mission planning method for a multiple-type air defense weapon according to claim 4, wherein in the transforming step, the time conflict-free constraint is expressed as:
C(T0*D,Tf*D)-NW0 or less and C ((T)0*D)T,(Tf*D)T)-NT≤0
In the formula, an operator represents that the elements with the same row and column in two matrixes with the same dimension are multiplied respectively;
function C (T)0*D,TfD) for T, respectively0D and TfCalculating non-zero elements t for each row of Dij0And tijfSeveral time periods t of representationij0,tijf]G of the overlapping timesiUsing all giForm a column vector [ g1g2…gn]T；
Column vector NW＝[nW1nW2…nWn]TElement n thereofWiFrom weapons WiAt the same timeDetermining the quantity of intercepted targets;
function C ((T)0*D)T,(Tf*D)T) Represents, respectively, to T0D and TfFor each column of D, calculating the non-zero element tij0And tijfSeveral time periods t of representationij0,tijf]Number of overlapping kiUsing all kiForm a column vector [ k1k2…km]T；
Column vector NT＝[nT1nT2…nTm]TElement n thereofTjBy the pair of targets TjWhile intercepting the weapon quantity constraint decision.
6. The cooperative air defense mission planning method for a multiple-type air defense weapon according to claim 4, wherein in the transforming step, the interception number constraint is expressed as:
I1×n×(NI*D)-R≥0
in the formula I1×nIs an n-dimensional row vector with elements of 1; n is a radical ofIIs an n x m dimensional matrix with elements nijFrom weapons WiFor target TjDetermining the interception times; r is an m-dimensional row vector of which the element R isjBy the pair of targets TjIs determined by the interception number constraint.
7. The cooperative air defense mission planning method for multiple-type air defense weapon according to claim 6, wherein in the transforming step, the total interception profitability is expressed as:
I1×n×(Q*D)×Im×1
in the formula Im×1Is an m-dimensional column vector with elements of 1.
8. The collaborative air defense mission planning method for a polytype air defense weapon according to claim 7, characterized in that the constrained optimization problem is expressed as:
namely, a matrix D with an element of 0 or 1 is searched for, the time conflict-free constraint and the interception frequency constraint are met, the benefit degree of total interception is maximized, and a triplet (T)0、TfAnd D) representing a collaborative air defense mission planning scheme of the multi-type air defense weapon, namely the corresponding relation of time period-weapon-target.
9. A cooperative air defense mission planning system for multiple types of air defense weapons, comprising:
an estimation module: estimating the interception starting time, the interception ending time and the interception times of each weapon on each target according to the performance index and each target track of each weapon;
a constraint determination module: determining the quantity constraint of the targets intercepted by the weapons at the same time, the quantity constraint of the weapons intercepted by the targets at the same time, the interception times constraint of the targets and the interception favorable degree of the weapons to the targets;
a matrix building module: establishing an interception starting time matrix, an interception ending time matrix and an interception profitability matrix of each weapon on each target according to the estimation result and the constraint determination result;
a conversion module: converting the collaborative air defense task planning problem of the multi-type air defense weapon into a constrained optimization problem according to the established matrix, wherein the optimization index is the total interception profitability, and the constraint comprises non-time conflict constraint and interception frequency constraint;
a solving module: and solving the constrained optimization problem by adopting a numerical optimization algorithm to obtain a collaborative air defense task planning scheme of the multi-type air defense weapon.
10. The cooperative air defense mission planning system for multiple-type air defense weapon according to claim 9, wherein each weapon in said constraint determination moduleFavorable interception degree of each target by the device, and killing probability q of each target by each weaponijDetermining according to weapon WiFor target TjNumber of interception nijAnd the killing probability q calculation of each interception, namely:
CN201811160508.2A 2018-09-30 2018-09-30 Collaborative air defense task planning method and system for multi-type air defense weapons Active CN109255491B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811160508.2A CN109255491B (en) 2018-09-30 2018-09-30 Collaborative air defense task planning method and system for multi-type air defense weapons

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811160508.2A CN109255491B (en) 2018-09-30 2018-09-30 Collaborative air defense task planning method and system for multi-type air defense weapons

Publications (2)

Publication Number Publication Date
CN109255491A true CN109255491A (en) 2019-01-22
CN109255491B CN109255491B (en) 2020-01-31

Family

ID=65045053

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811160508.2A Active CN109255491B (en) 2018-09-30 2018-09-30 Collaborative air defense task planning method and system for multi-type air defense weapons

Country Status (1)

Country Link
CN (1) CN109255491B (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111091273A (en) * 2019-11-29 2020-05-01 上海航天控制技术研究所 Multi-missile cooperative task planning method based on capability prediction
CN111121536A (en) * 2019-12-31 2020-05-08 中国人民解放军海军大连舰艇学院 Shooting opportunity conflict resolution method for dual-ship vertical-launching first-launch naval-aircraft missile
CN111141180A (en) * 2020-01-09 2020-05-12 中国人民解放军海军大连舰艇学院 Interception target method based on division of plane launching area of naval vessel formation naval-air missile
CN111582553A (en) * 2020-04-17 2020-08-25 上海机电工程研究所 Information and firepower integrated task planning method
CN112629321A (en) * 2020-11-19 2021-04-09 哈尔滨工程大学 Torpedo time cooperative guidance method based on double-layer structure
CN114240170A (en) * 2021-12-17 2022-03-25 中国航空研究院 Multi-domain combat-oriented weapon target distribution method
CN113703479B (en) * 2021-08-26 2022-05-17 中国人民解放军国防科技大学 Weapon configuration method and system based on high-density value and large depth

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111091273A (en) * 2019-11-29 2020-05-01 上海航天控制技术研究所 Multi-missile cooperative task planning method based on capability prediction
CN111091273B (en) * 2019-11-29 2023-08-11 上海航天控制技术研究所 Multi-bullet collaborative task planning method based on capability prediction
CN111121536A (en) * 2019-12-31 2020-05-08 中国人民解放军海军大连舰艇学院 Shooting opportunity conflict resolution method for dual-ship vertical-launching first-launch naval-aircraft missile
CN111141180A (en) * 2020-01-09 2020-05-12 中国人民解放军海军大连舰艇学院 Interception target method based on division of plane launching area of naval vessel formation naval-air missile
CN111141180B (en) * 2020-01-09 2022-07-19 中国人民解放军海军大连舰艇学院 Interception target method based on division of plane launching area of naval vessel formation naval-air missile
CN111582553A (en) * 2020-04-17 2020-08-25 上海机电工程研究所 Information and firepower integrated task planning method
CN111582553B (en) * 2020-04-17 2023-07-04 上海机电工程研究所 Information and firepower integrated task planning method
CN112629321A (en) * 2020-11-19 2021-04-09 哈尔滨工程大学 Torpedo time cooperative guidance method based on double-layer structure
CN113703479B (en) * 2021-08-26 2022-05-17 中国人民解放军国防科技大学 Weapon configuration method and system based on high-density value and large depth
CN114240170A (en) * 2021-12-17 2022-03-25 中国航空研究院 Multi-domain combat-oriented weapon target distribution method
CN114240170B (en) * 2021-12-17 2024-05-24 中国航空研究院 Weapon target distribution method for multi-domain combat

Also Published As

Publication number Publication date
CN109255491B (en) 2020-01-31

Similar Documents

Publication Publication Date Title
CN109255491B (en) Collaborative air defense task planning method and system for multi-type air defense weapons
CN107886184B (en) Multi-type air defense weapon mixed-programming fire group target distribution optimization method
Matlin A review of the literature on the missile-allocation problem
CN109472043B (en) Autonomous shooting decision method accompanied by artillery and soldier
US20150199623A1 (en) Method for resource allocation in mission planning
JP6209120B2 (en) Tactical support device, tactical support method, and tactical support program
CN109408877B (en) Intelligent shooting decision-making method for anti-tank missile teams
JP5554206B2 (en) Thermal power distribution device
CN114020021B (en) Design method and system for multi-missile distributed cooperative guidance law
Ha et al. A stochastic game-based approach for multiple beyond-visual-range air combat
Shin et al. Weapon-target assignment problem with interference constraints using mixed-integer linear programming
CN109460565B (en) Autonomous shooting decision modeling method for cannon barracks
KR20120126512A (en) Inducement weapon assignment system and method using CLP method and computer-readerable storage medium having a program recorded thereon where the program is to carry out its method
CN109447398B (en) Intelligent shooting decision method for artillery group
Duan et al. Research on algorithm for dynamic weapon target assignment based on the improved Markov decision model
JPH11183091A (en) Weapon scheduling apparatus
Sun et al. Research on a Simulation Algorithm for Artillery Firepower Assignment According to Region
JPH0933193A (en) Fire distribution apparatus
KR101988484B1 (en) Method and apparatus for weapon assignment
KR101668774B1 (en) Generation method of combat plan based on forward/backward delay expectation and generation system thereof
Li et al. Iterative Recurrence Model for Calculating Effectiveness of Defense in the Multiple Shooting Mode
Chen et al. Research on multiple kill vehicles firepower distribution strategy based on adjust genetic algorithm
Liu et al. Firepower allocation of continuous multiple incoming targets
Chi et al. Research on Networked Cooperative fire control based on improved Hungary algorithm
Taghavi et al. Weapon scheduling in naval combat systems for maximization of defense capabilities

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
CB03 Change of inventor or designer information
CB03 Change of inventor or designer information

Inventor after: Dong Chen

Inventor after: Lu Zhifeng

Inventor after: Zhang Hongjun

Inventor after: Hong Zehua

Inventor after: Qian Xiaochao

Inventor after: Chen Wei

Inventor after: Zhang Jiajun

Inventor before: Dong Chen

Inventor before: Lu Zhifeng

Inventor before: Hong Zehua

Inventor before: Qian Xiaochao

Inventor before: Chen Wei

Inventor before: Zhang Jiajun

GR01 Patent grant
GR01 Patent grant