# Multi-UAVs Formation Autonomous Control Method Based on RQPSO-FSM-DMPC

Authors: Shao-lei Zhou; Yu-hang Kang; Hong-de Dai; Zhou Chao
Journal: Mathematical Problems in Engineering
 (2016)

---

## Abstract

For various threats in the enemy defense area, in order to achieve covert penetration and implement effective combat against enemy, the unmanned aerial vehicles formation needs to be reconfigured in the process of penetration; the mutual collision avoidance problems and communication constraint problems among the formation also need to be considered. By establishing the virtual-leader formation model, this paper puts forward distributed model predictive control and finite state machine formation manager. Combined with distributed cooperative strategy establishing the formation reconfiguration cost function, this paper proposes that adopting the revised quantum-behaved particle swarm algorithm solves the cost function, and it is compared with the result which is solved by particle swarm algorithm. Simulation result shows that this algorithm can control multiple UAVs formation autonomous reconfiguration effectively and achieve covert penetration safely.


---

## Body

## 1. Introduction

Multiple UAVs formation control has become an important research direction in the field of UAV control in recent years [1–8], whether in military applications or in civil applications, and it has attracted a lot of attention. Compared with executing the task by single UAV, multiple UAVs formation has significant advantages in terms of time consumption, project selection, task completion rate, and so on. However, as the battlefield environment or formation task changes, the formation or loose degree of UAVs formation needs to be changed, namely, formation reconfiguration. Therefore, it is very important to research a kind of fast, safe, effective, and applicable multiple UAVs formation reconfiguration method [9–14].Multiple UAVs formation reconfiguration has been widely researched in domestic and foreign regions currently. In order to solve the problem of autonomous formation reconfiguration under the threat of known radar and missile, the literature [15, 16] proposed a method that achieves the location optimal configuration of different load UAVs by the plan, reaction, and parameters, then reaches the goal which is the inference of the enemies’ radar and missile cooperatively, and ensures the overall safety of the formation, but it did not put forward the effective formation reconfiguration control method for the UAV model. The optimal time control problem of the fixed terminal state constraints has been discussed in detail by the literature [17, 18]. The optimal time control problem of free terminal state constraints has been discussed in [19–21], but all of them do not consider the distance constraint and collision avoidance constraint. The mathematical description of UAV has been described by the literature [22], and it adopts the optimal control and differential countermeasure theory to analyze whether the external aircraft can influence the collision avoidance among UAVs of the formation. The literature [23] takes artificial potential field method to control the UAV formation so that the UAV formation can avoid the collision among them, but the design of potential field is very complicated, it is only suitable for the collision avoidance of the fixed formation, and it is difficult to be applied to the process of formation reconfiguration. The literature [24] adopts DMPC to solve the collision avoidance problem among UAVs in three-dimensional space, but this method can only calculate the path of collision avoidance, and it is not suitable for the formation problem with clear goal state. The literature [25] maps the formation onto large rigid graph; when the formation passes the obstacle zone, the big rigid graph will be divided into many small rigid graphs, the formation passes the obstacle zone by subformation, and this method can only analyze this problem from the angle of system stability, but it does not put forward effective control strategy. In order to solve the multiple UAVs search problem, the literature [26] takes the method of distributed model predictive control that transforms the centralized multiple UAVs optimization decision problem on line to each UAV small scale distributed optimization problem and then adopts the algorithm which is based on particle swarm optimization and Nash optimization achieves iterative solution for each subsystem optimization problem. Based on optimal trajectory generator coupled with a modified sliding controller for tracking the trajectory and avoiding collisions, the literature [27] accomplishes a UAV formation reconfiguration control scheme with autonomous collision avoidance system for application in 3D space. When facing the uncertainties and obstacles, the literature [28] adopts the learning based model predictive control (LBMPC) to solve the formation reconfiguration problem for a group of N cooperative UAVs forming a desired formation. The literature [29] proposes a distributed linear MPC approach to solve the trajectory planning problem for rotary-wing UAVs, and the simulation results show that this method is valid. Under the constraints of terminal status and of control action energy, the literature [30] puts forward a novel algorithm which is pigeon-inspired optimization to solve the problem of multiple unmanned aerial vehicles formation reconfiguration; compared with particle swarm optimization, this algorithm is better.This paper elaborates taking distributed model predictive control (DMPC) and finite state machine (FSM) to solve the formation reconfiguration control for multiple UAVs formation which are the mathematic model of UAV, formation model, and different threat constraints and then puts forward revising quantum-behaved particle swarm algorithm (RQPSO) to solve the cost function of DMPC problem, and the particle swarm optimization algorithm solution is compared. The simulation result shows that the algorithm can accomplish formation configuration quickly and efficiently and then achieve covert penetration.The rest of the paper is organized as follows. Section2 introduces the UAV motion model and formation model. Main environment threats and constraints will be described in Section 3. The concept of distributed model predictive control and the formation reconfiguration control description is provided in Section 4. Then finite state machine formation management unit and the solution of reconfiguration problem which is revised in quantum particle swarm optimization algorithm are, respectively, presented in Sections 5 and 6. The simulation results and experimental explication are shown in Section 7. Finally, the conclusion and future work are reported in Section 8.


## 2. UAV Formation Reconfiguration Model

### 2.1. UAV Motion Model

Assuming that there areN
v UAVs in the UAV formation, then the UAV formation set can be expressed as V
c
=
u
v
i
∣
i
=
1,2
,
…
,
N
v. All the UAVs can keep the flying height constant; therefore, the UAV centroid motion model after discretization can be described as [31, 32](1)
x
i
k
+
1
=
x
i
k
+
v
i
cos
⁡
χ
i
k
τ
,
y
i
k
+
1
=
y
i
k
+
v
i
sin
⁡
χ
i
k
τ
,
v
i
k
+
1
=
v
i
k
+
v
i
c
k
-
v
i
k
α
v
,
χ
i
k
+
1
=
χ
i
k
+
χ
i
c
k
-
χ
i
k
α
χ
.
x
i
,
y
i
,
v
i
,
χ
i are, respectively, the coordinate, velocity, and track azimuth of UAV in the earth coordinate system. v
i
c
,
χ
i
c are, respectively, speed command and track azimuth command of UAV. α
v
,
α
χ are, respectively, velocity time constant and track roll angle time constant. τ is sampling period.Take the state variable of UAVu
v
i in k time as x
i
k
=
x
i
k
y
i
k
v
i
k
χ
i
k
T and the control variable of UAV u
v
i in k time as u
i
k
=
v
i
c
k
χ
i
c
k
T; then the motion equation of the UAV u
v
i can be simplified as (2), and the constraint condition can be expressed as (3).(2)
x
i
k
+
1
=
f
i
x
i
k
,
u
i
k
,
(3)
0
<
v
min
⁡
≤
v
i
≤
v
max
⁡
,
χ
min
⁡
≤
χ
≤
χ
max
⁡
,
v
i
k
+
1
-
v
i
k
τ
≤
Δ
v
max
⁡
,
χ
i
k
+
1
-
χ
i
k
τ
≤
Δ
χ
max
⁡
.Assuming that there is a known reference trajectory so that the UAV formation can follow with it, the reference trajectory satisfies the following [33]:(4)
x
r
k
+
1
=
x
r
k
+
v
r
k
cos
⁡
χ
r
k
τ
,
y
r
k
+
1
=
y
r
k
+
v
r
k
sin
⁡
χ
r
k
τ
,
χ
r
k
+
1
=
χ
r
k
+
ω
r
k
τ
.
x
r
,
y
r
,
χ
r are, respectively, coordinates and azimuth angle of reference trajectory in the earth coordinate system. v
r
,
ω
r are, respectively, velocity and angular velocity of reference trajectory. Both v
r and ω
r are piecewise continuous and uniformly bounded, and they satisfy the following constraint equation:(5)
0
<
v
r
min
⁡
<
v
r
<
v
r
max
⁡
,
ω
r
min
⁡
<
ω
r
<
ω
r
max
⁡
.


### 2.2. Formation Model

The control strategy of multiple UAVs formation mainly includes the following three: leader-follower method, virtual-leader method, and behavior control method [34–38]. Because the leader-follower method has the error transmission problem, and it is hard to establish the mathematic model for the behavior control method, this paper selects the virtual-leader method. Assuming there exists a reference point which UAVs can follow it, and all UAVs in the formation can achieve the trajectory of reference point in advance or through wireless communication in real-time and keep the relative distance and angle with reference point, there is no reference error among the UAVs. The trajectory reference point coordinate system X
r
O
r
Y
r is fixedly connected to the reference point O
r (Figure 1); thus, we can obtain the desired position of all UAVs in the formation.(6)
x
i
d
k
y
i
d
k
=
x
r
k
y
r
k
+
cos
⁡
χ
r
k
sin
⁡
χ
r
k
-
sin
⁡
χ
r
k
cos
⁡
χ
r
k
x
i
d
r
k
y
i
d
r
k
.
x
i
d
r
,
y
i
d
r
k are, respectively, the relative distance between the desired position of u
v
i and trajectory reference point in k time.Figure 1
Sketch map of formation model.


## 2.1. UAV Motion Model

Assuming that there areN
v UAVs in the UAV formation, then the UAV formation set can be expressed as V
c
=
u
v
i
∣
i
=
1,2
,
…
,
N
v. All the UAVs can keep the flying height constant; therefore, the UAV centroid motion model after discretization can be described as [31, 32](1)
x
i
k
+
1
=
x
i
k
+
v
i
cos
⁡
χ
i
k
τ
,
y
i
k
+
1
=
y
i
k
+
v
i
sin
⁡
χ
i
k
τ
,
v
i
k
+
1
=
v
i
k
+
v
i
c
k
-
v
i
k
α
v
,
χ
i
k
+
1
=
χ
i
k
+
χ
i
c
k
-
χ
i
k
α
χ
.
x
i
,
y
i
,
v
i
,
χ
i are, respectively, the coordinate, velocity, and track azimuth of UAV in the earth coordinate system. v
i
c
,
χ
i
c are, respectively, speed command and track azimuth command of UAV. α
v
,
α
χ are, respectively, velocity time constant and track roll angle time constant. τ is sampling period.Take the state variable of UAVu
v
i in k time as x
i
k
=
x
i
k
y
i
k
v
i
k
χ
i
k
T and the control variable of UAV u
v
i in k time as u
i
k
=
v
i
c
k
χ
i
c
k
T; then the motion equation of the UAV u
v
i can be simplified as (2), and the constraint condition can be expressed as (3).(2)
x
i
k
+
1
=
f
i
x
i
k
,
u
i
k
,
(3)
0
<
v
min
⁡
≤
v
i
≤
v
max
⁡
,
χ
min
⁡
≤
χ
≤
χ
max
⁡
,
v
i
k
+
1
-
v
i
k
τ
≤
Δ
v
max
⁡
,
χ
i
k
+
1
-
χ
i
k
τ
≤
Δ
χ
max
⁡
.Assuming that there is a known reference trajectory so that the UAV formation can follow with it, the reference trajectory satisfies the following [33]:(4)
x
r
k
+
1
=
x
r
k
+
v
r
k
cos
⁡
χ
r
k
τ
,
y
r
k
+
1
=
y
r
k
+
v
r
k
sin
⁡
χ
r
k
τ
,
χ
r
k
+
1
=
χ
r
k
+
ω
r
k
τ
.
x
r
,
y
r
,
χ
r are, respectively, coordinates and azimuth angle of reference trajectory in the earth coordinate system. v
r
,
ω
r are, respectively, velocity and angular velocity of reference trajectory. Both v
r and ω
r are piecewise continuous and uniformly bounded, and they satisfy the following constraint equation:(5)
0
<
v
r
min
⁡
<
v
r
<
v
r
max
⁡
,
ω
r
min
⁡
<
ω
r
<
ω
r
max
⁡
.


## 2.2. Formation Model

The control strategy of multiple UAVs formation mainly includes the following three: leader-follower method, virtual-leader method, and behavior control method [34–38]. Because the leader-follower method has the error transmission problem, and it is hard to establish the mathematic model for the behavior control method, this paper selects the virtual-leader method. Assuming there exists a reference point which UAVs can follow it, and all UAVs in the formation can achieve the trajectory of reference point in advance or through wireless communication in real-time and keep the relative distance and angle with reference point, there is no reference error among the UAVs. The trajectory reference point coordinate system X
r
O
r
Y
r is fixedly connected to the reference point O
r (Figure 1); thus, we can obtain the desired position of all UAVs in the formation.(6)
x
i
d
k
y
i
d
k
=
x
r
k
y
r
k
+
cos
⁡
χ
r
k
sin
⁡
χ
r
k
-
sin
⁡
χ
r
k
cos
⁡
χ
r
k
x
i
d
r
k
y
i
d
r
k
.
x
i
d
r
,
y
i
d
r
k are, respectively, the relative distance between the desired position of u
v
i and trajectory reference point in k time.Figure 1
Sketch map of formation model.


## 3. Description of Formation Reconfiguration

### 3.1. Threat Description

In the process of penetration multiple UAVs formation will face a variety of threats, this paper takes the early warning radar, short-range air defense radar, and no fly zone (including fixed obstacles, fixed threats, and mobile threats), assuming that all the UAVs in formation are able to detect enemy early warning radar and air defense radar, and they carry jamming equipment which is used to interfere in the early warning radar and air defense radar.


#### 3.1.1. Threat of Early Warning Radar

As shown in Figure2, assuming that the early warning radar’s position is x
je
,
y
je, the early warning radar jamming equipment position is x
je
,
y
je, the effective interference distance of early warning radar jamming equipment is R
ewr, and the max detection radium of early warning radar is R
max
⁡, when a certain UAV is interfering the early warning radar, its detection radium can be described as [39, 40](7)
R
=
R
max
⁡
,
ρ
je
≥
R
m
a
x
,
ρ
je
,
ρ
je
≤
R
m
a
x
,
ρ
je
=
x
ewr
-
x
je
2
+
y
ewr
-
y
je
2
1
/
2
-
R
ewr
.Figure 2
Sketch map of early warning radar and interference.


#### 3.1.2. Threat of Air Defense Radar

As shown in Figure3, assuming that the air defense radar position is x
adr
,
y
adr, the air defense radar jamming equipment position is x
je
,
y
je, the position of u
v
i is x
i
,
y
i, the effective interference distance of air defense radar jamming equipment is R
adr, the max detection radium and angle of air defense radar are, respectively, R
max
⁡ and β, then the condition which UAVs can be in the safe zone is [39, 40](8)
d
s
=
ρ
i
a
-
ρ
j
a
-
R
adr
>
0
c
s
s
=
ρ
i
a
2
+
ρ
j
a
2
-
ρ
i
j
2
2
ρ
i
a
ρ
j
a
≥
cos
⁡
β
2
ρ
i
a
=
x
adr
-
x
i
2
+
y
adr
-
y
i
2
1
/
2
,
ρ
j
a
=
x
adr
-
x
je
2
+
y
adr
-
y
je
2
1
/
2
,
ρ
i
j
=
x
je
-
x
i
2
+
y
je
-
y
i
2
1
/
2
.Figure 3
Sketch map of air defense radar and interference.


#### 3.1.3. Nonfly Zone

Once multiple UAVs formation encounters nonfly zones or obstacles, they can only be able to keep away from them, as shown in Figure4; in order to simplify the problem, the nonfly zones or obstacles are replaced by their minimum circumnavigations in this paper; assuming that the minimum circumnavigations of nonfly zone position and radium are, respectively, x
i
rc
,
y
i
rc and R
i
rc, then the condition which UAVs can be in the safe zone is(9)
d
i
nz
=
x
i
-
x
i
rc
2
+
y
i
-
y
i
rc
2
1
/
2
-
R
i
rc
>
0
.Figure 4
Sketch map of nonfly zone.


### 3.2. Constraint Condition Construction of UAVs Formation

On the one hand, because UAVs formation faces a variety of threats, only to avoid these threats, the UAVs formation can achieve covert penetration, reach the designated zone, and implement effective attack on enemy targets. On the other hand, because UAVs formation needs to avoid collision among the UAVs in the formation and maintain normal communication in real-time in the process of flight, it only keeps a certain distance between one UAV and another UAV, and then the formation can fly safely. Based on the above situation, the constraints condition can be constructed as follows.


#### 3.2.1. Threat Constraint of Early Warning Radar

Assuming that there areN
ewr enemy early warning radars ewr
j
j
=
1,2
,
…
,
N
ewr detected by UAVs in the formation in k time, their position can be expressed as x
ewr
j
,
y
ewr
j, and the detection radium after interference is R
j, according to Figure 2, the UAV in the formation can ensure that it is not found by the early warning radar only if it is beyond the early warning radar detection distance after interference; thus, we can construct the threat constraint condition when UAV i faces the early warning radar j as follows:(10)
h
i
ewr
x
i
k
,
u
i
k
=
R
j
+
R
ewr
-
x
i
-
x
ewr
j
2
+
y
i
-
y
ewr
j
2
1
/
2
>
0
.


#### 3.2.2. Threat Constraint of Air Defense Radar

Assuming that there areN
adr enemy air defense radars adr
j
j
=
1,2
,
…
,
N
adr detected by UAVs in the formation inktime, their position can be expressed as x
adr
j
,
y
adr
j, and the safe distance and angle cosine after interference are, respectively, d
s
j and c
s
s
j, according to Figure 3, the UAV in the formation can ensure that it is not found by air defense radar only if it is in the safe zone; thus, we can construct the threat constraint condition when UAV i faces the air defense radar j as follows:(11)
h
i
adr
1
x
i
k
,
u
i
k
=
d
s
j
+
R
adr
-
x
i
-
x
adr
j
2
+
y
i
-
y
adr
j
2
1
/
2
>
0
,
h
i
adr
2
x
i
k
,
u
i
k
=
c
s
s
j
k
-
cos
⁡
β
2
≤
0
.


#### 3.2.3. Threat Constraint of Nonfly Zone

Assuming that there areN
nfz nonfly zone nfz
j
j
=
1,2
,
…
,
N
nfz detected by UAVs in the formation in k time, and the minimal circumnavigation of nonfly zone can be expressed as x
i
rc
j
,
y
i
rc
j, according to Figure 4, the UAVs in the formation can ensure that they are safe only if they do not fly across the nonfly zones; thus, we can construct the threat constraint condition when UAV i faces the nonfly zone j as follows:(12)
h
i
i
rc
1
x
i
k
,
u
i
k
=
d
i
nz
j
-
x
i
-
x
i
rc
j
2
+
y
i
-
y
i
rc
j
2
1
/
2
>
0
.


#### 3.2.4. Collision Free Constraint

In order to ensure that UAVs in the formation avoid collision, the distance between every two UAVs in the formation needs to be greater than the safety distanceD
safe; thus, we can construct the distance constraint condition as follows:(13)
d
i
,
j
k
≥
D
safe
∀
i
≠
j
,
i
,
j
∈
1
,
…
,
N
v
,
d
i
,
j
k
=
x
i
k
-
x
j
k
2
+
y
i
k
-
y
j
k
2
1
/
2
.


#### 3.2.5. Communication Distance Constraint

Multiple UAVs formation needs to receive many commands or information during missions, like the command from the upper, change task, all UAVs’ state information, and so on, so they must keep normal communication in real-time, and owing to the communication distance of device being limited, so it is necessary to ensure that the distance between two UAVs is less than the communication security distanceD
com; thus, we can construct the distance constraint condition as follows:(14)
d
i
,
j
k
≤
D
com
∀
i
≠
j
,
i
,
j
∈
1
,
…
,
N
v
.


## 3.1. Threat Description

In the process of penetration multiple UAVs formation will face a variety of threats, this paper takes the early warning radar, short-range air defense radar, and no fly zone (including fixed obstacles, fixed threats, and mobile threats), assuming that all the UAVs in formation are able to detect enemy early warning radar and air defense radar, and they carry jamming equipment which is used to interfere in the early warning radar and air defense radar.


### 3.1.1. Threat of Early Warning Radar

As shown in Figure2, assuming that the early warning radar’s position is x
je
,
y
je, the early warning radar jamming equipment position is x
je
,
y
je, the effective interference distance of early warning radar jamming equipment is R
ewr, and the max detection radium of early warning radar is R
max
⁡, when a certain UAV is interfering the early warning radar, its detection radium can be described as [39, 40](7)
R
=
R
max
⁡
,
ρ
je
≥
R
m
a
x
,
ρ
je
,
ρ
je
≤
R
m
a
x
,
ρ
je
=
x
ewr
-
x
je
2
+
y
ewr
-
y
je
2
1
/
2
-
R
ewr
.Figure 2
Sketch map of early warning radar and interference.


### 3.1.2. Threat of Air Defense Radar

As shown in Figure3, assuming that the air defense radar position is x
adr
,
y
adr, the air defense radar jamming equipment position is x
je
,
y
je, the position of u
v
i is x
i
,
y
i, the effective interference distance of air defense radar jamming equipment is R
adr, the max detection radium and angle of air defense radar are, respectively, R
max
⁡ and β, then the condition which UAVs can be in the safe zone is [39, 40](8)
d
s
=
ρ
i
a
-
ρ
j
a
-
R
adr
>
0
c
s
s
=
ρ
i
a
2
+
ρ
j
a
2
-
ρ
i
j
2
2
ρ
i
a
ρ
j
a
≥
cos
⁡
β
2
ρ
i
a
=
x
adr
-
x
i
2
+
y
adr
-
y
i
2
1
/
2
,
ρ
j
a
=
x
adr
-
x
je
2
+
y
adr
-
y
je
2
1
/
2
,
ρ
i
j
=
x
je
-
x
i
2
+
y
je
-
y
i
2
1
/
2
.Figure 3
Sketch map of air defense radar and interference.


### 3.1.3. Nonfly Zone

Once multiple UAVs formation encounters nonfly zones or obstacles, they can only be able to keep away from them, as shown in Figure4; in order to simplify the problem, the nonfly zones or obstacles are replaced by their minimum circumnavigations in this paper; assuming that the minimum circumnavigations of nonfly zone position and radium are, respectively, x
i
rc
,
y
i
rc and R
i
rc, then the condition which UAVs can be in the safe zone is(9)
d
i
nz
=
x
i
-
x
i
rc
2
+
y
i
-
y
i
rc
2
1
/
2
-
R
i
rc
>
0
.Figure 4
Sketch map of nonfly zone.


## 3.1.1. Threat of Early Warning Radar

As shown in Figure2, assuming that the early warning radar’s position is x
je
,
y
je, the early warning radar jamming equipment position is x
je
,
y
je, the effective interference distance of early warning radar jamming equipment is R
ewr, and the max detection radium of early warning radar is R
max
⁡, when a certain UAV is interfering the early warning radar, its detection radium can be described as [39, 40](7)
R
=
R
max
⁡
,
ρ
je
≥
R
m
a
x
,
ρ
je
,
ρ
je
≤
R
m
a
x
,
ρ
je
=
x
ewr
-
x
je
2
+
y
ewr
-
y
je
2
1
/
2
-
R
ewr
.Figure 2
Sketch map of early warning radar and interference.


## 3.1.2. Threat of Air Defense Radar

As shown in Figure3, assuming that the air defense radar position is x
adr
,
y
adr, the air defense radar jamming equipment position is x
je
,
y
je, the position of u
v
i is x
i
,
y
i, the effective interference distance of air defense radar jamming equipment is R
adr, the max detection radium and angle of air defense radar are, respectively, R
max
⁡ and β, then the condition which UAVs can be in the safe zone is [39, 40](8)
d
s
=
ρ
i
a
-
ρ
j
a
-
R
adr
>
0
c
s
s
=
ρ
i
a
2
+
ρ
j
a
2
-
ρ
i
j
2
2
ρ
i
a
ρ
j
a
≥
cos
⁡
β
2
ρ
i
a
=
x
adr
-
x
i
2
+
y
adr
-
y
i
2
1
/
2
,
ρ
j
a
=
x
adr
-
x
je
2
+
y
adr
-
y
je
2
1
/
2
,
ρ
i
j
=
x
je
-
x
i
2
+
y
je
-
y
i
2
1
/
2
.Figure 3
Sketch map of air defense radar and interference.


## 3.1.3. Nonfly Zone

Once multiple UAVs formation encounters nonfly zones or obstacles, they can only be able to keep away from them, as shown in Figure4; in order to simplify the problem, the nonfly zones or obstacles are replaced by their minimum circumnavigations in this paper; assuming that the minimum circumnavigations of nonfly zone position and radium are, respectively, x
i
rc
,
y
i
rc and R
i
rc, then the condition which UAVs can be in the safe zone is(9)
d
i
nz
=
x
i
-
x
i
rc
2
+
y
i
-
y
i
rc
2
1
/
2
-
R
i
rc
>
0
.Figure 4
Sketch map of nonfly zone.


## 3.2. Constraint Condition Construction of UAVs Formation

On the one hand, because UAVs formation faces a variety of threats, only to avoid these threats, the UAVs formation can achieve covert penetration, reach the designated zone, and implement effective attack on enemy targets. On the other hand, because UAVs formation needs to avoid collision among the UAVs in the formation and maintain normal communication in real-time in the process of flight, it only keeps a certain distance between one UAV and another UAV, and then the formation can fly safely. Based on the above situation, the constraints condition can be constructed as follows.


### 3.2.1. Threat Constraint of Early Warning Radar

Assuming that there areN
ewr enemy early warning radars ewr
j
j
=
1,2
,
…
,
N
ewr detected by UAVs in the formation in k time, their position can be expressed as x
ewr
j
,
y
ewr
j, and the detection radium after interference is R
j, according to Figure 2, the UAV in the formation can ensure that it is not found by the early warning radar only if it is beyond the early warning radar detection distance after interference; thus, we can construct the threat constraint condition when UAV i faces the early warning radar j as follows:(10)
h
i
ewr
x
i
k
,
u
i
k
=
R
j
+
R
ewr
-
x
i
-
x
ewr
j
2
+
y
i
-
y
ewr
j
2
1
/
2
>
0
.


### 3.2.2. Threat Constraint of Air Defense Radar

Assuming that there areN
adr enemy air defense radars adr
j
j
=
1,2
,
…
,
N
adr detected by UAVs in the formation inktime, their position can be expressed as x
adr
j
,
y
adr
j, and the safe distance and angle cosine after interference are, respectively, d
s
j and c
s
s
j, according to Figure 3, the UAV in the formation can ensure that it is not found by air defense radar only if it is in the safe zone; thus, we can construct the threat constraint condition when UAV i faces the air defense radar j as follows:(11)
h
i
adr
1
x
i
k
,
u
i
k
=
d
s
j
+
R
adr
-
x
i
-
x
adr
j
2
+
y
i
-
y
adr
j
2
1
/
2
>
0
,
h
i
adr
2
x
i
k
,
u
i
k
=
c
s
s
j
k
-
cos
⁡
β
2
≤
0
.


### 3.2.3. Threat Constraint of Nonfly Zone

Assuming that there areN
nfz nonfly zone nfz
j
j
=
1,2
,
…
,
N
nfz detected by UAVs in the formation in k time, and the minimal circumnavigation of nonfly zone can be expressed as x
i
rc
j
,
y
i
rc
j, according to Figure 4, the UAVs in the formation can ensure that they are safe only if they do not fly across the nonfly zones; thus, we can construct the threat constraint condition when UAV i faces the nonfly zone j as follows:(12)
h
i
i
rc
1
x
i
k
,
u
i
k
=
d
i
nz
j
-
x
i
-
x
i
rc
j
2
+
y
i
-
y
i
rc
j
2
1
/
2
>
0
.


### 3.2.4. Collision Free Constraint

In order to ensure that UAVs in the formation avoid collision, the distance between every two UAVs in the formation needs to be greater than the safety distanceD
safe; thus, we can construct the distance constraint condition as follows:(13)
d
i
,
j
k
≥
D
safe
∀
i
≠
j
,
i
,
j
∈
1
,
…
,
N
v
,
d
i
,
j
k
=
x
i
k
-
x
j
k
2
+
y
i
k
-
y
j
k
2
1
/
2
.


### 3.2.5. Communication Distance Constraint

Multiple UAVs formation needs to receive many commands or information during missions, like the command from the upper, change task, all UAVs’ state information, and so on, so they must keep normal communication in real-time, and owing to the communication distance of device being limited, so it is necessary to ensure that the distance between two UAVs is less than the communication security distanceD
com; thus, we can construct the distance constraint condition as follows:(14)
d
i
,
j
k
≤
D
com
∀
i
≠
j
,
i
,
j
∈
1
,
…
,
N
v
.


## 3.2.1. Threat Constraint of Early Warning Radar

Assuming that there areN
ewr enemy early warning radars ewr
j
j
=
1,2
,
…
,
N
ewr detected by UAVs in the formation in k time, their position can be expressed as x
ewr
j
,
y
ewr
j, and the detection radium after interference is R
j, according to Figure 2, the UAV in the formation can ensure that it is not found by the early warning radar only if it is beyond the early warning radar detection distance after interference; thus, we can construct the threat constraint condition when UAV i faces the early warning radar j as follows:(10)
h
i
ewr
x
i
k
,
u
i
k
=
R
j
+
R
ewr
-
x
i
-
x
ewr
j
2
+
y
i
-
y
ewr
j
2
1
/
2
>
0
.


## 3.2.2. Threat Constraint of Air Defense Radar

Assuming that there areN
adr enemy air defense radars adr
j
j
=
1,2
,
…
,
N
adr detected by UAVs in the formation inktime, their position can be expressed as x
adr
j
,
y
adr
j, and the safe distance and angle cosine after interference are, respectively, d
s
j and c
s
s
j, according to Figure 3, the UAV in the formation can ensure that it is not found by air defense radar only if it is in the safe zone; thus, we can construct the threat constraint condition when UAV i faces the air defense radar j as follows:(11)
h
i
adr
1
x
i
k
,
u
i
k
=
d
s
j
+
R
adr
-
x
i
-
x
adr
j
2
+
y
i
-
y
adr
j
2
1
/
2
>
0
,
h
i
adr
2
x
i
k
,
u
i
k
=
c
s
s
j
k
-
cos
⁡
β
2
≤
0
.


## 3.2.3. Threat Constraint of Nonfly Zone

Assuming that there areN
nfz nonfly zone nfz
j
j
=
1,2
,
…
,
N
nfz detected by UAVs in the formation in k time, and the minimal circumnavigation of nonfly zone can be expressed as x
i
rc
j
,
y
i
rc
j, according to Figure 4, the UAVs in the formation can ensure that they are safe only if they do not fly across the nonfly zones; thus, we can construct the threat constraint condition when UAV i faces the nonfly zone j as follows:(12)
h
i
i
rc
1
x
i
k
,
u
i
k
=
d
i
nz
j
-
x
i
-
x
i
rc
j
2
+
y
i
-
y
i
rc
j
2
1
/
2
>
0
.


## 3.2.4. Collision Free Constraint

In order to ensure that UAVs in the formation avoid collision, the distance between every two UAVs in the formation needs to be greater than the safety distanceD
safe; thus, we can construct the distance constraint condition as follows:(13)
d
i
,
j
k
≥
D
safe
∀
i
≠
j
,
i
,
j
∈
1
,
…
,
N
v
,
d
i
,
j
k
=
x
i
k
-
x
j
k
2
+
y
i
k
-
y
j
k
2
1
/
2
.


## 3.2.5. Communication Distance Constraint

Multiple UAVs formation needs to receive many commands or information during missions, like the command from the upper, change task, all UAVs’ state information, and so on, so they must keep normal communication in real-time, and owing to the communication distance of device being limited, so it is necessary to ensure that the distance between two UAVs is less than the communication security distanceD
com; thus, we can construct the distance constraint condition as follows:(14)
d
i
,
j
k
≤
D
com
∀
i
≠
j
,
i
,
j
∈
1
,
…
,
N
v
.


## 4. Distributed Model Predictive Control (DMPC) Strategy

### 4.1. Model Predictive Control (MPC)

Model predictive control is also called receding horizon control; its basic principles can be summed up in three aspects: prediction model, rolling optimization, and feedback correction. Since MPC is a finite time domain optimization, not a global optimization strategy, its performance of anti-interference and robustness are very strong [24]. The process of MPC algorithm is shown in Figure 5.Figure 5
Schematic diagram of model predictive control.The typical MPC algorithm can be simply described as follows:(1)
Assuming that the system state isx
∗
k at k time, thus we can forecast the future output of the system based on the past input.
(2)
Select a certain performance index to solve problem online; then the system open loop optimal control input sequence inN prediction of time domain is u
∗
k
=
u
∗
k
∣
k
,
u
∗
k
+
1
∣
k
,
…
,
u
∗
k
+
N
-
1
∣
k.
(3)
Select the first item of the system open loop optimal control input sequenceu
∗
k as the input of time k, namely, u
∗
k
∣
k, and then act in the system.
(4)
Repeat the above steps in the new time domain atk
+
1 time.


### 4.2. Structure of Multiple UAVs Formation Reconfiguration Based on DMPC

The reconfiguration controller needs to optimize all the control inputs in traditional centralized formation reconfiguration control method, the calculation is very large, and it has no scalability [39]. Because these UAVs in the formation are independent, from the view of dynamic characteristics, they are decoupling, so formation reconfiguration can be achieved by the necessary information; thus, the DMPC control architecture can be adopted. Every UAV will be equipped with a MPC controller which can also achieve the information interaction under DMPC control architecture; thus, the overall formation behavior can be described by all subsystems, so the state equation of formation system can be described as [26, 41, 42](15)
f
x
k
,
u
k
=
f
i
x
i
k
,
u
i
k
f
2
x
2
k
,
u
2
k
⋯
f
N
v
x
N
v
k
,
u
N
v
k
.Further, the overall cost function of formation can be expressed as(16)
J
X
k
,
U
k
=
∑
i
=
1
N
v
γ
i
J
i
X
i
k
,
X
j
≠
i
k
∣
U
i
k
j
=
1,2
,
…
,
N
v
,
J
k
=
∑
s
=
1
N
-
1
e
i
k
+
s
∣
k
Q
2
+
e
i
k
+
N
∣
k
Q
′
2
+
α
·
∑
j
≠
i
∑
s
=
0
N
-
1
e
i
k
+
s
∣
k
Q
2
+
∑
j
≠
i
e
i
k
+
N
∣
k
Q
′
2
,
X
i
k
=
x
i
k
∣
k
,
x
i
k
+
1
∣
k
,
…
,
x
i
k
+
N
-
1
∣
k
,
U
i
k
=
u
i
k
∣
k
,
u
i
k
+
1
∣
k
,
…
,
u
i
k
+
N
-
1
∣
k
,
X
j
≠
i
k
=
X
j
k
∣
j
≠
i
,
e
i
k
+
s
∣
k
=
X
i
k
+
s
∣
k
-
X
i
d
k
+
s
∣
k
,
s
=
1
,
…
,
N
.X
i
k
,
U
i
k are, respectively, the N step prediction state and N step prediction control input of ith UAV. X
j
≠
i
k are N step prediction state set of other UAVs. γ
i is weight coefficient. α
>
0, e
i
k
+
N
|
k
Q
′
2 and ∑
j
≠
i
e
j
k
+
N
|
k
Q
′
2 can reflect the time cost of the overall formation reconfiguration: namely, demanding that every UAV does not deviate from the final desired position too far; thus, the reconfiguration control task can be completed as soon as possible. Here the optimization problem can be decomposed into N
v small scale local finite time domain optimization problems; thus, the local optimization control model for ith subsystem can be expressed as(17)
U
i
∗
k
=
arg
⁡
min
U
i
k
⁡
J
i
X
i
k
,
X
j
≠
i
k
∣
U
i
k
j
=
1,2
,
…
,
N
v
s.t.
x
i
k
+
s
+
1
∣
k
=
f
i
x
i
k
+
s
∣
k
,
u
i
k
+
s
∣
k
s
=
0,1
,
…
,
N
-
1
;
i
=
1,2
,
…
,
N
v
x
i
k
∣
k
=
x
i
k
x
i
k
+
s
∣
k
∈
Ξ
i
u
i
k
+
s
∣
k
∈
Θ
i
.Assuming that all the UAVs can be able to maintain the normal communication under the communication constraint, other UAVs’ statesX
j
≠
i
k can be obtained by communication; thus, the local optimization problem of ith subsystem is relevant to its own state X
i
k, the other UAVs’ states X
j
≠
i
k, and its own control input U
i
k, the scale of optimization problem is greatly reduced, and ith UAV’s control input can be obtained by solving this optimization problem. Combined with the threat constraints, the overall reconfiguration optimization model of UAV formation can be expressed as(18)
J
X
,
U
=
∑
i
=
1
,
i
≠
j
i
=
N
v
min
U
i
∗
⁡
g
i
J
X
i
,
X
j
≠
i
k
,
U
i
s.t.
x
i
k
+
s
+
1
∣
k
=
f
x
i
k
+
s
∣
k
,
u
i
k
+
s
∣
k
;
x
i
k
∣
k
=
x
i
k
;
u
i
k
∣
k
=
u
i
k
;
v
i
k
+
s
∣
k
∈
v
m
i
n
,
v
m
a
x
;
χ
i
k
+
s
∣
k
∈
χ
m
i
n
,
χ
m
a
x
;
v
i
c
k
+
s
∣
k
∈
v
m
i
n
,
v
m
a
x
;
χ
i
c
k
+
s
∣
k
∈
χ
m
i
n
,
χ
m
a
x
;
v
i
k
+
s
+
1
∣
k
-
v
i
k
+
s
∣
k
τ
∈
0
,
Δ
v
m
a
x
;
χ
i
k
+
s
+
1
∣
k
-
χ
i
k
+
s
∣
k
τ
∈
0
,
Δ
χ
m
a
x
;
h
i
ewr
x
i
k
,
u
i
k
>
0
;
h
i
adr
1
x
i
k
,
u
i
k
>
0
;
h
i
adr
2
x
i
k
,
u
i
k
<
0
;
h
i
i
rc
1
x
i
k
,
u
i
k
>
0
;
d
i
,
j
k
≥
D
safe
∀
i
≠
j
,
i
,
j
∈
1
,
…
,
N
v
;
d
i
,
j
k
≤
D
com
∀
i
≠
j
,
i
,
j
∈
1
,
…
,
N
v
.


## 4.1. Model Predictive Control (MPC)

Model predictive control is also called receding horizon control; its basic principles can be summed up in three aspects: prediction model, rolling optimization, and feedback correction. Since MPC is a finite time domain optimization, not a global optimization strategy, its performance of anti-interference and robustness are very strong [24]. The process of MPC algorithm is shown in Figure 5.Figure 5
Schematic diagram of model predictive control.The typical MPC algorithm can be simply described as follows:(1)
Assuming that the system state isx
∗
k at k time, thus we can forecast the future output of the system based on the past input.
(2)
Select a certain performance index to solve problem online; then the system open loop optimal control input sequence inN prediction of time domain is u
∗
k
=
u
∗
k
∣
k
,
u
∗
k
+
1
∣
k
,
…
,
u
∗
k
+
N
-
1
∣
k.
(3)
Select the first item of the system open loop optimal control input sequenceu
∗
k as the input of time k, namely, u
∗
k
∣
k, and then act in the system.
(4)
Repeat the above steps in the new time domain atk
+
1 time.


## 4.2. Structure of Multiple UAVs Formation Reconfiguration Based on DMPC

The reconfiguration controller needs to optimize all the control inputs in traditional centralized formation reconfiguration control method, the calculation is very large, and it has no scalability [39]. Because these UAVs in the formation are independent, from the view of dynamic characteristics, they are decoupling, so formation reconfiguration can be achieved by the necessary information; thus, the DMPC control architecture can be adopted. Every UAV will be equipped with a MPC controller which can also achieve the information interaction under DMPC control architecture; thus, the overall formation behavior can be described by all subsystems, so the state equation of formation system can be described as [26, 41, 42](15)
f
x
k
,
u
k
=
f
i
x
i
k
,
u
i
k
f
2
x
2
k
,
u
2
k
⋯
f
N
v
x
N
v
k
,
u
N
v
k
.Further, the overall cost function of formation can be expressed as(16)
J
X
k
,
U
k
=
∑
i
=
1
N
v
γ
i
J
i
X
i
k
,
X
j
≠
i
k
∣
U
i
k
j
=
1,2
,
…
,
N
v
,
J
k
=
∑
s
=
1
N
-
1
e
i
k
+
s
∣
k
Q
2
+
e
i
k
+
N
∣
k
Q
′
2
+
α
·
∑
j
≠
i
∑
s
=
0
N
-
1
e
i
k
+
s
∣
k
Q
2
+
∑
j
≠
i
e
i
k
+
N
∣
k
Q
′
2
,
X
i
k
=
x
i
k
∣
k
,
x
i
k
+
1
∣
k
,
…
,
x
i
k
+
N
-
1
∣
k
,
U
i
k
=
u
i
k
∣
k
,
u
i
k
+
1
∣
k
,
…
,
u
i
k
+
N
-
1
∣
k
,
X
j
≠
i
k
=
X
j
k
∣
j
≠
i
,
e
i
k
+
s
∣
k
=
X
i
k
+
s
∣
k
-
X
i
d
k
+
s
∣
k
,
s
=
1
,
…
,
N
.X
i
k
,
U
i
k are, respectively, the N step prediction state and N step prediction control input of ith UAV. X
j
≠
i
k are N step prediction state set of other UAVs. γ
i is weight coefficient. α
>
0, e
i
k
+
N
|
k
Q
′
2 and ∑
j
≠
i
e
j
k
+
N
|
k
Q
′
2 can reflect the time cost of the overall formation reconfiguration: namely, demanding that every UAV does not deviate from the final desired position too far; thus, the reconfiguration control task can be completed as soon as possible. Here the optimization problem can be decomposed into N
v small scale local finite time domain optimization problems; thus, the local optimization control model for ith subsystem can be expressed as(17)
U
i
∗
k
=
arg
⁡
min
U
i
k
⁡
J
i
X
i
k
,
X
j
≠
i
k
∣
U
i
k
j
=
1,2
,
…
,
N
v
s.t.
x
i
k
+
s
+
1
∣
k
=
f
i
x
i
k
+
s
∣
k
,
u
i
k
+
s
∣
k
s
=
0,1
,
…
,
N
-
1
;
i
=
1,2
,
…
,
N
v
x
i
k
∣
k
=
x
i
k
x
i
k
+
s
∣
k
∈
Ξ
i
u
i
k
+
s
∣
k
∈
Θ
i
.Assuming that all the UAVs can be able to maintain the normal communication under the communication constraint, other UAVs’ statesX
j
≠
i
k can be obtained by communication; thus, the local optimization problem of ith subsystem is relevant to its own state X
i
k, the other UAVs’ states X
j
≠
i
k, and its own control input U
i
k, the scale of optimization problem is greatly reduced, and ith UAV’s control input can be obtained by solving this optimization problem. Combined with the threat constraints, the overall reconfiguration optimization model of UAV formation can be expressed as(18)
J
X
,
U
=
∑
i
=
1
,
i
≠
j
i
=
N
v
min
U
i
∗
⁡
g
i
J
X
i
,
X
j
≠
i
k
,
U
i
s.t.
x
i
k
+
s
+
1
∣
k
=
f
x
i
k
+
s
∣
k
,
u
i
k
+
s
∣
k
;
x
i
k
∣
k
=
x
i
k
;
u
i
k
∣
k
=
u
i
k
;
v
i
k
+
s
∣
k
∈
v
m
i
n
,
v
m
a
x
;
χ
i
k
+
s
∣
k
∈
χ
m
i
n
,
χ
m
a
x
;
v
i
c
k
+
s
∣
k
∈
v
m
i
n
,
v
m
a
x
;
χ
i
c
k
+
s
∣
k
∈
χ
m
i
n
,
χ
m
a
x
;
v
i
k
+
s
+
1
∣
k
-
v
i
k
+
s
∣
k
τ
∈
0
,
Δ
v
m
a
x
;
χ
i
k
+
s
+
1
∣
k
-
χ
i
k
+
s
∣
k
τ
∈
0
,
Δ
χ
m
a
x
;
h
i
ewr
x
i
k
,
u
i
k
>
0
;
h
i
adr
1
x
i
k
,
u
i
k
>
0
;
h
i
adr
2
x
i
k
,
u
i
k
<
0
;
h
i
i
rc
1
x
i
k
,
u
i
k
>
0
;
d
i
,
j
k
≥
D
safe
∀
i
≠
j
,
i
,
j
∈
1
,
…
,
N
v
;
d
i
,
j
k
≤
D
com
∀
i
≠
j
,
i
,
j
∈
1
,
…
,
N
v
.


## 5. Finite State Machine Formation Management Unit

### 5.1. Finite State Machine (FSM)

Finite state machine is mainly used to describe the conversion process and mechanism of object between different states, and its mathematical definition can be defined as follows: a finite state machineQ can be expressed by a quintet Q
=
Σ
,
S
,
f
,
I
,
O. S
=
S
1
,
S
2
,
…
,
S
n is nonempty finite set of state. I
=
I
1
,
I
2
,
…
,
I
m is the initial state set, I
⊆
S. O
=
O
1
,
O
2
,
…
,
O
l is the final state set, and O
⊆
S. Σ is the input alphabet (triggering event set). f is mapping function from S
×
Σ to S, f
:
S
×
Σ
→
S [43–46].


### 5.2. Design of Formation Control Manager Based on FSM

As shown in Figure6, the adjacent UAVs’ state, environmental threat information, task command, and reference trajectory coordinate will be transferred to FSM formation management unit and DMPC formation controller by communication unit. According to this information, FSM formation management unit will make the formation mode of the next step and transfer it to DMPC formation controller, and then the DMPC formation controller will output specific control signal after handling the above information.Figure 6
Formation control manager based on FSM.The operation steps of the FSM formation management are as follows:(1)
According to the theory of finite state machine and the mission requirement of UAVs formation, we can determine five models of UAV formation as follows: free formation flightS
1; forming the initial formation S
2; keeping the formation S
3; formation reconfiguration S
4; formation avoidance control S
5.
(2)
According to the formation mode of the first step, the switching condition (trigger event) between two states is determined: UAVs formation command isI
1; formation satisfies the constraint condition, that is, I
2; there exists a fixed obstacle or nonfly zone within the predetermined range, that is, I
3; there exists no fixed obstacle or nonfly zone within the predetermined range, that is, I
4; a certain UAV joins into the formation, that is, I
5; a certain UAV leaves the formation, that is, I
6; start a cooperative task, such as cooperative attack and cooperative interference, that is, I
7; end a cooperative task, such as cooperative attack and cooperative interference, that is, I
8; command of formation dissolution is I
9.
(3)
According to the first step and the second step, we can draw a state transition diagram (Figure7).Figure 7
FSM state transition diagram.Based on the DMPC formation controller and the FSM formation management unit, this paper presents an automatic formation reconfiguration control method. When UAVs formation arrives in the target zone and finds the early warning radar threat or air defense radar threat, the cooperative interference penetration should be mainly taken. It is usual to select one or several UAVs to interfere in the early warning radar or air defense radar for cooperative interference penetration; for simplicity, in this paper electronic interference will be carried out only by the UAV whose distance is nearest from radar interfere, and the overall formation transforms the formation based on this UAV and reference trajectory point, while it must satisfy the constraints of formation forming which is required by cooperative interference penetration. The other UAVs in the formation which has not interference task will arrive to the latest desired relative position as soon as possible. And when the UAVs formation detects the nonfly zone, cooperative penetration can only be carried out by them, and the overall formation can achieve formation transformation based on reference trajectory and nonfly zone.Assuming that the initial state of formation isS
3, when a certain UAV of the formation detects the early warning radar or air defense radar, the formation goes into S
4, and it will select the most suitable UAV which will carry on real-time resolving to obtain the best position to interfere in the early warning radar or air defense radar; the other UAVs in the formation will also carry on real-time resolving to obtain the desired formation parameters; they will justify whether they are in the range of the enemy early warning radar or air defense radar or not until they are in safety [39, 46].


## 5.1. Finite State Machine (FSM)

Finite state machine is mainly used to describe the conversion process and mechanism of object between different states, and its mathematical definition can be defined as follows: a finite state machineQ can be expressed by a quintet Q
=
Σ
,
S
,
f
,
I
,
O. S
=
S
1
,
S
2
,
…
,
S
n is nonempty finite set of state. I
=
I
1
,
I
2
,
…
,
I
m is the initial state set, I
⊆
S. O
=
O
1
,
O
2
,
…
,
O
l is the final state set, and O
⊆
S. Σ is the input alphabet (triggering event set). f is mapping function from S
×
Σ to S, f
:
S
×
Σ
→
S [43–46].


## 5.2. Design of Formation Control Manager Based on FSM

As shown in Figure6, the adjacent UAVs’ state, environmental threat information, task command, and reference trajectory coordinate will be transferred to FSM formation management unit and DMPC formation controller by communication unit. According to this information, FSM formation management unit will make the formation mode of the next step and transfer it to DMPC formation controller, and then the DMPC formation controller will output specific control signal after handling the above information.Figure 6
Formation control manager based on FSM.The operation steps of the FSM formation management are as follows:(1)
According to the theory of finite state machine and the mission requirement of UAVs formation, we can determine five models of UAV formation as follows: free formation flightS
1; forming the initial formation S
2; keeping the formation S
3; formation reconfiguration S
4; formation avoidance control S
5.
(2)
According to the formation mode of the first step, the switching condition (trigger event) between two states is determined: UAVs formation command isI
1; formation satisfies the constraint condition, that is, I
2; there exists a fixed obstacle or nonfly zone within the predetermined range, that is, I
3; there exists no fixed obstacle or nonfly zone within the predetermined range, that is, I
4; a certain UAV joins into the formation, that is, I
5; a certain UAV leaves the formation, that is, I
6; start a cooperative task, such as cooperative attack and cooperative interference, that is, I
7; end a cooperative task, such as cooperative attack and cooperative interference, that is, I
8; command of formation dissolution is I
9.
(3)
According to the first step and the second step, we can draw a state transition diagram (Figure7).Figure 7
FSM state transition diagram.Based on the DMPC formation controller and the FSM formation management unit, this paper presents an automatic formation reconfiguration control method. When UAVs formation arrives in the target zone and finds the early warning radar threat or air defense radar threat, the cooperative interference penetration should be mainly taken. It is usual to select one or several UAVs to interfere in the early warning radar or air defense radar for cooperative interference penetration; for simplicity, in this paper electronic interference will be carried out only by the UAV whose distance is nearest from radar interfere, and the overall formation transforms the formation based on this UAV and reference trajectory point, while it must satisfy the constraints of formation forming which is required by cooperative interference penetration. The other UAVs in the formation which has not interference task will arrive to the latest desired relative position as soon as possible. And when the UAVs formation detects the nonfly zone, cooperative penetration can only be carried out by them, and the overall formation can achieve formation transformation based on reference trajectory and nonfly zone.Assuming that the initial state of formation isS
3, when a certain UAV of the formation detects the early warning radar or air defense radar, the formation goes into S
4, and it will select the most suitable UAV which will carry on real-time resolving to obtain the best position to interfere in the early warning radar or air defense radar; the other UAVs in the formation will also carry on real-time resolving to obtain the desired formation parameters; they will justify whether they are in the range of the enemy early warning radar or air defense radar or not until they are in safety [39, 46].


## 6. Solution of Reconfiguration Problem

### 6.1. Quantum Particle Swarm Optimization Algorithm (QPSO)

In the model of quantum particle swarm optimization algorithm, the particle motion state can be described by wave functionψ
X
,
t as follows:(19)
ψ
2
d
x
d
y
d
z
=
Q
d
x
d
y
d
z
.
Q is probability density function, and it satisfies the normalization condition:(20)
∫
-
∞
+
∞
ψ
2
d
x
d
y
d
z
=
∫
-
∞
+
∞
Q
d
x
d
y
d
z
=
1
.The particle motion satisfies the Schrödinger equation in the quantum space:(21)
i
ħ
∂
∂
t
ψ
X
,
t
=
H
^
ψ
X
,
t
.
ħ is Planck constant; H
^ is Hamiltonian operator which can be described as follows:(22)
H
^
=
-
ħ
2
m
∇
2
+
V
X
.m is the particle mass, V
X is particle potential energy, and the model is called δ potential well. Quantum particle swarm optimization algorithm is mainly based on δ potential well: assuming that there is a group made up of M particles which are represented as problem solution in N dimensional object search space: namely, X
L
t
=
X
L
1
t
,
X
L
2
t
,
…
,
X
L
M
t. At t time ith particle position is X
L
i
t
=
X
L
i
,
1
t
,
X
L
i
,
2
t
,
…
,
X
L
i
,
N
t
,
i
=
1,2
,
…
,
M, it has no velocity vector, the best individual position in the group can be expressed as P
i
t
=
P
i
,
1
l
t
,
P
i
,
2
l
t
,
…
,
P
i
,
N
l
t, and the best global position in the group can be expressed as P
g
=
P
1
g
,
P
2
g
,
…
,
P
N
g. In order to ensure the convergence of the algorithm, each particle converges to an attractor point p
i
=
p
i
,
1
,
p
i
,
2
,
…
,
p
i
,
N which can be expressed as follows: (23)
p
i
.
j
t
=
c
1
r
1
,
j
t
·
P
i
,
j
l
t
+
c
2
r
2
,
j
t
·
P
j
g
t
c
1
r
1
,
j
t
+
c
2
r
2
,
j
t
.
r
1
,
j
,
r
2
,
j are, respectively, random number between 0 and 1.The average best position is introduced in the quantum particle swarm optimization algorithm, which can be defined as the average of the individual best position from all the particles: namely,(24)
M
b
e
s
t
=
1
M
∑
i
=
1
M
P
i
l
t
=
1
M
∑
i
=
1
M
P
i
,
1
l
t
,
1
M
∑
i
=
1
M
P
i
,
2
l
t
,
…
,
1
M
∑
i
=
1
M
P
i
,
N
l
t
.
M is the group scale.Then the evolution equation of the quantum particle swarm optimization algorithm can be expressed as(25)
X
L
i
t
+
1
=
p
i
±
b
M
b
e
s
t
-
X
L
i
t
In
⁡
⁡
1
u
.
u is a random number between 0 and 1, b is the contraction-expansion coefficient, and the selection of parameter b will affect the performance of the algorithm directly. Generally, when b is reduced from 1 to 0.5, the result is relatively good, so it can be expressed as follows:(26)
b
=
1
-
t
T
×
0.5
.
T is the maximum iteration number and t is the current iteration number.Compared with the basic particle swarm optimization algorithm, because the attractor pointp
i is between P
i
,
j
l and P
j
g, the particle will probably appear near P
g for the particles which are gathering in P
g. The quantum particle swarm optimization algorithm has less operator and simplifies the calculation, and to introduce the average best position M
b
e
s
t, there exists a waiting effect among the particles which can greatly improve the cooperative work capability and enhance the global search capability of the algorithm [47, 48].


### 6.2. Solution of Formation Reconfiguration Based on RQPSO-FSM-DMPC

Although QPSO has been proved to be a global convergence algorithm, it may also fall into premature when it is used to deal with complex optimization problem such as multipeak function. In order to improve this problem, Sun et al. introduced the diversity guidance strategy into PSO and proposed the attraction and repulsion particle swarm optimization algorithm [47]. By controlling the diversity of the group, the attraction and repulsion particle swarm optimization algorithm can achieve the switch between the two modes of global search and local search. The attraction corresponded with the convergence phase, and the repulsion corresponded with the divergence phase.The paper takes the average Euclidean distance between the particle and the centre point to express the diversity. The group made up by the current position of the particle and the group made up by the individual best position of the particle can be expressed as(27)
S
X
=
X
1
,
X
2
,
…
,
X
M
,
S
P
=
P
1
,
P
2
,
…
,
P
M
.Thus, the diversity metric can be expressed as follows:(28)
diversity
S
X
=
1
M
·
A
·
∑
i
=
1
M
∑
j
=
1
N
X
i
,
j
-
X
-
j
2
,
X
-
j
=
1
M
∑
i
=
1
M
X
i
,
j
,
diversity
S
P
=
1
M
·
A
·
∑
i
=
1
M
∑
j
=
1
N
P
i
,
j
-
P
-
j
2
,
P
-
j
=
1
M
∑
i
=
1
M
P
i
,
j
=
C
j
.
A is the length of the longest diagonal in the search space, N is the dimension of optimization, and M is the scale of particle swarm:(29)
A
=
X
max
⁡
-
X
min
⁡
·
N
.Time is critical for the battlefield, so search speed is more important in the search early and middle phase, but when entering the search later phase, the diversity of particle reduces, and the capability of global search will subsequently be greatly degraded. In order to avoid the premature phenomenon effectively, this paper sets the lower limit of the diversity and the QPSO algorithm which is introduced by the diversity is applied to UAVs formation reconfiguration control.We can use the diversity metricsdiversity
S
X to guide the algorithm search. After the initialization of the particle swarm, it will converge. According to (26), we can know that b will decrease linearly from 1 to 0.5. In the process of convergence, once diversity
S
X is smaller than the preset lower limit d
low, the particle swarm will enter into the divergence state; this is a temporary increase of diversity until diversity
S
X is larger than d
low.Whendiversity
S
X or diversity
S
P is less than d
low, the mutation operation can be carried out for the particles in the best position of the group:(30)
P
j
g
=
P
j
g
+
l
·
A
·
ε
,
ε
~
N
0,1
,
j
=
1,2
,
…
,
N
.
ε is the random number according to the standard normal distribution and l is the mutation parameter.By conducting the mutation operation, the distance between the particle individual best position and the average best position can be increased, and then the value ofdiversity
S
P will increase. At the same time, due to the change of the global best position that can make M
b
e
s
t deviate from the current position, the distance between the particle current position and M
b
e
s
t will also increase and then will directly lead to a certain degree of divergence of particles which will increase diversity
S
X. Therefore, we can conduct the mutation by increasing two kinds of diversity (diversity
S
P or diversity
S
X); the former is called DGQPSO
P and the latter is called DGQPSO
X.In addition to carrying out the mutation operation for particle swarm which can increase the diversity of group, this paper proposes another measure to increase the diversity of the group by conducting selection operation onP
g which can avoid falling into the local optimal solution. Namely, p
i of particles is no longer determined by the global best position and P
i
l but is determined by P
i
l and the individual best position of the other particles which are selected randomly. After selecting some other particle P
k
l
t from particle swarm we can carry out the following operation:(31)
P
g
=
P
k
l
t
,
f
P
k
l
t
<
f
P
i
l
t
,
P
i
l
t
,
f
P
k
l
t
≥
f
P
i
l
t
.When the objective function value which is determined byP
k
l
t is better than P
i
l
t, then P
i
t is determined by P
k
l
t and P
k
l
t; otherwise, it is determined by P
g
t and P
i
l
t. Therefore, the coordinate of P
i
t can be expressed as follows:(32)
p
i
,
j
t
=
ζ
·
P
i
,
j
t
+
1
-
ζ
·
G
j
t
,
ζ
~
U
0,1
.The individual optimal position of each particle is likely to be selected asP
g, so the particle swarm will tend to it. If some nonglobal best position of the particle becomes the target which is the convergence of the particle swarm, and it is located near the global optimal solution, then the probability of finding the global optimal solution will be increased greatly, so that the global search capability of QPSO algorithm is improved evidently [49, 50].The revised quantum particle swarm algorithm (RQPSO) is obtained by introducing the diversity and selection strategy, and its process is described as follows.Step 1.
Set the basic parameters of the algorithm, encode the particles (Figure8), initialize the particle swarm randomly, and establish the mapping relationship between the problems and particles.Figure 8
Particle encoding.Step 2.
Perform the following steps when the iteration number is less thanT.Step 3.
Calculate the average best position of the particle swarm, namely,M
b
e
s
t.Step 4.
Calculate the current fitness value of the particles and compare it with the fitness value of the former iteration; if the current fitness value is less than the former iteration, then the particle position is updated by the current particle position; namely, iff
X
i
t
+
1
<
f
P
i
t, then P
i
t
+
1
=
X
i
t
+
1.Step 5.
Calculate the current global optimal position of the group, namely,P
g.Step 6.
Compare the fitness value of the current global optimal position with the fitness value of the former global optimal position; if the current global optimal position is better, then the global optimal position of the group is updated by it.Step 7.
Select the pointP
g for each particle, and calculate p
i
,
j depending on (32) for each dimension of the particle.Step 8.
According to (25), calculate the new position of the particles.Step 9.
Calculate the particle swarm diversity, namely,diversity
S
X or diversity
S
P.Step 10.
Calculate the contraction-expansion coefficient and conduct the convergence model.Step 11.
Justifydiversity
S
X or diversity
S
P; if it is less than d
low, then carry out the mutation for the global best particle depending on (30) and conduct the divergence mode.Step 12.
According to the quantum particle swarm optimization evolution equation, update the position for each particle of the group.Step 13.
Return to Step2.


## 6.1. Quantum Particle Swarm Optimization Algorithm (QPSO)

In the model of quantum particle swarm optimization algorithm, the particle motion state can be described by wave functionψ
X
,
t as follows:(19)
ψ
2
d
x
d
y
d
z
=
Q
d
x
d
y
d
z
.
Q is probability density function, and it satisfies the normalization condition:(20)
∫
-
∞
+
∞
ψ
2
d
x
d
y
d
z
=
∫
-
∞
+
∞
Q
d
x
d
y
d
z
=
1
.The particle motion satisfies the Schrödinger equation in the quantum space:(21)
i
ħ
∂
∂
t
ψ
X
,
t
=
H
^
ψ
X
,
t
.
ħ is Planck constant; H
^ is Hamiltonian operator which can be described as follows:(22)
H
^
=
-
ħ
2
m
∇
2
+
V
X
.m is the particle mass, V
X is particle potential energy, and the model is called δ potential well. Quantum particle swarm optimization algorithm is mainly based on δ potential well: assuming that there is a group made up of M particles which are represented as problem solution in N dimensional object search space: namely, X
L
t
=
X
L
1
t
,
X
L
2
t
,
…
,
X
L
M
t. At t time ith particle position is X
L
i
t
=
X
L
i
,
1
t
,
X
L
i
,
2
t
,
…
,
X
L
i
,
N
t
,
i
=
1,2
,
…
,
M, it has no velocity vector, the best individual position in the group can be expressed as P
i
t
=
P
i
,
1
l
t
,
P
i
,
2
l
t
,
…
,
P
i
,
N
l
t, and the best global position in the group can be expressed as P
g
=
P
1
g
,
P
2
g
,
…
,
P
N
g. In order to ensure the convergence of the algorithm, each particle converges to an attractor point p
i
=
p
i
,
1
,
p
i
,
2
,
…
,
p
i
,
N which can be expressed as follows: (23)
p
i
.
j
t
=
c
1
r
1
,
j
t
·
P
i
,
j
l
t
+
c
2
r
2
,
j
t
·
P
j
g
t
c
1
r
1
,
j
t
+
c
2
r
2
,
j
t
.
r
1
,
j
,
r
2
,
j are, respectively, random number between 0 and 1.The average best position is introduced in the quantum particle swarm optimization algorithm, which can be defined as the average of the individual best position from all the particles: namely,(24)
M
b
e
s
t
=
1
M
∑
i
=
1
M
P
i
l
t
=
1
M
∑
i
=
1
M
P
i
,
1
l
t
,
1
M
∑
i
=
1
M
P
i
,
2
l
t
,
…
,
1
M
∑
i
=
1
M
P
i
,
N
l
t
.
M is the group scale.Then the evolution equation of the quantum particle swarm optimization algorithm can be expressed as(25)
X
L
i
t
+
1
=
p
i
±
b
M
b
e
s
t
-
X
L
i
t
In
⁡
⁡
1
u
.
u is a random number between 0 and 1, b is the contraction-expansion coefficient, and the selection of parameter b will affect the performance of the algorithm directly. Generally, when b is reduced from 1 to 0.5, the result is relatively good, so it can be expressed as follows:(26)
b
=
1
-
t
T
×
0.5
.
T is the maximum iteration number and t is the current iteration number.Compared with the basic particle swarm optimization algorithm, because the attractor pointp
i is between P
i
,
j
l and P
j
g, the particle will probably appear near P
g for the particles which are gathering in P
g. The quantum particle swarm optimization algorithm has less operator and simplifies the calculation, and to introduce the average best position M
b
e
s
t, there exists a waiting effect among the particles which can greatly improve the cooperative work capability and enhance the global search capability of the algorithm [47, 48].


## 6.2. Solution of Formation Reconfiguration Based on RQPSO-FSM-DMPC

Although QPSO has been proved to be a global convergence algorithm, it may also fall into premature when it is used to deal with complex optimization problem such as multipeak function. In order to improve this problem, Sun et al. introduced the diversity guidance strategy into PSO and proposed the attraction and repulsion particle swarm optimization algorithm [47]. By controlling the diversity of the group, the attraction and repulsion particle swarm optimization algorithm can achieve the switch between the two modes of global search and local search. The attraction corresponded with the convergence phase, and the repulsion corresponded with the divergence phase.The paper takes the average Euclidean distance between the particle and the centre point to express the diversity. The group made up by the current position of the particle and the group made up by the individual best position of the particle can be expressed as(27)
S
X
=
X
1
,
X
2
,
…
,
X
M
,
S
P
=
P
1
,
P
2
,
…
,
P
M
.Thus, the diversity metric can be expressed as follows:(28)
diversity
S
X
=
1
M
·
A
·
∑
i
=
1
M
∑
j
=
1
N
X
i
,
j
-
X
-
j
2
,
X
-
j
=
1
M
∑
i
=
1
M
X
i
,
j
,
diversity
S
P
=
1
M
·
A
·
∑
i
=
1
M
∑
j
=
1
N
P
i
,
j
-
P
-
j
2
,
P
-
j
=
1
M
∑
i
=
1
M
P
i
,
j
=
C
j
.
A is the length of the longest diagonal in the search space, N is the dimension of optimization, and M is the scale of particle swarm:(29)
A
=
X
max
⁡
-
X
min
⁡
·
N
.Time is critical for the battlefield, so search speed is more important in the search early and middle phase, but when entering the search later phase, the diversity of particle reduces, and the capability of global search will subsequently be greatly degraded. In order to avoid the premature phenomenon effectively, this paper sets the lower limit of the diversity and the QPSO algorithm which is introduced by the diversity is applied to UAVs formation reconfiguration control.We can use the diversity metricsdiversity
S
X to guide the algorithm search. After the initialization of the particle swarm, it will converge. According to (26), we can know that b will decrease linearly from 1 to 0.5. In the process of convergence, once diversity
S
X is smaller than the preset lower limit d
low, the particle swarm will enter into the divergence state; this is a temporary increase of diversity until diversity
S
X is larger than d
low.Whendiversity
S
X or diversity
S
P is less than d
low, the mutation operation can be carried out for the particles in the best position of the group:(30)
P
j
g
=
P
j
g
+
l
·
A
·
ε
,
ε
~
N
0,1
,
j
=
1,2
,
…
,
N
.
ε is the random number according to the standard normal distribution and l is the mutation parameter.By conducting the mutation operation, the distance between the particle individual best position and the average best position can be increased, and then the value ofdiversity
S
P will increase. At the same time, due to the change of the global best position that can make M
b
e
s
t deviate from the current position, the distance between the particle current position and M
b
e
s
t will also increase and then will directly lead to a certain degree of divergence of particles which will increase diversity
S
X. Therefore, we can conduct the mutation by increasing two kinds of diversity (diversity
S
P or diversity
S
X); the former is called DGQPSO
P and the latter is called DGQPSO
X.In addition to carrying out the mutation operation for particle swarm which can increase the diversity of group, this paper proposes another measure to increase the diversity of the group by conducting selection operation onP
g which can avoid falling into the local optimal solution. Namely, p
i of particles is no longer determined by the global best position and P
i
l but is determined by P
i
l and the individual best position of the other particles which are selected randomly. After selecting some other particle P
k
l
t from particle swarm we can carry out the following operation:(31)
P
g
=
P
k
l
t
,
f
P
k
l
t
<
f
P
i
l
t
,
P
i
l
t
,
f
P
k
l
t
≥
f
P
i
l
t
.When the objective function value which is determined byP
k
l
t is better than P
i
l
t, then P
i
t is determined by P
k
l
t and P
k
l
t; otherwise, it is determined by P
g
t and P
i
l
t. Therefore, the coordinate of P
i
t can be expressed as follows:(32)
p
i
,
j
t
=
ζ
·
P
i
,
j
t
+
1
-
ζ
·
G
j
t
,
ζ
~
U
0,1
.The individual optimal position of each particle is likely to be selected asP
g, so the particle swarm will tend to it. If some nonglobal best position of the particle becomes the target which is the convergence of the particle swarm, and it is located near the global optimal solution, then the probability of finding the global optimal solution will be increased greatly, so that the global search capability of QPSO algorithm is improved evidently [49, 50].The revised quantum particle swarm algorithm (RQPSO) is obtained by introducing the diversity and selection strategy, and its process is described as follows.Step 1.
Set the basic parameters of the algorithm, encode the particles (Figure8), initialize the particle swarm randomly, and establish the mapping relationship between the problems and particles.Figure 8
Particle encoding.Step 2.
Perform the following steps when the iteration number is less thanT.Step 3.
Calculate the average best position of the particle swarm, namely,M
b
e
s
t.Step 4.
Calculate the current fitness value of the particles and compare it with the fitness value of the former iteration; if the current fitness value is less than the former iteration, then the particle position is updated by the current particle position; namely, iff
X
i
t
+
1
<
f
P
i
t, then P
i
t
+
1
=
X
i
t
+
1.Step 5.
Calculate the current global optimal position of the group, namely,P
g.Step 6.
Compare the fitness value of the current global optimal position with the fitness value of the former global optimal position; if the current global optimal position is better, then the global optimal position of the group is updated by it.Step 7.
Select the pointP
g for each particle, and calculate p
i
,
j depending on (32) for each dimension of the particle.Step 8.
According to (25), calculate the new position of the particles.Step 9.
Calculate the particle swarm diversity, namely,diversity
S
X or diversity
S
P.Step 10.
Calculate the contraction-expansion coefficient and conduct the convergence model.Step 11.
Justifydiversity
S
X or diversity
S
P; if it is less than d
low, then carry out the mutation for the global best particle depending on (30) and conduct the divergence mode.Step 12.
According to the quantum particle swarm optimization evolution equation, update the position for each particle of the group.Step 13.
Return to Step2.


## 7. Simulation and Analysis

In order to verify the effectiveness of formation reconfiguration control method which is proposed by this paper, we have made procedure simulation under the MATLAB compiler environment, adopt the virtual-leader formation control strategy, and then make UAVs formation reconfiguration control simulation experiment by particle swarm optimization (PSO) algorithm and revise quantum particle swarm optimization (RQPSO) algorithm, respectively. We set the particle swarm scale and the max iteration to be 20 and 400, respectively, in PSO and RQPSO. In PSO, local coefficient and global coefficient are set to 2, and inertia weight is set to 0.5. In RQPSO, the contraction-expansion coefficientb is reduced linearly from 1 to 0.5, the lower limit value of diversity is set to 0.0004, and the parameter l is set to 0.000012.Assuming the communication link between UAVs is in good condition, the communication delay need not be considered. The velocity and track azimuth of all the UAVs can be measured, and there is no interference which can interfere in the velocity and track azimuth. The parameters of early warning radar, air defense radar, and nonfly zone and collision avoidance constraints and communication constraints are shown in Table1; the state transformation is shown in Table 5. The reference trajectory and the UAVs initial motion parameters are shown in Tables 2 and 3. The relative distance between UAVs in the formation and the reference trajectory is shown in Table 4.Table 1
Parameters of enemy threat.
Parameter
Value
Coordinate and action distance of early warning radar
30,20  20 km
Coordinate, action distance, and angle of air defense radar
32,18  12 km  1
0
0
The first nonfly zone
12,12
,
18,12
,
18,18
,
12,5
The second nonfly zone
25,25
,
35,25
,
35,5
,
25,5
Distance of collision avoidance
500 m
The max communication distance
2 km
v
m
i
n
,
v
m
a
x
100,200
χ
m
i
n
,
χ
m
a
x
80,110
ω
m
i
n
,
ω
m
a
x
2.5,5
Δ
v
m
a
x
20
Δ
χ
m
a
x
5Table 2
Parameter of reference trajectory.
Parameter
Time
Value
Initial position
0 s
(2.8, 8.2)
Velocity
[0, 200] s
152 m/s
Track azimuth
[0, 200]  s
90Table 3
Initial kinematic parameters of the UAVs.
UAVs
(x
,
y)/km
v (m/s)
χ
/
d
e
g
U
A
V
1
3.8,8.2
152
90
U
A
V
2
2.8,7.7
152
90
U
A
V
3
2.8,8.7
152
90
U
A
V
4
1.8,7.2
152
90
U
A
V
5
1.8,9.2
152
90Table 4
Parameters of desired formation configuration.
Mathematic symbol
Value
x
1
r
d
,
y
1
r
d
0,1
/

sin
⁡
π
/
3
x
2
r
d
,
y
2
r
d
0.5,0.5
/

sin
⁡
π
/
6
x
3
r
d
,
y
3
r
d
-
0.5,0.5
/

sin
⁡
π
/
6
x
4
r
d
,
y
4
r
d
1
,
-
0.5
/

cos
⁡
π
/
6
x
5
r
d
,
y
5
r
d
-
1
,
-
0.5
/

cos
⁡
π
/
6Table 5
Time step of the state transition.
Time
State transition
Trigger event
0 s
S
1
→
S
2
I
1
12 s
S
2
→
S
3
I
2
34 s
S
3
→
S
4
I
8
58 s
S
4
→
S
3
I
2
66 s
S
3
→
S
5
I
3
73 s
S
5
→
S
2
→
S
3
I
4
,
I
2
112 s
S
3
→
S
4
I
8
290 s
S
4
→
S
3
I
10
,
I
2The simulation results are shown in Figures9–14.Figure 9
Automatic configuration transforming flight trajectory under threaten environment.Figure 10
Velocity instruction and response of UAV1.Figure 11
Course angle instruction and response of UAV1.Figure 12
Desired location tracking deviation graph of UAVs.Figure 13
Relative distance between UAVs.Figure 14
The convergence speed between RQPSO and PSO.From Figure9, we can see that the overall UAVs formation does not deviate the reference trajectory too far in the process of flight, and it can automatically switch the formation control law to complete the transformation between formation keeping and formation reconfiguration in accordance with each discrete event. When the UAVs formation detects the enemy early warning radar and carries out penetrating, UAV5 is selected to interfere in it, and the other UAVs regard UAV5 and reference trajectory as reference to transform formation automatically, so that they can be in a safe zone. When the UAVs formation detects the air defense radar tracking threat, UAV3 is selected to interfere in it; at this moment, UAV3 and UAV5 select the optimal interference position cooperatively and automatically, the formation completes the optimum formation solution, and all the UAVs can reach the desired position quickly and realize safe penetration. After successful penetration, according to the latest position and the desired formation, the UAVs formation makes the formation reconfiguration; although it forms the same formation with the former, the relative position among the UAVs has changed; this phenomenon shows that the formation which is made up of five UAVs can transform the formation nimbly under the threats environment. Figures 10 and 11 show the velocity, course angle control input of UAV1 and its actual velocity, and course angle response, and from the figures, we can achieve that the actual velocity and course angle response are within the range of constraint. Figure 12 shows the desired location tracking deviation of five UAVs, and from the figure, we can get that all the tracking deviations are within the range of constraint. Figure 13 shows that the relative distance between one UAV and another meets the constraints; thus, it validates the fact that the formation configuration automatic control method which is designed by this paper is effective. Figure 14 shows that the effect of revised quantum particle swarm optimization algorithm is better than particle swarm algorithm apparently.


## 8. Conclusion

In this paper, a finite state machine management unit scheme was proposed in the framework of distributed model predictive control. Because the formation adopts the virtual-leader control model and the battle field created the known threat constraints, such as early warning radar, air defense radar, nonfly zone, collision free constraints, and communication distance constraints, the formation configuration is determined by the reference trajectory point and the above threat constrains. This paper regards the cost of formation reconfiguration as the optimization objective, introduces the finite state machine scheme to justify the future state of the UAVs formation, and then adopts the revised quantum particle swarm optimization algorithm to solve the problem, while comparing it with particle swarm optimization algorithm. Simulation results show that the designed method is able to keep and transform the formation along with the desired reference trajectory when avoiding the threat of battlefield, avoiding intervehicle collision, and meeting the communication distance limit. Furthermore, we will explore the results when there exists communication delay or there exists no communication in a short period of time on the designed formation reconfiguration control problem.



---

*Source: 4878962-2016-09-20.xml*