Next Article in Journal
Adaptive Deeping Siamese Residual Network: A Novel Model for Few-Shot Bearing Fault Diagnosis
Previous Article in Journal
Drilling Parameter Control Based on Online Identification of Drillability and Multi-Objective Optimization
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Event-Driven Prescribed-Time Tracking Control for Multiple UAVs with Flight State Constraints

1
Air Traffic Control and Navigation College, Air Force Engineering University, Xi’an 710051, China
2
China Airport Planning & Design Institute Co., Ltd., Northwest Branch, Xi’an 710075, China
3
School of Mathematics and Statistics, Xidian University, Xi’an 710126, China
4
Air Traffic Control and Navigation College, The Naval Aviation University, Yantai 264001, China
*
Author to whom correspondence should be addressed.
Machines 2025, 13(3), 192; https://doi.org/10.3390/machines13030192
Submission received: 28 January 2025 / Revised: 23 February 2025 / Accepted: 26 February 2025 / Published: 27 February 2025
(This article belongs to the Special Issue Intelligent Control Techniques for Unmanned Aerial Vehicles)

Abstract

:
Consensus tracking control for multiple UAVs demonstrates critical theoretical value and application potential, improving system robustness and addressing challenges in complex operational environments. This paper addresses the challenge of event-triggered prescribed-time synchronization tracking control for 6-DOF fixed-wing UAVs with state constraints. We propose a novel prescribed-time command filtered backstepping approach to effectively tackle the issues of complexity explosion and singularities. By utilizing a state-transition function, we manage asymmetric time-varying state constraints, including limitations on speed, roll, yaw, and pitch angles in UAVs. The theoretical analysis demonstrates that all signals in the 6-DOF UAV system remain bounded, with tracking errors converging to the origin within the prescribed time. Finally, simulation results validate the effectiveness of the proposed control strategy.

1. Introduction

With the widespread adoption of unmanned aerial vehicles (UAVs) in both military and civilian sectors, the cooperative control of multiple UAVs has garnered significant attention [1,2,3,4]. UAVs are characterized by their intelligence, lightweight design, and cost effectiveness [5]. Over the past few decades, distributed optimization has been extensively employed in multi-agent systems [6,7]. Researchers design optimal trajectories for multi-agent systems based on distributed optimization methods [8], and demonstrated effectiveness in addressing nonlinear dynamics and non-convex constraints [9].
However, recent practical applications require faster convergence rates and enhanced robustness. To address these demands, finite-time control designs have been proposed [10,11,12,13,14], enabling systems to achieve rapid convergence within a finite time. However, the settling time for finite-time stability is dependent on the system’s initial state, meaning convergence may take longer if the initial state is large. To resolve this, fixed-time control methods have been developed [15,16,17,18], ensuring that the convergence time is independent of the initial state. Despite this improvement, the settling time in fixed-time stabilization remains a complex function influenced by system parameters and cannot be predefined. In many UAV applications, it is critical to prescribe the convergence time in advance. Thus, prescribed-time and predefined-time stability methods were introduced, allowing the settling time to be determined by specific parameters [19,20]. Several predefined-time sliding-mode controllers have been developed to ensure fast response and robust steady-state performance [21,22,23]. To further enhance dynamic performance in the presence of actuator saturation and system uncertainties, a vision-based prescribed performance controller was introduced [24], along with a modified predefined-time control scheme for specialized missions, such as UAV in-air refueling [25]. However, most studies model UAVs with only three degrees of freedom, which does not accurately capture UAV motion compared to the more comprehensive six-degrees-of-freedom model. This makes the design of prescribed-time controllers for 6-DOF UAVs significantly more challenging.
In practical flight, external disturbances [26] and model uncertainties [27] pose challenges to the stability of UAVs. By employing disturbance observers to estimate and counteract these effects while dynamically adjusting controller parameters via online learning mechanisms such as neural networks, adaptive control ensures robust performance compensation for both environmental perturbations and system modeling errors [28,29]. Meanwhile, the effects of aerodynamics and the flight environment must be taken into account, making it essential to impose state constraints on the speed and attitude control of UAVs to ensure safe system operation. Several approaches have been proposed to address this challenge, including reference governors [30], extremum-seeking methods [31], and barrier Lyapunov functions (BLF) [32]. Additionally, a higher-order tan-type BLF was introduced in [33] for UAV systems, resulting in improved tracking performance, while a time-varying BLF was employed in [34] to handle state constraints. In [18], an IBLF-based controller was developed to impose both upper and lower positive constraints on non-negative states. Moreover, a nonlinear function was proposed in [35] to transform constrained systems into unconstrained ones. Despite these advances, few studies have simultaneously addressed state constraints in both the speed and attitude subsystems, particularly in 6-DOF UAV systems.
In recent years, event-triggered control (ETC) has been developed to conserve communication and computational resources [36,37]. For instance, an event-triggered super-twisting algorithm for UAVs facing external disturbances was proposed in [38], effectively reducing computational costs while maintaining system performance. Similarly, Ref. [39] designed an adaptive event-triggered mechanism for quadrotor UAVs, achieving practical finite-time stability. In [40], a novel event-based dynamic sliding-mode surface was introduced to ensure robust stabilization of multi-quadrotor systems under unknown perturbations. However, most existing ETC methods primarily focus on attitude systems and finite-time stability [40,41,42]. Thus, further research is needed to develop a novel prescribed-time-based event-triggered control scheme for UAV systems.
Motivated by the discussions above, the main contributions of this paper are outlined as follows:
  • Unlike existing works [24,25,43], this paper designs an event-triggered prescribed-time backstepping control for 6-DOF UAV systems. The stability proof of the closed-loop system under the proposed method is proved by Lyapunov-based technology.
  • By proposing a novel prescribed-time command-filtered backstepping, the “explosion of complexity” problem is effectively addressing while ensuring prescribed-time stability and a fast response.
  • In contrast to the works [18,33,34,35] that utilize barrier Lyapunov functions to tackle state-constrained problems, this paper addresses the issue of asymmetric time-varying state constraints by employing a state-transition function. This approach effectively eliminates the need for feasibility conditions on the virtual controller.
The rest of this paper is organized as follows:
In Section 2, we present the preliminaries and problem formulation. The prescribed-time event-triggered control design and stability analysis are developed in Section 3. Section 4 provides the simulation results, while Section 5 concludes the paper.

2. Preliminaries and Problem Formulation

2.1. Notations

R n × n denotes real m × n matrices, | · | denotes the absolute value, and · represents the Euclidean 2-norm of a vector or matrix. λ m i n ( A ) is the minimum eigenvalues of the matrix A, S ( · ) is skew-symmetric matrix, and ( · ) is the signum function; for b = [ b 1 , b 2 , b 3 ] T , define sig a b = [ sign ( b 1 ) | b 1 | a , sign ( b 2 ) | b 2 | a ,   sign ( b 3 ) | b 3 | a ] T , where a is a constant.

2.2. UAV Dynamics Model

A fixed-wing UAV system is assumed to have N UAVs. The connections among UAVs are described as an undirected graph G = ( V , E , A ) with V = { v 1 , v n } being the set of nodes, and E = { ( i , j ) , i , j V , and i j } being the edges. A = [ a i j ] R n × n denotes the weighted adjacency matrix of G , where a i j > 0 if the node j is node i’s neighbor, and zero otherwise. Meanwhile, we suppose a i i = 0 . The Laplacian matrix is defined by L = D A , where D = diag { d 1 , d n } with d i = j = 1 n a i j . When there exists a path from every node to every other node, G is connected.
Consider a group of N fixed-wing UAVs. The dynamics model of ith UAV is described as [43,44].
p ˙ i = R 1 φ i v i v ˙ i = S ω i v i + R 1 T φ i g + T i + F i m i + d v i φ ˙ i = R 2 1 φ i ω i J i ω ˙ i = ω i × J i ω i + N i + C i δ i + J i d ω i ,
where p i = [ x i , y i , z i ] T and φ i = [ ϕ i , θ i , ψ i ] T represent the inertial position and attitude angle, v i = [ α i , ϱ i , o i ] T and ω i = [ l i , q i , j i ] T denote the linear speed and angular velocity, T i = [ T X i , 0 , 0 ] T represents thrust vector, and δ i = [ δ e i , δ a i , δ r i ] T represents control surfaces; g = [ 0 , 0 , g ] T is the gravity acceleration. d v i and d ω i are external disturbances. R 1 ( φ i ) is the rotation matrix transforming the body frame coordinates to inertial axis coordinates, and R 2 ( φ i ) is the time derivative of attitude angles.
R 1 φ i = c ψ i c θ i s ψ i s ϕ i + c ψ i s θ i s ϕ i s ψ i s ϕ i + c ψ i s θ i c ϕ i s ψ i c θ i c ψ i c ϕ i + s ψ i s θ i s ϕ i c ψ i s ϕ i + s ψ i s θ i c ϕ i s θ i c θ i s ϕ i c θ i c ϕ i
R 2 φ i = 1 0 s ψ i 0 c ψ i s ψ i c θ i 0 s θ i c ψ i c θ i ,
where c and s are the abbreviation of sin and cos, respectively. J is the inertia tensor and C i is the control matrix, which are given as
J = J x i 0 J x z i 0 J y i 0 J z x i 0 J z i
C i = 1 2 ρ V i 2 S i b i c l δ a i 0 b i c l δ r i 0 c ¯ i c m δ e i 0 b i c n δ a i 0 b i c n δ r i ,
where ρ is the air density, S i is the wing surface area, b i is the wingspan, c ¯ i is the mean aerodynamic chord, and c l δ a i , c l δ r i , c m δ e i , c n δ a i and c n δ r i are the coefficients.
The aerodynamic force vector F i is calculated as
F i = 1 2 ρ V i 2 S i R 3 1 α i , β i C D i C Y i C L i ,
where α i = arctan ( o 1 / α i ) and β i = arctan ( α i / ϱ i ) , C D i , C Y i , and C L i are the coefficients. The matrix R 3 α i , β i is
R 3 α i , β i = c α i c β i s β i s α i c β i c α i s β i c β i s α i s β i s α i 0 c α i .
Additionally, the aerodynamic moment vector N i is calculated as
N i = 1 2 ρ V i 2 S i b i C l i c ¯ i C M i b i C n i ,
where C l i , C M i and C n i are coefficients, of which the details are introduced in [43].

2.2.1. Velocity Subsystem

Based on (1), the velocity can be differentiated as
V ˙ i = α i T x i m i V i + v i T V i ( R 1 T g + F i 0 m i ) + v i T V i ( Δ v i + d v i ) ,
where Δ v i = Δ F i m i represents the modeling uncertainties in the velocity subsystem.

2.2.2. Attitude Subsystem

φ ˙ i = R 2 1 φ i ω i ω ˙ i = J i 0 1 S J i 0 ω i + J i 0 1 N i 0 + J i 0 1 C i 0 δ i + Δ ω i + d ω i ,
where Δ ω i = Δ J i 1 S ( J i ω i ) + Δ J i 1 N i + Δ J i 1 C i δ i represents the lumped uncertainties induced by modeling uncertainties in the attitude subsystem.
Assumption 1.
The speed reference signal is restricted to V l i ( t ) < V x i < V u i ( t ) . The attitude reference signal is restricted to φ l i ( t ) < φ i < φ u i ( t ) . V l i ( t ) , V u i ( t ) , φ l i ( t ) , and φ u i ( t ) are time-varying smooth and positive functions.
Assumption 2.
The external disturbance d v i and d ω i are bounded.
Assumption 3.
There exists a positive constant q 0 such that λ min J i 0 1 C i 0   D φ J i 0 1 C i 0 T   q 0 .

2.3. State Transition

In order to transform the constrained system into the nonconstrained system, a nonlinear function is introduced that maps the system state from space Ω x to space Ω Φ .
Φ ( x ( t ) ) = x ( t ) ( m 1 ( t ) + x ( t ) ) ( m 2 ( t ) x ( t ) ) .
Taking the derivative of (11), it has
Φ ˙ ( x ( t ) ) = p x ˙ ( t ) + q ,
where x ( t ) is a constrained system, Φ ( x ( t ) ) is a nonconstrained system, m 1 ( t ) and m 2 ( t ) are positive time-varying functions, p = m 1 m 2 + x 2 ( m 1 + x ) 2 ( m 2 x ) 2 , q = [ m ˙ 1 m 2 + m 1 m ˙ 2 + ( m ˙ 2 m ˙ 1 ) x ] x ( m 1 + x ) 2 ( m 2 x ) 2 .
According to (12), if m 1 ( t ) < x ( t ) < m 2 ( t ) , Φ ( x ( t ) ) is monotonically increasing. For any initial condition x ( 0 ) , if m 1 ( 0 ) < x ( 0 ) < m 2 ( 0 ) , then m 1 ( t ) < x ( t ) < m 2 ( t ) always holds. By using (11), the constrained system can be transformed into nonconstrained system.

2.4. Control Objective

This study aims to design an event-triggered tracking controller that ensures the consistent tracking of both velocity and attitude within a prescribed time, all while adhering to specified velocity and attitude constraints.
To design the prescribed-time event-triggered controller, several lemmas are introduced.
Lemma 1
([45]). Consider a nonlinear system
x ˙ ( t ) = f ( x ( t ) ) , x 0 = x ( 0 ) ,
suppose that there exists a radially unbounded Lyapunov function V ( x ) such that
V ˙ ( x ) π μ T c κ 1 κ 2 ( κ 1 V 1 μ 2 ( x ) + κ 2 V 1 + μ 2 ( x ) ) + ϖ ,
where κ 1 > 0 , κ 2 > 0 , T c > 0 , 0 < μ < 1 , 0 < ϖ < + ; then, the nonlinear system is practically predefined-time stable, and the residual set of the solutions of system (13) can be given by
V ( x ) min ϖ μ T c κ 1 κ 2 π κ 1 ( 1 θ ) 2 2 μ , ϖ μ T c κ 1 κ 2 π κ 2 ( 1 θ ) 2 2 + μ ,
where θ ( 0 , 1 ) , the settling time is given by T p c = T c θ .
Lemma 2
([46]). For x i R , i N , then
i = 1 n x i b i = 1 n x i b n 1 b i = 1 n x i b ,
if b 1 , then
i = 1 n x i b n 1 b i = 1 n x i b .
Lemma 3
([47]). For x R , y R , c 1 , c 2 , c 3 are positive constants; then,
x c 1 y c 2 c 1 c 1 + c 2 c 3 x c 1 + c 2 + c 2 c 1 + c 2 c 3 c 1 c 2 y c 1 + c 2 .
Lemma 4
([48]). For y R , ς R , and ς > 0 , then
0 y y tanh y ς 0.2785 ς .
Lemma 5
([49]). For x R , ι R , and ι > 0 , then
0 x x 2 x 2 + ι ι .
Lemma 6
([50]). For x , y R , y x , and positive b > 0 , then
y x y b b 1 + b x 1 + b y 1 + b .
Lemma 7
([51]). For the nonlinear function Δ Θ : N within a given compact set Ω Θ N , there exist the radial-basis-function neural networks such that
Δ Θ = W * T h Θ + g Θ .
where W * = W ¯ 1 , W ¯ 2 , , W ¯ n T denotes the idealized weight matrix, g Θ is the bounded approximation error, and h Θ = h ¯ 1 Θ , h ¯ 2 Θ , , h ¯ n Θ T is the basis function vector.

3. Prescribed-Time Control Design

3.1. Error Transformations Based on State Transition

3.1.1. Velocity Subsystem

Define the velocity-tracking error
e v i = β 1 i V i V d + β 2 i j N i a i j V i V j ,
where β 1 i , β 2 i are positive design parameters.
According to (11), the tracking error e v i is transformed into
Φ v i = e v i V l i + e v i V u i e v i .
Taking the derivative of (24), it has
Φ ˙ v i = p v i e ˙ v i + q v i
p v i = V l i V u i + e v i 2 ( V l i + e v i ) 2 ( V u i e v i ) 2
q v i = V ˙ l i V u i + V l i V ˙ u i + V ˙ u i V ˙ l i e v i e v i ( V l i + e v i ) 2 ( V u i e v i ) 2 .

3.1.2. Attitude Subsystem

Define the attitude-tracking error
e φ i = β 3 i φ i φ d + β 4 i j N i a i j φ i φ j ,
where β 3 i , β 4 i are positive design parameters.
Similarly, we have
Φ ˙ φ i = p φ i e ˙ φ i + q φ i ,
where p φ i = diag ( p φ i ϕ , p φ i θ , p φ i ψ ) , q φ i = [ q φ i ϕ , q φ i θ ,   q φ i ψ ] T .
Remark 1.
Noting that p v i , q v i , p φ i , q φ i are time-varying parameters, which are affected by tracking errors and state constraints. When designing the controller, we only need to guarantee the boundedness of Φ v i and Φ φ i .

3.2. Control Design

3.2.1. Velocity Subsystem

To reduce the communication burden, the event-triggering mechanism is introduced as follows:
T x i t = T x i t h , t [ t h , t h + 1 ) .
t h + 1 = inf t > t h e T i a 1 T x i t a 2 0 ,
where e T i = T x i ( t ) T x i ( t ) is the measurement error, and T x i ( t ) is the control law, which will be defined later. 0 < a 1 < 1 , a 2 > 0 are known positive parameters.
For t [ t h , t h + 1 ) , | e T i | a 1 | T x i ( t ) | a 2 < 0 always holds, then
T x i t = T x i t 1 + a 1 λ 1 a 2 λ 1 1 + a 1 λ 1 ,
where λ 1 is time-varying parameter, and | λ 1 | < 1 .
Remark 2.
Compared with the existing event-triggering conditions established based on relative errors and system states [36,37], event-triggering mechanism (31) adds the parameter a 2 . By setting a 2 to an appropriate positive number, the frequency of event triggering can be reduced and Zeno behavior can be better avoided.
Then, based on (24) and (32), a nonsingular prescribed-time ETC law is developed as:
T x i t = m i V i u 1 i ( 1 + a 1 ) p v i β v i α i
u 1 i = π μ T c k 11 i sig 1 μ Φ v i + k 12 i sig 1 + μ Φ v i + Φ v i p v i 2 β v i 2 v i T v i λ ^ v i h v i T h v i 2 V i 2 tanh Φ v i 2 p v i 2 β v i 2 v i T v i λ ^ v i h v i T h v i 2 V i 2 ς + 1 2 V i 2 Φ v i p v i 2 β v i 2 v i T v i + p v i β v i α i a 2 m i V i 1 a 1 + f v ,
where k 11 i > 0 , k 12 i > 0 , T c > 0 , 0 < μ < 1 , h v i is a basis function vector in radial-basis-function neural networks [51], and f v = p v i β v i v i T V R 1 T g + F i 0 m i p v i β v i V ˙ d p v i β 2 i j N i a i j e ˙ v j + q v i .
The adaptive update law is designed as:
λ ^ ˙ v i = 1 2 V i 2 γ v i Φ v i 2 p v i 2 β v i 2 v i T v i h v i T h v i χ v i λ ^ v i ,
where γ v i , χ v i are positive design parameters.
Theorem 1.
Consider the velocity subsystem (9), the dynamic controller (33), the intermediate control law (34), the parameter adaptation law (35), and the event-triggered mechanism (31). By selecting appropriate parameters, we obtain:
(1) All signals remain bounded, and the tracking error converges to the origin within the prescribed time, even in the presence of state constraints and external disturbances.
(2) The prescribed-time is given by T p c = T c θ , where θ ( 0 , 1 ) .
(3) The communication and computational burden for the speed subsystem is alleviated, and the Zeno phenomenon does not occur.
Proof. 
From (23), its time derivative is
e ˙ v i = β 1 i V ˙ i V ˙ d + β 2 i j N i a i j V ˙ i V ˙ j = β 1 i + β 2 i j N i a i j V ˙ i V ˙ d β 2 i j N i a i j V ˙ j V ˙ d = β v i ( V ˙ i V ˙ d ) β 2 i j N i a i j e ˙ v j ,
where β v i = β 1 i + β 2 i j N i a i j , e v j = V j V d .□
Substituting (9) and (36) into (25) gives
Φ ˙ v i = p v i β v i α i T x i m i V i + v i T V i R 1 T g + F i 0 m i + v i T V i ( Δ v i + d v i ) p v i β v i V ˙ d p v i β 2 i j N i a i j e ˙ v j + q v i .
Noting (32), the (37) can be further rewritten as
Φ ˙ v i = p v i β v i α i T x i m i V i ( 1 + a 1 λ 1 ) + p v i β v i v i T V i ( Δ v i + d v i ) + p v i β v i α i σ v m i V i + f v ,
where f v = p v i β v i v i T V i R 1 T g + F i 0 m i p v i β v i V ˙ d + q v i p v i β 2 i   · j N i a i j e ˙ v j , σ v = a 2 λ 1 1 + a 1 λ 1 .
According to Lemma 7, using the radial-basis-function neural network to approximate Δ v i , Δ v i = [ Δ v i 1 , Δ v i 2 , Δ v i 3 ] T .
Δ v i j = W v i j * T h v i j + g v i j ,
where W v i j * T M × 1 is an ideal weight matrix, h v i j M is a basis function vector, g v i j is a bounded approximation error. Define λ v i = max { W v i 1 * T W v i 1 * , W W v i 2 * T W v i 2 * , W v i 3 * T W v i 3 * } .
We choose the Lyapunov function as
L 1 = 1 2 Φ v i 2 + 1 2 γ v i λ ˜ v i 2 ,
where γ v i is a positive design parameter, and λ ˜ v i = λ v i λ ^ v i denotes the estimation error with λ ^ v i .
Taking the time derivative of L 1 and integrating (39), we obtain
L ˙ 1 = Φ v i p v i β v i α i T x i m i V i ( 1 + a 1 λ 1 ) + p v i β v i V i j = 1 3 v i j W v i j * T h v i j + j = 1 3 v i j g v i j + d v i j + p v i β v i α i σ v m i V i + f v + 1 γ v i λ ˜ v i λ ˜ ˙ v i
Since λ 1 t 1 , one has a 2 1 + a 1 σ v a 2 1 a 1 . It holds that p v i β v i α i σ v m i V i p v i β v i α i a 2 m i V i 1 a 1 . According to Assumption 2, there exists g v i j + d v i j l v i j . Using Yang’s inequality, we arrive at
Φ v i p v i β v i v i j W v i j * T h v i j V i Φ v i 2 p v i 2 β v i 2 v i T v i λ v i h i T h i 2 V i 2 + 1 2 ,
Φ v i p v i β v i v i j V i g v i j + d v i j Φ v i 2 p v i 2 β v i 2 v i T v i 2 V i 2 + l v i j 2 2 .
To achieve a prescribed-time convergence of L 1 , we introduce an intermediate control law u 1 i as (34). Noting (42) and (43), it follows from (41) that
L ˙ 1 π μ T c k 11 i Φ v i 2 μ + k 12 i Φ v i 2 + μ + Φ v i p v i β v i α i T x i m i V i ( 1 + a 1 λ 1 ) + Φ v i 2 p v i 2 β v i 2 v i T v i λ v i h i T h i 2 V i 2 + 3 2 + j = 1 3 l v i j 2 2 + Φ v i u 1 i Φ v i 2 p v i 2 β v i 2 v i T v i λ ^ v i h v i T h v i 2 V i 2 tanh Φ v i 2 p v i 2 β v i 2 v i T v i λ ^ v i h v i T h v i 2 V i 2 ς 1 γ v i λ ˜ v i λ ^ ˙ v i .
According to Lemma 4, it holds that
Φ v i 2 p v i 2 β v i 2 v i T v i λ v i h i T h i 2 V i 2 Φ v i 2 p v i 2 β v i 2 v i T v i λ ^ v i h v i T h v i 2 V i 2 tanh Φ v i 2 p v i 2 β v i 2 v i T v i λ ^ v i h v i T h v i 2 V i 2 ς Φ v i 2 p v i 2 β v i 2 v i T v i λ ˜ v i h i T h i 2 V i 2 + 0.2785 ς .
It follows from (44) that
L ˙ 1 π μ T c k 11 i Φ v i 2 μ + k 12 i Φ v i 2 + μ + Φ v i p v i β v i α i T x i m i V i ( 1 + a 1 λ 1 ) 1 γ v i λ ˜ v i λ ^ ˙ v i 1 2 V i 2 γ v i Φ v i 2 p v i 2 β v i 2 v i T v i h v i T h v i + 0.2785 ς + 3 2 + j = 1 3 l v i j 2 2 + Φ v i u 1 i .
It follows from (33) that
Φ v i p v i β v i α i T x i m i V i 1 + a 1 λ 1 = Φ v i u 1 i 1 + a 1 1 + a 1 λ 1 .
Since λ 1 t 1 , following 1 a 1 1 + a 1 λ 1 1 + a 1 , one has Φ v i u 1 i 1 + a 1 1 + a 1 λ 1 Φ v i u 1 i .
Substituting (35) and (47) into (46) gives
L ˙ 1 π μ T c k 11 i Φ v i 2 μ + k 12 i Φ v i 2 + μ + χ v i γ v i λ ˜ v i λ ^ v i + 0.2785 ς + 3 2 + 3 2 l v i 2 .
Using Young’s inequality, one arrives at
χ v i γ v i λ ˜ v i λ ^ v i χ v i 2 γ v i λ v i 2 λ ˜ v i 2 .
Invoking Lemma 3, it follows that
1 2 γ v i λ ˜ v i 2 1 μ 2 1 2 γ v i λ ˜ v i 2 + μ 2 1 μ 2 2 μ 1 .
By substituting (49) and (50) into (48), meanwhile adding and subtracting the term of χ v i 1 2 γ v i λ ˜ v i 2 1 + μ 2 , it follows that
L ˙ 1 π μ T c k 11 i Φ v i 2 μ + k 12 i Φ v i 2 + μ + χ v i 2 γ v i λ v i 2 λ ˜ v i 2 + 0.2785 ς + 3 2 + j = 1 3 l v i j 2 2 π μ T c k 11 i Φ v i 2 μ + k 12 i Φ v i 2 + μ + χ v i 2 γ v i λ v i 2 χ v i 1 2 γ v i λ ˜ v i 2 1 μ 2 + χ v i μ 2 1 μ 2 2 μ 1 + χ v i 1 2 γ v i λ ˜ v i 2 1 + μ 2 χ v i 1 2 γ v i λ ˜ v i 2 1 + μ 2 + 0.2785 ς + 3 2 + j = 1 3 l v i j 2 2 .
According to Assumption 2, λ v i is bounded. Considering the properties of the system in practical flight, we have λ ˜ v i = λ v i λ ^ v i . It derives that χ v i 1 2 γ v i λ ˜ v i 2 1 + μ 2 is bounded. Then, we have
L ˙ 1 π μ T c k 11 i · 2 1 μ 2 · 1 2 Φ v i 2 1 μ 2 + μ T c χ v i π 1 2 γ v i λ ˜ v i 2 1 μ 2 π μ T c k 12 i · 2 1 + μ 2 · 1 2 Φ v i 2 1 + μ 2 + μ T c χ v i π 1 2 γ v i λ ˜ v i 2 1 + μ 2 + ϖ 1 ,
where ϖ 1 = χ v i 1 2 γ v i λ ˜ v i 2 1 + μ 2 + χ v i 2 γ v i λ v i 2 + 0.2785 ς + 3 2 + j = 1 3 l v i j 2 2 + χ v i   · μ 2 1 μ 2 2 μ 1 . Define κ 1 =min { k 11 i · 2 1 μ 2 , μ T c χ v i π } , κ 2 =   min { k 12 i · 2 1 + μ 2 , μ T c χ v i π } . Using Lemma 2, one has
L ˙ 1 π μ T c κ 1 1 2 Φ v i 2 1 μ 2 + κ 1 1 2 γ v i λ ˜ v i 2 1 μ 2 π μ T c κ 2 1 2 Φ v i 2 1 + μ 2 + κ 2 1 2 γ v i λ ˜ v i 2 1 + μ 2 + ϖ 1 π μ T c κ 1 L 1 1 μ 2 + κ 2 2 μ 2 L 1 1 + μ 2 + ϖ 1 π μ T c L 1 1 μ 2 + L 1 1 + μ 2 + ϖ 1 .
According to Lemma 1, it can be concluded that all signals of the velocity subsystem are prescribed-time stable, and it can be derived that
L 1 min ϖ μ T c π ( 1 θ ) 2 2 μ , ϖ μ T c π ( 1 θ ) 2 2 + μ .
The prescribed-time denotes
T p c = T c θ .
Next, we prove the prescribed-time ETC scheme does not exhibit Zeno behavior. We define t = t h + 1 t h . Since e T i ( t ) = T x i ( t ) T x i ( t ) . Then, we have
d d t e T i = d d t e T i × e T i 1 2 = sign e T i e ˙ T i | T ˙ x i | .
Noting (33), T x i is a function of the bounded variables. Obviously, | T ˙ x i | is bounded, and satisfying | T ˙ x i | ϑ v , where h v is a constant.
Since e T i ( t h ) = 0 , define lim t t h + 1 e T i t = l ; then, we have l t h + 1 t h ϑ v , the lower bound of t satisfies t l ϑ v . It is proved that the Zero behavior is successfully exempted. This concludes Theorem 1’s proof.
Remark 3.
It should be noted that Φ v i can be made arbitrarily small by increasing control gains k 11 i , k 12 i , γ v i , meanwhile decreasing χ v i , a 1 , a 2 , μ, ς. Moreover, it is important to choose suitable a 1 and a 2 to balance control performance and triggering times. The prescribed time T c is set based on the task requirement.

3.2.2. Attitude Subsystem

The event-triggering signal is introduced as
δ i t = δ i t h , t [ t h , t h + 1 ) .
t h + 1 = inf t > t h e δ i a 3 δ i t a 4 0 ,
where δ i ( t ) = [ δ a i ( t ) , δ e i ( t ) , δ r i ( t ) ] T , δ i ( t ) = [ δ a i ( t ) , δ e i ( t ) ,   δ r i ( t ) ] T , e δ i = δ i ( t ) δ i ( t ) is the measurement error, and δ i ( t ) is the control law, which will be defined later. 0 < a 3 < 1 , a 4 > 0 are known positive parameters.
Similarly, we have
δ i = D φ δ i + σ φ ,
where D φ = diag { 1 + a 3 λ 2 sign ( δ a i ) 1 , 1 + a 3 λ 3 sign ( δ e i ) 1 ,   1 + a 3 λ 4 sign ( δ r i ) 1 } , σ φ = [ a 4 λ 2 / ( 1 + a 3 λ 2 sign ( δ a i ) ) ,   a 4 λ 3 / ( 1 + a 3 λ 3 sign ( δ e i ) ) , a 4 λ 4   / ( 1 + a 3 λ 4 sign ( δ r i ) ) ] T . λ 2 , λ 3 , λ 4 are time-varying parameters, and | λ 2 | < 1 , | λ 3 | < 1 , | λ 4 | < 1 .
A nonsingular prescribed-time ETC law is developed as:
δ i = J i 0 1 C i 0 T u 2 i g ^ ω i 2 e ω i T u 2 i g ^ ω i 2 e ω i T u 2 i e ω i T u 2 i + ι ,
where u 2 i is defined as
u 2 i = π μ T c k 31 i sig 1 μ e ω i + k 32 i 3 μ 2 sig 1 + μ e ω i + 1 2 K ω i λ ^ ω i tanh e ω i T K ω i λ ^ ω i 2 ς + J i 0 1 S J i 0 ω i + J i 0 1 N i 0 + 1 2 e ω i + J i 0 1 C i 0 σ φ m a x + p φ i β φ i R 2 1 Φ φ i ω ˙ d i ,
where k 31 i = diag { k 1 i , k 2 i , k 3 i } , k 32 i = diag { k 4 i , k 5 i , k 6 i } , k j i 0 , T c > 0 , 0 < μ < 1 , K ω i = e ω i 1 h ω i 1 T h ω i 1 , e ω i 2 h ω i 2 T h ω i 2 , e ω i 3 h ω i 3 T h ω i 3 T , h ω i j is basis function in radial-basis-function neural networks, σ φ max = a 4 1 a 3 , a 4 1 a 3 , a 4 1 a 3 T .
The adaptive update law is designed as:
λ ^ ˙ ω i = γ ω i e ω i T K ω i χ ω 1 i λ ^ ω i ,
g ^ ˙ ω i = η ω i e ω i T u 2 i χ ω 2 i g ^ ω i χ ω 3 i g ^ ω i 1 + μ ,
where γ ω i , χ ω 1 i , η ω i , χ ω 2 i , χ ω 3 i are positive design parameters.
Theorem 2.
Consider the attitude subsystem (10), the dynamic controller (60), the intermediate control law (61), the parameter adaptation laws (62) and (63), and the event-triggered mechanism (58). By selecting appropriate parameters, we obtain:
(1) The attitude tracking error Φ φ i converges to a residual set around the origin in prescribed time, even in the presence of state constraints and external disturbances. And the prescribed-time is given by T p c = T c θ , where θ ( 0 , 1 ) .
(2) The communication and computational burden for the attitude subsystem is reduced, and the Zeno phenomenon does not occur.
Proof. 
step 1: Noting (10), (28), and (29), we have
Φ ˙ φ i = p φ i β 3 i φ ˙ i φ ˙ d + β 4 i j N i a i j φ ˙ i φ ˙ j + q φ i = p φ i β φ i φ ˙ i φ ˙ d β 4 i j N i a i j e ˙ φ j + q φ i = p φ i β φ i R 2 1 ω i p φ i β 4 i j N i a i j e ˙ φ j p φ i β φ i φ ˙ d + q φ i ,
where β φ i = β 3 i + β 4 i j N i a i j , e φ j = φ j φ d .□
We design a virtual controller as
ξ i = p φ i β φ i R 2 1 1 π μ T c ( k 21 i sig 1 μ Φ φ i + k 22 i 3 μ 2 sig 1 + μ Φ φ i ) + p φ i β φ i φ ˙ d + p φ i β φ i j N i a i j e ˙ φ j q φ i ,
where ξ i = [ ξ i 1 , ξ i 2 , ξ i 3 ] T , k 21 i = diag { k 7 i , k 8 i , k 9 i } , k 22 i = diag { k 10 i , k 11 i , k 12 i } ,   k j i 0 , T c > 0 , 0 < μ < 1 . Considering the limitation of actuators, there exists a unknown constant D such that ξ ˙ i j D.
To avoid the explosion of complex ξ i , a nonlinear filter ω d i = [ ω d i 1 , ω d i 2 ,   ω d i 3 ] T is introduced to guarantee the overall prescribed-time convergence as
ω ˙ d i j = π μ T f sig 1 μ ξ i j ω d i j + sig 1 + μ ξ i j ω d i j ,
where 0 < μ < 1 , T f > 0 is a prescribed-time constant of prescribed-time filter.
Remark 4.
It can be observed that the term sig 1 μ Φ φ i in (65) may cause a singularity issue when the virtual controller ξ i is further derived. The novel prescribed-time command filter can resolve this problem, allowing the convergence time T f to be set. Additionally, the prescribed-time command filter helps avoid the issue of complexity explosion.
Choose the following Lyapunov function as
L 2 = 1 2 Φ φ i T Φ φ i + 1 2 e f i T e f i .
Define e f i = ω d i ξ i , e ω i = ω i ω d i . Taking the time derivative of L 2 along (64), we obtain
L ˙ 2 = Φ φ i T p φ i β φ i R 2 1 ω i p φ i β φ i φ ˙ d p φ i β φ i c d o t j N i a i j e ˙ φ j + q φ i + e f i T ω ˙ d i ξ ˙ i .
Substituting (65) and (66) into (68) leads to
L ˙ 2 π μ T c k 21 i Φ φ i 2 μ + k 22 i Φ φ i 2 + μ π μ T f e f i 2 μ + 3 μ 2 e f i 2 + μ + Φ φ i T p φ i β φ i R 2 1 e ω i + p φ i β φ i R 2 1 2 2 e f i 2 + 1 2 e f i 2 + 1 2 Φ φ i 2 + 3 2 D 2 .
Consider that 2 e f i 2 e f i 2 μ + e f i 2 + μ , 2 Φ f i 2 Φ φ i 2 μ + Φ φ i 2 + μ . We have
L ˙ 2 π μ T c k 21 i μ T c 4 π Φ φ i 2 μ + k 22 i μ T c 4 π · Φ φ i 2 + μ + Φ φ i T p φ i β φ i R 2 1 e ω i + 3 2 D 2 π μ T f 1 μ T f 1 + p φ i β φ i R 2 1 2 4 π · e f i 2 μ + 3 μ 2 μ T f 1 + p φ i β φ i R 2 1 2 4 π · e f i 2 + μ .
step 2: Similarly, we use radial-basis-function neural networks to approximate Δ ω i . Then, we have
e ω i T ( Δ ω i + d ω i ) = j = 1 3 e ω i j W ω i j * T h ω i j + j = 1 3 e ω i j ( g ω i j + d ω i j ) .
According to Assumption 2, there exists g ω i j + d ω i j l ω i j . Using Young’s inequality, we obtain from (71) that
e ω i T ( Δ ω i + d ω i ) e ω i T λ ω i K ω i 2 + e ω i 2 + 3 2 + j = 1 3 l ω i j 2 2 ,
where λ ω i = max { W ω i 1 * T W ω i 1 * , W ω i 2 * T W ω i 2 * , W ω i 3 * T W ω i 3 * } . Based on the Assumption 3, we define g ω i = 1 q 0 . Further, we consider the Lyapunov function as
L 3 = 1 2 e ω i T e ω i + 1 2 γ ω i λ ˜ ω i 2 + q 0 2 η ω i g ˜ ω i 2 ,
where λ ˜ ω i = λ ω i λ ^ ω i , g ˜ ω i = g ω i g ^ ω i , and γ ω i , η ω i are positive design parameters. Based on (10), (59), and (61), and using Lemma 2, we obtain
L ˙ 3 π μ T c k 31 i e ω i 2 μ + k 32 i e ω i 2 + μ 1 2 e ω i T K ω i λ ^ ω i tanh e ω i T K ω i λ ^ ω i 2 ς e ω i T J i 0 1 C i 0 σ φ max e ω i T p φ i β φ i R 2 1 Φ φ i + e ω i T J i 0 1 C i 0 D φ δ i + e ω i T J i 0 1 C i 0 σ φ + 1 2 e ω i T λ ω i K ω i + 3 2 + j = 1 3 l ω i j 2 2 + e ω i T u 2 i 1 γ ω i λ ˜ ω i λ ^ ˙ ω i q 0 η ω i g ˜ ω i g ^ ˙ ω i .
Since 0 < a 3 < 1 , a 4 > 0 , | λ 2 | < 1 , | λ 3 | < 1 , | λ 4 | < 1 , one has a 4 1 a 3 a 4 λ i 1 + a 3 λ i sign δ i j a 4 1 a 3 . It holds that e ω i T J i 0 1 C i 0 σ φ e ω i T J i 0 1 C i 0 σ φ max , using Lemma 4, we have
L ˙ 3 π μ T c k 31 i e ω i 2 μ + k 32 i e ω i 2 + μ + 1 2 e ω i T K ω i λ ˜ ω i + 0.2785 ς e ω i T p φ i β φ i R 2 1 Φ φ i + e ω i T J i 0 1 C i 0 D φ δ i + 3 2 + j = 1 3 l ω i j 2 2 + e ω i T u 2 i 1 γ ω i λ ˜ ω i λ ^ ˙ ω i q 0 η ω i g ˜ ω i g ^ ˙ ω i .
Noting (60) and invoking Lemma 5, we arrive
e ω i T J i 0 1 C i 0 D φ δ i = e ω i T J i 0 1 C i 0 D φ J i 0 1 C i 0 T u 2 i g ^ ω i 2 e ω i T u 2 i g ^ ω i 2 e ω i T u 2 i e ω i T u 2 i + ι q 0 e ω i T u 2 i g ^ ω i 2 e ω i T u 2 i g ^ ω i 2 e ω i T u 2 i e ω i T u 2 i + ι q 0 ι q 0 g ^ ω i e ω i T u 2 i .
Substituting (62), (63), and (76) into (75) leads to
L ˙ 3 π μ T c k 31 e ω i 2 μ + k 32 e ω i 2 + μ + χ ω 1 i γ ω i λ ˜ ω i λ ^ ω i + q 0 χ ω 2 i η ω i g ˜ ω i g ^ ω i + q 0 χ ω 3 i η ω i g ˜ ω i g ^ ω i 1 + μ e ω i T p φ i β φ i R 2 1 Φ φ i + 0.2785 ς + q 0 ι + 3 2 + j = 1 3 l ω i j 2 2 .
Using Lemma 6, we have
q 0 χ ω 3 i η ω i g ˜ ω i g ^ ω i 1 + μ q 0 χ ω 3 i 1 + μ η ω i 2 + μ g ω i 2 + μ g ˜ ω i 2 + μ .
Adopting Young’s inequality, one obtains
χ ω 1 i γ ω i λ ˜ ω i λ ^ ω i χ ω 1 i 2 γ ω i λ ω i 2 λ ˜ ω i 2 ,
q 0 χ ω 2 i η ω i g ˜ ω i g ^ ω i q 0 χ ω 2 i 2 η ω i g ω i 2 g ˜ ω i 2 .
Substituting (78), (79), and (80) into (77), it holds that
L ˙ 3 π μ T c k 31 i e ω i 2 μ + k 32 i e ω i 2 + μ χ ω 1 i 2 γ ω i λ ˜ ω i 2 q 0 χ ω 2 i 2 η ω i g ˜ ω i 2 q 0 χ ω 3 i 1 + μ η ω i 2 + μ g ˜ ω i 2 + μ + χ ω 1 i 2 γ ω i λ ω i 2 e ω i T p φ i β φ i R 2 1 Φ φ i + q 0 χ ω 3 i 1 + μ η ω i 2 + μ g ω i 2 + μ + q 0 χ ω 2 i 2 η ω i g ω i 2 + 0.2785 ς + q 0 ι + 3 2 + j = 1 3 l ω i j 2 2 .
Further, Let us choose the following Lyapunov function candidate
L 4 = L 2 + L 3 = 1 2 Φ φ i T Φ φ i + 1 2 e f i T e f i + 1 2 e ω i T e ω i + 1 2 γ ω i λ ˜ ω i 2 + q 0 2 η ω i g ˜ ω i 2 .
Based on (70) and (81), and taking the time derivative of (82), we obtain
L ˙ 4 π μ T c k 21 i μ T c 4 π Φ φ i 2 μ + k 22 i μ T c 4 π · Φ φ i 2 + μ π μ T c k 31 i e ω i 2 μ + k 32 i e ω i 2 + μ π μ T f 1 μ T f 1 + p φ i β φ i R 2 1 2 4 π e f i 2 μ + 3 μ 2 μ T f 1 + p φ i β φ i R 2 1 2 4 π e f i 2 + μ χ ω 1 i 2 γ ω i λ ˜ ω i 2 q 0 χ ω 2 i 2 η ω i g ˜ ω i 2 q 0 χ ω 3 i 1 + μ η ω i 2 + μ g ˜ ω i 2 + μ + ϖ 2 ,
where ϖ 2 = χ ω 1 i 2 γ ω i λ ω i 2 + q 0 χ ω 2 i 2 η ω i g ω i 2 + q 0 χ ω 3 i 1 + μ η ω i 2 + μ g ω i 2 + μ + q 0 ι + 0.2785 ς + 3 2 + j = 1 3 l ω i j 2 2 + 3 2 D 2 .
Using Lemma 3, it holds that
1 2 γ ω i λ ˜ ω i 2 1 μ 2 1 2 γ ω i λ ˜ ω i 2 + μ 2 1 μ 2 2 μ 1 ,
q 0 2 η ω i g ˜ ω i 2 1 μ 2 q 0 2 η ω i g ˜ ω i 2 + μ 2 1 μ 2 2 μ 1 .
According to (84) and (85), and adding and subtracting the term of χ ω 1 i 1 2 γ ω i   λ ˜ ω i 2 1 + μ 2 , (83) can be rewritten as
L ˙ 4 π μ T c k 21 i μ T c 4 π · 2 1 μ 2 · 1 2 Φ φ i 2 1 μ 2 + k 31 i · 2 1 μ 2 · 1 2 e ω i 2 1 μ 2 + T c T f 1 μ T f 4 π × 1 + p φ i β φ i R 2 1 2 · 2 1 μ 2 · 1 2 e f i 2 1 μ 2 + χ ω 1 i μ T c π 1 2 γ ω i λ ˜ ω i 2 1 μ 2 + χ ω 2 i μ T c π q 0 2 η ω i g ˜ ω i 2 1 μ 2 π μ T c k 22 i μ T c 4 π · 2 1 + μ 2 · 1 2 Φ φ i 2 1 + μ 2 + k 32 i · 2 1 + μ 2 · 1 2 e ω i 2 1 + μ 2 + T c T f 3 μ 2 μ T f 4 π × 1 + p φ i β φ i R 2 1 2 · 2 1 + μ 2 · 1 2 e f i 2 1 + μ 2 + χ ω 1 i μ T c π 1 2 γ ω i λ ˜ ω i 2 1 + μ 2 + μ T c π · 2 1 + μ 2 · χ ω 3 i · η ω i q 0 μ 2 · 1 + μ 2 + μ · q 0 2 η ω i g ˜ ω i 2 1 + μ 2 + ϖ 3 ,
where ϖ 3 = ϖ 2 + χ ω 1 i 1 2 γ ω i λ ˜ ω i 2 1 + μ 2 + μ 2 1 μ 2 2 μ 1 χ ω 1 i + χ ω 2 i μ 2 1 μ 2 2 μ 1 .
According to the Assumption 2, λ ω i is bounded. It derives that χ ω 1 i 1 2 γ ω i   λ ˜ ω i 2 1 + μ 2 is bounded. Define κ 3 = min { 2 1 μ 2 k 21 i μ T c 4 π , 2 1 μ 2 k 31 i , 2 1 μ 2 T c T f ( 1 μ T f 4 π   ( 1 + p φ i β φ i   R 2 1 2 ) ) ,   χ ω 1 i μ T c π , χ ω 2 i μ T c π } , κ 4 = min { 2 1 + μ 2 k 22 i μ T c 4 π , 2 1 + μ 2 k 32 i , 2 1 + μ 2 T c T f ( 3 μ 2   μ T f 4 π ( 1   + p φ i β φ i R 2 1 2 ) ) ,   χ ω 1 i μ T c π , 2 1 + μ 2 1 + μ 2 + μ μ T c π χ ω 3 i η ω i q 0 μ 2 } .
It follows from (86) that
L ˙ 4 π μ T c κ 3 1 2 Φ φ i 2 1 μ 2 + κ 3 1 2 e ω i 2 1 μ 2 + κ 3 1 2 e f i 2 1 μ 2 + κ 3 1 2 γ ω i λ ˜ ω i 2 1 μ 2 + κ 3 q 0 2 η ω i g ˜ ω i 2 1 μ 2 π μ T c κ 4 1 2 Φ φ i 2 1 + μ 2 + κ 4 1 2 e ω i 2 1 + μ 2 + κ 4 1 2 e f i 2 1 + μ 2 + κ 4 1 2 γ ω i λ ˜ ω i 2 1 + μ 2 + κ 4 q 0 2 η ω i g ˜ ω i 2 1 + μ 2 + ϖ 3 .
According to Lemma 2, we have
L ˙ 4 π μ T c κ 3 L 4 1 μ 2 + κ 4 5 μ 2 L 4 1 + μ 2 + ϖ 2 π μ T c L 4 1 μ 2 + L 4 1 + μ 2 + ϖ 2 .
According to Lemma 1, it can be concluded that all signals of the attitude subsystem are prescribed-time stable, and it can be derived that
Ł 4 min ϖ μ T c π ( 1 θ ) 2 2 μ , ϖ μ T c π ( 1 θ ) 2 2 + μ .
The prescribed-time denotes
T p c = T c θ .
Further, we prove that the prescribed-time ETC scheme for attitude subsystem does not exhibit Zeno behavior. We define t φ = t h + 1 t h . Since e δ i ( t ) = δ i ( t ) δ i ( t ) . Then, we have d d t e δ i | δ ˙ i | . From (59), δ i is a function of the bounded variables. It is clear that | δ ˙ i | is bounded, and satisfying | δ ˙ i | ϑ δ i , where ϑ δ i = [ ϑ a δ i , ϑ e δ i , ϑ r δ i ] T , in which ϑ j δ i is a positive constant, j = 1 , 2 , 3 . Since e δ i ( t h ) = 0 , and defining lim t t h + 1 e δ i t = l , the lower bound of interexecution time t φ l ϑ δ i . It is proved that the Zero behavior is successfully exempted. This concludes Theorem 2’s proof.
Remark 5.
The prescribed times T c and T f are set based on task requirement. To improve the convergence rate, we can increase the control gains k 21 i , k 22 i , k 31 i , k 32 i , and meanwhile decrease χ ω 1 i , γ ω i , η ω i , χ ω 2 i , χ ω 3 i , a 3 , a 4 , μ, ς, and ι. Morever, the choice of a 3 and a 4 should balance control performance and triggering times.

4. Simulation Results and Analysis

To validate the effectiveness of the proposed prescribed-time ETC scheme, this section conducts experimental verification. The parameters for each UAV are sourced from [43] and detailed in Table 1. The communication topology is illustrated in Figure 1, while the initial states are presented in Table 2. Throughout the flight, the UAVs experience external disturbances represented as d v 1 = d v 2 = d v 3 = [ 0.25 sin ( t ) , 0.4 cos ( 2 t ) , 0.3 cos ( t ) ] T , d ω 2 = d ω 3 = [ 0.3 cos ( 2 t ) , 0.5 sin ( 2 t ) , 0.25 sin ( t ) ] T .
The reference command for velocity and attitude subsystems are given as
V d = 20 + 20 s + 1 , 0 s < t 10 s , 20 + 35 0.4 s + 1 , 10 s < t 30 s , 20 + 40 2 s + 1 , 30 s < t 40 s ,
φ d = [ 0 , 0 , 0 ] T , 0 s < t 10 s , [ 0 , 0 , 0 ] T , 10 s < t 25 s , [ 0 , 0 , 0 ] T , 25 s < t 40 s ,
The time-varying state-constrained functions are set as: 0 < V i 100 , 5 < ϕ 1 i 5 , 12.5 < ϕ 2 i , ϕ 3 i 12.5 , 5 sin ( 0.1 t ) < θ 1 i 5 + sin ( 0.1 t ) , 10 sin ( 0.1 t ) < θ 2 i , θ 3 i 10 + sin ( 0.1 t ) , 5 e t 5 < ψ 1 i 5 e t + 5 , 15 e t 5 < ψ 2 i , ψ 3 i 15 e t + 5 .
The designed parameters specified in (33)–(35), (60)–(63), (65) and (66) are set as follows: a 1 = 0.6 , a 2 = 1 , μ = 0.13 , T c = 3 , k 111 = k 121 = 20 , k 121 = k 122 = 20 ( t ( 0 , 10 ] ) , k 121 = k 122 = 15 ( t ( 10 , 40 ] ) , k 113 = k 123 = 20 , ς = 0.1 , γ v i = 10 , χ v i = 0.15 , k 211 = k 221 = diag { 5 , 5 , 5 } , k 212 = diag { 10 , 10 , 10 } , k 222 = diag { 15 , 15 , 15 } , k 213 = k 223 = diag { 5 , 5 , 5 } , T f = 1 , a 3 = 0.5 , a 4 = 1 , k 311 = k 321 = diag { 20 , 25 , 25 } , k 312 = k 322 = diag { 5 , 5 , 5 } , k 313 = k 323 = diag { 55 , 55 , 55 } , γ ω 1 = γ ω 2 = γ ω 3 = diag { 0.25 , 0.25 , 0.25 } , χ ω 11 = diag { 1 , 0.01 , 0.01 } , χ ω 12 = diag { 0.01 , 0.01 , 0.01 } , χ ω 12 = diag { 1 , 1 , 0.01 } , η ω 1 = η ω 2 = η ω 3 = 0.001 , χ ω 21 = χ ω 22 = χ ω 23 = 0.5 , χ ω 31 = χ ω 32 = χ ω 33 = 0.5 .
The simulation results are presented in Figure 2, Figure 3, Figure 4 and Figure 5. Figure 2a–d demonstrate successful speed and attitude synchronization tracking, confirming the effectiveness of the proposed control methods. Additionally, the trajectories of speed and attitude adhere to the state constraints. Furthermore, the prescribed-time leader–follower consensus is achieved within 0.6 s, as illustrated in Figure 2e–h, indicating that T T c , even in the presence of external disturbances. Figure 3 shows that the proposed mechanism effectively tracks the reference trajectories while adhering to state constraints, demonstrating superior control performance compared to the controller in [52]. From Figure 4a–f, we observe the time intervals of T x i and δ i for each UAV. Finally, Figure 5 and Table 3 reveal that, compared to the periodically sampled control (Controller 1) and static event-triggering control as described in [53] (Controller 2), the proposed controller significantly reduces the number of triggered events while exhibiting no Zeno behavior.

5. Conclusions

This paper has developed event-triggered prescribed-time synchronization strategies for velocity and attitude-tracking control of 6-DOF UAVs with state constraints. To avoid the need for infinite derivatives, a novel prescribed-time filter has been designed. The issue of asymmetric time-varying state constraints is addressed using a nonlinear state-transition function. Additionally, event-triggered mechanisms are separately designed for the velocity and attitude subsystems, effectively reducing communication and computational burdens. The simulation results demonstrate the effectiveness of the proposed control methods. However, real-world variations such as wind disturbances [54], sensor noise [55] can have an impact on tracking control for multiple UAVs, and these factors need to be considered as well. Future work will involve incorporating wind disturbances and sensor noise into the prescribed-time ETC framework, as well as considering switching topologies for further enhancements.

Author Contributions

Conceptualization, X.H. and M.L.; methodology, X.H. and Y.S.; software, Y.S. and P.Y.; validation, M.L. and N.W.; formal analysis, Y.S.; investigation, N.W.; data curation, P.Y.; writing—original draft preparation, X.H.; writing—review and editing, X.H. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Natural Science Basic Research Program of Shaanxi (Program No.2024JC-YBQN-0668), Postdoctoral Fellowship Program of CPSF under grant GZB20230988, Postdoctoral Science Foundation General Program under grant 2024M754258.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

Author Peng Yu was employed by the company China Airport Planning & Design Institute Co., Ltd. The remaining authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

References

  1. Doukhi, O.; Lee, D.J. Neural network-based robust adaptive certainty equivalent controller for quadrotor UAV with unknown disturbances. Int. J. Control Autom. Syst. 2019, 17, 2365–2374. [Google Scholar] [CrossRef]
  2. Guerrero-Sánchez, M.E.; Hernández-González, O. Dynamics and control of UAVs. Machines 2024, 12, 749. [Google Scholar] [CrossRef]
  3. Liu, H.; Meng, Q.; Peng, F.; Lewis, F.L. Heterogeneous formation control of multiple UAVs with limited-input leader via reinforcement learning. Neurocomputing 2020, 412, 63–71. [Google Scholar] [CrossRef]
  4. Xiao, J.; Yuan, G.; Xue, Y.; He, J.; Wang, Y.; Zou, Y.; Wang, Z. A deep reinforcement learning based distributed multi-UAV dynamic area coverage algorithm for complex environment. Neurocomputing 2024, 595, 127904. [Google Scholar] [CrossRef]
  5. Ahmed, Z.; Xiong, X. Adaptive impedance control of multirotor UAV for accurate and robust path following. Machines 2024, 12, 868. [Google Scholar] [CrossRef]
  6. Lv, M.; Wang, N. Distributed control for uncertain multi-agent systems with the powers of positive-odd mumbers: A low-complexity design approach. IEEE Trans. Autom. Control 2023, 69, 434–441. [Google Scholar] [CrossRef]
  7. Shi, Y.; Li, J.; Lv, M.; Wang, N.; Zhang, B. Distributed consensus control for 6-DOF fixed-wing multi-UAVs in asynchronously switching topologies. IEEE Trans. Veh. Technol. 2024, 1–15. [Google Scholar] [CrossRef]
  8. Jackson, B.; Howell, T.; Shaha, K.; Schwager, M.; Manchester, Z. Scalable cooperative transport of cable-suspended loads with UAVs using distributed trajectory optimization. IEEE Robot. Autom. Lett. 2020, 5, 3368–3374. [Google Scholar] [CrossRef]
  9. He, H.; Yuan, W.; Chen, S.; Jiang, X.; Yang, F.; Yang, J. Deep reinforcement learning-based distributed 3D UAV trajectory design. IEEE Trans. Commun. 2024, 72, 3736–3751. [Google Scholar] [CrossRef]
  10. Fu, C.; Tian, Y.; Huang, H.; Zhang, L.; Peng, C. Finite-time trajectory tracking control for a 12-rotor unmanned aerial vehicle with input saturation. Isa Trans. 2018, 81, 52–62. [Google Scholar] [CrossRef]
  11. Wang, D.; Zong, Q.; Tian, B.; Lu, H.; Wang, J. Adaptive finite-time reconfiguration control of unmanned aerial vehicles with a moving leader. Nonlinear Dyn. 2018, 95, 1099–1116. [Google Scholar] [CrossRef]
  12. Sun, P.; Zhu, B.; Zou, Z.; Basin, M. Vision-based finite-time uncooperative target tracking for UAV subject to actuator saturation. Automatica 2021, 130, 109708. [Google Scholar] [CrossRef]
  13. Huang, D.; Huang, T.; Qin, N.; Li, Y.; Yang, Y. Finite-time control for a UAV system based on finite-time disturbance observer. Aerosp. Sci. Technol. 2022, 129, 107825. [Google Scholar] [CrossRef]
  14. Lin, G.; Li, H.; Ahn, C.; Yao, D. Event-Based finite-time neural control for human-in-the-loop UAV attitude systems. IEEE Trans. Neural Networks Learn. Syst. 2023, 34, 10387–10397. [Google Scholar] [CrossRef]
  15. Zhou, S.; Guo, K.; Yu, X.; Guo, L.; Xie, L. Fixed-Time observer based safety control for a quadrotor UAV. IEEE Trans. Aerosp. Electron. Syst. 2021, 57, 2815–2825. [Google Scholar] [CrossRef]
  16. Tao, M.; Chen, Q.; He, X.; Xie, S. Fixed-time filtered adaptive parameter estimation and attitude control for quadrotor UAVs. IEEE Trans. Aerosp. Electron. Syst. 2022, 58, 4135–4146. [Google Scholar] [CrossRef]
  17. Lv, M.; Ahn, C.; Zhang, B.; Fu, A. Fixed-Time antisaturation cooperative control for networked fixed-wing unmanned aerial vehicles considering actuator failures. IEEE Trans. Aerosp. Electron. Syst. 2023, 59, 8812–8825. [Google Scholar] [CrossRef]
  18. Zhou, Y.; Dong, W.; Liu, Z.; Lv, M.; Zhang, W.; Chen, Y. IBLF-based fixed-time fault-tolerant control for fixed-wing UAV with guar-anteed time-varying state constraints. IEEE Trans. Veh. Technol. 2023, 72, 4252–4266. [Google Scholar] [CrossRef]
  19. Zhao, S.; Zheng, J.; Yi, F.; Wang, X.; Zuo, Z. Exponential predefined time trajectory tracking control for fixed-wing UAV with input saturation. IEEE Trans. Aerosp. Electron. Syst. 2024, 60, 6406–6419. [Google Scholar] [CrossRef]
  20. Sun, F.; Zhang, J. Event-triggered prescribed-time tracking control for nonlinear systems with asynchronous switching. IEEE Trans. Circuits Syst. 2023, 70, 4159–4168. [Google Scholar]
  21. Dong, T.; Chai, R.; Yao, F.; Tsourdos, A.; Chai, S.; Garcia, M. Terminal sliding mode attitude tracking control for unmanned vehicle with predefined-time stability. Aerosp. Sci. Technol. 2023, 142, 108669. [Google Scholar] [CrossRef]
  22. Benaddy, A.; Labbadi, M.; Boubaker, S.; Alsubaei, F.; Bouzi, M. Predefined-time fractional-order tracking control for UAVs with pertur-bation. Mathematics 2023, 11, 4886. [Google Scholar] [CrossRef]
  23. Li, Q.; Chen, Y.; Liang, K. Predefined-time formation control of the quadrotor-UAV cluster’ position system. Appl. Math. Model. 2023, 116, 45–64. [Google Scholar] [CrossRef]
  24. Sun, P.; Zhu, B.; Li, S. Vision-based prescribed performance control for UAV target tracking subject to actuator saturation. IEEE Trans. Intell. Veh. 2024, 9, 2382–2389. [Google Scholar] [CrossRef]
  25. Yang, S.; Pan, Y.; Cao, L.; Chen, L. Predefined-time fault-tolerant consensus tracking control for multi-UAV systems with prescribed per-formance and attitude constraints. IEEE Trans. Aerosp. Electron. Syst. 2024, 60, 4058–4072. [Google Scholar] [CrossRef]
  26. Wang, F.; Gao, H.; Wang, K.; Zhou, C.; Zong, Q.; Hua, C. Disturbance observer-based finite-time control design for a quadrotor UAV with external disturbance. IEEE Trans. Aerosp. Electron. Syst. 2021, 57, 834–847. [Google Scholar] [CrossRef]
  27. Mofid, O.; Mobayen, S. Adaptive finite-time backstepping global sliding mode tracker of quad-rotor UAVs under model uncertainty, wind Perturbation, and input Saturation. IEEE Trans. Aerosp. Electron. Syst. 2022, 58, 140–151. [Google Scholar] [CrossRef]
  28. Han, Q.; Liu, Z.; Su, H.; Liu, X. Filter-based disturbance observer and adaptive control for euler–lagrange systems with application to a quadrotor UAV. IEEE Trans. Ind. Electron. 2023, 70, 8437–8445. [Google Scholar] [CrossRef]
  29. Wang, H.; Li, M.; Zhang, H.; Liu, S. Predefined-Time Composite Adaptive Fuzzy Nonsingular Attitude Control for Multi-UAVs. IEEE Trans. Fuzzy Syst. 2024, 32, 6891–6903. [Google Scholar] [CrossRef]
  30. Bemporad, A. Reference governor for constrained nonlinear systems. IEEE Trans. Autom. Control 1998, 43, 415–419. [Google Scholar] [CrossRef]
  31. Dehaan, D.; Guay, M. Extremum-seeking control of statecon-strained nonlinear systems. IFAC Proc. Vol. 2004, 37, 663–668. [Google Scholar] [CrossRef]
  32. He, W.; Yin, Z.; Sun, C. Adaptive neural network control of a marine vessel with constraints using the asymmetric barrier Lyapunov function. Math. Probl. Eng. 2016, 47, 1641–1651. [Google Scholar] [CrossRef] [PubMed]
  33. Chang, X.; Wang, K.; Chen, K.; Fu, W. Full-state-constrained adaptive control for a class of UAVs suffering from coupled uncertainties using the HOBLF. Automatica 2021, 2021, 9963426. [Google Scholar] [CrossRef]
  34. Ma, R.; Fu, L.; Fu, J. Prescribed-time tracking control for nonlinear systems with guaranteed performance. Automatica 2022, 146, 110573. [Google Scholar] [CrossRef]
  35. Cao, Y.; Song, Y.; Wen, C. Practical tracking control of perturbed uncertain nonaffine systems with full state constraints. Automatica 2019, 110, 108608. [Google Scholar] [CrossRef]
  36. Kazemy, A.; Lam, J.; Zhang, X. Event-triggered output feedback synchronization of master–slave neural networks under deception attacks. IEEE Trans. Neural Networks Learn. Syst. 2022, 33, 952–961. [Google Scholar] [CrossRef] [PubMed]
  37. Zhang, X.; Han, Q.; Zhang, B.; Ge, X.; Zhang, D. Accumulated-state-error-based event-triggered sampling scheme and its application to H∞ control of sampled-data systems. Sci. China 2024, 67, 162206. [Google Scholar] [CrossRef]
  38. Tian, B.; Cui, J.; Lu, H.; Liu, L.; Zong, Q. Attitude control of UAVs based on event-triggered supertwisting algorithm. IEEE Trans. Ind. Inf. 2021, 17, 1029–1038. [Google Scholar] [CrossRef]
  39. Wang, J.; Bi, C.; Wang, D.; Kuang, Q.; Wang, C. Finite-time distributed event-triggered formation control for quadrotor UAVs with experimentation. ISA Trans. 2022, 126, 585–596. [Google Scholar] [CrossRef]
  40. Wang, H.; Shan, J. Fully distributed event-triggered formation control for multiple quadrotors. IEEE Trans. Ind. Electron. 2023, 70, 12566–12575. [Google Scholar] [CrossRef]
  41. Ma, C.; Zheng, S.; Xu, T.; Ji, Y. Finite-time asynchronous event-triggered formation of UAVs with semi-markov-type topologies. Sensors 2022, 22, 4529. [Google Scholar] [CrossRef] [PubMed]
  42. Wang, F.; He, S.; Zhou, C.; Gao, Y.; Zong, Q. Distributed practical finite-time formation control of quadrotor UAVs based on finite-time event-triggered disturbance observer. IEEE Syst. J. 2023, 18, 355–366. [Google Scholar] [CrossRef]
  43. Zhang, B.; Sun, X.; Liu, S.; Lv, M.; Deng, X. Event-triggered adaptive fault-tolerant synchronization tracking control for multiple 6-DOF fixed-Wing UAVs. IEEE Trans. Veh. Technol. 2022, 71, 148–161. [Google Scholar] [CrossRef]
  44. Castaneda, H.; Salas-Pena, O.S.; Leon-Morales, J. Extended observer based on adaptive second order sliding mode control for a fixed wing UAV. ISA. Trans. 2017, 66, 226–232. [Google Scholar] [CrossRef]
  45. Wu, C.; Yan, J.; Shen, J.; Wu, X.; Xiao, B. Predefined-time attitude stabilization of receiver aircraft in aerial refueling. IEEE Trans. Circ. Syst.-II Express Briefs 2021, 68, 3321–3325. [Google Scholar] [CrossRef]
  46. Zhou, Z.; Tie, L. A new class of finite-time nonlinear consensus protocols for multi-agent systems. Int. J. Control 2014, 87, 363–370. [Google Scholar]
  47. Wang, H.; Zhu, Q. Adaptive output feedback control of stochastic nonholonomic systems with nonlinear parameterization. Automatica 2018, 98, 247–255. [Google Scholar] [CrossRef]
  48. Sun, J.; Yi, J.; Pu, Z. Fixed-time adaptive fuzzy control for uncertain nonstrict-feedback systems with time-varying onstraints and input saturations. IEEE Trans. Fuzzy Syst. 2011, 30, 1114–1128. [Google Scholar] [CrossRef]
  49. Wang, C.; Lin, Y. Decentralized adaptive tracking control for a class of interconnected nonlinear time-varying systems. Automatica 2015, 54, 16–24. [Google Scholar] [CrossRef]
  50. Yang, H.; Ye, D. Adaptive fixed-time bipartite tracking consensus control for unknown nonlinear multi-agent systems: An information classification mechanism. Inf. Sci. 2018, 459, 238–254. [Google Scholar] [CrossRef]
  51. Zhou, N.; Kawano, Y.; Cao, M. Neural network-based adaptive control for spacecraft under actuator failures and input saturations. IEEE Trans. Neural Netw. Learn. Syst. 2020, 31, 3696–3710. [Google Scholar] [CrossRef] [PubMed]
  52. Zhang, B.; Sun, X.; Lv, M.; Liu, S.; Li, L. Distributed adaptive fixed-time fault-tolerant control for multiple 6-dof uavs with full-state constraints guarantee. IEEE Syst. J. 2022, 16, 4792–4803. [Google Scholar] [CrossRef]
  53. Sun, W.; Su, S.; Wu, Y.; Xia, J. Adaptive fuzzy event-triggered control for high-order nonlinear systems with prescribed performance. IEEE Trans. Cybern. 2022, 52, 2885–2895. [Google Scholar] [CrossRef]
  54. Guo, K.; Jia, J.; Yu, X.; Guo, L.; Xie, L. Multiple observers based anti-disturbance control for a quadrotor UAV against payload and wind disturbances. Control Eng. Pract. 2020, 102, 104560. [Google Scholar] [CrossRef]
  55. Chen, S.; Hu, F.; Chen, Z.; Wu, H. Correction method for UAV pose estimation with dynamic compensation and noise reduction using multi-sensor fusion. IEEE Trans. Consum. Electron. 2024, 70, 980–989. [Google Scholar] [CrossRef]
Figure 1. Communication topology.
Figure 1. Communication topology.
Machines 13 00192 g001
Figure 2. The trajectory of speed and attitude and their tracking errors in proposed controller. (a) Speed response. (b) Roll−angle response. (c) Pitch−angle response. (d) Yaw−angle response. (e) Tracking error of speed. (f) Tracking error of roll angle. (g) Tracking error of pitch angle. (h) Tracking error of yaw angle.
Figure 2. The trajectory of speed and attitude and their tracking errors in proposed controller. (a) Speed response. (b) Roll−angle response. (c) Pitch−angle response. (d) Yaw−angle response. (e) Tracking error of speed. (f) Tracking error of roll angle. (g) Tracking error of pitch angle. (h) Tracking error of yaw angle.
Machines 13 00192 g002
Figure 3. Speed and attitude tracking response under comparative controller and proposed controller. (a) Speed response. (b) Roll−angle response. (c) Pitch−angle response. (d) Yaw−angle response.
Figure 3. Speed and attitude tracking response under comparative controller and proposed controller. (a) Speed response. (b) Roll−angle response. (c) Pitch−angle response. (d) Yaw−angle response.
Machines 13 00192 g003
Figure 4. Triggering time interval. (a) Data T x 1 . (b) Data δ 1 . (c) Data T x 2 . (d) Data δ 2 . (e) Data T x 3 . (f) Data δ 3 .
Figure 4. Triggering time interval. (a) Data T x 1 . (b) Data δ 1 . (c) Data T x 2 . (d) Data δ 2 . (e) Data T x 3 . (f) Data δ 3 .
Machines 13 00192 g004
Figure 5. The number of times an event was triggered.
Figure 5. The number of times an event was triggered.
Machines 13 00192 g005
Table 1. The parameter values of UAV.
Table 1. The parameter values of UAV.
CoefficientValueUnitCoefficientValueUnit
m i 20.64kg c l p i −0.213 rad 1 · s
b i 1.96m c m q i −3.449 rad 1 · s
c ¯ i 0.76 m c n p i −0.151 rad 1 · s
S i 1.37 m 2 c l r i 0.114 rad 1 · s
g9.8 m · s 2 c n r i −0.195 rad 1 · s
ρ 1.29 kg · m 3 c l δ a i −0.056 rad 1
J x i 1.607 kg · m 2 c n δ a i −0.036 rad 1
J y i 7.51 kg · m 2 c L α i 0.25 rad 1
J z i 7.18 kg · m 2 c Y β i −0.1 rad 1
J x z i 0.59 kg · m 2 c l β i −0.038 rad 1
c L 0 i 0.1/ c l δ r i 0.014 rad 1
c D 0 i 0.5/ c m α i −0.473 rad 1
c l 0 i −0.001/ c m δ e i −0.364 rad 1
c m 0 i 0.022/ c n β i 0.036 rad 1
c n 0 i 0.022/ c n δ r i −0.055 rad 1
Table 2. Initial states of UAVs.
Table 2. Initial states of UAVs.
UAV1UAV2UAV3
x (m)−201030
y (m)−1010−10
z (m)100100100
V (m/s)2019.520
ϕ ( ° )0−0.50
θ ( ° )10.50
ψ ( ° )00.50
l (rad/s)000
q (rad/s)000
j (rad/s)000
Table 3. The number of data transmission under different controllers.
Table 3. The number of data transmission under different controllers.
Control Schemes T x 1 δ 1
Compared controller 140,00040,000
Compared controller 221,0596222
Proposed controller56983231
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Han, X.; Yu, P.; Lv, M.; Shi, Y.; Wang, N. Event-Driven Prescribed-Time Tracking Control for Multiple UAVs with Flight State Constraints. Machines 2025, 13, 192. https://doi.org/10.3390/machines13030192

AMA Style

Han X, Yu P, Lv M, Shi Y, Wang N. Event-Driven Prescribed-Time Tracking Control for Multiple UAVs with Flight State Constraints. Machines. 2025; 13(3):192. https://doi.org/10.3390/machines13030192

Chicago/Turabian Style

Han, Xueyan, Peng Yu, Maolong Lv, Yuyuan Shi, and Ning Wang. 2025. "Event-Driven Prescribed-Time Tracking Control for Multiple UAVs with Flight State Constraints" Machines 13, no. 3: 192. https://doi.org/10.3390/machines13030192

APA Style

Han, X., Yu, P., Lv, M., Shi, Y., & Wang, N. (2025). Event-Driven Prescribed-Time Tracking Control for Multiple UAVs with Flight State Constraints. Machines, 13(3), 192. https://doi.org/10.3390/machines13030192

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop