CN105469139A - Embedded control-based unmanned aerial vehicle air real-time cooperative guidance method - Google Patents
Embedded control-based unmanned aerial vehicle air real-time cooperative guidance method Download PDFInfo
- Publication number
- CN105469139A CN105469139A CN201610014790.8A CN201610014790A CN105469139A CN 105469139 A CN105469139 A CN 105469139A CN 201610014790 A CN201610014790 A CN 201610014790A CN 105469139 A CN105469139 A CN 105469139A
- Authority
- CN
- China
- Prior art keywords
- guidance
- unmanned plane
- guided missile
- particle
- ijk
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 239000002245 particle Substances 0.000 claims abstract description 92
- 230000008901 benefit Effects 0.000 claims description 29
- 239000011159 matrix material Substances 0.000 claims description 16
- 238000009472 formulation Methods 0.000 claims description 4
- 239000000203 mixture Substances 0.000 claims description 4
- 238000005457 optimization Methods 0.000 abstract description 3
- 230000007547 defect Effects 0.000 abstract 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 231100000225 lethality Toxicity 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/12—Target-seeking control
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Biomedical Technology (AREA)
- Data Mining & Analysis (AREA)
- Automation & Control Theory (AREA)
- Health & Medical Sciences (AREA)
- Life Sciences & Earth Sciences (AREA)
- Artificial Intelligence (AREA)
- Radar, Positioning & Navigation (AREA)
- Biophysics (AREA)
- Computational Linguistics (AREA)
- Remote Sensing (AREA)
- Evolutionary Computation (AREA)
- General Health & Medical Sciences (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Aviation & Aerospace Engineering (AREA)
- Aiming, Guidance, Guns With A Light Source, Armor, Camouflage, And Targets (AREA)
Abstract
The invention relates to an embedded control-based unmanned aerial vehicle air real-time cooperative guidance method, which belongs to the field of unmanned aerial vehicle guidance. The method comprises steps: A, an objective function and constraint conditions are made; B, the our unmanned aerial vehicle guidance priority and the enemy threat value are calculated; C, a particle swarm is initialized; D, the guidance right transfer price is calculated; E, the best fitness value of a single particle is calculated; F, the particle swarm is updated; G, the best fitness value of the overall particles is calculated; H, whether to be early mature is judged, if not, a step I is carried out, and if yes, the step F is carried out; and I, whether to meet a termination condition is judged, if not, the step F is carried out, and if yes, termination is carried out. In view of defects of the current domestic air-to-air missile guidance right transfer theory and the technical means, based on the improved particle swarm algorithm and the auction algorithm, a distributed particle swarm auction mixed algorithm with excellent dynamic performance, excellent real-time performance and excellent global optimization performance is brought forward, and the method can be applied to optimization solution to the large-sized air-to-air missile guidance right transfer problem.
Description
Technical field
The present invention relates to the aerial real-time collaborative method of guidance of a kind of unmanned plane based on embedded Control, belong to unmanned plane guidance field.
Background technology
Along with the broad development of unmanned air vehicle technique, its purposes in war is also more and more crucial, and especially utilize unmanned plane to carry out dog fight, not only lethality is large, with low cost, and can effectively reduce one's own side's casualties.But time when guide unmanned plane be on the hazard time, in order to realize striking target and reduce self loss, need guidance power to transfer other wing planes to and continue to guide the guided missile launched, and select any frame wing plane to be key point in problem, its essence is a problem solving global optimum.
Summary of the invention
For unmanned plane guidance power hand-off problem, the invention provides the aerial real-time collaborative method of guidance of a kind of unmanned plane based on embedded Control.
Technical scheme of the present invention is: the aerial real-time collaborative method of guidance of a kind of unmanned plane based on embedded Control, comprises the steps:
A, set objectives function and constraint condition;
B, calculate our unmanned plane guidance right of priority and enemy's threat value;
C, initialization population;
D, calculating guidance power transfer price;
The best fitness value of E, calculating single particle;
F, renewal population;
The best fitness value of G, calculating integral particles;
H, judge whether precocity, then go to step I if not, if then go to step F;
I, whether meet end condition, then go to step F if not, if then terminate.
The concrete steps of described method are as follows:
Step1, set objectives function and constraint condition;
Adopt the auction algorithm based on greediness to calculate the function that sets objectives, the function that sets objectives is:
Formulation constraint condition is:
(1)
represent that we guides at most I piece of guided missile by the i-th frame unmanned plane, I is threshold value;
(2)
represent that one piece of guided missile is guided by a frame unmanned plane at most;
(3) Δ (T, j)≤Δ
i, i=1,2,3...M, represent that the sensing range of unfriendly target T and jth piece guided missile must the radar range Δ of unmanned plane at this end
iin;
Wherein, N is the guided missile number needing cooperative guidance, and M is our unmanned plane number, S
ijfor our unmanned plane guidance right of priority, p
ijfor our the i-th frame unmanned plane is to the guidance ability of jth piece guided missile, x
ijfor our the i-th frame unmanned plane transfers the element weighed in decision matrix to the guidance of jth piece guided missile, represent whether the i-th frame unmanned plane participates in the guidance to jth piece guided missile, can only get 0 or 1,0 expression does not participate in, and 1 represents participation; Power decision matrix is transferred in guidance:
Get any frame in footmark i our M frame unmanned plane corresponding, footmark j correspondence N piece needs any one piece in the guided missile of cooperative guidance;
Step2, calculate our unmanned plane guidance right of priority and enemy's threat value;
Step2.1, first, we comprises the guidance right of priority to enemy plane and the guidance right of priority to guided missile at unmanned plane guidance right of priority:
Step2.1.1, the guidance right of priority of our unmanned plane to enemy plane are that our the i-th frame unmanned plane is to the guidance ability p of jth piece guided missile
ij;
Step2.1.2, the guidance right of priority of our unmanned plane to guided missile comprise angle advantage and distance advantage:
Angle advantage:
wherein, θ
ijfor we the i-th frame unmanned plane speed V
iscore d is departed from direction
ijangle; σ
ijfor jth piece missile velocity V
jscore d is departed from direction
ijthe angle of extended line;
for the effective working cone angle of jth piece missile's rearward-facing antenna, δ
ifor our the i-th frame unmanned plane radar maximum search cone angle; d
ijfor the score of our the i-th frame unmanned plane and jth piece guided missile;
Distance advantage:
Wherein, r
ifor our the i-th frame unmanned plane radar is to the maximum guidance range of guided missile, e is exponential constant;
Comprehensive angle advantage, distance advantage can obtain the guidance right of priority of our unmanned plane to guided missile and be:
wherein, e
1, e
2for weight coefficient and e
1+ e
2=1;
Draw, we guides right of priority by unmanned plane
wherein, u
1, u
2for weight coefficient and u
1+ u
2=1;
Step2.2, enemy's threat value comprise threat and kill probability; Wherein, A is the threat of enemy plane to our unmanned plane, and g is the kill probability of enemy plane guided missile;
Step3, initialization population:
Element x ij arbitrary in decision matrix being mapped to arbitrary particle xij in population is PP at the positional representation of E dimension space
ij=(pp
ij1, pp
ij2... pp
ijE), the desired positions of arbitrary particle xij process is PP, i.e. the best fitness value of single particle, and the desired positions of integral particles process is PP
best, i.e. the best fitness value of integral particles; Wherein, pp
ij1, pp
ij2... pp
ijErepresent arbitrary particle x
ijthe component of position in E dimension coordinate system in E coordinate axis;
Step4, calculating guidance power transfer price:
Adopt based on greediness auction algorithm calculate guidance power transfer price (auction algorithm need auction the both sides i.e. side of auction and auction side, auction side for we send transfer guidance power unmanned plane, auction side be we participate in guide weigh transfer unmanned plane.), calculating our the guidance power transfer price of the i-th frame unmanned plane participation jth piece guided missile is J
ij=a
1* V
ij-a
2* K
ij; Wherein, a
1, a
2for weight coefficient, for adjusting the ratio of interests and cost, and a
1+ a
2=1; The benefit that the guidance power that our the i-th frame unmanned plane participates in jth piece guided missile is transferred is
e is exponential constant; The cost that the guidance power that our the i-th frame unmanned plane participates in jth piece guided missile is transferred is K
ij=A*g;
The best fitness value of Step5, calculating single particle:
First, the fitness function defining particle is
Secondly, price J is transferred by guidance power
ijinput as fitness function calculates the best fitness value PP of single particle;
Step6, renewal population;
After by Step3 initialization being carried out to population, define every generation particle and upgrade the speed of oneself and the formula of position is:
Speed: pv
ijk=cpv
ijk+ d
1r
1pp
ijk+ d
2r
2pp
ijk; Wherein, c is inertia weight, value between [0.1,0.9], d
1, d
2for Studying factors, r
1, r
2for coefficient value is between [0,1], footmark k represents each component in E dimension coordinate system in each coordinate axis, k=1,2,3...E, pv
ijkrepresent the component of the speed of arbitrary particle xij in E dimension coordinate system in E coordinate axis;
(2) position: pp
ijk=pp
ijk+ tpv
ijkrepresent the position pp of previous generation particle
ijkwith previous generation particle in refresh time t with speed pv
ijkthe position sum changed is as the position pp of particle of future generation
ijk;
The best fitness value of Step7, calculating integral particles:
The fitness function of definition particle is
price J is transferred by guidance power
ijinput as fitness function calculates the best fitness value PP of integral particles
best;
Step8, judge whether precocity:
When having a particle x
ijbest fitness value PP be greater than the best fitness value PP of integral particles
best, then become precocious, then forward Step6 to and continue to upgrade population; Otherwise represent and do not occur precocity, so enter Step9;
Step9, judge whether to meet end condition:
By step Step8, draw in population and do not occur precocity, then obtain and particle x
ijthe particle position PP corresponding to best fitness value PP
ij, according to PP
ijobtain element x in corresponding decision matrix
ijvalue as transfer program, then whether meet according to step Step1 constraint IF condition:
If do not meet constraint condition, then forward Step6 to and continue to upgrade population;
If meet constraint condition, then calculating target function F (x), exports net result.
The invention has the beneficial effects as follows:
The deficiency of theory and technology means is transferred for Present Domestic air-to-air missile guidance power, based on modified particle swarm optiziation and auction algorithm, propose a kind of distributed dynamic, real-time and global optimizing performance population auction all preferably hybrid algorithm, the Optimization Solution of extensive air-to-air missile guidance power hand-off problem can be applied to.
Accompanying drawing explanation
Fig. 1 is process flow diagram of the present invention;
Fig. 2 is guided missile of the present invention and our unmanned plane relative attitude figure.
Embodiment
Embodiment 1: as shown in Figure 1-2,
The aerial real-time collaborative method of guidance of unmanned plane based on embedded Control, comprises the steps:
A, set objectives function and constraint condition;
B, calculate our unmanned plane guidance right of priority and enemy's threat value;
C, initialization population;
D, calculating guidance power transfer price;
The best fitness value of E, calculating single particle;
F, renewal population;
The best fitness value of G, calculating integral particles;
H, judge whether precocity, then go to step I if not, if then go to step F;
I, whether meet end condition, then go to step F if not, if then terminate.
The concrete steps of described method are as follows:
Step1, set objectives function and constraint condition;
Adopt the auction algorithm based on greediness to calculate the function that sets objectives, the function that sets objectives is:
Formulation constraint condition is:
(1)
represent that we guides at most I piece of guided missile by the i-th frame unmanned plane, I is threshold value;
(2)
represent that one piece of guided missile is guided by a frame unmanned plane at most;
(3) Δ (T, j)≤Δ
i, i=1,2,3...M, represent that the sensing range of unfriendly target T and jth piece guided missile must the radar range Δ of unmanned plane at this end
iin;
Wherein, N is the guided missile number needing cooperative guidance, and M is our unmanned plane number, S
ijfor our unmanned plane guidance right of priority, p
ijfor our the i-th frame unmanned plane is to the guidance ability of jth piece guided missile, x
ijfor our the i-th frame unmanned plane transfers the element weighed in decision matrix to the guidance of jth piece guided missile, represent whether the i-th frame unmanned plane participates in the guidance to jth piece guided missile, can only get 0 or 1,0 expression does not participate in, and 1 represents participation; Power decision matrix is transferred in guidance:
Get any frame in footmark i our M frame unmanned plane corresponding, footmark j correspondence N piece needs any one piece in the guided missile of cooperative guidance;
Step2, calculate our unmanned plane guidance right of priority and enemy's threat value;
Step2.1, first, we comprises the guidance right of priority to enemy plane and the guidance right of priority to guided missile at unmanned plane guidance right of priority:
Step2.1.1, the guidance right of priority of our unmanned plane to enemy plane are that our the i-th frame unmanned plane is to the guidance ability p of jth piece guided missile
ij;
Step2.1.2, the guidance right of priority of our unmanned plane to guided missile comprise angle advantage and distance advantage:
Angle advantage:
wherein, θ
ijfor we the i-th frame unmanned plane speed V
iscore d is departed from direction
ijangle; σ
ijfor jth piece missile velocity V
jscore d is departed from direction
ijthe angle of extended line;
for the effective working cone angle of jth piece missile's rearward-facing antenna, δ
ifor our the i-th frame unmanned plane radar maximum search cone angle; d
ijfor the score of our the i-th frame unmanned plane and jth piece guided missile;
Distance advantage:
Wherein, r
ifor our the i-th frame unmanned plane radar is to the maximum guidance range of guided missile, e is exponential constant;
Comprehensive angle advantage, distance advantage can obtain the guidance right of priority of our unmanned plane to guided missile and be:
wherein, e
1, e
2for weight coefficient and e
1+ e
2=1;
Draw, we guides right of priority by unmanned plane
wherein, u
1, u
2for weight coefficient and u
1+ u
2=1;
Step2.2, enemy's threat value comprise threat and kill probability; Wherein, A is the threat of enemy plane to our unmanned plane, and g is the kill probability of enemy plane guided missile;
Step3, initialization population:
By element x arbitrary in decision matrix
ijbe mapped to arbitrary particle x in population
ijbe PP at the positional representation of E dimension space
ij=(pp
ij1, pp
ij2... pp
ijE), the desired positions of arbitrary particle xij process is PP, i.e. the best fitness value of single particle, and the desired positions of integral particles process is PP
best, i.e. the best fitness value of integral particles; Wherein, pp
ij1, pp
ij2... pp
ijErepresent arbitrary particle x
ijthe component of position in E dimension coordinate system in E coordinate axis;
Step4, calculating guidance power transfer price:
Adopt the auction algorithm based on greediness to calculate guidance power and transfer price, calculating guidance power that our the i-th frame unmanned plane participates in jth piece guided missile, to transfer price be J
ij=a
1* V
ij-a
2* K
ij; Wherein, a
1, a
2for weight coefficient, for adjusting the ratio of interests and cost, and a
1+ a
2=1; The benefit that the guidance power that our the i-th frame unmanned plane participates in jth piece guided missile is transferred is
e is exponential constant; The cost that the guidance power that our the i-th frame unmanned plane participates in jth piece guided missile is transferred is K
ij=A*g;
The best fitness value of Step5, calculating single particle:
First, the fitness function defining particle is
Secondly, price J is transferred by guidance power
ijinput as fitness function calculates the best fitness value PP of single particle;
Step6, renewal population;
After by Step3 initialization being carried out to population, define every generation particle and upgrade the speed of oneself and the formula of position is:
Speed: pv
ijk=cpv
ijk+ d
1r
1pp
ijk+ d
2r
2pp
ijk; Wherein, c is inertia weight, value between [0.1,0.9], d
1, d
2for Studying factors, r
1, r
2for coefficient value is between [0,1], footmark k represents each component in E dimension coordinate system in each coordinate axis, k=1,2,3...E, pv
ijkrepresent arbitrary particle x
ijthe component of speed in E dimension coordinate system in E coordinate axis;
(2) position: pp
ijk=pp
ijk+ tpv
ijkrepresent the position pp of previous generation particle
ijkwith previous generation particle in refresh time t with speed pv
ijkthe position sum changed is as the position pp of particle of future generation
ijk;
The best fitness value of Step7, calculating integral particles:
The fitness function of definition particle is
price J is transferred by guidance power
ijinput as fitness function calculates the best fitness value PP of integral particles
best;
Step8, judge whether precocity:
When having a particle x
ijbest fitness value PP be greater than the best fitness value PP of integral particles
best, then become precocious, then forward Step6 to and continue to upgrade population; Otherwise represent and do not occur precocity, so enter Step9;
Step9, judge whether to meet end condition:
By step Step8, draw in population and do not occur precocity, then obtain and particle x
ijthe particle position PP corresponding to best fitness value PP
ij, according to PP
ijobtain element x in corresponding decision matrix
ijvalue as transfer program, then whether meet according to step Step1 constraint IF condition:
If do not meet constraint condition, then forward Step6 to and continue to upgrade population;
If meet constraint condition, then calculating target function F (x), exports net result.
Embodiment 2: as shown in Figure 1-2,
The aerial real-time collaborative method of guidance of unmanned plane based on embedded Control, comprises the steps:
A, set objectives function and constraint condition;
B, calculate our unmanned plane guidance right of priority and enemy's threat value;
C, initialization population;
D, calculating guidance power transfer price;
The best fitness value of E, calculating single particle;
F, renewal population;
The best fitness value of G, calculating integral particles;
H, judge whether precocity, then go to step I if not, if then go to step F;
I, whether meet end condition, then go to step F if not, if then terminate.
Embodiment 3: as shown in Figure 1-2,
The aerial real-time collaborative method of guidance of unmanned plane based on embedded Control, comprises the steps:
A, set objectives function and constraint condition;
B, calculate our unmanned plane guidance right of priority and enemy's threat value;
C, initialization population;
D, calculating guidance power transfer price;
The best fitness value of E, calculating single particle;
F, renewal population;
The best fitness value of G, calculating integral particles;
H, judge whether precocity, then go to step I if not, if then go to step F;
I, whether meet end condition, then go to step F if not, if then terminate.
Specific experiment is as follows:
Assuming that we has 6 frame unmanned planes, r
1, r
2, r
3, r
4, r
5, r
6, wherein r
4just guide M
1, M
2attack enemy plane b
1, b
2, now r
4withdrawn by enemy plane locking needs, therefore abandon guidance power, require that other wing planes carry out guidance power and transfer.In algorithm, each parameter is provided by expertise, and each flight parameter is provided by table 1, and transfer program is provided by table 2.
Table 1. flight parameter
Numbering | Horizontal ordinate | Ordinate | Direction | Speed | Scope | Distance by radar |
r1 | -140 | -48 | 17.22 | 360 | 200 | 220 |
r2 | -140 | -120 | 35.43 | 385 | 200 | 220 |
r3 | -120 | -140 | 47.74 | 400 | 200 | 220 |
r4 | -140 | 0 | 0 | 440 | 200 | 220 |
r5 | -260 | -255 | 49.17 | 400 | 200 | 220 |
r6 | 0 | -160 | 100 | 400 | 200 | 220 |
b1 | 10 | 0 | 0 | 420 | 220 | 240 |
b2 | -120 | -20 | 0 | 400 | 220 | 240 |
M1 | -120 | 0 | 0 | 1200 | ||
M2 | -80 | 0 | 0 | 1200 |
As shown in Table 1, M=6, N=2, i=1,2,3,4,5,6, j=1,2.
The decision matrix that power is transferred in guidance is:
Step1, set objectives function and constraint condition;
Adopt the auction algorithm based on greediness to calculate the function that sets objectives, the function that sets objectives is:
Formulation constraint condition is:
(1)
represent that we guides at most I piece of guided missile by the i-th frame unmanned plane, I is threshold value;
(2)
represent that one piece of guided missile is guided by a frame unmanned plane at most;
(3) Δ (T, j)≤Δ
i, i=1,2,3,4,5,6, represent that the sensing range of unfriendly target T and jth piece guided missile must the radar range Δ of unmanned plane at this end
iin;
Step2, calculate our unmanned plane guidance right of priority and enemy's threat value;
Step2.1, first, we comprises the guidance right of priority to enemy plane and the guidance right of priority to guided missile at unmanned plane guidance right of priority:
Step2.1.1, the guidance right of priority of our unmanned plane to enemy plane are that our the i-th frame unmanned plane is to the guidance ability p of jth piece guided missile
ij;
Wherein, we is to the guidance right of priority of enemy plane, for without loss of generality, gets the guidance ability of our 6 frame unmanned planes to 2 pieces of guided missiles and is 0.5, i.e. p
ij=0.5.
Step2.1.2, the guidance right of priority of our unmanned plane to guided missile comprise angle advantage and distance advantage:
Wherein, the guidance right of priority of our unmanned plane to guided missile comprises angle and distance advantage.For without loss of generality, the effective working cone angle of aft antenna of the radar maximum search cone angle and 2 pieces of guided missiles of getting our 6 frame unmanned planes is current accepted value.
Angle advantage:
In sum, can show that we guides right of priority and is thus:
Step2.2, enemy's threat value comprise threat and kill probability.
Wherein, make 1 for enemy plane is to the threat of our unmanned plane, i.e. A=1,0.5 is the kill probability of enemy plane guided missile, i.e. g=0.5.
Step3, initialization population:
For without loss of generality, get E=3, namely in three dimensions, in population, speed and the position component on three axles of arbitrary particle is three random numbers.
Step4, calculating guidance power transfer price:
The benefit that the guidance power that our the i-th frame unmanned plane participates in jth piece guided missile is transferred is:
K
11=K
12=K
21=K
22=K
31=K
32=K
41=K
42=K
51=K
52=K
61=K
62=0.5
The guidance power transfer price that our the i-th frame unmanned plane participates in jth piece guided missile is:
For without loss of generality, get a
1=a
2=0.5, then
Table 2. guides power transfer program
Guided missile is numbered | Unmanned plane is numbered | Price |
M 1 | r 3 | 0.18595 |
M 2 | r 6 | 0.195 |
The best fitness value of Step5, calculating single particle:
First, the fitness function defining particle is
Secondly, price J is transferred by guidance power
ijinput as fitness function calculates the best fitness value PP of single particle;
Step6, renewal population;
After by Step3 initialization being carried out to population, define every generation particle and upgrade the speed of oneself and the formula of position is:
Speed: pv
ijk=cpv
ijk+ d
1r
1pp
ijk+ d
2r
2pp
ijk; Wherein, because E=3, therefore k=1,2,3; For without loss of generality, c=0.5 might as well be established, d
1=d
2=0.5, r
1=r
2=0.5.
(2) position: pp
ijk=pp
ijk+ tpv
ijkrepresent the position pp of previous generation particle
ijkwith previous generation particle in refresh time t with speed pv
ijkthe position sum changed is as the position pp of particle of future generation
ijk; Wherein, because E=3, therefore k=1,2,3
The best fitness value of Step7, calculating integral particles:
The fitness function of definition particle is
price J is transferred by guidance power
ijinput as fitness function calculates the best fitness value PP of integral particles
best;
Step8, judge whether precocity:
Step9, judge whether to meet end condition:
From the above, be without loss of generality in the present embodiment, all parameters all choose the convenient conventional fixed value calculated, and get E=3 in population, namely, in three dimensions, in population, speed and the position component on three axles of arbitrary particle is three random numbers simultaneously.Therefore all meet PP≤PP
best, namely there will not be precocious phenomenon, and certainly meet constraint condition.
Then:
The decision matrix that power is transferred in guidance is:
Objective function: F (x)=MAX{0.29,0.275}=0.29.
From table 2, guidance transfer power decision matrix, objective function can be found out, this algorithm consider guidance power transfer time interests and cost, have selected r
3and r
6as the cooperative guidance of guided missile, guidance advantage and self loss have been taken into account simultaneously, in addition each frame unmanned plane can determine whether joining in cooperative guidance and goes by the environment residing for self, when certain frame unmanned plane does not participate in the transfer of guidance power, the traffic between the calculated amount of algorithm and body can be effectively reduced.
By reference to the accompanying drawings the specific embodiment of the present invention is explained in detail above, but the present invention is not limited to above-mentioned embodiment, in the ken that those of ordinary skill in the art possess, can also make a variety of changes under the prerequisite not departing from present inventive concept.
Claims (2)
1., based on the aerial real-time collaborative method of guidance of unmanned plane of embedded Control, it is characterized in that: comprise the steps:
A, set objectives function and constraint condition;
B, calculate our unmanned plane guidance right of priority and enemy's threat value;
C, initialization population;
D, calculating guidance power transfer price;
The best fitness value of E, calculating single particle;
F, renewal population;
The best fitness value of G, calculating integral particles;
H, judge whether precocity, then go to step I if not, if then go to step F;
I, whether meet end condition, then go to step F if not, if then terminate.
2. the aerial real-time collaborative method of guidance of the unmanned plane based on embedded Control according to claim 1, is characterized in that: the concrete steps of described method are as follows:
Step1, set objectives function and constraint condition;
Adopt the auction algorithm based on greediness to calculate the function that sets objectives, the function that sets objectives is:
Formulation constraint condition is:
(1)
represent that we guides at most I piece of guided missile by the i-th frame unmanned plane, I is threshold value;
(2)
represent that one piece of guided missile is guided by a frame unmanned plane at most;
(3) Δ (T, j)≤Δ
i, i=1,2,3...M, represent that the sensing range of unfriendly target T and jth piece guided missile must the radar range Δ of unmanned plane at this end
iin;
Wherein, N is the guided missile number needing cooperative guidance, and M is our unmanned plane number, S
ijfor our unmanned plane guidance right of priority, p
ijfor our the i-th frame unmanned plane is to the guidance ability of jth piece guided missile, x
ijfor our the i-th frame unmanned plane transfers the element weighed in decision matrix to the guidance of jth piece guided missile, represent whether the i-th frame unmanned plane participates in the guidance to jth piece guided missile, can only get 0 or 1,0 expression does not participate in, and 1 represents participation; Power decision matrix is transferred in guidance:
Get any frame in footmark i our M frame unmanned plane corresponding, footmark j correspondence N piece needs any one piece in the guided missile of cooperative guidance;
Step2, calculate our unmanned plane guidance right of priority and enemy's threat value;
Step2.1, first, we comprises the guidance right of priority to enemy plane and the guidance right of priority to guided missile at unmanned plane guidance right of priority:
Step2.1.1, the guidance right of priority of our unmanned plane to enemy plane are that our the i-th frame unmanned plane is to the guidance ability p of jth piece guided missile
ij;
Step2.1.2, the guidance right of priority of our unmanned plane to guided missile comprise angle advantage and distance advantage:
Angle advantage:
wherein, θ
ijfor we the i-th frame unmanned plane speed V
iscore d is departed from direction
ijangle; σ
ijfor jth piece missile velocity V
jscore d is departed from direction
ijthe angle of extended line;
for the effective working cone angle of jth piece missile's rearward-facing antenna, δ
ifor our the i-th frame unmanned plane radar maximum search cone angle; d
ijfor the score of our the i-th frame unmanned plane and jth piece guided missile;
Distance advantage:
Wherein, r
ifor our the i-th frame unmanned plane radar is to the maximum guidance range of guided missile, e is exponential constant;
Comprehensive angle advantage, distance advantage can obtain the guidance right of priority of our unmanned plane to guided missile and be:
wherein, e
1, e
2for weight coefficient and e
1+ e
2=1;
Draw, we guides right of priority by unmanned plane
wherein, u
1, u
2for weight coefficient and u
1+ u
2=1;
Step2.2, enemy's threat value comprise threat and kill probability; Wherein, A is the threat of enemy plane to our unmanned plane, and g is the kill probability of enemy plane guided missile;
Step3, initialization population:
By element x arbitrary in decision matrix
ijbe mapped to arbitrary particle x in population
ijbe PP at the positional representation of E dimension space
ij=(pp
ij1, pp
ij2... pp
ijE), arbitrary particle x
ijthe desired positions of process is PP, i.e. the best fitness value of single particle, and the desired positions of integral particles process is PP
best, i.e. the best fitness value of integral particles; Wherein, pp
ij1, pp
ij2... pp
ijErepresent arbitrary particle x
ijthe component of position in E dimension coordinate system in E coordinate axis;
Step4, calculating guidance power transfer price:
Adopt the auction algorithm based on greediness to calculate guidance power and transfer price, calculating guidance power that our the i-th frame unmanned plane participates in jth piece guided missile, to transfer price be J
ij=a
1* V
ij-a
2* K
ij; Wherein, a
1, a
2for weight coefficient, for adjusting the ratio of interests and cost, and a
1+ a
2=1; The benefit that the guidance power that our the i-th frame unmanned plane participates in jth piece guided missile is transferred is
e is exponential constant; The cost that the guidance power that our the i-th frame unmanned plane participates in jth piece guided missile is transferred is K
ij=A*g;
The best fitness value of Step5, calculating single particle:
First, the fitness function defining particle is
Secondly, price J is transferred by guidance power
ijinput as fitness function calculates the best fitness value PP of single particle;
Step6, renewal population;
After by Step3 initialization being carried out to population, define every generation particle and upgrade the speed of oneself and the formula of position is:
Speed: pv
ijk=cpv
ijk+ d
1r
1pp
ijk+ d
2r
2pp
ijk; Wherein, c is inertia weight, value between [0.1,0.9], d
1, d
2for Studying factors, r
1, r
2for coefficient value is between [0,1], footmark k represents each component in E dimension coordinate system in each coordinate axis, k=1,2,3...E, pv
ijkrepresent arbitrary particle x
ijthe component of speed in E dimension coordinate system in E coordinate axis;
(2) position: pp
ijk=pp
ijk+ tpv
ijkrepresent the position pp of previous generation particle
ijkwith previous generation particle in refresh time t with speed pv
ijkthe position sum changed is as the position pp of particle of future generation
ijk;
The best fitness value of Step7, calculating integral particles:
The fitness function of definition particle is
price J is transferred by guidance power
ijinput as fitness function calculates the best fitness value PP of integral particles
best;
Step8, judge whether precocity:
When having a particle x
ijbest fitness value PP be greater than the best fitness value PP of integral particles
best, then become precocious, then forward Step6 to and continue to upgrade population; Otherwise represent and do not occur precocity, so enter Step9;
Step9, judge whether to meet end condition:
By step Step8, draw in population and do not occur precocity, then obtain and particle x
ijthe particle position PP corresponding to best fitness value PP
ij, according to PP
ijobtain element x in corresponding decision matrix
ijvalue as transfer program, then whether meet according to step Step1 constraint IF condition:
If do not meet constraint condition, then forward Step6 to and continue to upgrade population;
If meet constraint condition, then calculating target function F (x), exports net result.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610014790.8A CN105469139B (en) | 2016-01-11 | 2016-01-11 | A kind of aerial real-time collaborative method of guidance of unmanned plane based on embedded Control |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610014790.8A CN105469139B (en) | 2016-01-11 | 2016-01-11 | A kind of aerial real-time collaborative method of guidance of unmanned plane based on embedded Control |
Publications (2)
Publication Number | Publication Date |
---|---|
CN105469139A true CN105469139A (en) | 2016-04-06 |
CN105469139B CN105469139B (en) | 2017-12-01 |
Family
ID=55606809
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201610014790.8A Active CN105469139B (en) | 2016-01-11 | 2016-01-11 | A kind of aerial real-time collaborative method of guidance of unmanned plane based on embedded Control |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN105469139B (en) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106595663A (en) * | 2016-11-28 | 2017-04-26 | 四川航天系统工程研究所 | Aircraft auto-route planning method with combination of searching and optimization |
CN107103356A (en) * | 2017-04-24 | 2017-08-29 | 华北电力大学(保定) | Group robot searching method based on dynamic particles honeybee algorithm |
CN110163502A (en) * | 2019-05-21 | 2019-08-23 | 北京壹氢科技有限公司 | A kind of more bullet collaboration multistage target assignment methods |
CN110187640A (en) * | 2019-06-29 | 2019-08-30 | 东南大学 | For more guided missile cooperation Design of Guidance Law methods of maneuvering target and permission communication delay |
CN111650914A (en) * | 2020-07-02 | 2020-09-11 | 昆明理工大学 | Optimal scheduling method for assembly process of automobile power battery |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7552669B1 (en) * | 2005-12-13 | 2009-06-30 | Lockheed Martin Corporation | Coordinated ballistic missile defense planning using genetic algorithm |
CN101908097A (en) * | 2010-07-13 | 2010-12-08 | 北京航空航天大学 | Particle swarm optimization method for air combat decision |
CN103413186A (en) * | 2013-08-19 | 2013-11-27 | 中国电子科技集团公司第二十八研究所 | Cooperative multi-aircraft target distribution method based on hybrid optimization algorithm |
CN104950673A (en) * | 2015-06-11 | 2015-09-30 | 昆明理工大学 | Method for distributing targets cooperatively attacked by unmanned aerial vehicle group |
-
2016
- 2016-01-11 CN CN201610014790.8A patent/CN105469139B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7552669B1 (en) * | 2005-12-13 | 2009-06-30 | Lockheed Martin Corporation | Coordinated ballistic missile defense planning using genetic algorithm |
CN101908097A (en) * | 2010-07-13 | 2010-12-08 | 北京航空航天大学 | Particle swarm optimization method for air combat decision |
CN103413186A (en) * | 2013-08-19 | 2013-11-27 | 中国电子科技集团公司第二十八研究所 | Cooperative multi-aircraft target distribution method based on hybrid optimization algorithm |
CN104950673A (en) * | 2015-06-11 | 2015-09-30 | 昆明理工大学 | Method for distributing targets cooperatively attacked by unmanned aerial vehicle group |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106595663A (en) * | 2016-11-28 | 2017-04-26 | 四川航天系统工程研究所 | Aircraft auto-route planning method with combination of searching and optimization |
CN107103356A (en) * | 2017-04-24 | 2017-08-29 | 华北电力大学(保定) | Group robot searching method based on dynamic particles honeybee algorithm |
CN110163502A (en) * | 2019-05-21 | 2019-08-23 | 北京壹氢科技有限公司 | A kind of more bullet collaboration multistage target assignment methods |
CN110163502B (en) * | 2019-05-21 | 2021-03-05 | 北京壹氢科技有限公司 | Multi-bullet cooperative multi-stage target distribution method |
CN110187640A (en) * | 2019-06-29 | 2019-08-30 | 东南大学 | For more guided missile cooperation Design of Guidance Law methods of maneuvering target and permission communication delay |
CN111650914A (en) * | 2020-07-02 | 2020-09-11 | 昆明理工大学 | Optimal scheduling method for assembly process of automobile power battery |
CN111650914B (en) * | 2020-07-02 | 2023-03-28 | 昆明理工大学 | Optimal scheduling method for assembly process of automobile power battery |
Also Published As
Publication number | Publication date |
---|---|
CN105469139B (en) | 2017-12-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN105469139A (en) | Embedded control-based unmanned aerial vehicle air real-time cooperative guidance method | |
Kang et al. | Optimal cooperative guidance law for salvo attack: An MPC-based consensus perspective | |
CN105739303B (en) | Multiple no-manned plane collaboration strike method for allocating tasks based on rolling time horizon method | |
CN106502250B (en) | The path planning algorithm of multi-robot formation in three-dimensional space | |
CN106020230A (en) | Task distribution method for multiple unmanned planes within constraint of energy consumption | |
CN103413186B (en) | A kind of multi-aircraft based on hybrid optimization algorithm works in coordination with target assignment method | |
CN106403948A (en) | Three-dimensional flight track planning method for electric transmission line inspection unmanned aerial vehicle | |
Bao et al. | Path planning for reconnaissance UAV based on particle swarm optimization | |
CN105116381A (en) | Multi-beam radar time power resource joint distribution method | |
CN114200826B (en) | High stability control method for supersonic speed large maneuvering target continuous large overload maneuvering | |
CN110928329A (en) | Multi-aircraft track planning method based on deep Q learning algorithm | |
CN103324993B (en) | A kind of track optimizing method based on multi-aircraft cooperation | |
Xia et al. | Multi—UAV path planning based on improved neural network | |
CN105184092A (en) | Method for achieving multi-type unmanned aerial vehicle cooperative task assignment under resource constraints | |
CN112824998A (en) | Multi-unmanned aerial vehicle collaborative route planning method and device in Markov decision process | |
CN112379600A (en) | Distributed cooperative guidance law construction method based on communication time-varying delay | |
CN116680509A (en) | Dynamic matching method for multi-spacecraft escape-tracking game task | |
Wang et al. | An efficient clonal selection algorithm to solve dynamicweapon-target assignment game model in UAV cooperative aerial combat | |
CN112882493B (en) | Cluster cooperative deployment method based on distributed optimal energy MPC | |
CN104406588A (en) | Air route planning method based on guide speed field in threat environment | |
Qian et al. | Route planning of UAV based on improved ant colony algorithm | |
CN113110576B (en) | Self-adaptive fixed time convergence cooperative guidance method capable of realizing continuous switching | |
CN101576968B (en) | Method for sorting target threat based on cloud model reasoning | |
CN106249759B (en) | A kind of conflict coordination method of guided missile autonomous formation in formation control process | |
Guopeng et al. | Research on Path planning of Three-Dimensional UAV Based on Levy Flight Strategy and Improved Particle Swarm Optimization Algorithm |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |