# US 2025/0224735 A1 · Methods and systems for controlling multi-uav cooperative tracking of ground-moving targets

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0224735 A1
- Document ID: US20250224735A1
- Status: Published application
- Kind: A1
- Application number: 19/004,353
- Filed: 2024-12-29
- Published: 2025-07-10
- Earliest claimed: 2023-12-29
- Assignees: Zhongyuan University of Technology
- Applicants: Zhongyuan University of Technology
- Inventors: Xuzhao CHAI; Yongheng ZHAO; Sanqiang GAO; Baihao QIAO; Hui YANG; Li YAN; Boyang QU; Ping LIU; Bangsheng FU
- Web page: https://patentgrep.com/patent/US20250224735A1

## CPC

- G05D 1/2465: {using a 3D model of the environment}
- G05D 1/644: Optimisation of travel parameters, e.g. of energy consumption, journey time or distance
- G05D 1/246: using environment maps, e.g. simultaneous localisation and mapping [SLAM]
- G05D 1/43: Control of position or course in two dimensions [2D]
- G05D 1/622: Obstacle avoidance (predicting or avoiding probable or impending collision of road vehicles B60W30/08)
- G05D 1/686: Maintaining a relative position with respect to moving targets, e.g. following animals or humans (for pointing payloads towards targets G05D1/689; involving controlling the position or course of two or more vehicles G05D1/69)
- G05D 1/689: Pointing payloads towards fixed or moving targets (positioning towed, pushed or suspended implements G05D1/672)
- G05D 1/69: Coordinated control of the position or course of two or more vehicles
- G05D 1/6987: {by centralised control off-board any of the vehicles}
- G05D 2101/10: using artificial intelligence [AI] techniques
- G05D 2101/15: using machine learning, e.g. neural networks
- G05D 2105/85: for patrolling or reconnaissance for police, security or military applications
- G05D 2107/13: Spaces reserved for vehicle traffic, e.g. roads, regulated airspace or regulated waters
- G05D 2107/17: Spaces with priority for humans, e.g. populated areas, pedestrian ways, parks or beaches
- G05D 2109/20: Aircraft, e.g. drones
- G05D 2111/32: {transmitted via communication networks, e.g. cellular networks or wireless local area networks [WLAN]}
- Y02T 10/40: Engine management systems
- G05D: SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- Y02T: CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION

## Abstract

Disclosed herein are a system and a method for controlling multi-UAV cooperative tracking of a ground-moving target. The system includes UAVs, a processor, and a storage device. The UAVs are wirelessly communicatively connected to the processor. The processor is configured to generate a UAV command transmitted to the UAVs. The UAVs are configured to transmit tracking data to the processor. The processor includes a terrain building module, a flight simulation module, a UAV parameter generation module, a flight trajectory prediction module, a flight trajectory determination module, and a flight trajectory control module. The system provided in the embodiments of the present disclosure integrates Model Predictive Control (MPC) with an Improved Whale Optimization Algorithm (IWOA) to enhance the algorithm's convergence speed and precision, thereby improving the accuracy and stability of target tracking.

## Claims

### Claim 1

A system for controlling multi-UAV cooperative tracking of a ground-moving target, comprising unmanned aerial vehicles (UAVs), a processor, and a storage device; wherein the UAVs are wirelessly communicatively connected to the processor, the processor is configured to generate a UAV command transmitted to the UAVs, the UAVs are configured to transmit tracking data to the processor, and the processor includes:
a terrain building module configured to:
control the UAVs to fly in a flight area based on a flight environment and the flight area in which the UAVs are flying, collect coordinate information in the flight area, and generate a three-dimensional (3D) coordinate map;
generate obstacle information based on an area occupied by a building of a building complex, a height of the building, a central position of the building on the ground, a central position area, and a count of buildings of the building complex;
a flight simulation module configured to:
generate a first dynamic model based on a horizontal position coordinate, a first velocity, a first heading angle, and a first angular velocity of the ground-moving target, and store the first dynamic model in the storage device, the first dynamic model being configured to characterize a moving characteristic of the ground-moving target;
generate a second dynamic model based on a position coordinate, a second velocity, a second heading angle, and a second angular velocity of each of the UAVs, and store the second dynamic model in the storage device, the second dynamic model being configured to characterize a moving characteristic of the UAVs;
generate a total cost model for target tracking control based on a horizontal distance model, an obstacle avoidance model, a coverage model, a safety distance model, a communication distance model, and an energy consumption model, and store the total cost model in the storage device;
a UAV parameter generation module configured to:
for each of the UAVs, generate a guidance function for an input control variable of the UVA based on a horizontal distance between the UAV and the ground-moving target, a predicted count of steps of a subsequent trajectory of the UAV, an extreme value of the input control variable of the UAV, an angle between a flight direction of the UAV and a moving direction of the ground-moving target, a maximum distance at which the UAV effectively tracks the ground-moving target, the input control variable including the second velocity and the second angular velocity;
generate an input constraint for the input control variable;
generate a plurality of subsequent control sequences based on the input constraint and the guidance function, while satisfying a performance constraint of each of the UAVs, the performance constraint including at least one of a flight velocity, a turning angle, and a flight altitude of the UAV;
a flight trajectory prediction module configured to:
receive current status information of the UAVs transmitted by the UAVs; and
predict a plurality of subsequent flight trajectories based on the current status information, the second dynamic model, and the plurality of subsequent control sequences;
a flight track determination module configured to:
generate an adaptation value for each of the plurality of subsequent flight trajectories based on the total cost model;
generate an optimal subsequent trajectory for the UAVs based on adaptation values for the plurality of subsequent flight trajectories; and
a flight trajectory control module configured to:
send a flight input sequence corresponding to the optimal subsequent trajectory to a corresponding UAV via a mobile network.

### Claim 2 (depends on 1)

The system of claim 1, wherein the processor is configured to:
S1: designate an urban topography as the flight environment, and construct the 3D coordinate map, the obstacle information, the first dynamic model, the second dynamic model, and the total cost model based on the flight environment and the flight area;
construct the 3D coordinate map by the UAVs in the flight area using an X-axis and a Y-axis of a ground area, and a flight altitude above the ground area as a Z-axis;
determine a threat boundary and the height of the building complex by approximating a threat area as a rectangular area,
the obstacle information is represented as: ξ=∪B=1B=N1ξB, ξB=F(HB, (x, y))∈XB
wherein ξB denotes an area occupied by any one of the building of the building complex, as function of the height HB of the building and the central position (x, y) of the building on the ground, XB denotes the central position area, and N1 denotes the count of the buildings of the building complex;
construct the first dynamic model under an inertial system without considering an influence of external factors on the movement of the UAVs:
{dot over (x)}T=νT sin θT, {dot over (y)}T=νT cos θT, {dot over (θ)}T=ωT
wherein (xT, yT) denotes the horizontal position coordinate of the ground-moving target; and νT, θT, ωT denote the first velocity, the first heading angle, and the first angular velocity, respectively;
assuming the UAVs fly at a fixed altitude between urban buildings, construct the second dynamic model without considering the influence of the external factors on the movement of the UAVs:
{dot over (x)}=νi sin θi, {dot over (y)}i=νi cos θi, żi=0, {dot over (θ)}i=ωi,
wherein xui=(xi, yi, zi) denotes a position coordinate of an ith UAV; νi and θi denote an ith second velocity and an ith second heading angle, respectively; ωi denotes an ith second angular velocity; ri=(νi, ωi) denotes an input control variable of the ith UAV, i=1, 2, . . . , N2, N2 denotes a count of the UAVs;
generate the total cost model based on a weighted algebraic sum of the horizontal distance model, denoted as JD, the obstacle avoidance model, denoted as JOA, the coverage model, denoted as JC, the safety distance model, denoted as JSD, the communication distance model, denoted as JCD, and the energy consumption model, denoted as JEC;
the total cost model is represented by:
f
N
,
G
=
m
1
·
J
D
+
m
2
·
J
OA
+
m
3
·
J
C
+
m
4
·
J
SD
+
m
5
·
J
CD
+
m
6
·
J
EC
wherein m1, m2, m3, m4, m5, and m6 denote first weight coefficients of a horizontal distance cost, an obstacle avoidance cost, a target coverage cost, a safety distance cost, a communication distance cost, and an energy consumption cost, respectively;
S2: set the input constraint and the guidance function for the input control variable based on the models constructed in S1, and generate N3 the subsequent control sequences based on the input constraint and the guidance function, while satisfying the performance constraint of the UAVs;
the performance constraint includes the flight velocity, the turning angle, and the flight altitude of the UAVs; and the input control variable includes the second velocity vi and the second angular velocity ωi,
construct the guidance function using a mathematical model expressed as:
g
M
=
1
(
1
+
e
(
c
⁢
θ
⁢
r
)
)
⁢
(
ub
-
lb
)
+
lb
⁢
if
⁢
d
>
l
,
wherein d denotes the horizontal distance between the UAV and the ground-moving target, M denotes the predicted count of steps of the subsequent trajectory of the UAV, ub and lb denote a maximum value and a minimum value of the input control variable, respectively, θ denote the angle between the flight direction of the UAV and the moving direction of the ground-moving target, and l denotes the a maximum distance at which the UAV effectively track the ground-moving target, determined based on a type of a sensor of the UAV; c is a constant parameter, and r is a random number in (0, 1);
S3, predict N3 subsequent flight trajectories using the N3 subsequent control sequences obtained S2 based on the current status information and the second dynamic model constructed in S1;
S4, define a population of an improved whale optimization algorithm based on the N3 subsequent control sequences obtained in S3, wherein each subsequent control sequence corresponds to an individual in the population, evaluate each individual in the population based on the total cost model constructed in S1, and determine an evaluation result as the adaptation value;
S5, determine whether a count of iterations in the improved whale optimization algorithm in S4 is equal to a maximum count of iterations; in response to the count of iterations reaching the maximum count of iterations, select an individual with a smallest adaptation value as the optimal subsequent trajectory based on adaptation values of individuals of each generation of the population obtained in S4; in response to the count of iterations not reaching the maximum count of iterations, update each individual using the improved whale optimization algorithm, and select the optimal subsequent trajectory after a set count of optimized generations;
wherein a process of updating each individual using the improved whale optimization algorithm includes:
S51, an initialization phase:
updating vector coefficients A and C, and a parameter a in the whale optimization algorithm,
A
=
2
·
a
·
r
1
-
a
,
C
=
2
·
r
2
,
a
=
2
-
2
·
t
T
max
,
wherein r1 is a random number in (0,1) and a is a number whose value decreases linearly from 2 to 0; r2 is a random number in (0,1); t denotes a current count of iterations, and Tmax denotes the maximum count of iterations;
S52, a searching phase:
if p≤λ, then the whale optimization algorithm enters into the searching phase, wherein p is a random number in (0, 1), λ denotes a set parameter whose value varies with the count of iterations,
λ
=
t
T
max
,
and a classic differential mutation strategy and a random differential mutation strategy are used in the searching phase;
the classic differential mutation strategy is expressed as:
X
1
,
i
(
t
+
1
)
=
X
*
(
t
)
+
F
·
(
X
rand
⁢
1
(
t
)
-
X
rand
⁢
2
(
t
)
)
,
wherein X*(t) denotes an optimal individual in the population before a generation t, which is an optimal predicted input sequence, Xrand1(t) and Xrand2(t) denote two different individuals in the generation t, which are two different predicted input sequences, and F is a scaling factor;
the random differential mutation strategy is expressed as:
X
2
,
i
(
t
+
1
)
=
r
1
·
(
X
*
(
t
)
-
X
i
(
t
)
)
+
r
2
·
(
X
rand
⁢
3
(
t
)
-
X
i
(
t
)
)
,
wherein r1 and r1 are random numbers in (0,1), X*(t) denotes the optimal individual in the population before the generation t, Xrand3(t) denotes an individual in the generation t, which is a random predicted input sequence, and Xi(t) denotes an ith individual in the generation t, which is an ith predicted input sequence;
the above two strategies are selected based on equations as follows:
X
i
(
t
+
1
)
=
{
X
1
,
i
(
t
+
1
)
rand
≤
CR
⁢
or
⁢
j
=
j
rand
j
=
1
,
2
,
…
,
N
X
2
,
i
(
t
+
1
)
otherwise
,
wherein Xi(t+1) denotes an ith individual in a generation (t+1), which is the ith predicted input sequence; jrand is a randomly generated integer between 1 and N, and CR denotes a randomly generated crossover probability between 0 and 1;
S53, an encircling prey phase:
if p<λ, then the whale optimization algorithm enters into the encircling prey phase, and an encircling-and-surrounding prey strategy and a spiral-update prey strategy are used in the encircling prey phase;
the encircling-and-surrounding prey strategy is expressed as:
X
3
,
i
(
t
+
1
)
=
ω
·
X
*
(
t
)
-
A
·
D
,
the spiral-update prey strategy is expressed as:
X
4
,
i
(
t
+
1
)
=
ω
·
X
*
(
t
)
+
D
·
e
bl
·
cos
⁡
(
2
⁢
π
⁢
l
)
,
the above two strategies are selected based on an equation as follows:
X
i
(
t
+
1
)
=
{
X
3
,
i
(
t
+
1
)
q
≤
0.5
X
4
,
i
(
t
+
1
)
q
>
0.5
,
wherein ω denotes a second weight coefficient determined adaptively; D denotes a distance between a current individual and the optimal individual, which is a distance between a current predicted trajectory and a trajectory corresponding to the optimal individual; b denotes a spiral shape parameter, l denotes a cycle parameter, whose value is a random number in (−1,1), and q denotes a probability of randomly selecting a predation mode; X*(t) denotes the optimal individual in the population before the generation t, and Xt(t) denotes the ith individual in the generation t, which is the ith predicted input sequence;
S54, an offspring update phase:
selecting the optimal individual as an offspring individual using an elite selection strategy;
the elite selection strategy is expressed as:
X
i
(
t
+
1
)
=
{
X
i
(
t
)
f
⁡
(
X
l
,
i
(
t
+
1
)
)
>
f
⁡
(
X
i
(
t
)
)
X
i
(
t
+
1
)
else
,
wherein Xi(t) denotes the ith individual in the generation t, which is the ith predicted input sequence, and Xi(t+1) denotes the ith individual in the generation (t+1), which is the ith predicted input sequence; and
S6, transform the optimal subsequent trajectory selected in S5 to the subsequent control sequences corresponding to the UAVs based on the second dynamic model constructed in S1, wherein a first item of each of the subsequent control sequences is a next flight control input of a corresponding UAV; repeat the operations S2 to S6 until obtaining flight input sequences during the entire tracking process of the ground-moving target, and obtain an optimal trajectory for the multi-UAV cooperative tracking of the ground-moving target.

### Claim 3 (depends on 2)

The system of claim 2, wherein the processor is further configured to:
set boundary constraints of the flight area based on the flight environment in S1, and obtain the flight area by the boundary constraints; the boundary constraints including a boundary constraint on directions of the X-axis and the Y-axis in a horizontal plane, and a boundary constraint on a direction of the Z-axis.

### Claim 4 (depends on 2)

The system of claim 2, wherein in S1,
the horizontal distance model is expressed as:
J
D
=
{
∑
j
=
k
k
+
N
4
-
1
⁢
∑
i
=
1
N
2
⁢
l
iT
(
j
)
L
l
iT
<
L
∑
j
=
k
k
+
N
4
-
1
⁢
∑
i
=
1
N
2
⁢
l
iT
(
j
)
l
iT
>
L
,
l
iT
=
(
x
U
i
-
x
T
)
2
-
(
y
U
i
-
y
T
)
2
,
wherein JD denotes the horizontal distance cost between the UAVs and the ground-moving target in a horizontal plane, N4 denotes a predicted count of steps of the movement of the UAV, N2 denotes the count of the UAVs, liT denotes a horizontal distance between the ith UAV and the ground-moving target, L is a constant;
the obstacle avoidance model is represented as:
J
oA
=
∑
j
=
k
k
+
N
4
-
1
⁢
∑
i
=
1
N
U
⁢
g
i
(
j
)
,
g
i
=
{
0
p
c
(
h
nfz
-
z
U
i
)
<
0
∞
p
c
(
h
nfz
-
z
U
i
)
>
0
,
wherein JOA denotes the obstacle avoidance cost between the UAVs and an obstacle, gi denotes a penalty function for the collision of the UAVs with a building of the building complex, hnfz denotes a height of the obstacle, zUi denotes a flight altitude of the ith UAV; pc denotes a probability of collision between the UAVs and the building in a horizontal direction, if the UAVs collide with a boundary of the building, pc=1, if the UAVs do not collide with the boundary of the building, pc=0;
the coverage model is expressed as:
J
C
=
{
∑
j
=
k
k
+
N
4
-
1
⁢
∑
i
=
1
N
U
⁢
P
i
⁢
P
T
(
j
)
∃
i
❘
P
i
>
p
⁢
and
⁢
P
T
=
1
0
else
,
P
i
=
ρ
*
exp
⁡
(
-
c
⁡
(
(
x
U
i
-
x
T
)
2
+
(
y
U
i
-
y
T
)
2
+
(
z
U
i
-
z
T
)
2
)
)
,
P
T
=
{
0
⁢
the
⁢
UAV
⁢
having
⁢
an
obstructed
⁢
line
-
of
-
sight
⁢
to
⁢
the
⁢
ground
-
moving
⁢
target
1
⁢
the
⁢
UAV
⁢
having
⁢
an
unobstructed
⁢
line
-
of
-
sight
⁢
to
⁢
the
⁢
ground
-
moving
⁢
target
,
wherein JC denotes the target coverage cost of the UAVs' target tracking, Pi denotes a probability that the ground-moving target is detected by the ith UAV, p denotes a probability that the UAVs detect the ground-moving target, PT denotes a probability of a line-of-sight between the UAVs and the ground-moving target being obstructed, (xT, yT, zT) denotes a position coordinate of the ground-moving target;
the safety distance model is expressed as:
J
SD
=
∑
j
=
k
k
+
N
4
-
1
⁢
∑
i
=
1
N
U
⁢
f
SDi
(
j
)
,
f
SDi
=
1
2
[
1
-
tanh
⁡
(
d
ij
-
d
min
-
Δ
⁢
d
2
Δ
⁢
d
8
)
]
,
where JSD denotes the safety distance cost between the UAVs, dij denotes a distance between the ith UAV and a jth UAV, dmin denotes a minimum safe distance between the UAVs, and Δd denotes a buffer distance of the UAVs;
the communication distance model is expressed as:
J
CD
=
∑
j
=
k
k
+
N
4
-
1
⁢
∑
i
=
1
N
U
⁢
f
CDi
(
j
)
,
f
CDi
=
1
2
[
1
+
tanh
⁡
(
d
ij
-
d
max
+
Δ
⁢
d
2
Δ
⁢
d
8
)
]
,
wherein JCD denotes the communication distance cost between the UAVs, dij denotes the distance between the ith UAV and the jth UAV, dmax denotes a maximum communication distance between the UAVs, and Δd denotes the buffer distance of the UAVs; and
the energy consumption model is expressed as:
J
EC
=
∑
j
=
k
k
+
N
4
-
1
⁢
∑
i
=
1
N
U
⁢

v
i
(
j
)
-
v
i
(
j
-
1
)

v
max
-
v
min
+

ω
i
(
j
)
-
ω
i
(
j
-
1
)

ω
max
-
ω
min
,
wherein JEC denotes the energy consumption cost of the UAVs' target tracking, ωi and νi are the input control variables of the UAVs, νmax denotes a maximum velocity of the UAVs, νmin denotes a minimum velocity of the UAVs, ωmax denotes a maximum angular velocity of the UAVs, and ωmin denotes a minimum angular velocity of the UAVs.

### Claim 5 (depends on 2)

The system of claim 2, wherein in the operations S2˜S4, N subsequent control sequences are represented as:
(
v
1
,
i
,
ω
1
,
i
)
,
(
v
1
,
i
+
1
,
ω
1
,
i
+
1
)
,
(
v
1
,
i
+
2
,
ω
1
,
i
+
2
)
,
…
,
(
v
1
,
i
+
M
,
ω
1
,
i
+
M
)
,
(
v
2
,
i
,
ω
2
,
i
)
,
(
v
2
,
i
+
1
,
ω
2
,
i
+
1
)
,
(
v
2
,
i
+
2
,
ω
2
,
i
+
2
)
,
…
,
(
v
2
,
i
+
M
,
ω
2
,
i
+
M
)
,
(
v
3
,
i
,
ω
3
,
i
)
,
(
v
2
,
i
+
1
,
ω
2
,
i
+
1
)
,
(
v
3
,
i
+
2
,
ω
3
,
i
+
2
)
,
…
,
(
v
3
,
i
+
M
,
ω
3
,
i
+
M
)
,
…
⁢
(
v
N
,
i
,
ω
N
,
i
)
,
(
v
N
,
i
+
1
,
ω
N
,
i
+
1
)
,
(
v
N
,
i
+
2
,
ω
N
,
i
+
2
)
,
…
,
(
v
N
,
i
+
M
,
ω
N
,
i
+
M
)
;
N predicted subsequent flight trajectories are represented as:
(
x
1
,
i
,
y
1
,
i
,
z
1
,
i
,
φ
1
,
i
)
,
(
x
1
,
i
+
1
,
y
1
,
i
+
1
,
z
1
,
i
+
1
,
φ
1
,
i
+
1
)
,
(
x
1
,
i
+
2
,
y
1
,
i
+
2
,
z
1
,
i
+
2
,
φ
1
,
i
+
2
)
,
…
,
(
x
1
,
i
+
M
,
y
1
,
i
+
M
,
z
1
,
i
+
M
,
φ
1
,
i
+
M
)
,
(
x
2
,
i
,
y
2
,
i
,
z
2
,
i
,
φ
2
,
i
)
,
(
x
2
,
i
+
1
,
y
2
,
i
+
1
,
z
2
,
i
+
1
,
φ
2
,
i
+
1
)
,
(
x
2
,
i
+
2
,
y
2
,
i
+
2
,
z
2
,
i
+
2
,
φ
2
,
i
+
2
)
,
…
,
(
x
2
,
i
+
M
,
y
2
,
i
+
M
,
z
2
,
i
+
M
,
φ
2
,
i
+
M
)
,
(
x
3
,
i
,
y
3
,
i
,
z
3
,
i
,
φ
3
,
i
)
,
(
x
3
,
i
+
1
,
y
3
,
i
+
1
,
z
3
,
i
+
1
,
φ
3
,
i
+
1
)
,
(
x
3
,
i
+
2
,
y
3
,
i
+
2
,
z
3
,
i
+
2
,
φ
3
,
i
+
2
)
,
…
,
(
x
3
,
i
+
M
,
y
3
,
i
+
M
,
z
3
,
i
+
M
,
φ
3
,
i
+
M
)
,
…
⁢
(
x
N
,
i
,
y
N
,
i
,
z
N
,
i
,
φ
N
,
i
)
,
(
x
N
,
i
+
1
,
y
N
,
i
+
1
,
z
N
,
i
+
1
,
φ
N
,
i
+
1
)
,
(
x
N
,
i
+
2
,
y
N
,
i
+
2
,
z
N
,
i
+
2
,
φ
N
,
i
+
2
)
,
…
,
(
x
N
,
i
+
M
,
y
N
,
i
+
M
,
z
N
,
i
+
M
,
φ
N
,
i
+
M
)
;
and
adaptation values for the N subsequent flight trajectories are represented as:
f
1
,
1
,
f
2
,
1
,
f
3
,
1
,
…
,
f
N
,
1
,
f
1
,
2
,
f
2
,
2
,
f
3
,
2
,
…
,
f
N
,
2
,
f
1
,
3
,
f
2
,
3
,
f
3
,
3
,
…
,
f
N
,
3
,
…
⁢
f
1
,
t
,
f
2
,
t
,
f
3
,
t
,
…
,
f
N
,
t
;
wherein, fN,t denotes the adaptation values for the subsequent flight trajectories, N denotes a number of a predicted trajectory, N∈[1, N3]; t denotes the current count of iterations, t∈[1, Tmax], and Tmax denotes the maximum count of iterations.

### Claim 6 (depends on 2)

The system of claim 2, wherein in S53, the second weight coefficient ω is expressed as:
ω
=
1
-
e
t
T
max
-
1
e
-
1
.

### Claim 7 (depends on 1)

The system of claim 1, wherein the processor is further configured to:
obtain historical tracking data transmitted by the UAVs to the processor; and
dynamically adjust the first weight coefficient of each cost based on a change of the historical tracking data.

### Claim 8 (depends on 1)

The system of claim 1, wherein the processor is further configured to:
in response to a UAV of the UAVs identifying the ground-moving target and the UAV having an unobstructed line-of-sight to the ground-moving target, determine the UAV as a target UAV and obtain tracking data of an associated UAV corresponding to the target UAV;
adjust the optimal subsequent trajectory of the associated UAV tracking the ground-moving target based on the tracking data of the associated UAV;
update the flight input sequence for the associated UAV based on an adjustment result;
generate the UAV command based on an updated flight input sequence; and
send the UAV command to the associated UAV, such that the associated UAV flies in accordance with the updated flight input sequence.

### Claim 9 (depends on 8)

The system of claim 8, wherein the processor is further configured to:
in response to the target UAV being unable to identify the ground-moving target for a subsequent preset period after the target UAV initially identifies the ground-moving target, determine that the target UAV has an obstructed line-of-sight to the ground-moving target.

### Claim 10 (depends on 8)

The system of claim 8, wherein the processor is further configured to:
generate a plurality of candidate adjusted trajectories;
for a candidate adjusted trajectory, determine a predicted energy consumption amount of the associated UAV using a UAV energy consumption model based on an initial optimal subsequent trajectory of the associated UAV, the candidate adjusted trajectory, wind force and direction data, flight altitude data of the associated UAV, and a current energy level of the associated UAV, the UAV energy consumption model being a neural network model; and
adjust the optimal subsequent trajectory of the associated UAV tracking the ground-moving target based on predicted energy consumption amounts of the plurality of candidate adjusted trajectories.

### Claim 11 (depends on 8)

The system of claim 8, wherein the processor is further configured to:
obtain a plurality of training samples and labels, each of the training samples including a sample initial optimal subsequent trajectory of a sample UAV, a sample candidate adjusted track, sample wind force and direction data, sample flight altitude data of the sample UAV, and a sample current energy level of the sample UAV, the label of a training sample including a sample predicted energy consumption amount of the sample UAV corresponding to the training sample;
set a plurality of training sets and a learning rate corresponding to each of the plurality of training sets based on at least one of the sample current energy level and a trajectory complexity of sample UAVs;
train an initial UAV energy consumption model based on the learning rate of the plurality of training sets, the plurality of training samples, and labels; and
acquire the UAV energy consumption model until a trained UAV energy consumption model satisfies a first predetermined condition.

### Claim 12 (depends on 1)

The system of claim 1, wherein the processor is further configured to:
perform iterations based on an initial selection probability;
in response to a count of the iterations reaching a predetermined count, determine, for each set of individuals generated during all iterations, a first count of instances in which an optimal individual is generated from the encircling-and-surrounding prey strategy and a second count of instances in which the optimal individual is generated from the spiral-update prey strategy;
determine a magnitude of change between a tracking result of the UVAs flying according to a current optimal subsequent trajectory and a tracking result of the UVAs flying according to a previous optimal subsequent trajectory; and
adjust a probability of randomly selecting a predation mode based on the magnitude of change, the first count, and the second count.

### Claim 13 (depends on 6)

The system of claim 6, wherein the processor is further configured to:
determine a predicted remaining energy level based on a current energy level and a predicted energy consumption amount; and
adjust the second weight coefficient based on the predicted remaining energy level.

### Claim 14

A method for controlling multi-UAV cooperative tracking of a ground-moving target, the method comprising:
controlling UAVs to fly in a flight area based on a flight environment and the flight area in which the UAVs are flying, collecting coordinate information in the flight area, and generating a three-dimensional (3D) coordinate map;
generating obstacle information based on an area occupied by a building of a building complex, a height of the building, a central position of the building on the ground, a central position area, and a count of buildings of the building complex;
generating a first dynamic model based on a horizontal position coordinate, a first velocity, a first heading angle, and a first angular velocity of the ground-moving target, and storing the first dynamic model in the storage device, the first dynamic model being configured to characterize a moving characteristic of the ground-moving target;
generating a second dynamic model based on a position coordinate, a second velocity, a second heading angle, and a second angular velocity of each of the UAVs, and storing the second dynamic model in the storage device, the second dynamic model being configured to characterize a moving characteristic of the UAVs;
generating a total cost model for target tracking control based on a horizontal distance model, an obstacle avoidance model, a coverage model, a safety distance model, a communication distance model, and an energy consumption model, and storing the total cost model in the storage device;
for each of the UAVs, generating a guidance function for an input control variable of the UVA based on a horizontal distance between the UAV and the ground-moving target, a predicted count of steps of a subsequent trajectory of the UAV, an extreme value of the input control variable of the UAV, an angle between a flight direction of the UAV and a moving direction of the ground-moving target, a maximum distance at which the UAV effectively tracks the ground-moving target, the input control variable including the second velocity and the second angular velocity;
generating an input constraint for the input control variable;
generating a plurality of subsequent control sequences based on the input constraint and the guidance function, while satisfying a performance constraint of each of the UAVs, the performance constraint including at least one of a flight velocity, a turning angle, and a flight altitude of the UAV;
receiving current status information of the UAVs transmitted by the UAVs;
predicting a plurality of subsequent flight trajectories based on the current status information, the second dynamic model, and the plurality of subsequent control sequences;
generating an adaptation value for each of the plurality of subsequent flight trajectories based on the total cost model;
generating an optimal subsequent trajectory for the UAVs based on adaptation values for the plurality of subsequent flight trajectories; and
sending a flight input sequence corresponding to the optimal subsequent trajectory to a corresponding UAV via a mobile network.
