# Distributed Cooperative Search Control Method of Multiple UAVs for Moving Target

Authors: Chang-jian Ru; Xiao-ming Qi; Xu-ning Guan
Journal: International Journal of Aerospace Engineering
 (2015)

---

## Abstract

To reduce the impact of uncertainties caused by unknown motion parameters on searching plan of moving targets and improve the efficiency of UAV’s searching, a novel distributed Multi-UAVs cooperative search control method for moving target is proposed in this paper. Based on detection results of onboard sensors, target probability map is updated using Bayesian theory. A Gaussian distribution of target transition probability density function is introduced to calculate prediction probability of moving target existence, and then target probability map can be further updated in real-time. A performance index function combining with target cost, environment cost, and cooperative cost is constructed, and the cooperative searching problem can be transformed into a central optimization problem. To improve computational efficiency, the distributed model predictive control method is presented, and thus the control command of each UAV can be obtained. The simulation results have verified that the proposed method can avoid the blindness of UAV searching better and improve overall efficiency of the team effectively.


---

## Body

## 1. Introduction

In recent years, Unmanned Aerial Vehicles (UAVs) have been widely used in both civilian and military fields, performing a variety of missions such as searching, reconnaissance, and surveillance [1]. Carrying a series of sensors, they can search kinds of targets in mission areas and obtain large amounts of useful information. Currently, searching method is generally preplanning trajectory method, and it is effective to search steady and nonthreat targets. However, with the complexity of the environment and increase of threats, it will become very difficult for a single UAV to accomplish the tasks of searching and capturing. It may be destroyed by the enemies, and then the entire mission will be in failure. To solve this problem, many scholars have proposed cooperative search method by multiple UAVs [2–4]. Multi-UAVs cooperative search is precondition performing other tasks such as target tracking, attack, and evaluation. Efficient searching can find the targets in mission areas and obtain intelligence information. Then, how to realize better cooperation between UAVs has become an important problem to be resolved.For the problem of Multi-UAV cooperative search, there are many literatures developed by associated scholars. In [5, 6], a cooperative search method based on distributed model predictive control (DMPC) is presented. Based on this method, a centralized online optimization problem is decomposed into decentralized optimization problem of each UAV. In [7], the objective of teams is proposed to search and cover the whole of the unknown area, while avoiding collision. Another problem is communication delay between UAVs when carrying on cooperative search in an uncertain environment [8, 9]. In [8], a stochastic method is proposed to estimate the probability of different actions for each UAV, and it can effectively compensate the effect of communication delay. For searching static targets, k-shortest path algorithm is introduced to guide the UAVs in an unknown area. Compared with stochastic and greedy searching algorithm, it is verified to be more effective [10]. In [11], the distributed approach integrating dynamic programming is proposed, and the objective is to gain more information of the whole team. By this method, each UAV can find its own flight path, respectively.Although these above methods have been verified to be effective for cooperative searching problems, they are mainly about the static targets, not suitable for the moving and time-critical targets. Currently, searching moving targets is the main focus of the satellites and robots fields [12–18]. Here several typical results are listed. In [12], five methods are proposed to search the ocean moving targets, and their performances are compared by simulation experiments according to creditable orbit data of the satellite. In [14], a swarm of UAV is used to search one or more evading targets in a predefined area. These targets have the abilities of avoiding the detection of the UAV. By negotiation between UAVs, the swarm can optimize their sensing capabilities to ensure the maximal territory of searching. In [16], for the uncertainty of target motion, the distributed target-centric formation control strategy integrating sliding mode control is proposed. It can compensate the uncertainties and maintain the expected target-centric formation.In this paper, we focus on searching the moving targets using Multi-UAV cooperation. Our main contributions contain three aspects:(
1
) Cognitive information map is constructed to describe the interaction among target, environment, and UAVs. (
2
) A novel updated mechanism for cognitive information map is designed integrating the prediction of target motion. (
3
) The pheromone map and artificial potential field are combined into the cooperative cost, which can ensure effective cooperation and collision avoidance between UAVs.The remainder of this paper is organized as follow. In Section2, the problem description is presented. The model of cognitive information map is built in Section 3. Based on these efforts, the performance function of UAV searching is constructed, and the receding horizon optimization method is used to solve distributed cooperative decision-making problem in Section 4. The simulation results are shown in Section 5. In Section 6, we conclude this paper and point out the further direction of this work.


## 2. Problem Descriptions

### 2.1. The Description of Search Environment

As is mentioned above, UAVs detect the ground moving targets by using onboard sensors with a fixed angle. So the whole environment can be mapped into a two-dimension space. Given a mission areaD
∈
R
2, suppose field of view (FOV) of the sensor to be approximately as a square area. Using geometric method, the mission area can be divided into L
x
×
L
y same grids. Let the coordinate (
x
,
y
) denote the position of one grid, where x
∈
{
1,2
,
…
,
L
x
} and y
∈
{
1,2
,
…
,
L
y
}. It is supposed that each grid can store some useful information, containing the existing probability of target, the uncertainty degree of environment, and the situation. Combining with all the grids, the cognitive information map (CIM) for searching can be obtained.To better describe the searching problem, three hypotheses are given as follows:(
1
) There is only a target in each grid at the same time. (
2
) Communication between UAVs has no delay or interruption. (
3
) There are no threats and obstacles in the environment, and only take into account the collision problem between UAVs.


### 2.2. Simplified Dynamic Model of UAV

Assume that each UAV has a certain speed and orientation. Letx
i
k
,
y
i
k and o
i
k
=
0,1
,
2
,
…
,
7 denote the position and flight orientation of UAV i, respectively. There are eight possible flight orientations, shown in such an array {
0
N
o
r
t
h, 1 N
o
r
t
h
e
a
s
t, 2
E
a
s
t, 3
S
o
u
t
h
e
a
s
t, 4
S
o
u
t
h, 5
S
o
u
t
h
w
e
s
t, 6
W
e
s
t, 7
N
o
r
t
h
w
e
s
t
}. The UAV’s dynamics is subjected by its curvature radius constraints. That means it can only change its orientation at most once by one step, namely, o
i
k
+
1
∈
o
i
k
-
1
,
o
i
k
,
o
i
k
+
1
mod
⁡
8. Each UAV has three possible orientations in the next time step, such as turn left, go straight, and turn right. It means that UAV’s maximum turning angle is 4
5
∘. For each UAV, the decision-making is which path will be selected in the next time step. Take UAV i, for example; let u
i
(
k
)
∈
l
,
s
,
r denote its selected path at each time step k. Figure 1 shows the schematic diagram for searching environment and various orientations.Figure 1
The schematic diagram for searching environment and various orientations.As is shown in Figure1, it is composed of two schematic diagrams. The left one is the description of UAV’s searching environment. The red triangle denotes UAV, the blue circle denotes target, and the black rectangle region denotes a preassumed river or lake, where there is a lower probability or even zero. The green rectangle region denotes a camp or an interesting target region, where there is a higher probability. The right one shows the possible flight orientations of UAV at the current and the next time step. If UAV flies towards the north at time k, there will be o
i
k
=
0. For each UAV, there are three possible selections for flight orientations at time k
+
1, which are o
i
k
+
1
=
7 (towards northwest), o
i
k
+
1
=
0 (towards north), and o
i
k
+
1
=
1 (towards northeast), respectively. But only one orientation can be selected, which should be most useful for searching based on acquired external environment information.


## 2.1. The Description of Search Environment

As is mentioned above, UAVs detect the ground moving targets by using onboard sensors with a fixed angle. So the whole environment can be mapped into a two-dimension space. Given a mission areaD
∈
R
2, suppose field of view (FOV) of the sensor to be approximately as a square area. Using geometric method, the mission area can be divided into L
x
×
L
y same grids. Let the coordinate (
x
,
y
) denote the position of one grid, where x
∈
{
1,2
,
…
,
L
x
} and y
∈
{
1,2
,
…
,
L
y
}. It is supposed that each grid can store some useful information, containing the existing probability of target, the uncertainty degree of environment, and the situation. Combining with all the grids, the cognitive information map (CIM) for searching can be obtained.To better describe the searching problem, three hypotheses are given as follows:(
1
) There is only a target in each grid at the same time. (
2
) Communication between UAVs has no delay or interruption. (
3
) There are no threats and obstacles in the environment, and only take into account the collision problem between UAVs.


## 2.2. Simplified Dynamic Model of UAV

Assume that each UAV has a certain speed and orientation. Letx
i
k
,
y
i
k and o
i
k
=
0,1
,
2
,
…
,
7 denote the position and flight orientation of UAV i, respectively. There are eight possible flight orientations, shown in such an array {
0
N
o
r
t
h, 1 N
o
r
t
h
e
a
s
t, 2
E
a
s
t, 3
S
o
u
t
h
e
a
s
t, 4
S
o
u
t
h, 5
S
o
u
t
h
w
e
s
t, 6
W
e
s
t, 7
N
o
r
t
h
w
e
s
t
}. The UAV’s dynamics is subjected by its curvature radius constraints. That means it can only change its orientation at most once by one step, namely, o
i
k
+
1
∈
o
i
k
-
1
,
o
i
k
,
o
i
k
+
1
mod
⁡
8. Each UAV has three possible orientations in the next time step, such as turn left, go straight, and turn right. It means that UAV’s maximum turning angle is 4
5
∘. For each UAV, the decision-making is which path will be selected in the next time step. Take UAV i, for example; let u
i
(
k
)
∈
l
,
s
,
r denote its selected path at each time step k. Figure 1 shows the schematic diagram for searching environment and various orientations.Figure 1
The schematic diagram for searching environment and various orientations.As is shown in Figure1, it is composed of two schematic diagrams. The left one is the description of UAV’s searching environment. The red triangle denotes UAV, the blue circle denotes target, and the black rectangle region denotes a preassumed river or lake, where there is a lower probability or even zero. The green rectangle region denotes a camp or an interesting target region, where there is a higher probability. The right one shows the possible flight orientations of UAV at the current and the next time step. If UAV flies towards the north at time k, there will be o
i
k
=
0. For each UAV, there are three possible selections for flight orientations at time k
+
1, which are o
i
k
+
1
=
7 (towards northwest), o
i
k
+
1
=
0 (towards north), and o
i
k
+
1
=
1 (towards northeast), respectively. But only one orientation can be selected, which should be most useful for searching based on acquired external environment information.


## 3. The Model of Cognitive Information Map

Traditional existing probability map (TEPM) constructed in Section3.1 only considers target existing probability in the task area, but it is not enough for Multi-UAVs cooperative search moving target. Next, the other two maps are introduced on the basis of TEPM. One is called the uncertain map of environment (UEM), and it can describe the certain degree of unknown environment which has been visited by UAVs. The other is called the pheromone map (PM), which is mainly used to establish the cooperation mechanism between UAVs and the controllable accessing ability to environment. So, integrating TPM, UEM, and PM, the cognitive information map (CIM) can be designed.


### 3.1. The Uncertain Map of Environment

For each grid cell, a number is set, which denotes uncertain degree of environment. For example, letχ
x
,
y
,
t denote uncertain degree of grid x
,
y at time t, and let μ denote descent factor. When UAV flies across the cell and understands grid cell, uncertain degree of grid cell will decrease. Set a certain threshold for the uncertain degree, and it means UAV completely understands the environment. Using the following equation, uncertain degree of grid cell can be updated: (1)
χ
x
,
y
,
t
+
1
=
μ
χ
x
,
y
,
t
,
UAV  is in grid cell
x
,
y
χ
x
,
y
,
t
,
others.


### 3.2. Pheromone Map

In order to realize the effective cooperation between UAVs, two basic pheromones [19] which are attractant and repulsion are introduced in this section. For these two pheromones, two mechanisms are introduced, namely, propagation and evaporation. Define G
a and G
r as the coefficients of attractant and repulsion propagation, respectively, while defining E
a and E
r as the coefficients of attractant and repulsion evaporation, respectively. Similarly, define two same pheromones for each grid. Let s
a
(
x
,
y
,
t
) and s
r
(
x
,
y
,
t
) denote attractant and repulsion pheromone of grid (
x
,
y
) at time t, respectively.Assume thatt
x
,
y is the last accessed time of the grid cell (
x
,
y
), T
0 is time threshold which is accessed again, and k
x
,
y is switch coefficient of attractant pheromone of grid cell (
x
,
y
). If t
-
t
x
,
y
≤
T
0, then k
x
,
y
=
0, which means grid (
x
,
y
) is not be accessed again. If t
-
t
x
,
y
>
T
0, then k
x
,
y
=
1, which means grid (
x
,
y
) should be accessed again. The switch matrix of attractant pheromone is calculated as follows:(2)
K
=
k
1,1
k
1,2
⋯
k
2,1
k
2,2
⋮
⋱
.Assume thatN
p is the accessed state matrix, storing the state of each grid accessed. Let n
x
,
y denote the times of UAV’s accessing grid (
x
,
y
) in the last period, where n
x
,
y
≥
0. Consider(3)
N
p
=
n
1,1
n
1,2
⋯
n
2,1
n
2,2
⋮
⋱
.Then, the attractant strength of the current grid can be calculated by (5), shown as follows:(4)
s
a
x
,
y
,
t
+
1
=
1
-
E
a
·
1
-
G
a
s
a
x
,
y
,
t
+
k
x
,
y
d
a
x
,
y
,
t
+
1
+
g
a
x
,
y
,
t
+
1
,where s
a
(
x
,
y
,
t
) denotes attractant strength of the grid (
x
,
y
) at time t, d
a
(
x
,
y
,
t
+
1
) denotes the release amount of attractant pheromone at time t
+
1, and g
a
(
x
,
y
,
t
+
1
) denotes attractant pheromone from neighboring grid between times t and t
+
1.Similar to attractant pheromone, the repulsion pheromone of current grid(
x
,
y
) can be calculated by (6). Consider(5)
s
r
x
,
y
,
t
+
1
=
1
-
E
r
·
1
-
G
r
s
r
x
,
y
,
t
+
n
x
,
y
d
r
x
,
y
,
t
+
1
+
g
r
x
,
y
,
t
+
1
,
⁡where s
r
(
x
,
y
,
t
) denotes repulsion strength of the grid at time t, d
r
(
x
,
y
,
t
+
1
) denotes the release amount of repulsion pheromone at time t
+
1, and g
r
(
x
,
y
,
t
+
1
) denotes repulsion pheromone from neighboring grids between times t and t
+
1.To ensure effective cooperation between UAVs, the total pheromone strength of the grid(
x
,
y
) at time t
+
1 can be obtained by the following equation:(6)
s
x
,
y
,
t
+
1
=
s
a
x
,
y
,
t
+
1
-
s
r
x
,
y
,
t
+
1
.


### 3.3. The Existing Probability Map of Target

If prior intelligent information obtained is not accurate, UAV cannot absolutely know the target distribution states. Existing probability map [11] is used to describe target existing probability of each grid. Let p
x
,
y
,
t denote target existing probability of grid x
,
y at time t, let p
d denote sensor detection precision, let p
f denote sensor false probability, and let b
(
t
) denote whether the target is detected or not at t time. If b
(
t
)
=
1, it means UAV has detected target, while b
(
t
)
=
0 means that UAVs do not detect target. Using the onboard sensors to detect all the grid cells, target existing probability is updated according to the detecting results. The updated mechanism is as follows: (7)
p
x
,
y
,
t
+
1
=
p
d
p
x
,
y
,
t
p
d
p
x
,
y
,
t
+
p
f
1
-
p
x
,
y
,
t
,
b
t
=
=
1
1
-
p
d
p
x
,
y
,
t
1
-
p
d
p
x
,
y
,
t
+
1
-
p
f
1
-
p
x
,
y
,
t
,
b
t
=
=
0
.To reduce the uncertainty of target motion parameters and improve the searching efficiency, prediction model of targets motion is established in this section. Then, a Gaussian distribution transition probability density function of moving target is proposed. Based on updating target existing probability in the TEPM, the existing prediction probability of the target can be calculated to further update the TEPM. So it can avoid the searching blindness and improve cognition and prediction ability for the target.


#### 3.3.1. The Description of Potential Movement Area of Maneuvering Target

If the prior intelligent information and the previous uncertain motion of maneuvering target manners are not accurate, it will be very difficult for UAV to search maneuvering target. Therefore, it is very important to predict the motion manners of target. Here, the impact on these constraints is considered. The potential movement area of maneuvering target is built, shown in Figure4. Assume that UAV has acquired prior information at time t and enters search area after Δ
T. During this time, target is moving. Suppose, at time t
0, the position of maneuvering target is (
x
0
,
y
0
), V denotes velocity of target, α denotes heading angle of target, Δ
α
m
a
x is the maximum heading angle, and Δ
V
m
a
x is the maximum velocity. The potential motion area of maneuvering target in time Δ
T is described as such a region, where (
x
0
,
y
0
) is center, (
v
+
v
0
)
Δ
T and (
v
-
v
0
)
Δ
T are radius, and the shadow between heading angle (
α
-
α
0
) and (
α
+
α
0
) is target potential area, shown in Figure 2(a). If prior information is deficient, there will be (
v
-
v
0
)
≈
0 and (
α
+
α
0
)
-
(
α
-
α
0
)
≈
36
0
∘. It means velocity and heading angle of target are unknown; then the potential movement area of maneuvering target can approximate a cirque, shown in Figure 2(b).Figure 2
The potential movement area of maneuvering target.
(a)
(b)


#### 3.3.2. The Motion Prediction Model of Maneuvering Target

In this paper, the probability distribution of maneuvering targets in potential movement area is used to predict the motion manners of target. Assumex
n
-
1 and y
n
-
1 denote position component of target on the axis of x and y at time t
n
-
1, respectively. Similarly, x
n and y
n denote position component of target on the axis of x and y at time t
n. Here, three hypotheses are given. (
1
) The position component of target on the axis of x and y is independent. (
2
) There is a larger time interval between t
n
-
1 and t
n, and m denotes the number of time step, where Δ
T
=
m
Δ
t. (
3
) The acceleration is the same in each time step and subject to Gaussian white noise sequence ξ
n with the same variance.According to the above description, mathematical induction method can be applied to gain the position and velocity of the target at subsectionk between t
n
-
1 and t
n time, respectively. Consider(8)
x
˙
k
=
x
˙
0
+
∑
i
=
1
k
ξ
x
i
Δ
t
,
(9)
y
˙
k
=
y
˙
0
+
∑
i
=
1
k
ξ
y
i
Δ
t
,
(10)
x
k
=
x
0
+
k
Δ
t
x
˙
0
+
1
2
∑
i
=
1
k
2
k
-
2
i
+
1
ξ
x
i
Δ
t
2
,
(11)
y
k
=
y
0
+
k
Δ
t
y
˙
0
+
1
2
∑
i
=
1
k
2
k
-
2
i
+
1
ξ
y
i
Δ
t
2
.According to formulation (7)–(10), suppose k
=
m. In this paper, m
=
10 is selected. Then, the position and velocity of the target towards x- and y-axis at time t
n can be obtained as follows:(12)
x
˙
n
=
x
˙
n
-
1
+
∑
i
=
1
m
ξ
x
i
Δ
t
,
(13)
y
˙
n
=
y
˙
n
-
1
+
∑
i
=
1
m
ξ
y
i
Δ
t
,
(14)
x
n
=
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
+
1
2
∑
i
=
1
m
2
m
-
2
i
+
1
ξ
x
i
Δ
t
2
,
(15)
y
n
=
y
n
-
1
+
m
Δ
t
y
˙
n
-
1
+
1
2
∑
i
=
1
m
2
k
-
2
i
+
1
ξ
y
i
Δ
t
2
.


#### 3.3.3. The Transition Probability Density Function of Maneuvering Target

The uncertainty of target position is mainly determined by the moving direction of the target. AfterΔ
T, the circle with the center (
x
n
-
1
,
y
n
-
1
) and the radius v
^
Δ
T is formed. The transition probability density function of maneuvering target can be obtained. It is subject to a Gaussian distribution, the mean values of which are the points on the cycle mentioned above. The schematic of transition probability density function of maneuvering target is shown in Figure 3.Figure 3
The schematic of transition probability density function of maneuvering target.Figure 4
The nonzero competition force and the vector plot between UAVs.Assume that the position of target is(
x
n
-
1
,
y
n
-
1
) at time t
n
-
1, after Δ
T, and the position of target along x- and y-axis will be such Gaussian distributions with the means μ
x and μ
y, variance δ
2, respectively. According to formulation (13), solving the mean and variance of random variable x
n, it can be deduced as follows:(16)
μ
x
=
E
x
n
=
E
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
+
1
2
·
∑
i
=
1
m
2
m
-
2
i
+
1
ξ
x
i
Δ
t
2
=
E
x
n
-
1
+
m
Δ
t
E
x
˙
n
-
1
+
1
2
∑
i
=
1
m
2
m
-
2
i
+
1
E
ξ
x
i
Δ
t
2
=
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
,
(17)
δ
2
=
D
x
n
=
E
x
n
2
-
E
2
x
n
=
E
x
n
2
-
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
2
,
(18)
E
x
n
2
=
E
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
+
1
2
∑
i
=
1
m
2
m
-
2
i
+
1
ξ
x
i
Δ
t
2
2
=
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
2
+
Δ
t
4
4
∑
i
=
1
m
2
i
-
1
2
E
ξ
x
i
2
=
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
2
+
Δ
t
4
4
∑
i
=
1
m
2
i
-
1
2
ξ
.Combining (17) with (16), the variance of the random variable x
n can be obtained:(19)
δ
2
=
Δ
t
4
4
∑
i
=
1
m
2
i
-
1
2
ξ
=
Δ
t
4
12
m
4
m
2
-
1
ξ
.Assume that the estimation of moving velocity isv
^ and the angle α is between the velocity direction and x-axis, and then (15) can be transformed as follows:(20)
μ
x
=
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
=
x
n
-
1
+
m
Δ
t
v
^
cos
⁡
α
=
x
n
-
1
+
m
Δ
t
v
^
x
n
-
x
n
-
1
x
n
-
x
n
-
1
2
+
y
n
-
y
n
-
1
2
.Similarly, one can obtain the meanμ
y and variance δ
2 of random variable y
n: (21)
μ
y
=
y
n
-
1
+
m
Δ
t
y
˙
n
-
1
=
y
n
-
1
+
m
Δ
t
v
^
sin
⁡
α
=
y
n
-
1
+
m
Δ
t
v
^
y
n
-
y
n
-
1
x
n
-
x
n
-
1
2
+
y
n
-
y
n
-
1
2
.Assume random variablesx
n and y
n are independent. After Δ
T, the target moves from (
x
n
-
1
,
y
n
-
1
) to (
x
n
,
y
n
), and then transition probability density function will be(22)
p
x
n
,
y
n
∣
x
n
-
1
,
y
n
-
1
=
1
2
π
δ
e
-
x
n
-
μ
x
2
/
2
δ
2
1
2
π
δ
e
-
y
n
-
μ
y
2
/
2
δ
2
=
1
2
π
δ
2
e
-
x
n
-
μ
x
2
+
y
n
-
μ
y
2
/
2
δ
2
.


#### 3.3.4. The Existence Prediction Probability of Maneuvering Target

For ground moving target, UAV continuously needs to detect, update, and predict the moving of target and makes use of predictive result to update the existence prediction probability of the target. The predictive result will be the prior information for UAV’s decision-making at next time step.Assume that the probability of the target existing in the gridi at time t
n
-
1 is p
i
(
t
n
-
1
). The length and width of the grid are both w. After Δ
T, UAV will predict the moving situation of targets and gain the transition probability density function of the target moving from grid i to grid j. Consider(23)
T
i
,
j
,
Δ
T
=
∫
y
j
-
w
/
2
y
j
+
w
/
2
∫
x
j
-
w
/
2
x
j
+
w
/
2
p
x
n
,
y
n
∣
x
n
-
1
,
y
n
-
1
d
x
n
d
y
n
=
1
2
π
δ
2
∫
y
j
-
w
/
2
y
j
+
w
/
2
∫
x
j
-
w
/
2
x
j
+
w
/
2
e
-
x
n
-
μ
x
2
+
y
n
-
μ
y
2
/
2
δ
2
d
x
n
d
y
n
.The existence prediction probability of targets in the gridj at time t
n is shown as follows:(24)
p
^
j
t
n
=
T
i
,
j
,
Δ
T
p
i
t
n
-
1
.At last, the cognitive information map (CIM) integrating uncertain map of environment, probability map of target, and pheromone map is completely built. It can provide more information to UAVs and ensure the effective cooperation between Multi-UAV.


## 3.1. The Uncertain Map of Environment

For each grid cell, a number is set, which denotes uncertain degree of environment. For example, letχ
x
,
y
,
t denote uncertain degree of grid x
,
y at time t, and let μ denote descent factor. When UAV flies across the cell and understands grid cell, uncertain degree of grid cell will decrease. Set a certain threshold for the uncertain degree, and it means UAV completely understands the environment. Using the following equation, uncertain degree of grid cell can be updated: (1)
χ
x
,
y
,
t
+
1
=
μ
χ
x
,
y
,
t
,
UAV  is in grid cell
x
,
y
χ
x
,
y
,
t
,
others.


## 3.2. Pheromone Map

In order to realize the effective cooperation between UAVs, two basic pheromones [19] which are attractant and repulsion are introduced in this section. For these two pheromones, two mechanisms are introduced, namely, propagation and evaporation. Define G
a and G
r as the coefficients of attractant and repulsion propagation, respectively, while defining E
a and E
r as the coefficients of attractant and repulsion evaporation, respectively. Similarly, define two same pheromones for each grid. Let s
a
(
x
,
y
,
t
) and s
r
(
x
,
y
,
t
) denote attractant and repulsion pheromone of grid (
x
,
y
) at time t, respectively.Assume thatt
x
,
y is the last accessed time of the grid cell (
x
,
y
), T
0 is time threshold which is accessed again, and k
x
,
y is switch coefficient of attractant pheromone of grid cell (
x
,
y
). If t
-
t
x
,
y
≤
T
0, then k
x
,
y
=
0, which means grid (
x
,
y
) is not be accessed again. If t
-
t
x
,
y
>
T
0, then k
x
,
y
=
1, which means grid (
x
,
y
) should be accessed again. The switch matrix of attractant pheromone is calculated as follows:(2)
K
=
k
1,1
k
1,2
⋯
k
2,1
k
2,2
⋮
⋱
.Assume thatN
p is the accessed state matrix, storing the state of each grid accessed. Let n
x
,
y denote the times of UAV’s accessing grid (
x
,
y
) in the last period, where n
x
,
y
≥
0. Consider(3)
N
p
=
n
1,1
n
1,2
⋯
n
2,1
n
2,2
⋮
⋱
.Then, the attractant strength of the current grid can be calculated by (5), shown as follows:(4)
s
a
x
,
y
,
t
+
1
=
1
-
E
a
·
1
-
G
a
s
a
x
,
y
,
t
+
k
x
,
y
d
a
x
,
y
,
t
+
1
+
g
a
x
,
y
,
t
+
1
,where s
a
(
x
,
y
,
t
) denotes attractant strength of the grid (
x
,
y
) at time t, d
a
(
x
,
y
,
t
+
1
) denotes the release amount of attractant pheromone at time t
+
1, and g
a
(
x
,
y
,
t
+
1
) denotes attractant pheromone from neighboring grid between times t and t
+
1.Similar to attractant pheromone, the repulsion pheromone of current grid(
x
,
y
) can be calculated by (6). Consider(5)
s
r
x
,
y
,
t
+
1
=
1
-
E
r
·
1
-
G
r
s
r
x
,
y
,
t
+
n
x
,
y
d
r
x
,
y
,
t
+
1
+
g
r
x
,
y
,
t
+
1
,
⁡where s
r
(
x
,
y
,
t
) denotes repulsion strength of the grid at time t, d
r
(
x
,
y
,
t
+
1
) denotes the release amount of repulsion pheromone at time t
+
1, and g
r
(
x
,
y
,
t
+
1
) denotes repulsion pheromone from neighboring grids between times t and t
+
1.To ensure effective cooperation between UAVs, the total pheromone strength of the grid(
x
,
y
) at time t
+
1 can be obtained by the following equation:(6)
s
x
,
y
,
t
+
1
=
s
a
x
,
y
,
t
+
1
-
s
r
x
,
y
,
t
+
1
.


## 3.3. The Existing Probability Map of Target

If prior intelligent information obtained is not accurate, UAV cannot absolutely know the target distribution states. Existing probability map [11] is used to describe target existing probability of each grid. Let p
x
,
y
,
t denote target existing probability of grid x
,
y at time t, let p
d denote sensor detection precision, let p
f denote sensor false probability, and let b
(
t
) denote whether the target is detected or not at t time. If b
(
t
)
=
1, it means UAV has detected target, while b
(
t
)
=
0 means that UAVs do not detect target. Using the onboard sensors to detect all the grid cells, target existing probability is updated according to the detecting results. The updated mechanism is as follows: (7)
p
x
,
y
,
t
+
1
=
p
d
p
x
,
y
,
t
p
d
p
x
,
y
,
t
+
p
f
1
-
p
x
,
y
,
t
,
b
t
=
=
1
1
-
p
d
p
x
,
y
,
t
1
-
p
d
p
x
,
y
,
t
+
1
-
p
f
1
-
p
x
,
y
,
t
,
b
t
=
=
0
.To reduce the uncertainty of target motion parameters and improve the searching efficiency, prediction model of targets motion is established in this section. Then, a Gaussian distribution transition probability density function of moving target is proposed. Based on updating target existing probability in the TEPM, the existing prediction probability of the target can be calculated to further update the TEPM. So it can avoid the searching blindness and improve cognition and prediction ability for the target.


### 3.3.1. The Description of Potential Movement Area of Maneuvering Target

If the prior intelligent information and the previous uncertain motion of maneuvering target manners are not accurate, it will be very difficult for UAV to search maneuvering target. Therefore, it is very important to predict the motion manners of target. Here, the impact on these constraints is considered. The potential movement area of maneuvering target is built, shown in Figure4. Assume that UAV has acquired prior information at time t and enters search area after Δ
T. During this time, target is moving. Suppose, at time t
0, the position of maneuvering target is (
x
0
,
y
0
), V denotes velocity of target, α denotes heading angle of target, Δ
α
m
a
x is the maximum heading angle, and Δ
V
m
a
x is the maximum velocity. The potential motion area of maneuvering target in time Δ
T is described as such a region, where (
x
0
,
y
0
) is center, (
v
+
v
0
)
Δ
T and (
v
-
v
0
)
Δ
T are radius, and the shadow between heading angle (
α
-
α
0
) and (
α
+
α
0
) is target potential area, shown in Figure 2(a). If prior information is deficient, there will be (
v
-
v
0
)
≈
0 and (
α
+
α
0
)
-
(
α
-
α
0
)
≈
36
0
∘. It means velocity and heading angle of target are unknown; then the potential movement area of maneuvering target can approximate a cirque, shown in Figure 2(b).Figure 2
The potential movement area of maneuvering target.
(a)
(b)


### 3.3.2. The Motion Prediction Model of Maneuvering Target

In this paper, the probability distribution of maneuvering targets in potential movement area is used to predict the motion manners of target. Assumex
n
-
1 and y
n
-
1 denote position component of target on the axis of x and y at time t
n
-
1, respectively. Similarly, x
n and y
n denote position component of target on the axis of x and y at time t
n. Here, three hypotheses are given. (
1
) The position component of target on the axis of x and y is independent. (
2
) There is a larger time interval between t
n
-
1 and t
n, and m denotes the number of time step, where Δ
T
=
m
Δ
t. (
3
) The acceleration is the same in each time step and subject to Gaussian white noise sequence ξ
n with the same variance.According to the above description, mathematical induction method can be applied to gain the position and velocity of the target at subsectionk between t
n
-
1 and t
n time, respectively. Consider(8)
x
˙
k
=
x
˙
0
+
∑
i
=
1
k
ξ
x
i
Δ
t
,
(9)
y
˙
k
=
y
˙
0
+
∑
i
=
1
k
ξ
y
i
Δ
t
,
(10)
x
k
=
x
0
+
k
Δ
t
x
˙
0
+
1
2
∑
i
=
1
k
2
k
-
2
i
+
1
ξ
x
i
Δ
t
2
,
(11)
y
k
=
y
0
+
k
Δ
t
y
˙
0
+
1
2
∑
i
=
1
k
2
k
-
2
i
+
1
ξ
y
i
Δ
t
2
.According to formulation (7)–(10), suppose k
=
m. In this paper, m
=
10 is selected. Then, the position and velocity of the target towards x- and y-axis at time t
n can be obtained as follows:(12)
x
˙
n
=
x
˙
n
-
1
+
∑
i
=
1
m
ξ
x
i
Δ
t
,
(13)
y
˙
n
=
y
˙
n
-
1
+
∑
i
=
1
m
ξ
y
i
Δ
t
,
(14)
x
n
=
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
+
1
2
∑
i
=
1
m
2
m
-
2
i
+
1
ξ
x
i
Δ
t
2
,
(15)
y
n
=
y
n
-
1
+
m
Δ
t
y
˙
n
-
1
+
1
2
∑
i
=
1
m
2
k
-
2
i
+
1
ξ
y
i
Δ
t
2
.


### 3.3.3. The Transition Probability Density Function of Maneuvering Target

The uncertainty of target position is mainly determined by the moving direction of the target. AfterΔ
T, the circle with the center (
x
n
-
1
,
y
n
-
1
) and the radius v
^
Δ
T is formed. The transition probability density function of maneuvering target can be obtained. It is subject to a Gaussian distribution, the mean values of which are the points on the cycle mentioned above. The schematic of transition probability density function of maneuvering target is shown in Figure 3.Figure 3
The schematic of transition probability density function of maneuvering target.Figure 4
The nonzero competition force and the vector plot between UAVs.Assume that the position of target is(
x
n
-
1
,
y
n
-
1
) at time t
n
-
1, after Δ
T, and the position of target along x- and y-axis will be such Gaussian distributions with the means μ
x and μ
y, variance δ
2, respectively. According to formulation (13), solving the mean and variance of random variable x
n, it can be deduced as follows:(16)
μ
x
=
E
x
n
=
E
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
+
1
2
·
∑
i
=
1
m
2
m
-
2
i
+
1
ξ
x
i
Δ
t
2
=
E
x
n
-
1
+
m
Δ
t
E
x
˙
n
-
1
+
1
2
∑
i
=
1
m
2
m
-
2
i
+
1
E
ξ
x
i
Δ
t
2
=
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
,
(17)
δ
2
=
D
x
n
=
E
x
n
2
-
E
2
x
n
=
E
x
n
2
-
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
2
,
(18)
E
x
n
2
=
E
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
+
1
2
∑
i
=
1
m
2
m
-
2
i
+
1
ξ
x
i
Δ
t
2
2
=
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
2
+
Δ
t
4
4
∑
i
=
1
m
2
i
-
1
2
E
ξ
x
i
2
=
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
2
+
Δ
t
4
4
∑
i
=
1
m
2
i
-
1
2
ξ
.Combining (17) with (16), the variance of the random variable x
n can be obtained:(19)
δ
2
=
Δ
t
4
4
∑
i
=
1
m
2
i
-
1
2
ξ
=
Δ
t
4
12
m
4
m
2
-
1
ξ
.Assume that the estimation of moving velocity isv
^ and the angle α is between the velocity direction and x-axis, and then (15) can be transformed as follows:(20)
μ
x
=
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
=
x
n
-
1
+
m
Δ
t
v
^
cos
⁡
α
=
x
n
-
1
+
m
Δ
t
v
^
x
n
-
x
n
-
1
x
n
-
x
n
-
1
2
+
y
n
-
y
n
-
1
2
.Similarly, one can obtain the meanμ
y and variance δ
2 of random variable y
n: (21)
μ
y
=
y
n
-
1
+
m
Δ
t
y
˙
n
-
1
=
y
n
-
1
+
m
Δ
t
v
^
sin
⁡
α
=
y
n
-
1
+
m
Δ
t
v
^
y
n
-
y
n
-
1
x
n
-
x
n
-
1
2
+
y
n
-
y
n
-
1
2
.Assume random variablesx
n and y
n are independent. After Δ
T, the target moves from (
x
n
-
1
,
y
n
-
1
) to (
x
n
,
y
n
), and then transition probability density function will be(22)
p
x
n
,
y
n
∣
x
n
-
1
,
y
n
-
1
=
1
2
π
δ
e
-
x
n
-
μ
x
2
/
2
δ
2
1
2
π
δ
e
-
y
n
-
μ
y
2
/
2
δ
2
=
1
2
π
δ
2
e
-
x
n
-
μ
x
2
+
y
n
-
μ
y
2
/
2
δ
2
.


### 3.3.4. The Existence Prediction Probability of Maneuvering Target

For ground moving target, UAV continuously needs to detect, update, and predict the moving of target and makes use of predictive result to update the existence prediction probability of the target. The predictive result will be the prior information for UAV’s decision-making at next time step.Assume that the probability of the target existing in the gridi at time t
n
-
1 is p
i
(
t
n
-
1
). The length and width of the grid are both w. After Δ
T, UAV will predict the moving situation of targets and gain the transition probability density function of the target moving from grid i to grid j. Consider(23)
T
i
,
j
,
Δ
T
=
∫
y
j
-
w
/
2
y
j
+
w
/
2
∫
x
j
-
w
/
2
x
j
+
w
/
2
p
x
n
,
y
n
∣
x
n
-
1
,
y
n
-
1
d
x
n
d
y
n
=
1
2
π
δ
2
∫
y
j
-
w
/
2
y
j
+
w
/
2
∫
x
j
-
w
/
2
x
j
+
w
/
2
e
-
x
n
-
μ
x
2
+
y
n
-
μ
y
2
/
2
δ
2
d
x
n
d
y
n
.The existence prediction probability of targets in the gridj at time t
n is shown as follows:(24)
p
^
j
t
n
=
T
i
,
j
,
Δ
T
p
i
t
n
-
1
.At last, the cognitive information map (CIM) integrating uncertain map of environment, probability map of target, and pheromone map is completely built. It can provide more information to UAVs and ensure the effective cooperation between Multi-UAV.


## 3.3.1. The Description of Potential Movement Area of Maneuvering Target

If the prior intelligent information and the previous uncertain motion of maneuvering target manners are not accurate, it will be very difficult for UAV to search maneuvering target. Therefore, it is very important to predict the motion manners of target. Here, the impact on these constraints is considered. The potential movement area of maneuvering target is built, shown in Figure4. Assume that UAV has acquired prior information at time t and enters search area after Δ
T. During this time, target is moving. Suppose, at time t
0, the position of maneuvering target is (
x
0
,
y
0
), V denotes velocity of target, α denotes heading angle of target, Δ
α
m
a
x is the maximum heading angle, and Δ
V
m
a
x is the maximum velocity. The potential motion area of maneuvering target in time Δ
T is described as such a region, where (
x
0
,
y
0
) is center, (
v
+
v
0
)
Δ
T and (
v
-
v
0
)
Δ
T are radius, and the shadow between heading angle (
α
-
α
0
) and (
α
+
α
0
) is target potential area, shown in Figure 2(a). If prior information is deficient, there will be (
v
-
v
0
)
≈
0 and (
α
+
α
0
)
-
(
α
-
α
0
)
≈
36
0
∘. It means velocity and heading angle of target are unknown; then the potential movement area of maneuvering target can approximate a cirque, shown in Figure 2(b).Figure 2
The potential movement area of maneuvering target.
(a)
(b)


## 3.3.2. The Motion Prediction Model of Maneuvering Target

In this paper, the probability distribution of maneuvering targets in potential movement area is used to predict the motion manners of target. Assumex
n
-
1 and y
n
-
1 denote position component of target on the axis of x and y at time t
n
-
1, respectively. Similarly, x
n and y
n denote position component of target on the axis of x and y at time t
n. Here, three hypotheses are given. (
1
) The position component of target on the axis of x and y is independent. (
2
) There is a larger time interval between t
n
-
1 and t
n, and m denotes the number of time step, where Δ
T
=
m
Δ
t. (
3
) The acceleration is the same in each time step and subject to Gaussian white noise sequence ξ
n with the same variance.According to the above description, mathematical induction method can be applied to gain the position and velocity of the target at subsectionk between t
n
-
1 and t
n time, respectively. Consider(8)
x
˙
k
=
x
˙
0
+
∑
i
=
1
k
ξ
x
i
Δ
t
,
(9)
y
˙
k
=
y
˙
0
+
∑
i
=
1
k
ξ
y
i
Δ
t
,
(10)
x
k
=
x
0
+
k
Δ
t
x
˙
0
+
1
2
∑
i
=
1
k
2
k
-
2
i
+
1
ξ
x
i
Δ
t
2
,
(11)
y
k
=
y
0
+
k
Δ
t
y
˙
0
+
1
2
∑
i
=
1
k
2
k
-
2
i
+
1
ξ
y
i
Δ
t
2
.According to formulation (7)–(10), suppose k
=
m. In this paper, m
=
10 is selected. Then, the position and velocity of the target towards x- and y-axis at time t
n can be obtained as follows:(12)
x
˙
n
=
x
˙
n
-
1
+
∑
i
=
1
m
ξ
x
i
Δ
t
,
(13)
y
˙
n
=
y
˙
n
-
1
+
∑
i
=
1
m
ξ
y
i
Δ
t
,
(14)
x
n
=
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
+
1
2
∑
i
=
1
m
2
m
-
2
i
+
1
ξ
x
i
Δ
t
2
,
(15)
y
n
=
y
n
-
1
+
m
Δ
t
y
˙
n
-
1
+
1
2
∑
i
=
1
m
2
k
-
2
i
+
1
ξ
y
i
Δ
t
2
.


## 3.3.3. The Transition Probability Density Function of Maneuvering Target

The uncertainty of target position is mainly determined by the moving direction of the target. AfterΔ
T, the circle with the center (
x
n
-
1
,
y
n
-
1
) and the radius v
^
Δ
T is formed. The transition probability density function of maneuvering target can be obtained. It is subject to a Gaussian distribution, the mean values of which are the points on the cycle mentioned above. The schematic of transition probability density function of maneuvering target is shown in Figure 3.Figure 3
The schematic of transition probability density function of maneuvering target.Figure 4
The nonzero competition force and the vector plot between UAVs.Assume that the position of target is(
x
n
-
1
,
y
n
-
1
) at time t
n
-
1, after Δ
T, and the position of target along x- and y-axis will be such Gaussian distributions with the means μ
x and μ
y, variance δ
2, respectively. According to formulation (13), solving the mean and variance of random variable x
n, it can be deduced as follows:(16)
μ
x
=
E
x
n
=
E
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
+
1
2
·
∑
i
=
1
m
2
m
-
2
i
+
1
ξ
x
i
Δ
t
2
=
E
x
n
-
1
+
m
Δ
t
E
x
˙
n
-
1
+
1
2
∑
i
=
1
m
2
m
-
2
i
+
1
E
ξ
x
i
Δ
t
2
=
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
,
(17)
δ
2
=
D
x
n
=
E
x
n
2
-
E
2
x
n
=
E
x
n
2
-
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
2
,
(18)
E
x
n
2
=
E
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
+
1
2
∑
i
=
1
m
2
m
-
2
i
+
1
ξ
x
i
Δ
t
2
2
=
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
2
+
Δ
t
4
4
∑
i
=
1
m
2
i
-
1
2
E
ξ
x
i
2
=
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
2
+
Δ
t
4
4
∑
i
=
1
m
2
i
-
1
2
ξ
.Combining (17) with (16), the variance of the random variable x
n can be obtained:(19)
δ
2
=
Δ
t
4
4
∑
i
=
1
m
2
i
-
1
2
ξ
=
Δ
t
4
12
m
4
m
2
-
1
ξ
.Assume that the estimation of moving velocity isv
^ and the angle α is between the velocity direction and x-axis, and then (15) can be transformed as follows:(20)
μ
x
=
x
n
-
1
+
m
Δ
t
x
˙
n
-
1
=
x
n
-
1
+
m
Δ
t
v
^
cos
⁡
α
=
x
n
-
1
+
m
Δ
t
v
^
x
n
-
x
n
-
1
x
n
-
x
n
-
1
2
+
y
n
-
y
n
-
1
2
.Similarly, one can obtain the meanμ
y and variance δ
2 of random variable y
n: (21)
μ
y
=
y
n
-
1
+
m
Δ
t
y
˙
n
-
1
=
y
n
-
1
+
m
Δ
t
v
^
sin
⁡
α
=
y
n
-
1
+
m
Δ
t
v
^
y
n
-
y
n
-
1
x
n
-
x
n
-
1
2
+
y
n
-
y
n
-
1
2
.Assume random variablesx
n and y
n are independent. After Δ
T, the target moves from (
x
n
-
1
,
y
n
-
1
) to (
x
n
,
y
n
), and then transition probability density function will be(22)
p
x
n
,
y
n
∣
x
n
-
1
,
y
n
-
1
=
1
2
π
δ
e
-
x
n
-
μ
x
2
/
2
δ
2
1
2
π
δ
e
-
y
n
-
μ
y
2
/
2
δ
2
=
1
2
π
δ
2
e
-
x
n
-
μ
x
2
+
y
n
-
μ
y
2
/
2
δ
2
.


## 3.3.4. The Existence Prediction Probability of Maneuvering Target

For ground moving target, UAV continuously needs to detect, update, and predict the moving of target and makes use of predictive result to update the existence prediction probability of the target. The predictive result will be the prior information for UAV’s decision-making at next time step.Assume that the probability of the target existing in the gridi at time t
n
-
1 is p
i
(
t
n
-
1
). The length and width of the grid are both w. After Δ
T, UAV will predict the moving situation of targets and gain the transition probability density function of the target moving from grid i to grid j. Consider(23)
T
i
,
j
,
Δ
T
=
∫
y
j
-
w
/
2
y
j
+
w
/
2
∫
x
j
-
w
/
2
x
j
+
w
/
2
p
x
n
,
y
n
∣
x
n
-
1
,
y
n
-
1
d
x
n
d
y
n
=
1
2
π
δ
2
∫
y
j
-
w
/
2
y
j
+
w
/
2
∫
x
j
-
w
/
2
x
j
+
w
/
2
e
-
x
n
-
μ
x
2
+
y
n
-
μ
y
2
/
2
δ
2
d
x
n
d
y
n
.The existence prediction probability of targets in the gridj at time t
n is shown as follows:(24)
p
^
j
t
n
=
T
i
,
j
,
Δ
T
p
i
t
n
-
1
.At last, the cognitive information map (CIM) integrating uncertain map of environment, probability map of target, and pheromone map is completely built. It can provide more information to UAVs and ensure the effective cooperation between Multi-UAV.


## 4. The Decision-Making Approach of Distributed Cooperative Search of Multi-UAVs

In order to ensure effective cooperation and avoid collision between UAVs, the special mechanism based on the combination of pheromone map and artificial potential field method is established. Meanwhile, the correlative value function is constructed. But, for centralized model prediction control, calculation amounts are very large. If the central UAV is disabled, the other UAVs will not acquire decision-making commands; thus the whole searching task will be failed. So the centralized online optimization problem of Multi-UAVs is transformed into the distributed online optimization problem. It can improve the calculation efficiency and ensure successful accomplishment of the searching task.


### 4.1. The Performance Index Function of UAV Searching

The purpose of cooperative search is to find as many targets as possible and to reduce the uncertain degree of the whole searching area, thus ensuring the effective cooperation between UAVs and avoiding collision [19, 20]. We can construct the function of searching efficiency J
(
x
(
k
)
,
u
(
k
)
) to describe performance of UAV searching. This function is a multiobjectives optimization function, containing coverage, target discovery, and cooperative capability. Next, we will introduce the modeling process of the search cost of environment, the discovery cost of target, and cooperative cost in detail.(1) The Search Cost of Environment. The search cost of environment is mainly used to describe how to reduce the uncertainty degree of environment. The information entropy is introduced to denote the uncertainty degree of environment, presented as p
(
x
,
y
,
t
n
). The special definition is described as follows:(25)
z
x
,
y
,
t
n
=
H
p
x
,
y
,
t
n
p
x
,
y
,
t
n
≠
0
and
1
0
p
x
,
y
,
t
n
=
0
or
1
,
(26)
H
p
x
,
y
,
t
n
=
-
p
x
,
y
,
t
n
log
2
⁡
p
x
,
y
,
t
n
-
1
-
p
x
,
y
,
t
n
log
2
⁡
1
-
p
x
,
y
,
t
n
.With UAV continuously searching and detecting in the mission area, the information entropy may gradually decrease. So, in order to describe the reduced amount of information entropy, the search cost of environment is defined as follows:(27)
J
e
x
,
y
,
t
n
=
z
x
,
y
,
t
n
-
1
-
z
x
,
y
,
t
n
=
H
p
x
,
y
,
t
n
-
1
-
H
p
x
,
y
,
t
n
.(2) The Discovery Cost of Target. The discovery cost of target denotes the possibility of UAV finding targets based on onboard sensors from the current position to target position:(28)
J
t
x
,
y
,
t
n
=
p
d
-
p
f
p
x
,
y
,
t
n
+
p
f
,where p
(
x
,
y
,
t
n
) is updated by formulation (2), p
d is the detection precision of the sensor, and p
f is false probability of the sensor.(3) Cooperative Cost. The purpose of cooperation optimization is to avoid the excessive repeated searching of one grid. Therefore, the pheromone is introduced to describe the occupation situation of searching area. By this way, it can effectively reduce the numbers of UAV visiting the grid repeatedly and improve the cooperative searching efficiency. The cooperative cost is defined as follows:(29)
J
c
1
x
,
y
,
t
n
=
s
a
x
,
y
,
t
n
-
s
r
x
,
y
,
t
n
.


### 4.2. Collision Avoidance Mechanism between Multi-UAVs

For Multi-UAVs cooperative search problem, we not only consider cooperative search efficiency but also consider the collision and trajectory overlap between UAVs. Here, the artificial potential field method is introduced to solve the above problem. This method is a virtual method and can ensure the relative position and orientation by calculating competition force between UAVs. LetF
i
j
(
t
n
) denote the competition force between UAV i and UAV j at time t
n, which is defined as follows:(30)
F
i
j
→
t
n
=
k
e
-
α
ρ
i
j
ρ
i
j
→
satisfy Conditions
1
and
2
0
others
,where ρ
i
j denotes the shortest distance between the flight path of UAV j and UAV i, if ρ
i
j
=
0, the constant k is changed to a larger number, and if ρ
i
j is gradually rising, F
i
j
→
(
t
n
) is gradually dropping.To facilitate the description, two conditions are given.Condition 1.
The distance between the UAVj and UAV i is less than the maximum distance R, and the UAV j lies in flight observation scope of UAV i, where the scope is a sector area which is between the maximum angle θ and the minimum angle -
θ.Condition 2.
The differenceα
i
j of heading angle between the UAV j and UAV i is less than the threshold α
t
h; that is, α
i
j
∈
[
-
α
t
h
,
α
t
h
].The condition and the vector of competition force between UAVs are shown in Figure6. From Figure 4, it can be found that UAV 3 and UAV 4 satisfy Condition 1, both in the flight range of UAV 1 and less than the maximum distance. UAV 2 and UAV 3 satisfy Condition 2, the angle between UAVs is less than α
t
h, so only UAV 3 satisfies Conditions 1 and 2 at the same time, and only UAV 3 produces competition force for UAV 1; others do not produce competition force for UAV 1; that is, F
21
→
=
0, F
41
→
=
0, and F
31
→
≠
0.The resultant force is the vector sum of competition forces which belong to the other UAVs act on the UAVi. Consider(31)
F
i
→
t
n
=
∑
j
≠
i
F
i
j
→
t
n
.As is mentioned above, both UAV’s repeated access and collision avoidance between UAVs should be considered, so we will model competition force value function, shown as follows:(32)
J
c
2
i
,
j
,
t
n
=
e
x
p
γ
0
F
i
→
t
n
cos
⁡
β
i
j
,
t
n
/
2
,where β
i
(
j
,
t
n
) denotes angle difference between the direction of total rivaling force F
i
→
(
t
n
) and the direction of each possible path. γ
0 is a positive constant.Combining (28) and (31), the cooperation value function can better express cooperative mechanism between UAVs. It can both improve the efficiency of cooperative search and avoid collision between UAVs:(33)
J
c
=
α
J
c
1
+
1
-
α
J
c
2
.The total value functionJ
(
X
(
k
)
,
U
(
k
)
) is obtained by weighting every performance function:(34)
J
X
k
,
U
k
=
λ
1
J
e
+
λ
2
J
t
+
λ
3
J
c
.


### 4.3. The Decision-Making Approach of Distributed Cooperative Search

The purpose of Multi-UAV cooperative search moving targets is to ensure maximizing search efficiency in uncertain area, obtaining the information of the whole search area, decreasing the uncertain degree of environment, and finding the maximum number of targets.Assume that the discrete states equation of Multi-UAVs cooperative search system is shown as follows:(35)
x
k
+
1
=
f
x
k
,
u
k
,where k is the discrete time, x
(
k
) is the system states, u
(
k
) is the control input, f is the mapping from input to output, and N is the length of predictive horizon. Here, x
(
k
) and u
(
k
) contain the states and controls of all UAVs, shown as follows:(36)
x
k
=
x
1
k
,
x
2
k
,
…
,
x
v
n
k
,
u
k
=
u
1
k
,
u
2
k
,
…
,
u
v
n
k
.Based on the current statex
(
k
) and decision-making sequence (
k
,
k
+
N
-
1
) during the horizon time, predictive states sequence x
k
+
1
,
x
k
+
2
,
…
,
x
(
k
+
N
) can be obtained. Assume that X
(
k
) and U
(
k
) are the sets of the states and decision-making sequence, respectively, shown as follows:(37)
X
k
=
x
k
+
1
,
x
k
+
2
,
…
,
x
k
+
N
,
U
k
=
u
k
,
u
k
+
1
,
…
,
u
k
+
N
-
1
.Here,X
i
(
k
) and U
i
(
k
) denote the state and control sequence of UAV v
i, respectively. Assume that J
(
x
(
k
)
,
u
(
k
)
) is the performance function of UAV; the total performance function of UAV autonomous cooperative search during the prediction horizon can be written as (38)
J
X
k
,
U
k
=
∑
q
=
1
N
J
x
k
+
q
-
1
,
u
k
+
q
-
1
.Then, the model of centralized prediction control of cooperative search at timek can be obtained as follows:(39)
U
~
k
=
arg
⁡
m
a
x
U
k
J
X
k
,
U
k
s
.
t
.
X
k
+
q
=
f
X
k
+
q
-
1
∣
k
,
U
k
+
q
-
1
∣
k
X
k
∣
k
=
X
k
x
i
k
+
q
∣
k
∈
Ξ
i
=
1,2
,
…
,
N
v
u
i
k
+
q
∣
k
∈
Θ
x
i
k
+
N
∣
k
∈
Ξ
i
f
G
X
k
,
U
k
≤
0
,where Ξ and Θ denote the feasible state set and admissible input set of UAV, respectively, Ξ
i
f denotes state constraint set of UAV v
i, and G
(
X
(
k
)
,
U
(
k
)
)
≤
0 denotes the various constraint conditions.For centralized optimization model, the central node (UAV or ground station) is responsible for obtaining the state information of all UAVs and assigning the optimization control sequence to each UAV. This method has a good ability of global decision-making, but it may bring severe dimension disaster when the numbers of UAV and prediction horizon time increase. But, for each UAV, it must make the decision in a short time. So distributed model predictive control (DMPC) [20] method is introduced to realize decision-making of UAV searching. The information structure of UAV autonomous cooperative search based on DMPC is shown in Figure 5.Figure 5
The information structure of UAV autonomous cooperation search based on DMPC.Figure 6
Pheromone potential differences.
(a)
250 steps
(b)
500 steps
(c)
750 steps
(d)
1000 stepsFor such a dynamic decoupling system, assume thatf
i
(
x
v
i
(
k
)
,
u
v
i
(
k
)
) is the state equation of UAV v
i. UAV v
i can obtain information X
-
i
(
k
) by the network communication and make the decision by the DMPC method. It also can share the state x
v
i
(
k
) and the decision u
v
i
(
k
) with other neighboring grids. For the UAV  v
i, the local horizon optimization decision-making model of autonomous cooperative search can be written as(40)
U
i
∗
k
=
arg
⁡
m
a
x
U
i
k
J
i
X
i
k
,
X
-
i
k
,
U
i
k
,
U
-
i
k
s
.
t
.
x
i
k
+
q
=
f
i
x
i
k
+
q
-
1
∣
k
,
u
i
k
+
q
-
1
∣
k
x
i
k
∣
k
=
x
i
k
x
i
k
+
q
∣
k
∈
Ξ
i
=
1,2
,
…
,
N
v
u
i
k
+
q
∣
k
∈
Θ
x
i
k
+
N
∣
k
∈
Ξ
i
f
G
X
i
k
,
X
-
i
k
,
U
i
k
,
U
-
i
k
≤
0
.The distributed decision-making algorithm of Multi-UAVs cooperative search can be divided into steps, shown in Algorithm 1.Algorithm 1:The distributed decision-making algorithm of Multi-UAVs cooperative search.
Initialize: Assume that the prediction horizon length isN, sample time is t
s, discrete time is k.
At timek
=
0, x
i
(
k
), i
=
1,2
,
…
,
N
v
n is initialized. Predict the states of each UAV and obtain prediction
sequencesX
i
(
k
+
1
), U
i
(
k
+
1
), i
=
1,2
,
…
,
N
v
n.
Step  1. Let the first item u
i
(
k
+
1
∣
k
+
1
) of control sequence U
i
(
k
+
1
) as the command of output decision.
Step  2. Update the system states x
i
(
k
+
1
)
→
x
i
(
k
+
2
), and predict the states and decision sequences of
UAV asX
i
(
k
+
2
), U
i
(
k
+
2
), i
=
1,2
,
…
,
N
v
n.
Step  3. UAV v
i sends its state and decision-making information to UAV v
j
,
j
≠
i, and receives the
prediction states sequenceX
-
i
(
k
+
2
), i
=
1,2
,
…
,
N
v
n of the other UAVs.
Step  4. Compute the value of each value function based on formulation (26), (27), (28), (31), and (32), and obtain
total cost value of UAVv
i in the prediction horizon length N.
Step  5. According to formulation (39), make the local decision and obtain decision-making sequence
U
~
i
(
k
+
2
)
=
[
u
i
(
k
+
2
∣
k
+
2
)
,
…
,
u
i
(
k
+
N
+
1
∣
k
+
2
)
], define u
i
(
k
+
2
∣
k
+
2
) as decision-making output at time k
+
2.
Step  6. Update k
=
k
+
1, return to Step  1.
End


## 4.1. The Performance Index Function of UAV Searching

The purpose of cooperative search is to find as many targets as possible and to reduce the uncertain degree of the whole searching area, thus ensuring the effective cooperation between UAVs and avoiding collision [19, 20]. We can construct the function of searching efficiency J
(
x
(
k
)
,
u
(
k
)
) to describe performance of UAV searching. This function is a multiobjectives optimization function, containing coverage, target discovery, and cooperative capability. Next, we will introduce the modeling process of the search cost of environment, the discovery cost of target, and cooperative cost in detail.(1) The Search Cost of Environment. The search cost of environment is mainly used to describe how to reduce the uncertainty degree of environment. The information entropy is introduced to denote the uncertainty degree of environment, presented as p
(
x
,
y
,
t
n
). The special definition is described as follows:(25)
z
x
,
y
,
t
n
=
H
p
x
,
y
,
t
n
p
x
,
y
,
t
n
≠
0
and
1
0
p
x
,
y
,
t
n
=
0
or
1
,
(26)
H
p
x
,
y
,
t
n
=
-
p
x
,
y
,
t
n
log
2
⁡
p
x
,
y
,
t
n
-
1
-
p
x
,
y
,
t
n
log
2
⁡
1
-
p
x
,
y
,
t
n
.With UAV continuously searching and detecting in the mission area, the information entropy may gradually decrease. So, in order to describe the reduced amount of information entropy, the search cost of environment is defined as follows:(27)
J
e
x
,
y
,
t
n
=
z
x
,
y
,
t
n
-
1
-
z
x
,
y
,
t
n
=
H
p
x
,
y
,
t
n
-
1
-
H
p
x
,
y
,
t
n
.(2) The Discovery Cost of Target. The discovery cost of target denotes the possibility of UAV finding targets based on onboard sensors from the current position to target position:(28)
J
t
x
,
y
,
t
n
=
p
d
-
p
f
p
x
,
y
,
t
n
+
p
f
,where p
(
x
,
y
,
t
n
) is updated by formulation (2), p
d is the detection precision of the sensor, and p
f is false probability of the sensor.(3) Cooperative Cost. The purpose of cooperation optimization is to avoid the excessive repeated searching of one grid. Therefore, the pheromone is introduced to describe the occupation situation of searching area. By this way, it can effectively reduce the numbers of UAV visiting the grid repeatedly and improve the cooperative searching efficiency. The cooperative cost is defined as follows:(29)
J
c
1
x
,
y
,
t
n
=
s
a
x
,
y
,
t
n
-
s
r
x
,
y
,
t
n
.


## 4.2. Collision Avoidance Mechanism between Multi-UAVs

For Multi-UAVs cooperative search problem, we not only consider cooperative search efficiency but also consider the collision and trajectory overlap between UAVs. Here, the artificial potential field method is introduced to solve the above problem. This method is a virtual method and can ensure the relative position and orientation by calculating competition force between UAVs. LetF
i
j
(
t
n
) denote the competition force between UAV i and UAV j at time t
n, which is defined as follows:(30)
F
i
j
→
t
n
=
k
e
-
α
ρ
i
j
ρ
i
j
→
satisfy Conditions
1
and
2
0
others
,where ρ
i
j denotes the shortest distance between the flight path of UAV j and UAV i, if ρ
i
j
=
0, the constant k is changed to a larger number, and if ρ
i
j is gradually rising, F
i
j
→
(
t
n
) is gradually dropping.To facilitate the description, two conditions are given.Condition 1.
The distance between the UAVj and UAV i is less than the maximum distance R, and the UAV j lies in flight observation scope of UAV i, where the scope is a sector area which is between the maximum angle θ and the minimum angle -
θ.Condition 2.
The differenceα
i
j of heading angle between the UAV j and UAV i is less than the threshold α
t
h; that is, α
i
j
∈
[
-
α
t
h
,
α
t
h
].The condition and the vector of competition force between UAVs are shown in Figure6. From Figure 4, it can be found that UAV 3 and UAV 4 satisfy Condition 1, both in the flight range of UAV 1 and less than the maximum distance. UAV 2 and UAV 3 satisfy Condition 2, the angle between UAVs is less than α
t
h, so only UAV 3 satisfies Conditions 1 and 2 at the same time, and only UAV 3 produces competition force for UAV 1; others do not produce competition force for UAV 1; that is, F
21
→
=
0, F
41
→
=
0, and F
31
→
≠
0.The resultant force is the vector sum of competition forces which belong to the other UAVs act on the UAVi. Consider(31)
F
i
→
t
n
=
∑
j
≠
i
F
i
j
→
t
n
.As is mentioned above, both UAV’s repeated access and collision avoidance between UAVs should be considered, so we will model competition force value function, shown as follows:(32)
J
c
2
i
,
j
,
t
n
=
e
x
p
γ
0
F
i
→
t
n
cos
⁡
β
i
j
,
t
n
/
2
,where β
i
(
j
,
t
n
) denotes angle difference between the direction of total rivaling force F
i
→
(
t
n
) and the direction of each possible path. γ
0 is a positive constant.Combining (28) and (31), the cooperation value function can better express cooperative mechanism between UAVs. It can both improve the efficiency of cooperative search and avoid collision between UAVs:(33)
J
c
=
α
J
c
1
+
1
-
α
J
c
2
.The total value functionJ
(
X
(
k
)
,
U
(
k
)
) is obtained by weighting every performance function:(34)
J
X
k
,
U
k
=
λ
1
J
e
+
λ
2
J
t
+
λ
3
J
c
.


## 4.3. The Decision-Making Approach of Distributed Cooperative Search

The purpose of Multi-UAV cooperative search moving targets is to ensure maximizing search efficiency in uncertain area, obtaining the information of the whole search area, decreasing the uncertain degree of environment, and finding the maximum number of targets.Assume that the discrete states equation of Multi-UAVs cooperative search system is shown as follows:(35)
x
k
+
1
=
f
x
k
,
u
k
,where k is the discrete time, x
(
k
) is the system states, u
(
k
) is the control input, f is the mapping from input to output, and N is the length of predictive horizon. Here, x
(
k
) and u
(
k
) contain the states and controls of all UAVs, shown as follows:(36)
x
k
=
x
1
k
,
x
2
k
,
…
,
x
v
n
k
,
u
k
=
u
1
k
,
u
2
k
,
…
,
u
v
n
k
.Based on the current statex
(
k
) and decision-making sequence (
k
,
k
+
N
-
1
) during the horizon time, predictive states sequence x
k
+
1
,
x
k
+
2
,
…
,
x
(
k
+
N
) can be obtained. Assume that X
(
k
) and U
(
k
) are the sets of the states and decision-making sequence, respectively, shown as follows:(37)
X
k
=
x
k
+
1
,
x
k
+
2
,
…
,
x
k
+
N
,
U
k
=
u
k
,
u
k
+
1
,
…
,
u
k
+
N
-
1
.Here,X
i
(
k
) and U
i
(
k
) denote the state and control sequence of UAV v
i, respectively. Assume that J
(
x
(
k
)
,
u
(
k
)
) is the performance function of UAV; the total performance function of UAV autonomous cooperative search during the prediction horizon can be written as (38)
J
X
k
,
U
k
=
∑
q
=
1
N
J
x
k
+
q
-
1
,
u
k
+
q
-
1
.Then, the model of centralized prediction control of cooperative search at timek can be obtained as follows:(39)
U
~
k
=
arg
⁡
m
a
x
U
k
J
X
k
,
U
k
s
.
t
.
X
k
+
q
=
f
X
k
+
q
-
1
∣
k
,
U
k
+
q
-
1
∣
k
X
k
∣
k
=
X
k
x
i
k
+
q
∣
k
∈
Ξ
i
=
1,2
,
…
,
N
v
u
i
k
+
q
∣
k
∈
Θ
x
i
k
+
N
∣
k
∈
Ξ
i
f
G
X
k
,
U
k
≤
0
,where Ξ and Θ denote the feasible state set and admissible input set of UAV, respectively, Ξ
i
f denotes state constraint set of UAV v
i, and G
(
X
(
k
)
,
U
(
k
)
)
≤
0 denotes the various constraint conditions.For centralized optimization model, the central node (UAV or ground station) is responsible for obtaining the state information of all UAVs and assigning the optimization control sequence to each UAV. This method has a good ability of global decision-making, but it may bring severe dimension disaster when the numbers of UAV and prediction horizon time increase. But, for each UAV, it must make the decision in a short time. So distributed model predictive control (DMPC) [20] method is introduced to realize decision-making of UAV searching. The information structure of UAV autonomous cooperative search based on DMPC is shown in Figure 5.Figure 5
The information structure of UAV autonomous cooperation search based on DMPC.Figure 6
Pheromone potential differences.
(a)
250 steps
(b)
500 steps
(c)
750 steps
(d)
1000 stepsFor such a dynamic decoupling system, assume thatf
i
(
x
v
i
(
k
)
,
u
v
i
(
k
)
) is the state equation of UAV v
i. UAV v
i can obtain information X
-
i
(
k
) by the network communication and make the decision by the DMPC method. It also can share the state x
v
i
(
k
) and the decision u
v
i
(
k
) with other neighboring grids. For the UAV  v
i, the local horizon optimization decision-making model of autonomous cooperative search can be written as(40)
U
i
∗
k
=
arg
⁡
m
a
x
U
i
k
J
i
X
i
k
,
X
-
i
k
,
U
i
k
,
U
-
i
k
s
.
t
.
x
i
k
+
q
=
f
i
x
i
k
+
q
-
1
∣
k
,
u
i
k
+
q
-
1
∣
k
x
i
k
∣
k
=
x
i
k
x
i
k
+
q
∣
k
∈
Ξ
i
=
1,2
,
…
,
N
v
u
i
k
+
q
∣
k
∈
Θ
x
i
k
+
N
∣
k
∈
Ξ
i
f
G
X
i
k
,
X
-
i
k
,
U
i
k
,
U
-
i
k
≤
0
.The distributed decision-making algorithm of Multi-UAVs cooperative search can be divided into steps, shown in Algorithm 1.Algorithm 1:The distributed decision-making algorithm of Multi-UAVs cooperative search.
Initialize: Assume that the prediction horizon length isN, sample time is t
s, discrete time is k.
At timek
=
0, x
i
(
k
), i
=
1,2
,
…
,
N
v
n is initialized. Predict the states of each UAV and obtain prediction
sequencesX
i
(
k
+
1
), U
i
(
k
+
1
), i
=
1,2
,
…
,
N
v
n.
Step  1. Let the first item u
i
(
k
+
1
∣
k
+
1
) of control sequence U
i
(
k
+
1
) as the command of output decision.
Step  2. Update the system states x
i
(
k
+
1
)
→
x
i
(
k
+
2
), and predict the states and decision sequences of
UAV asX
i
(
k
+
2
), U
i
(
k
+
2
), i
=
1,2
,
…
,
N
v
n.
Step  3. UAV v
i sends its state and decision-making information to UAV v
j
,
j
≠
i, and receives the
prediction states sequenceX
-
i
(
k
+
2
), i
=
1,2
,
…
,
N
v
n of the other UAVs.
Step  4. Compute the value of each value function based on formulation (26), (27), (28), (31), and (32), and obtain
total cost value of UAVv
i in the prediction horizon length N.
Step  5. According to formulation (39), make the local decision and obtain decision-making sequence
U
~
i
(
k
+
2
)
=
[
u
i
(
k
+
2
∣
k
+
2
)
,
…
,
u
i
(
k
+
N
+
1
∣
k
+
2
)
], define u
i
(
k
+
2
∣
k
+
2
) as decision-making output at time k
+
2.
Step  6. Update k
=
k
+
1, return to Step  1.
End


## 5. The Simulation Validation and Results Analysis

To verify the effectiveness and feasibility of the proposed method, the simulation platform of Multi-UAVs distributed cooperative search for moving target is established in this section. The dynamic flight trajectory of UAV and motion trajectory of target can be observed in the simulation platform. The conditions of the simulation are designed as follows. The size of task area is 80 km × 80 km and divided into80
×
80 grids with the same width and length R
s = 1 km. Ten stochastic moving targets are distributed in the task area. Three UAVs take off from one base and enter the bottom edge of the search area after a short time. Assume that the speed of UAV is 30~50 m/s, the speed of moving target is 3~5 m/s, and the turning angle constraints of UAV and target are -
45
°~45
° and -
180
°~180
°, respectively. The simulation results are shown in Figures 6 and 7.Figure 7
The search trajectory plot of three UAVs based on DMPC.
(a)
250 steps
(b)
500 steps
(c)
750 steps
(d)
1000 stepsBecause the process of UAV searching is dynamic, different steps are selected to describe searching behavior of UAV and the coverage of environment area. In Figure7, the thin line denotes the search trajectory of UAV and the rectangle denotes the moving trajectory of target. As is shown in Figure 7(a), UAVs can detect some targets at the beginning. With the simulation ongoing, UAVs can continually access individual cells, know about the task area, and confirm whether the target exists. From Figure 7(d), three UAVs have already covered most of the task area and detected more targets than that in Figure 7(a). Figure 8 shows the potential difference variation of pheromone. There are no overlaps of trajectory between the UAVs and no resources to be wasted. The proposed method can avoid collisions and ensure better cooperation between UAVs. All the results above have verified the effectiveness and feasibility of the proposed method.Figure 8
Comparison curves of the proposed method with other methods on the average numbers of finding target.To further verify the effectiveness of the proposed method in this paper, it is compared with cooperative search method with nonprediction, scanning beam method, and greedy search method, respectively. There are two aspects of comparison, namely, average numbers of finding targets and average coverage ratio for the task area. Because the initial positions of UAV and moving targets, along with the initialization of area environment, are stochastic in the simulation, twenty simulations are performed, where the length of simulation step is set at 1000. The simulation results are shown in Figures8 and 9, respectively.Figure 9
Comparison curves of the proposed method with other methods on the average coverage ratio.According to Figure8, the average numbers of finding targets for four methods are almost the same at beginning. But, with the increasing simulation steps, it can be found that the proposed method in this paper can effectively find more moving targets in the task area than the other three methods. That has verified the effectiveness of the proposed method on the number of finding targets. From Figure 9, it can be seen that the final average coverage ratio of the proposed method is 44.5%, better than greedy search method and nonprediction cooperation method and a little inferior to scanning beam search method.


## 6. Conclusions

As a result of the restriction of the single UAV platform, it might not detect and find moving targets in the complex environment and is even destroyed by enemy units, causing the failure of the entire search and reconnaissance mission. So a distributed cooperative search decision-making method of Multi-UAV based on the moving prediction of targets is proposed in this paper. In this method, detection information of onboard sensors is used to update target existing probability based on Bayesian theory. A Gaussian distribution of target transition probability density function is introduced to calculate prediction probability of moving target existence, and then target probability map can be further updated in real-time. We will build the performance function of cooperative search and adopt receding horizon optimization method to solve and find the maximum control sequence in which searching performance function is to maximize and lead each UAV to effectively search in the task area. The simulation result shows that the proposed method can reduce the uncertainty and blindness in the process of UAV searching through introducing moving prediction of target and improve the entire searching performance of UAV and observes the flight trajectory of Multi-UAV in real-time.Future research may focus on the design of cognitive information map (CIM) and solving the optimization solution of distributed cooperative search and control. The more reasonable CIM will be designed to obtain more information, including environment, obstacles, threat, and targets. Searching and capturing intelligent evasion targets is also an important problem to be further researched.



---

*Source: 317953-2015-06-17.xml*