CN1845145A - Rapid command control method of low risk deployment for war field battle airplane - Google Patents

Rapid command control method of low risk deployment for war field battle airplane Download PDF

Info

Publication number
CN1845145A
CN1845145A CNA2006100402486A CN200610040248A CN1845145A CN 1845145 A CN1845145 A CN 1845145A CN A2006100402486 A CNA2006100402486 A CN A2006100402486A CN 200610040248 A CN200610040248 A CN 200610040248A CN 1845145 A CN1845145 A CN 1845145A
Authority
CN
China
Prior art keywords
risk
deployment
operational aircraft
operational
flight
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.)
Pending
Application number
CNA2006100402486A
Other languages
Chinese (zh)
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.)
Individual
Original Assignee
Individual
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 Individual filed Critical Individual
Priority to CNA2006100402486A priority Critical patent/CN1845145A/en
Publication of CN1845145A publication Critical patent/CN1845145A/en
Pending legal-status Critical Current

Links

Landscapes

  • Traffic Control Systems (AREA)

Abstract

The invention relates to a quick command control method for quickly low-risk deploying operational aircraft on the battlefield. Wherein, the commanded object the all operational aircrafts; according to the flying risk probability from different concentrate points to different deploy points, the deploy amount at the concentrate point, the needed amount at the deploy point, and the number of operational aircraft batch, the command control mode purposed for deploying all operational aircrafts in minimum risk is built with lower calculation complexity and high solvability; and using linear programming, and the pair rule of linear programming, to solve said mode, and improve the result via the two-dimension table, to obtain the command control method that meeting the demand of quick low-risk deploy. The invention can improve the battle effectiveness, with wider application. The invention also provides relative technique.

Description

Quick commander's control method of battlefield operational aircraft low-risk disposition
Technical field the present invention relates to national defence and association area, is used for battlefield operational aircraft low-risk disposition is implemented commander's control fast, realizes the low-risk disposition to the battlefield operational aircraft.
It is an important component part of operational commanding control that background technology implements between the assembly place of battlefield operational aircraft and deployment point that quick operational aircraft disposes, meet with risk probability according to the flight on flight path from different assembly places to different deployment points, the assembly place operational aircraft can the deployment amount and the deployment point to the demand of operational aircraft, the quantity of operational aircraft batch, structure is that target and the commander's control plan with low computational complexity and high solvability are that the battlefield commander implements the necessary key issue that solves of commander's control fast to battlefield operational aircraft low-risk disposition to dispose all operational aircrafts experience risk minimums, the solution of this problem is for increasing substantially fighting capacity, reduce to dispose the risk of operational aircraft and, have crucial meaning the demand of consumption of natural resource.
The low-risk disposition ability of battlefield operational aircraft is most important for the triumph of capturing IT-based warfare, but complicated battlefield surroundings may cause adverse effect to the operational aircraft along a certain flight path flight, thereby reduce the security of operational aircraft flight, and the commander of low-risk disposition operational aircraft control is the key that improves mobile operations, and commander's control plan of therefore formulating the deployment operational aircraft of science becomes the matter of utmost importance that must solve.The quality of this plan, not only be related to implement the battlefield operational aircraft dispose the risk that meets with, consumption of natural resource how much, can in time arrive the deployment point but also be related to operational aircraft, to guarantee that fighting capacity is unlikely to descend because of the delay of operational aircraft deployment.
Time seems very important for commander's control that the battlefield operational aircraft is disposed, and constraint condition that therefore must be by reducing commander's controlling models, analyzes the choose reasonable parameter by antithesis and improves solvability and come battlefield operational aircraft low-risk disposition is implemented commander's control fast as optimization aim to dispose the risk minimum.
The present invention relates to quick commander's control method of battlefield operational aircraft low-risk disposition, relate to military affairs and association area, the object of commander's control is all battlefield operational aircrafts, this method meets with risk probability according to the flight on the flight path from different assembly places to different deployment points, the assembly place operational aircraft can the deployment amount and the deployment point to the demand of operational aircraft, the quantity of operational aircraft batch, structure is target and the commander's controlling models with low computational complexity and high solvability to dispose all operational aircrafts experience risk minimums, and use linear programming, the dual program method of linear programming is found the solution this model, by two-dimentional form solving result is updated again, the option control command that meets the low-risk disposition requirement until final acquisition, this method has efficiently, simply, objective, characteristics are widely used and obviously improve its combat capabilities etc., can be widely used in quick commander's control of all battlefield operational aircraft low-risk dispositions, the invention further relates to the technology that realizes this method.
Summary of the invention the present invention meets with risk probability according to the flight on the flight path from different assembly places to different deployment points, the assembly place operational aircraft can the deployment amount and the deployment point to the demand of operational aircraft, the quantity of operational aircraft batch, structure is target and the commander's controlling models with low computational complexity and high solvability to dispose all operational aircrafts experience risk minimums, and use linear programming, the dual program method of linear programming is found the solution this model, obtain scheme to battlefield operational aircraft low-risk disposition enforcement commander control with two-dimentional form description, and check whether this option control command meets the risk demand of finishing whole battlefield operational aircraft deployment task, if do not meet the demands, then by analysis to this two dimension commander control form, and according to shadow price, the risk bottleneck can be adjusted for the operational aircraft quantity of deployment and the type of the operational aircraft of implementing to dispose etc. the relevant episode node, constantly repeat this and find the solution-check analytic process, meet the option control command of low-risk disposition requirement until final acquisition.Therefore, the conception of quick commander's control of battlefield operational aircraft low-risk disposition is proposed, introduce the analytical approach that flight meets with risk probability, set up linear programming and the dual program model of seeking optimum option control command, come this model of rapid solving by reducing constraint condition, obtain scheme to battlefield operational aircraft low-risk disposition enforcement commander control with two-dimentional form description, and according to finishing the risk requirement that whole operational aircraft is disposed, by searching the risk bottleneck that whole battlefield operational aircraft deployment task is finished in influence, the assembly place can be adjusted for the unreasonable configuration of the operational aircraft quantity of disposing with to the type of the operational aircraft implementing to dispose, continue to optimize and improve this option control command, and battlefield operational aircraft low-risk disposition requirement is satisfied in final acquisition, option control command with two-dimentional form description becomes key character of the present invention.
The technical scheme of quick commander's control method of battlefield of the present invention operational aircraft low-risk disposition is:
At first, with battlefield operational aircraft low-risk disposition problem definition is by the assembly place of operational aircraft and the assembly deployment system that the deployment point constituted of operational aircraft, the flight that the feature of this system can be used on the flight path from different assembly places to different deployment points meets with risk probability, the assembly place operational aircraft can the deployment amount and the demand of deployment point operational aircraft, the quantity of operational aircraft batch is described, and according to the risk requirement that the battlefield operational aircraft is disposed, structure is target and the commander's controlling models with low computational complexity and high solvability to dispose and to transport all operational aircrafts experience risk minimums, and use linear programming, the dual program method of linear programming is found the solution this model, obtain scheme to battlefield operational aircraft low-risk disposition enforcement commander control with two-dimentional form description, the risk bottleneck of assembling deployment system by continuous searching, quantity to the operational aircraft of relevant episode node is carried out reasonable disposition, adopt dissimilar methods such as operational aircraft, battlefield operational aircraft low-risk disposition requirement is satisfied in final acquisition, battlefield operational aircraft low-risk disposition is implemented the scheme that commander controls, finish commander's control battlefield operational aircraft low-risk disposition.
The quick commander that the battlefield operational aircraft is disposed controls, the computational complexity and the needed computing time of finding the solution commander's linear programming of controlling models and dual program should not exerted an influence to the real-time of commander's control decision, therefore reducing unnecessary constraint condition is the important measures that improve commander's control decision real-time, for computational complexity that reduces commander's controlling models and the solvability that improves commander's controlling models, stipulate that the constraint condition relevant with the deployment point is the constraint condition that equals the deployment point demand, the constraint condition relevant with the assembly place is to be not more than the constraint condition that the assembly place maximum can supply the deployment amount.
Complicated battlefield surroundings may cause adverse effect to the operational aircraft along a certain flight path flight, thereby reduce the security of operational aircraft flight, for meeting with commander's control that the risk minimum is a target to dispose operational aircraft, this reduction has been equivalent to increase the risk that operational aircraft flight faces, it can be with the function of time as variable that flight meets with risk probability, also can be and irrelevant constant of time, the flight of different flight paths meets with risk probability can be different.
Find the solution commander's controlling models by the method for finding the solution linear programming and finding the solution the dual program of linear programming, can obtain to meet with the flight path of risk probability respectively from the minimum flight that different assembly places deployment operational aircrafts need to different deployment points, with different assembly places and the relevant shadow price of different deployment points constraint condition, the result that will find the solution inserts in a kind of two dimension commander's control form again, according to analysis to this two dimension commander control form, and pass through according to shadow price, the risk bottleneck is adjusted correlation parameter, constantly find the solution and update, meet the option control command of battlefield operational aircraft low-risk disposition requirement until final acquisition.
Quantity that can be by describing from each assembly place the operational aircraft of disposing each deployment point as the zones of different in the two-dimentional form of option control command, size, the flight that each deployment point need deliver power meet with risk probability, operational aircraft batch with relevant shadow price, each assembly place can dispose operational aircraft quantity, remain the situation of change and relevant shadow price and the priming the pump of disposing all operational aircrafts of operational aircraft quantity.
If the option control command of trying to achieve can not satisfy predetermined risk requirement, then can be by two dimension commander control table, result to former linear programming and dual program analyzes, determine to influence the risk bottleneck that the battlefield operational aircraft is disposed, again by the operational aircraft quantity of assembly place being carried out reasonable disposition, increase the quantity of operational aircraft batch and adopting dissimilar means such as operational aircraft, eliminate the risk bottleneck, and repeat this process, until making the risk of finishing battlefield operational aircraft deployment meet predetermined requirement.
Quick commander's control method of the battlefield operational aircraft low-risk disposition of the present invention's design is applicable to that all battlefield operational aircraft low-risk dispositions are key characters of the present invention.
The case study of quick commander's control of battlefield operational aircraft low-risk disposition is as follows.
Supposing that battlefield operational aircraft low-risk disposition problem can be used by the deployment point of the assembly place of m supply operational aircraft and n demand operational aircraft and between different supply and demand nodes exists the network in the path of a deployment operational aircraft to describe, and is x from assembly place i to the operational aircraft quantity that deployment point j disposes Ij, it is p that flight meets with risk probability Ij(t), flight meets with risk probability and is meant that complicated battlefield surroundings may cause adverse effect to the operational aircraft along a certain flight path flight, thereby reduce the security of operational aircraft flight, for meeting with commander's control that the risk minimum is a target to dispose operational aircraft, this reduction has been equivalent to increase the risk that operational aircraft flight faces, it can be with the function of time as variable that flight meets with risk probability, also can be and irrelevant constant of time, is expressed as p Ij, the flight of different flight paths meets with risk probability can be different,
The problem that need to solve be one of design from m assembly place deployment operational aircraft to n deployment point, make the flight of disposing all operational aircrafts meet with risk probability simultaneously and be minimum mapping out the plan, and calculate the quantity that required batch of operational aircraft is disposed in each assembly place, relevant operational aircraft deployment commander's controlling models and linear programming equation are as follows:
Objective function: min Z = Σ i = 1 m Σ j = 1 n p ij x ij
The deployment point is to the constraint condition of operational aircraft demand: Σ i = 1 m x ij = D j , (j=1,…,n)
The assembly place can supply to dispose the constraint condition of operational aircraft amount: Σ j = 1 n x ij ≤ S i , (i=1,…,m)
Condition of Non-Negative Constrains: x Ij〉=0, (i=1 ..., m; J=1 ..., n)
Assembly place i (i=1 ... m) the quantity V of the operational aircraft of need disposing batch i:
Figure A20061004024800114
The maximum flight relevant with j deployment point meets with risk probability: p j = max p ij ∈ P op { p ij } , j(j=1,…n)
Finish the flight experience risk probability that all operational aircrafts are disposed: min P=max{p j, j (j=1 ... n)
With j the risk carrying capacity that the deployment point is relevant: min Z j = Σ i = 1 m p ij x ij , j(j=1,…n)
The overall risk carrying capacity that the battlefield operational aircraft is disposed: min Z = Σ j = 1 n min Z j
Wherein:
M is for disposing the assembly place sum of operational aircraft;
N is the deployment point sum of demand operational aircraft;
P OpBe commander's controlling models p by associated pathway when obtaining optimum solution IjThe set of forming;
The value of objective function was called the risk carrying capacity when minZ obtained optimum solution for commander's controlling models, and this value is the smaller the better;
p IjFor assembly place i (i=1 ... m) with deployment point j (j=1 ... n) flight between meets with risk probability, can be with the function of time t as variable;
V iFor the assembly place i that disposes operational aircraft (i=1 ... m) dispose batch quantity that operational aircraft needs;
L is the ability (unit: frame) of each batch deployment operational aircraft;
S iFor assembly place i (i=1 ... m) quantity (unit: frame) of the operational aircraft that can dispose;
D jFor deployment point j (j=1 ... n) need the quantity (unit: frame) of operational aircraft;
Above-mentioned model shows: objective function be equivalent to ask probability-weighted and, on the basis of trying to achieve risk carrying capacity min Z value by linear programming, can calculate each assembly place must be to the operational aircraft quantity x of related deployment point deployment Ij, the p of associated pathway Ij, count L according to the contained operational aircraft frame of each batch again, can calculate the operational aircraft batch V that need dispose each assembly place i, the last risk carrying capacity min Z that can calculate each deployment point again j, maximum flight meets with risk probability p jFinish the flight experience risk probability min P that all battlefield operational aircrafts are disposed, thereby realize commander's control to battlefield operational aircraft low-risk disposition, for constraint condition rationally being set, improving solvability, utilizing above-mentioned linear programming model better, the dual linear programming model that provides this model is as follows:
Objective function: max G = Σ j = 1 n D j y j + Σ i = 1 m S i y n + i
Constraint condition: D jy j+ S iy N+i≤ p Ij, (i=1 ..., m; J=1 ..., n)
Condition of Non-Negative Constrains: y j, y N+i〉=0, (i=1 ..., m; J=1 ..., n)
Wherein: y j, y N+iBe respectively with the demand of former linear programming and dispose the shadow price or the relevant decision variable of opportunity cost of operational aircraft constraint condition,
Since primal linear programming solves be with deployment point j and assembly place i (i=1 ..., m; J=1 ..., the resource optimal utilization problem that constraint condition n) is relevant, thus dual program solve then be estimate to make deployment point j and assembly place i (i=1 ..., m; J=1 ..., constraint condition n) satisfies the cost problem that must pay, promptly uses the valency problem, and shadow price y jAnd y N+iReflection make just deployment point j and assembly place i (i=1 ..., m; J=1, n) constraint condition satisfies the cost that must pay, by making the target function value relevant minimize (or maximization) with cost, shadow price can be used for each constraint condition of comparison and carry out equivalence analysis to the contribution of target function value or to this contribution influence, shadow price is big more, show that this constraint condition is big more to the influence of the priming the pump delivery power of option control command, but it is also just difficult more to satisfy this condition, therefore, introducing shadow price just can be by comparing shadow price and realistic objective functional value, and can variation that study former linear programming constraint condition make objective function obtain gain.
Embodiment
Implementation example
In IT-based warfare, the deployment ability of operational aircraft is an important component part of fighting capacity, and the demand to huge battlefield operational aircraft deployment ability makes commander's control of implementing battlefield operational aircraft deployment become vital task.Suppose with 16, average speed per hour to be that 70 kilometers operational aircraft is as an operational aircraft batch, dispose the operational aircraft of specified amounts to 14 deployment points from 5 assembly places, between assembly place and the deployment point flight meet with risk probability, assembly place operational aircraft can the deployment amount and the deployment point as shown in table 1 to the demand of operational aircraft.
Table 1: flight meets with risk probability, portion's amount of asking (unit: probability, frame) between assembly place and the deployment point
01 assembly place 02 assembly place 03 assembly place 04 assembly place 05 assembly place Quantity required
14 deployment points, 13 deployment points, 12 deployment points, 11 deployment points, 10 deployment points, 09 deployment point, 08 deployment point, 07 deployment point, 06 deployment point, 05 deployment point, 04 deployment point, 03 deployment point, 02 deployment point, 01 deployment point 0.037 0.034 0.025 0.014 0.026 0.024 0.120 0.159 0.112 0.062 0.091 0.126 0.090 0.081 0.013 0.025 0.028 0.015 0.035 0.020 0.098 0.138 0.096 0.037 0.066 0.097 0.068 0.056 0.070 0.083 0.108 0.097 0.082 0.110 0.012 0.051 0.096 0.046 0.017 0.081 0.099 0.020 0.074 0.087 0.112 0.101 0.086 0.100 0.129 0.149 0.025 0.050 0.079 0.086 0.104 0.066 0.044 0.031 0.066 0.058 0.056 0.039 0.105 0.145 0.110 0.059 0.073 0.027 0.011 0.075 36.00 21.00 90.00 130.00 70.00 40.00 60.00 16.00 29.00 36.00 90.00 22.00 18.00 24.00
Can the deployment amount 250.00 200.00 300.00 400.00 150.00
According to above-mentioned linear programming and commander controlling models and relevant dual linear programming model, the option control command of the minimum risk operational aircraft that calculates by simplex algorithm deployment is as shown in table 2, and wherein the frame risk is the risk carrying capacity min Z of deployment point j, risk probability is that the maximum flight of deployment point meets with risk probability p j
Table 2: minimum flight meets with risk probability and disposes option control command (unit: frame, frame risk, probability, batch)
01 assembly place 02 assembly place 03 assembly place 04 assembly place 05 assembly place The frame risk Risk probability Batch Shadow price
14 deployment points, 13 deployment points, 12 deployment points, 11 deployment points, 10 deployment points, 09 deployment point, 08 deployment point, 07 deployment point, 06 deployment point, 05 deployment point, 04 deployment point, 03 deployment point, 02 deployment point, 01 deployment point 90.00 90.00 70.00 36.00 21.00 40.00 40.00 36.00 60.00 16.00 90.00 24.00 29.00 22.00 18.00 0.468 0.525 2.250 1.860 1.820 0.800 0.720 0.816 0.725 1.332 1.530 0.594 0.198 0.480 0.013 0.025 0.025 0.015 0.026 0.020 0.012 0.051 0.025 0.037 0.017 0.027 0.011 0.020 3 2 6 9 5 3 4 1 2 3 6 2 2 2 0.00 12.00 13.00 2.00 14.00 7.00 0.00 39.00 0.00 24.00 5.00 16.00 0.00 8.00
Add up to 250.00 173.00 190.00 29.00 40.00 14.118 0.051 * 50
But portion's quantity 250.00 200.00 300.00 400.00 150.00
Surplus after the portion 0.00 27.00 110.00 371.00 110.00
Shadow price 12.00 13.00 12.00 25.00 11.00
* the flight experience risk probability of finishing deployment task is 0.051
By option control command (table 2) is analyzed as can be known; finish operational aircraft that deployment task needs and batch add up to 50; it is 0.051 that flight meets with risk probability; the operational aircraft that 01~05 assembly place needs batch is respectively 17; 14; 13; 2 and 4; therefore must be to 01; 02 and 03 assembly place implements to lay special stress on protecting; further analyze as can be known; meeting with risk probability 0.051 from 03 assembly place to the flight of 16 operational aircrafts of 08 deployment point deployment is to reduce the bottleneck that the flight of finishing all battlefield operational aircrafts deployment meets with risk probability; finish this part deployment if meet with the operational aircraft of risk probability with lower flight; then risk probability can be reduced to 0.037; reduction is 27.45%; and for example fruit is adopted to use the same method and eliminates 0.037 bottleneck; then risk probability can be reduced to 0.027; reduction is 47.06%, almost only is half of former risk probability.
From to demand constraint condition D j(j=1,14) analysis of shadow price as can be known, the size of price has truly reflected the complexity that the related constraint condition satisfies, shadow price is 0 to be meant in specific span, and relevant constraint condition does not constitute influence to target function value, the easiliest satisfies, again for example, in order to satisfy constraint condition D 8, the risk of disposing operational aircraft to 08 deployment point is 0.051, the shadow price of this constraint condition is a maximal value 39, illustrates that this condition is the most difficult satisfied, can be by D with similar method jThe complexity that satisfies, from difficulty to easy ordering: D 8, D 10, D 12, D 5..., to deployment amount constraint condition S i(i=1 ..., 5) analysis of shadow price as can be known, S iThe complexity that satisfies, from difficulty to easy ordering: S 4, S 2, S 1, S 3, S 5, i.e. constraint condition S 4The most difficult satisfied.
In addition, from the residue operational aircraft amount of each assembly place, back of finishing the work as can be seen, the surplus of 01 assembly place and 02 assembly place is obviously on the low side, and particularly the operational aircraft that can dispose of 01 assembly place exhausts, this statement of facts:, add S if there is more operational aircraft 01 assembly place 1Constraint condition more easily satisfies, and just may obtain better to map out the plan, and therefore, can also carry out reasonable configuration to the operational aircraft of each assembly place with said method, and realization can be disposed the Optimal Management of operational aircraft quantity.

Claims (10)

1, the present invention relates to quick commander's control method of battlefield operational aircraft low-risk disposition, relate to military affairs and association area, the object of commander's control is all battlefield operational aircrafts, this method meets with risk probability according to the flight on the flight path from different assembly places to different deployment points, the assembly place operational aircraft can the deployment amount and the deployment point to the demand of operational aircraft, the quantity of operational aircraft batch, structure is target and the commander's controlling models with low computational complexity and high solvability to dispose all operational aircrafts experience risk minimums, and use linear programming, the dual program method of linear programming is found the solution this model, by two-dimentional form solving result is updated again, meet the option control command of low-risk disposition requirement until final acquisition, this scheme is applicable to commander's control of the low-risk disposition of all battlefield operational aircrafts.
2, quick commander's control method of battlefield according to claim 1 operational aircraft low-risk disposition, the object that it is characterized in that described commander's control is meant the object of all battlefield operational aircrafts as commander's control for all battlefield operational aircrafts, described commander's control is meant according to the actual demand of battlefield to operational aircraft, design is deployed to different deployment points with the battlefield operational aircraft from different assembly places, and make probability-weighted that all flights meet with risks for minimum, can be for the scheme of implementing.
3, quick commander's control method of battlefield according to claim 1 operational aircraft low-risk disposition, it is characterized in that described this method according to the flight on flight path from different assembly places to different deployment points meet with risk probability, assembly place operational aircraft can the deployment amount and the deployment point quantity of the demand of operational aircraft, operational aircraft batch is meant by these parameters can sets up the supply and demand system that a battlefield operational aircraft is disposed, obtain on this basis the battlefield operational aircraft is disposed the method for implementing commander's control.
4, quick commander's control method of battlefield according to claim 1 operational aircraft low-risk disposition, it is characterized in that described flight meets with risk probability and is meant that complicated battlefield surroundings may cause adverse effect to the operational aircraft along a certain flight path flight, thereby reduce the security of operational aircraft flight, for meeting with commander's control that the risk minimum is a target to dispose operational aircraft, this reduction has been equivalent to increase the risk that operational aircraft flight faces, it can be with the function of time as variable that flight meets with risk probability, also can be and irrelevant constant of time, the flight of different flight paths meets with risk probability can be different.
5, quick commander's control method of battlefield according to claim 1 operational aircraft low-risk disposition is characterized in that to meet with risk minimums be that the target of target and the commander's controlling models with low computational complexity and the high solvability objective function that is meant this commander controlling models is for making all operational aircrafts experience risk minimums of deployment to described structure to dispose all operational aircrafts.
6, quick commander's control method of battlefield according to claim 1 operational aircraft low-risk disposition, it is characterized in that to meet with risk minimums be that target and the commander's controlling models with low computational complexity and high solvability are meant for the computational complexity that reduces this commander controlling models and the solvability of this commander's controlling models of raising to described structure to dispose all operational aircrafts, stipulate that the constraint condition relevant with the deployment point is that the constraint condition that equals deployment point deployment amount, the constraint condition relevant with the assembly place are to be not more than the constraint condition that the assembly place maximum can the deployment amount.
7, quick commander's control method of battlefield according to claim 1 operational aircraft low-risk disposition, it is characterized in that described and use linear programming, the dual program method of linear programming is found the solution this model, by two-dimentional form solving result is updated again, the option control command that meets the low-risk disposition requirement until final acquisition is meant by the method for finding the solution linear programming and finding the solution the dual program of linear programming finds the solution commander's controlling models, can obtain to meet with the flight path of risk probability respectively from the minimum flight that different assembly places deployment operational aircrafts need to different deployment points, with different assembly places and the relevant shadow price of different deployment points constraint condition, the result that will find the solution inserts in a kind of two dimension commander's control form again, according to analysis to this two dimension commander control form, and pass through according to shadow price, the risk bottleneck is adjusted correlation parameter, constantly find the solution and update, meet the option control command of battlefield operational aircraft low-risk disposition requirement until final acquisition.
8, quick commander's control method of battlefield according to claim 1 operational aircraft low-risk disposition, it is characterized in that described and use linear programming, the dual program method of linear programming is found the solution this model, by two-dimentional form solving result is updated again, the option control command that meets the low-risk disposition requirement until final acquisition is meant can be by describing the quantity of the operational aircraft of disposing to each deployment point from each assembly place as the zones of different in the two-dimentional form of option control command, each deployment point need deliver the size of power, flight meets with risk probability, operational aircraft batch with relevant shadow price, the quantity of operational aircraft can be disposed in each assembly place, the situation of change and relevant shadow price and the priming the pump of disposing all operational aircrafts of residue operational aircraft quantity.
9, quick commander's control method of battlefield according to claim 1 operational aircraft low-risk disposition, it is characterized in that described this method meets with risk probability according to the flight on the flight path from different assembly places to different deployment points, the assembly place operational aircraft can the deployment amount and the deployment point to the demand of operational aircraft, the quantity of operational aircraft batch, structure is target and the commander's controlling models with low computational complexity and high solvability to dispose all operational aircrafts experience risk minimums, and use linear programming, the dual program method of linear programming is found the solution this model and is meant the following case study that the quick commander of battlefield operational aircraft low-risk disposition is controlled, but following mathematical formulae, derivation, result of calculation and application process are applicable to the quick commander's control to all battlefield operational aircraft low-risk dispositions
Supposing that battlefield operational aircraft low-risk disposition problem can be used by the deployment point of the assembly place of m supply operational aircraft and n demand operational aircraft and between different supply and demand nodes exists the network in the path of a deployment operational aircraft to describe, and is x from assembly place i to the operational aircraft quantity that deployment point j disposes Ij, it is p that flight meets with risk probability Ij(t), flight meets with risk probability and is meant that complicated battlefield surroundings may cause adverse effect to the operational aircraft along a certain flight path flight, thereby reduce the security of operational aircraft flight, for meeting with commander's control that the risk minimum is a target to dispose operational aircraft, this reduction has been equivalent to increase the risk that operational aircraft flight faces, it can be with the function of time as variable that flight meets with risk probability, also can be and irrelevant constant of time, is expressed as p Ij, the flight of different flight paths meets with risk probability can be different,
The problem that need to solve be one of design from m assembly place deployment operational aircraft to n deployment point, make the flight of disposing all operational aircrafts meet with risk probability simultaneously and be minimum mapping out the plan, and calculate the quantity that required batch of operational aircraft is disposed in each assembly place, relevant operational aircraft deployment commander's controlling models and linear programming equation are as follows:
Objective function: min Z = Σ i = 1 m Σ j = 1 n p ij x ij
The deployment point is to the constraint condition of operational aircraft demand: Σ i = 1 m x ij = D j , (j=1,…,n)
The assembly place can supply to dispose the constraint condition of operational aircraft amount: Σ j = 1 n x ij ≤ S i , (i=1,…,m)
Condition of Non-Negative Constrains: x Ij〉=0, (i=1 ..., m; J=1 ..., n)
Assembly place i (i=1 ... m) the quantity V of the operational aircraft of need disposing batch i:
Figure A2006100402480004C4
The maximum flight relevant with j deployment point meets with risk probability: p j = max p ij ∈ P op { p ij } , j(j=1,…n)
Finish the flight experience risk probability that all operational aircrafts are disposed: min P=max{p j, j (j=1 ... n)
With j the risk carrying capacity that the deployment point is relevant: min Z j = Σ i = 1 m p ij x ij , j(j=1,…n)
The overall risk carrying capacity that the battlefield operational aircraft is disposed: min Z = Σ j = 1 n min Z j
Wherein:
M is for disposing the assembly place sum of operational aircraft;
N is the deployment point sum of demand operational aircraft;
P OpBe commander's controlling models p by associated pathway when obtaining optimum solution IjThe set of forming;
The value of objective function was called the risk carrying capacity when min Z obtained optimum solution for commander's controlling models, and this value is the smaller the better;
p IjFor assembly place i (i=1 ... m) with deployment point j (j=1 ... n) flight between meets with risk probability, can be with the function of time t as variable;
V iFor the assembly place i that disposes operational aircraft (i=1 ... m) dispose batch quantity that operational aircraft needs;
L is the ability (unit: frame) of each batch deployment operational aircraft;
S iFor assembly place i (i=1 ... m) quantity (unit: frame) of the operational aircraft that can dispose;
D jFor deployment point j (j=1 ... n) need the quantity (unit: frame) of operational aircraft;
Above-mentioned model shows: objective function be equivalent to ask probability-weighted and, on the basis of trying to achieve risk carrying capacity min Z value by linear programming, can calculate each assembly place must be to the operational aircraft quantity x of related deployment point deployment Ij, the p of associated pathway Ij, count L according to the contained operational aircraft frame of each batch again, can calculate the operational aircraft batch V that need dispose each assembly place i, the last risk carrying capacity min Z that can calculate each deployment point again j, maximum flight meets with risk probability p jFinish the flight experience risk probability min P that all battlefield operational aircrafts are disposed, thereby realize commander's control to battlefield operational aircraft low-risk disposition, for constraint condition rationally being set, improving solvability, utilizing above-mentioned linear programming model better, the dual linear programming model that provides this model is as follows:
Objective function: max G = Σ j = 1 n D j y j + Σ i = 1 m S i y n + i
Constraint condition: D jy j+ S iy N+i≤ p Ij, (i=1 ..., m; J=1 ..., n)
Condition of Non-Negative Constrains: y j, y N+i〉=0, (i=1 ..., m; J=1 ..., n)
Wherein: y j, y N+iBe respectively with the demand of former linear programming and dispose the shadow price or the relevant decision variable of opportunity cost of operational aircraft constraint condition,
Since primal linear programming solves be with deployment point j and assembly place i (i=1 ..., m; J=1 ..., the resource optimal utilization problem that constraint condition n) is relevant, thus dual program solve then be estimate to make deployment point j and assembly place i (i=1 ..., m; J=1 ..., constraint condition n) satisfies the cost problem that must pay, promptly uses the valency problem, and shadow price y jAnd y N+iReflection make just deployment point j and assembly place i (i=1 ..., m; J=1, n) constraint condition satisfies the cost that must pay, by making the target function value relevant minimize (or maximization) with cost, shadow price can be used for each constraint condition of comparison and carry out equivalence analysis to the contribution of target function value or to this contribution influence, shadow price is big more, show that this constraint condition is big more to the influence of the priming the pump delivery power of option control command, but it is also just difficult more to satisfy this condition, therefore, introducing shadow price just can be by comparing shadow price and realistic objective functional value, and can variation that study former linear programming constraint condition make objective function obtain gain.
10, quick commander's control method of battlefield according to claim 1 operational aircraft low-risk disposition, it is characterized in that described this method meets with risk probability according to the flight on the flight path from different assembly places to different deployment points, the assembly place operational aircraft can the deployment amount and the deployment point to the demand of operational aircraft, the quantity of operational aircraft batch, structure is target and the commander's controlling models with low computational complexity and high solvability to dispose all operational aircrafts experience risk minimums, and use linear programming, the dual program method of linear programming is found the solution this model, by two-dimentional form solving result is updated again, the option control command that meets the low-risk disposition requirement until final acquisition is meant if the option control command of trying to achieve can not satisfy predetermined risk requirement, then can be by two dimension commander control table, result to former linear programming and dual program analyzes, come definite bottleneck that influences the risk of battlefield operational aircraft deployment, carry out reasonable disposition by operational aircraft quantity again to the assembly place, increase the quantity of operational aircraft batch and adopt dissimilar means such as operational aircraft, eliminate the risk bottleneck, and repeat this process, until making the risk of finishing battlefield operational aircraft deployment meet predetermined requirement, this process can be described with following example, but the mathematical formulae described in example, result of calculation, various forms and application process are applicable to the quick commander's control to all battlefield operational aircraft low-risk dispositions
Suppose with 16, average speed per hour to be that 70 kilometers operational aircraft is as an operational aircraft batch, dispose the operational aircraft of specified amount to 14 deployment points from 5 assembly places, between assembly place and the deployment point flight meet with risk probability, assembly place operational aircraft can the deployment amount and the deployment point as shown in table 1 to the demand of operational aircraft
Table 1: flight meets with risk probability, portion's amount of asking (unit: probability, frame) between assembly place and the deployment point 01 assembly place 02 assembly place 03 assembly place 04 assembly place 05 assembly place Quantity required 14 deployment points, 13 deployment points, 12 deployment points, 11 deployment points, 10 deployment points, 09 deployment point, 08 deployment point, 07 deployment point, 06 deployment point, 05 deployment point, 04 deployment point, 03 deployment point, 02 deployment point, 01 deployment point 0.037 0.034 0.025 0.014 0.026 0.024 0.120 0.159 0.112 0.062 0.091 0.126 0.090 0.081 0.013 0.025 0.028 0.015 0.035 0.020 0.098 0.138 0.096 0.037 0.066 0.097 0.068 0.056 0.070 0.083 0.108 0.097 0.082 0.110 0.012 0.051 0.096 0.046 0.017 0.081 0.099 0.020 0.074 0.087 0.112 0.101 0.086 0.100 0.129 0.149 0.025 0.050 0.079 0.086 0.104 0.066 0.044 0.031 0.066 0.058 0.056 0.039 0.105 0.145 0.110 0.059 0.073 0.027 0.011 0.075 36.00 21.00 90.00 130.00 70.00 40.00 60.00 16.00 29.00 36.00 90.00 22.00 18.00 24.00 Can the deployment amount 250.00 200.00 300.00 400.00 150.00
According to above-mentioned linear programming and commander controlling models and relevant dual linear programming model, the option control command of the minimum risk operational aircraft that calculates by simplex algorithm deployment is as shown in table 2, and wherein the frame risk is the risk carrying capacity min Z of deployment point j, risk probability is that the maximum flight of deployment point meets with risk probability p j,
Table 2: minimum flight meets with risk probability and disposes option control command (unit: frame, frame risk, probability, batch) 01 assembly place 02 assembly place 03 assembly place 04 assembly place 05 assembly place The frame risk Risk probability Batch Shadow price 07 deployment point, 06 deployment point, 05 deployment point, 04 deployment point, 03 deployment point, 02 deployment point, 01 deployment point 90.00 90.00 70.00 36.00 21.00 40.00 40.00 60.00 0.468 0.525 2.250 1.860 1.820 0.800 0.720 0.013 0.025 0.025 0.015 0.026 0.020 0.012 3 2 6 9 5 3 4 0.00 12.00 13.00 2.00 14.00 7.00 0.00
14 deployment points, 13 deployment points, 12 deployment points, 11 deployment points, 10 deployment points, 09 deployment point, 08 deployment point 36.00 16.00 90.00 24.00 29.00 22.00 18.00 0.816 0.725 1.332 1.530 0.594 0.198 0.480 0.051 0.025 0.037 0.017 0.027 0.011 0.020 1 2 3 6 2 2 2 39.00 0.00 24.00 5.00 16.00 0.00 8.00 Add up to 250.00 173.00 190.00 29.00 40.00 14.118 0.051* 50 But portion's quantity 250.00 200.00 300.00 400.00 150.00 Surplus after the portion 0.00 27.00 110.00 371.00 110.00 Shadow price 12.00 13.00 12.00 25.00 11.00
* the flight experience risk probability of finishing deployment task is 0.051
By option control command (table 2) is analyzed as can be known; finish operational aircraft that deployment task needs and batch add up to 50; it is 0.051 that flight meets with risk probability; the operational aircraft that 01~05 assembly place needs batch is respectively 17; 14; 13; 2 and 4; therefore must be to 01; 02 and 03 assembly place implements to lay special stress on protecting; further analyze as can be known; meeting with risk probability 0.051 from 03 assembly place to the flight of 16 operational aircrafts of 08 deployment point deployment is to reduce the bottleneck that the flight of finishing all battlefield operational aircrafts deployment meets with risk probability; finish this part deployment if meet with the operational aircraft of risk probability with lower flight; then risk probability can be reduced to 0.037; reduction is 27.45%; and for example fruit is adopted to use the same method and eliminates 0.037 bottleneck; then risk probability can be reduced to 0.027; reduction is 47.06%; almost only be half of former risk probability
From to demand constraint condition D j(j=1,14) analysis of shadow price as can be known, the size of price has truly reflected the complexity that the related constraint condition satisfies, shadow price is 0 to be meant in specific span, and relevant constraint condition does not constitute influence to target function value, the easiliest satisfies, again for example, in order to satisfy constraint condition D 8, the risk of disposing operational aircraft to 08 deployment point is 0.051, the shadow price of this constraint condition is a maximal value 39, illustrates that this condition is the most difficult satisfied, can be by D with similar method jThe complexity that satisfies, from difficulty to easy ordering: D 8, D 10, D 12, D 5..., to deployment amount constraint condition S i(i=1 ..., 5) analysis of shadow price as can be known, S iThe complexity that satisfies, from difficulty to easy ordering: S 4, S 2, S 1, S 3, S 5, i.e. constraint condition S 4It is the most difficult satisfied,
In addition, from the residue operational aircraft amount of each assembly place, back of finishing the work as can be seen, the surplus of 01 assembly place and 02 assembly place is obviously on the low side, and particularly the operational aircraft that can dispose of 01 assembly place exhausts, this statement of facts:, add S if there is more operational aircraft 01 assembly place 1Constraint condition more easily satisfies, and just may obtain better to map out the plan, and therefore, can also carry out reasonable configuration to the operational aircraft of each assembly place with said method, and realization can be disposed the Optimal Management of operational aircraft quantity.
CNA2006100402486A 2006-05-12 2006-05-12 Rapid command control method of low risk deployment for war field battle airplane Pending CN1845145A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNA2006100402486A CN1845145A (en) 2006-05-12 2006-05-12 Rapid command control method of low risk deployment for war field battle airplane

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNA2006100402486A CN1845145A (en) 2006-05-12 2006-05-12 Rapid command control method of low risk deployment for war field battle airplane

Publications (1)

Publication Number Publication Date
CN1845145A true CN1845145A (en) 2006-10-11

Family

ID=37064073

Family Applications (1)

Application Number Title Priority Date Filing Date
CNA2006100402486A Pending CN1845145A (en) 2006-05-12 2006-05-12 Rapid command control method of low risk deployment for war field battle airplane

Country Status (1)

Country Link
CN (1) CN1845145A (en)

Similar Documents

Publication Publication Date Title
CN105184092B (en) Polymorphic type unmanned plane cotasking distribution method under the conditions of a kind of resource constraint
Xie et al. A hybrid metaheuristic for multiple runways aircraft landing problem based on bat algorithm
CN108594645B (en) Planning method and system for single-station multi-unmanned aerial vehicle distribution and flight route
Alotaibi et al. Unmanned aerial vehicle routing in the presence of threats
CN1845145A (en) Rapid command control method of low risk deployment for war field battle airplane
CN1848148A (en) Fast command control method of battlefield guided missile firepower fast and high-hit rate-distribution
CN113625767A (en) Fixed-wing unmanned aerial vehicle cluster collaborative path planning method based on preferred pheromone gray wolf algorithm
CN1845144A (en) Command control method of low risk deployment for war field battle airplane
CN113177583A (en) Aerial target clustering method
CN1848150A (en) Fast command control method for battlefield guided missile firepower high-hit rate distribution
CN1845154A (en) Rapid command control method of low risk deployment for war field mechanization infantry
CN1845143A (en) Rapid command control method of rapid deployment for war field battle airplane
CN1848151A (en) Fast command control method of battlefield operation aircraft fast and low-risk disposition
He et al. An operation planning generation and optimization method for the new intelligent combat SoS
CN1848159A (en) Command control method for battlefield missile fire power high-hit rate distribution
CN116088586A (en) Method for planning on-line tasks in unmanned aerial vehicle combat process
CN1848161A (en) Command control method for battle field materials fast transportation
CN1845138A (en) Rapid command control method of low risk transport for war field material
CN1848157A (en) Battle-field guided missile firepower fast distribution fast command control method
CN1845142A (en) Command control method of airplane rapid deployment in war field battle
CN1845146A (en) Command control method of rapid low risk deployment for war field battle airplane
CN1845139A (en) Command control method of low risk transport for war field material
CN1845159A (en) Rapid command control method of rapid low risk deployment for war field mechanization infantry
CN1845155A (en) Rapid command control method of rapid deployment for war field mechanization infantry
CN1845157A (en) Command control method of low risk deployment for war field mechanization infantry

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C12 Rejection of a patent application after its publication
RJ01 Rejection of invention patent application after publication

Open date: 20061011