Next Article in Journal
Finite-Time Adaptive Quantized Control for Quadrotor Aerial Vehicle with Full States Constraints and Validation on QDrone Experimental Platform
Previous Article in Journal
Multi-Objective Deployment of UAVs for Multi-Hop FANET: UAV-Assisted Emergency Vehicular Network
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Predefined-Time Platoon Control of Unmanned Aerial Vehicle with Range-Limited Communication

1
School of Electrical Engineering, Yanshan University, Qinhuangdao 066004, China
2
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 639798, Singapore
*
Author to whom correspondence should be addressed.
Drones 2024, 8(6), 263; https://doi.org/10.3390/drones8060263
Submission received: 21 May 2024 / Revised: 11 June 2024 / Accepted: 12 June 2024 / Published: 13 June 2024

Abstract

:
In this paper, the predefined-time platoon control for multiple uncertain unmanned aerial vehicles (UAVs) under range-limited communication and external disturbance constraints is considered. A novel control scheme, which can guarantee communication connectivity, collision avoidance, and the predefined convergence time simultaneously, is proposed. To achieve disturbance robustness, an observer-based distributed control law is firstly proposed with a time-varying gain. Then, a radial basis function neural network (RBFNN) with an adaptive tuning law is applied to approximate uncertainties of the system. Under the time and error transformation techniques, uniformly ultimate boundedness (UUB) stability of the closed-loop system is guaranteed within predefined convergence time. Compared with the existing results, the proposed method allows the system to have UUB within any predefined time without depending on the initial conditions or system parameters. Finally, simulation results are presented to verify the derived theorem.

1. Introduction

In the past decades, unmanned aerial vehicles (UAVs) have been widely used in various fields [1,2]. The networked multiple UAVs greatly expand the capabilities of a single system, such as scalability, robustness, and execution ability [3,4]. To reduce the wind resistance of UAVs in flight, platoon control, which ensures that the UAVs maintain desired spaces between adjacent subsystems, is an effective way to solve this problem [5,6,7,8,9,10]. Platoon control can be achieved by using relative measurements. The existing works mainly focus on vehicular platoon control in one dimension for the single-integral system, double-integral system, or third-integral system [11,12,13]. Although the application of vehicle platoon control has been partially solved, the results in actual UAVs under external disturbances and system uncertainties lack of consideration [14,15,16,17,18].

1.1. Related Works

Recently, researchers have proposed several methods to deal with external disturbance issues in platoon control [19,20,21,22]. For example, a sliding mode based robust controller was proposed for vehicular systems with external disturbances [20], where the control scheme is independent of the object parameters and insensitive to parameter changes and inevitable high frequency chattering due to the high frequency switch of the sliding mode. By representing the uncertainties of the system and the unknown dynamics and as a lumped nonlinearity, a fuzzy approximation based approach was proposed for the platoon tracking control of marine vehicles. In Reference [22], a hybrid control framework that ensures practical finite time stability and asymptotical convergence was proposed by using neural network approximation. It is worth noting that these approaches cannot guarantee the transient and steady state performances such as communication connectivity and collision avoidance.
Due to the requirements of system performance, transient and steady state performance methods have been introduced [11,17,23], in which the constrained control problem of error dynamic is transformed into an unconstrained control problem. For example, an adaptive backstepping controller was proposed for the trajectory tracking problem of an uncertain UAV with guaranteed transient and steady state performance in [24]. In Reference [25], a transient and steady-state-constraint-based approach was proposed for a group of nonholonomic mobile robots to achieve leader–follower formation with range-limited communication. In Reference [26], collision avoidance was guaranteed for the platoon formation control of multiple unmanned surface vehicles. However, these methods can only guarantee the transient and steady-state performance of the closed-loop system but cannot guarantee the convergence time. The convergence time is a crucial indicator for evaluating the system performance, especially for UAV systems with severe time-of-flight constraints due to limited energy. The finite time control method is one of the effective methods to solve this issue [27,28,29,30,31,32,33]. In References [31,32,33], the authors considered the finite time trajectory tracking problem for nonlinear systems with uncertainties. However, the convergence time of the above-mentioned methods is highly relying on the system parameters and the system’s initial conditions. In addition, it is more difficult to steer the system to converge within an user predefined time.

1.2. Contributions

In this paper, we consider the predefined-time platoon control for uncertain UAVs subject to collision, range-limited communication, and external disturbances. By using the prescribed performance approach, the collision avoidance and connectivity preservation problems are transformed into the limitations on specific position error constraints. Then, a platoon control law with a dynamic gain is designed for the UAVs. To guarantee the stability of the closed-loop UAV system within the predefined time, the time transformation technique and UUB stability are applied. The contributions can be summarized as follows:
  • This paper focuses on the platoon control of UAV systems modeled by nonlinear dynamics with uncertainties and external disturbances. The RBFNN and the disturbance observer approaches are used to estimate the unknown bounded external disturbance and system uncertainties. Compared to [34,35,36], which is considered the platoon of linear systems, the control design in this paper is more complex and challenging.
  • Compared to [20], connectivity preservation and collision avoidance between UAVs can be guaranteed simultaneously by the proposed control scheme. The state errors are bounded, with the bounds decay exponentially by using the prescribed performance control approach.
  • Compared to the finite time convergent results in [37,38], the proposed control scheme can guarantee the platoon of UAVs converge into a small neighborhood around zero at a predefined time without relying on the initial conditions and system parameters.
Section 2 formulates the problem of interest. Section 3 gives the control design for UAVs platoon system, which is the main results. Then, the simulations are given in Section 4. Finally, Section 5 concludes this paper, and the Appendix gives some proof details.

2. Problem Formulation

2.1. UAV Model

In this paper, the rigid-body UAV with six degrees of freedom (DOF) is considered [39]. The kinematics model of the ith UAV is given as follows:
η ˙ i = R i V i ,
where η i = [ x i , y i , z i , ϕ i , θ i , ψ i ] T is the state of the UAV, with ( x i , y i , z i ) being the position in a global coordinate and ( ϕ i , θ i , ψ i ) being the pose. V i = [ u i , v i , w i , p i , q i , r i ] T is the linear and angular velocity vector in the body-fixed reference frame. R i = d i a g { R i 1 , R i 2 } is the rotation matrix between the body-fixed reference frame and the earth-fixed reference frame, where
R i 1 = cos θ i cos ψ i sin ϕ i sin θ i cos ψ i cos ϕ i sin ψ i cos ϕ i sin θ i cos ψ i + sin ϕ i sin ψ i cos θ i sin ψ i sin ϕ i sin θ i sin ψ i cos ϕ i cos ψ i cos ϕ i sin θ i sin ψ i + sin ϕ i cos ψ i sin θ i cos θ i sin ϕ i cos θ i cos ϕ i , R i 2 = 1 sin ϕ i sin θ i / cos θ i cos ϕ i sin θ i / cos θ i 0 cos ϕ i sin ϕ i 0 sin ϕ i / cos θ i cos ϕ i / cos θ i ,
The dynamics model of the ith UAV is given as follows:
M ¯ i V ˙ i = C ¯ i ( V i ) V i Z ¯ i ( V i ) G ¯ i ( V i ) + F i Δ f i ,
where M ¯ i , C ¯ i ( V i ) , G ¯ i ( V i ) , and Z ¯ i ( V i ) denote the inertia matrix, the coriolis matrix, gravitational matrix, and the modeling uncertainties of the ith UAV, respectively. F i is the exerted torque of the UAV in the ith body-fixed reference frame. Δ f i is the external disturbance.
According to (1) and (2), the UAV system model can be rewritten as
M i η ¨ i = C i ( η ˙ i ) η ˙ i Z i ( η ˙ i ) G g i ( η i ) τ ϖ i + τ i ,
where M i = ( R i 1 ) T M ¯ i R i 1 , C i ( η ˙ i ) = ( R i 1 ) T ( C ¯ i ( V i ) M ¯ i R i 1 R ˙ i ) R i 1 , Z i ( η ˙ i ) = ( R 1 ) T Z ¯ ( V ) , and G g i ( η ) = ( R i 1 ) T G ¯ i ( V i ) . τ i = ( R i 1 ) T F i define the control input. τ ϖ i = ( R i 1 ) T Δ f i is the external disturbance. For the external disturbances, the following assumption is given.
Assumption 1.
The unknown external disturbance is time-varying and bounded; its first derivative is also unknown and bounded.
Assumption 1 is widely used to model unknown external disturbances [19,20,21]. Under Assumption 1, the first derivative of the external disturbance is constrained by an unknown constant. Some important properties of the nonlinear dynamic model (3) are given:
Property 1.
M i represents inertia, which is positive and symmetric. In addition, the function has lower and upper bounds, respectively, with the positive scalars q i 1 and q i 2 , i.e.,
0 < q i 1 I M i ( η i ) q i 2 I < ,
where I is the identity matrix with the corresponding dimension. And M ˙ i 2 C i ( η ˙ i ) is skew-symmetric, which means s T ( M ˙ i 2 C i ( η ˙ ) i ) s = 0 , s R n .
Remark 1.
Note that for the UAV model, the system outputs η, η ˙ , and η ¨ can be considered as the generalized position, velocity, and acceleration, which can be measured by the omnidirectional distance sensor, gyroscope, laser speed sensor, altitude sensor, camera, GPS, acceleration transducer and other onboard sensors. Consequently, this information can be used to design the control input τ i .

2.2. Technical Lemmas

In this subsection, some technical lemmas are introduced.
Lemma 1
([40]). A R n × n is a square matrix. When a i i > 0 , a i j 0 ( i j ) , A is a L matrix. If all of the eigenvalues of the matrix have positive real parts, it will be an M matrix.
Lemma 2
([40]). N P + P T N is a positive matrix if P R n × n is an M matrix, and N = d i a g P 1 × 1 n 1 is a diagonal positive matrix.
Lemma 3
([41]). Φ ( t ) is a solution of the dynamic system
x ˙ ( t ) = f ( t , x ( t ) ) , x ( 0 ) = x 0 .
Let t = β ( τ ) be the time transformation; β ( τ ) is a strictly increasing and contiguously differentiable function of s, and Ψ ( τ ) = Φ ( t ) . Then, Ψ ˙ ( τ ) = β ˙ ( τ ) f ( β ( τ ) , Ψ ( τ ) ) , and Ψ ( β 1 ( 0 ) ) = x 0 .
Lemma 4
([42]). If f ( t ) is a differentiable function, it has a finite limit as t , and it is uniformly continuous: f ˙ ( t ) 0 as t .
Lemma 5
([42]). Q ´ is a positive matrix and a solution of the system is defined as s ˇ , and the maximal eigenvalues and the minimal eigenvalues of Q ´ are λ 2 ( Q ´ ) and λ 3 ( Q ´ ) , respectively. The system will be UUB stable in square with ultimate bound α 2 λ 2 ( Q ´ ) α 1 when V ( s ˇ ) = s ˇ T Q ´ s ˇ is a continuous function, and for constants α 1 > 0 , α 2 > 0 , we have
£ ( V ˙ ( s ˇ ) ) α 1 £ ( V ( s ˇ ) ) + α 2 , t 0 .

2.3. Problem Statements

Consider the n UAVs in a platoon; the collision and range-limited communication problem is considered. The safety state of each UAV is defined as ϰ s = [ ϰ a , ϰ g ] T = [ ϰ a x , ϰ a y , ϰ a z , ϰ g p , ϰ g r , ϰ g y ] T , with ϰ a being the avoiding collision distance between each UAV. The communication distance is defined as ϰ c = [ ϰ c x , ϰ c y , ϰ c z ] T . The position of each UAV is defined as η ^ i = [ x i , y i , z i ] T . The position error of the UAVs is defined as η ^ i η ^ i 1 . The desired states of each UAV is ϰ i , i 1 = [ ϰ u i , i 1 , ϰ v i , i 1 , ϰ w i , i 1 , ϰ p i , i 1 , ϰ q i , i 1 , ϰ r i , i 1 ] T . The desired position between each UAV is ϰ i , i 1 * = [ ϰ u i , i 1 , ϰ v i , i 1 , ϰ w i , i 1 ] T , ϰ a ϰ i , i 1 * . Obviously, the distance of each UAV should satisfy ϰ a < η ^ i ( t ) η ^ i 1 ( t ) < ϰ c . The desired reference trajectory is given as η 0 = [ x 0 , y 0 , z 0 , ϕ 0 , θ 0 , ψ 0 ] T . For the initial conditions, the following assumption is given.
Assumption 2.
The initial states of the platoon cannot violate the collision and connectivity constraints, which means the distances between each UAVs should satisfy the following:
ϰ a < η ^ i 1 ( 0 ) η ^ i ( 0 ) < ϰ c ,
for all n UAVs in the platoon system.
Remark 2.
Assumption 2 requires the UAV’s initial position errors to be limited within the predefined range. The controller is designed by using the predetermined performance technique to ensure that the UAVs are always in the predefined communication range with avoiding collisions, which means that the state errors are bounded with a decaying exponential time.
When the system’s state error δ i ( t ) evolves strictly within the predefined ranges, the prescribed performance is achieved. To avoid collision and maintain connectivity, the UAVs are maintained at a safe distance from one another and stay within the communication range, which satisfies Assumption 2. The state error δ i ( t ) satisfies the following conditions:
λ 1 ρ i ( t ) < δ i ( t ) < λ 1 ρ i ( t ) ,
where 0 < λ 1 < 1 . Define a positive function ρ i ( t ) as
ρ i ( t ) = ( ρ i ( 0 ) ρ i ( ) ) e ( l t ) + ρ i ( ) ,
where ρ i ( 0 ) R + , ρ i ( ) R + , l R + , and l i m t ρ i ( t ) = ρ i ( ) > 0 . ρ i ( ) represents the allowed maximum error. The decreasing rate represents the minimal convergence rate. It should be noted that ρ i ( ) λ 1 , which ensures that the practical can converge to zero.
Remark 3.
To ensure avoiding collisions within communication, λ 1 ρ i ( 0 ) should satisfy that λ 1 ρ i ( 0 ) > ϰ i , i 1 ( t ) + ϰ s . Thus, we have δ i ( t ) > λ 1 ρ i ( t ) > λ 1 ρ i ( 0 ) > ϰ i , i 1 ( t ) + ϰ s , and then collision avoidance among UAVs is guaranteed.
The generalized error of the ith UAV is
δ i ( t ) = η i ( t ) η i 1 ( t ) ϰ i , i 1 .
It can be rewritten as a matrix vector form:
δ ( t ) = δ 1 ( t ) δ 2 ( t ) δ n ( t ) = Ξ η 1 ( t ) η 0 η 2 ( t ) η 0 η n ( t ) η 0 ϰ 1 , 0 ϰ 2 , 0 ϰ n , 0 = Ξ δ 0 ( t ) ,
where ϰ i , 0 = j = 1 i ϰ j , j 1 , and Ξ R n × n = [ I i , j ] , with I i , i = 1 , I i 1 , i = 1 , I i , j = 0 , i , j { 1 , 2 , , n } , and δ 0 i ( t ) = η i ( t ) η 0 ϰ i , 0 .
The error transformation incorporates the state error δ i ( t ) with regard to the appropriate performance bounds imposed by ρ i ( t ) to ensure that the state errors are restricted by the prescribed performance function. Then, the state error can be written as
σ ( δ , t ) = σ 1 ( δ 1 , t ) σ 2 ( δ 2 , t ) σ n ( δ n , t ) = δ 1 ( t ) ρ 1 ( t ) δ 2 ( t ) ρ 2 ( t ) δ n ( t ) ρ n ( t ) ρ 1 ( t ) Ξ δ 0 ( t ) ,
where ρ ( t ) = d i a g ( [ ρ 1 ( t ) , ρ 2 ( t ) , , ρ n ( t ) ] ) . A candidate transformation function is given as
ζ i ( σ i ( t ) λ 1 ) = ln H + σ i ( t ) λ 1 H ( 1 σ i ( t ) λ 1 ) ,
where 1 < H < 2 . The auxiliary results of the system error are given in Appendix A. Then, the control objective is as follows.
Problem 1.
Design a controller for a platoon of UAVs that allows for the maintenance of a desirable inter-UAV state while meeting the following constraints:
  • The purpose of the control law is to guarantee that the UAVs can achieve the desired formation under collision avoidance and connectivity preservation. It means that each UAV should arrive at the desired position, and the state errors are bounded by a strictly decreasing exponential time function.
  • The system converges within the predefined time, which is independent on the system parameters and the system’s initial values.

3. Controller Design for UAVs Platoon System without Considering Time Constraints

This section presents a control law under prescribed performance constraints to obtain the platoon control objective above. The designed controller is based on lumped state errors, RBFNN approximations, disturbance observers, and the Lyapunov function. In theory, the RBFNN can simultaneously process system uncertainties and external disturbances online. However, when using a neural network to deal with the unknown external disturbances, the control input of the neural network is difficult, if not impossible, to design. In addition, the control performance based on neural network disturbance observer is better than the method only using the neural network. Based on these two motivations, the RBFNN-based disturbance observer is designed.
Based on the dynamic surface control technique to avoid the “explosion of complexity” problem, a new lumped state error variables is defined as
ε i = η ˙ i + μ i ζ i ,
where ε i = [ ε x i , ε y i , ε z i , ε ϕ i , ε θ i , ε ψ i ] T , μ i = d i a g { [ μ x i , μ y i , μ z i , μ ϕ i , μ θ i , μ ψ i ] } is a positive definite diagonal matrix.
Differentiating (11) and substituting (3) into it, one can obtain
M i ε ˙ i = τ i C i ( η ˙ ) η ˙ i Z i ( η ˙ ) G ( η ) τ ϖ i + M i μ i L i .
To solve Problem 1, the RBFNN is firstly introduced to approximate the system uncertainties. Any smooth nonlinear function may be approximated with arbitrary precision using the neural network technique. With a simple and implementable approach, the RBFNN can estimate the nonlinear uncertainties. The RBFNN can approximate a continuous function f ( X ) : R n R m , which can be expressed as
f ( X ) = W T S ( X ) + ϵ ( X ) ,
where X Ω X R n is the input vector; W R i × m is the weight matrix; i > 1 is the number of neurons in this paper; and S ( X ) = [ S 1 ( X ) , S 2 ( X ) , , S i ( X ) ] T is the Gaussian RBF function, which can be described as follows
S i ( X ) = e ( X C i 2 2 b i 2 ) , i = 1 , 2 , , n ,
where the center of i t h neuron is C i , and the width of it is b i . From the property of the neural network method, any continuous function f ( X ) has
f ( X ) = W * T S ( X ) + ϵ ( X ) ,
where W * is the optimal constant weight vector, and ϵ ( X ) is the approximation error with ϵ ( X ) ϵ * , where ϵ * > 0 . S ( X ) is the RBF vector, and S ( X ) S * , with S * > 0 . More details about the RBF neural network can be found in [43] and reference therein.
Denote
f i ( X i ) = Z i ( η ˙ ) = W i * S i ( X i ) + ϵ i ( X i ) ,
where X i = η ˙ i Ω X i R n . In this paper, the RBFNN method is used to estimate the uncertainties of the UAV systems. It has the function of associative memory and can fully approximate the complex nonlinear relation, which means the neural network method can approximate any nonlinear function arbitrarily so that the nonlinear problem can be handled in a linear way. Moreover, the RBFNN method has strong parallel distribution processing ability, as well as strong distribution storage and learning ability.
Substituting (16) into (12), we obtain
ε ˙ i = M i 1 ( τ i C i ( η ˙ ) η ˙ i W i * S i ( X i ) ϵ i ( X i ) G ( η ) τ ϖ i + M i μ i L i ) .
The lumped disturbance is designed as τ w i = τ ϖ i + ϵ i ( X i ) ; then, (17) can be rewritten as
ε ˙ i = M i 1 ( τ i C i ( η ˙ ) η ˙ i W i * S i ( X i ) G ( η ) τ w i + M i μ i L i ) .
The disturbance observer to estimate the unknown external disturbance τ w i in (18) is designed as
τ ^ w i = κ i K κ i ε i κ ˙ i = ε i K κ i M i 1 ( τ i C i ( η ˙ ) η ˙ i W ^ i S i ( X i ) G ( η ) τ ^ w i + M i μ i L i ) ,
where K κ i is a positive definite diagonal matrix. W ^ i is the estimate of the RBFNN weight W i , and τ ^ w i is the estimate of the unknown disturbance τ w i .
The estimate errors of the disturbance and the uncertainties are
W ˜ i = W i * W ^ i ,
τ ˜ w i = τ w i τ ^ w i .
Substituting (18)–(20) into the differential of (21) derives
τ ˜ ˙ w i = τ ˙ w i + ε i K κ i M i 1 ( C i ( η ˙ ) η ˙ i W ^ i S i ( X i ) G ( η ) τ ^ w i + τ i + M i μ i L i ) + K κ i M i 1 ( τ i C i ( η ˙ ) η ˙ i W i * S i ( X i ) G ( η ) τ w i + M i μ i L i ) = τ ˙ w i + ε i + K κ i M i 1 ( W ˜ i S i ( X i ) τ ˜ w i ) .
The proposed controller with prescribed performance is designed as follows:
τ i = K ε i ε i M i μ i L i + C i ( η ˙ ) η ˙ i + W ^ i S i ( X i ) + τ ^ w i + G ( η ) ,
where K ε i is positive definite diagonal matrices. The adaptive tuning law for W ^ i is given as follows:
W ^ ˙ i = ε i T Λ i S i ( X i ) M i Λ i ε ˙ i ,
where Λ i is positive definite diagonal matrix.
Theorem 1.
The closed-loop system is UUB stable, and the mean square and state errors tend to an extremely small neighborhood around zero under Assumptions 1 and 2 using the UAVs model (3) in a platoon under the control input (23) with the RBFNN (16), disturbance observer (19) and adaptive control law (24).
The proof of Theorem 1 is given in Appendix B.
The control scheme can be seen in Figure 1. The control input consists of three parts: the estimated uncertainties, the external disturbance observer, and the lumped state error convergence. The designed controller only requires the derivative of its own state, and the state of the system has physical significance; thus, the derivative of the state also holds physical meaning, and its effectiveness lies in reducing the influence of the corresponding part in the system dynamics. η = [ x , y , z , ϕ , θ , ψ ] T represents the position and the angle of the UAV, so the derivative of the η represents the velocity of each axis. Currently, sensor technology can realize the corresponding derivatives, which means the measurement of velocity. On the other hand, measurement noise does exist in the measurement of the state derivative. However, the H control method can be used to address this issue, as cited in [44]. Nonetheless, this is beyond the scope of this paper. For mathematical simplicity, this is not considered in the present analysis.

4. Controller Design for UAVs Platoon System with Considered Time Constraint

In the previous section, although the platoon control of multiple UAVs can be guaranteed, the cost of time is not taken into account in the application process. As is known to all, the flight time of the UAV is limited, and the UAV needs to complete all the tasks within the limited flight time. The finite time control approach is one of the methods that considers the cost of time. However, the convergence time of the finite time control depends on its initial conditions and system parameters. Therefore, in this section, we focus on how to achieve the platoon control of multiple UAVs within a predefined time.
The proposed controller with prescribed performance and time constraint is designed as follows:
τ t i = Γ τ i K ε t i ε t i M i μ i L i + C i ( η ˙ ) η ˙ i + W ^ i S i ( X i ) + τ ^ w i + G ( η ) ,
where
Γ τ t i = k τ i T t , t < T k τ i , o t h e r s ,
and K ε t i define positive definite diagonal matrices.
Remark 4.
The controller consists of two parts: one of which is used to ensure predefined time convergence; the other of which is used to compensate for the nonlinear uncertainties and disturbances. In addition, the controller (25) degenerates to (23) for t T ; thus, the proof of this part focuses on the case of t < T .
Remark 5.
Recall the predefined-time platoon control in [36], which considered the platoon control problem for single- and double-interrogator linear vehicle systems without disturbances and uncertainties. The main differences are as follows: (1) A predefined-time controller is designed for the nonlinear UAV system with external disturbance and system uncertainties, which will affect the stability of the system and bring additional challenges for control design. (2) A disturbance observer is proposed to handle the external disturbances, and the model uncertainties of the system are estimated by the RBFNN method. By using the adaptive control method, a lumped error is applied to avoid the “explosion of complexity” problem.
The adaptive tuning law for W ^ t i is given as follows:
W ^ ˙ i = ε t i T Λ t i S i ( X i ) M i Λ t i ε ˙ t i ,
where Λ i is positive definite diagonal matrix. Then the main results for the predefined-time platoon control of nonlinear UAV systems are presented as follows.
Theorem 2.
The closed-loop system is UUB stable, and the mean square and state errors are converged to an arbitrary small zero neighborhood within a predefined time T under Assumptions 1 and 2 by applying the UAVs model (3) in a platoon under the proposed control input (25) with the adaptive RBFNN and the proposed disturbance observer (19).
Theorem 3.
Under Assumption 1 and by using the proposed control law (25) with the selected parameters, if k τ i K ε t i M a 1 + T e s C ( η ˙ ) M a 1 + T e s μ t i ς Ξ T e s C ( η ˙ ) μ t i ς Ξ M a 1 I n × n is positive, the local control signals of each vehicle are bounded.
The details for the proof of Theorems 2 and 3 are given in Appendix C and Appendix D, respectively.
Calculating the boundary of the control input in the real nonlinear system is crucial. Set Θ i ( 0 ) = 0 and y ( t ) = Θ i ( s ) , and rewrite (A28) with Fourier transform
Y ( j ω ) = 0 y ( t ) e j ω t d t = G ( j ω ) U ( j ω ) ,
where the Fourier transforms of the control input and output are Y ( j ω ) and U ( j ω ) , respectively. G ( j ω ) is the frequency response transfer function.
Based on Parseval’s theorem [45], we have
y L 2 2 = 0 y T ( t ) y ( t ) d t = 1 2 π + Y * ( j ω ) Y ( j ω ) d ω = 1 2 π + U * ( j ω ) G T ( j ω ) G ( j ω ) U ( j ω ) d ω ( sup ω R G ( j ω ) 2 ) 2 1 2 π + U * ( j ω ) U ( j ω ) d ω = ( sup ω R G ( j ω ) 2 ) 2 ϑ ( s ) L 2 2 = λ max ( G T ( j ω ) G ( j ω ) ) ϑ ( s ) L 2 2 ( k τ i K ε t i λ max ( M a 1 ) + T e s λ max ( C ( η ˙ ) M a 1 ) + T e s λ max ( μ t i ς Ξ ) T e s λ max ( C ( η ˙ ) μ t i ς Ξ M a 1 ) I n × n ) ϑ ( s ) L 2 2 .
Remark 6.
The proof of the control input’s boundedness is required to ensure the control input’s acceptability in real-world applications. The control input is inversely proportional to the predefined time, so there will be a minimum convergence time in the actual system. The needed input may surpass the maximum input value of the system when the convergence time is defined as a very short amount, so the system cannot be stable within the predefined time. It is critical to demonstrate that the control input is bounded when the system can be stable within a predefined convergence time.

5. Simulation Results

The simulation results were implemented to demonstrate the effectiveness of the control laws (23) and (25), respectively. The simulation setup and parameters are given in Table 1. In general, the disturbance with i = 1 , 2 , , 5 is given as τ ϖ i = [ s i n ( t ) c o s ( 0.2 t ) + c o s ( 5 t ) , c o s ( 1.2 t ) + s i n ( t ) , s i n ( 0.9 t ) + c o s ( 0.5 t ) , c o s ( 0.3 t ) + s i n ( t ) , s i n ( 3 t ) + c o s ( 6 t ) , c o s ( 5 t ) + s i n ( 0.9 t ) ] T . The uncertainties of the model and the external disturbance are both unknown in the control inputs (23) and (25). The objective under the controllers is to form the platoon with limited communication while avoiding collision and maintaining connectivity between two UAVs. The desired distance between each UAVs is designed as
ϰ i , i 1 = [ 0 , 0 , 0 , 0 , 0 , 0 ] T , i = 1 [ 2 , 0 , 0 , 0 , 0 , 0 ] T , others .

Results and Analysis

In this part, some simulation results for the proposed control schemes are presented. Some existing control methods are also given as comparisons.
1. Simulations for the UAVs platoon without prescribed performance and time constraint
The results of applying the control law in [20] without prescribed performance or a time constraint as a comparison are shown in Figure 2. To see the estimation of the RBFNN weight succinctly, only the weight of the fifth UAV is given in Figure 2d. From Figure 2, it can be seen that, although the platoon of UAVs could be guaranteed by the controller in [20], both the position errors and the angle errors were uncontrolled, that is to say, under the controller in [20], the position errors and the angle errors could not satisfy the expected performance index. It also shows that there was a certain overshoot in the transient response. In addition, although the controller in [20] could deal with the system uncertainty to some extent, the final result shows that the controller could not suppress the external disturbances.
2. Simulations for the UAVs platoon with prescribed performance but without time constraint
The simulation results are shown in this section to evaluate how effective the controller (23) for the UAV system (3) is at avoiding collisions and maintaining connection. Figure 3 shows that the state errors could satisfy the transient and steady state performance constraints, and the system converged within a small neighborhood around zero. The control inputs were bounded under the controller (23), which can be seen in Figure 3c. The estimation of the RBFNN weight of the fifth UAV is given in Figure 3d.
Compared with the results in Figure 2, it can be seen that the overshoot of the system will not exceed the expected limits and could also effectively suppress impacts of the system uncertainties and the external disturbances.
3. Simulations for the UAVs platoon with time constraint but without prescribed performance
To clarify the convergence time constraint, the simulation results are presented under the controller with time constraint but without prescribed performance in Figure 4. The state errors did not evolve within the predefined regions that were bounded by exponentially decaying time functions. But the system could converge at the designed predefined time T = 20 s. Figure 4c shows the bounded control inputs. As stated in Theorem 3, the boundness of the control inputs can be guaranteed even in the presence of the convergence time constraint. The estimation of the RBFNN weight of the fifth UAV is given in Figure 3d.
4. Simulations for the UAVs platoon with time constraints and prescribed performance
In this part, the simulation results for the platoon of UAVs with a convergence time constraint and prescribed performance under the proposed control law (25) are presented. The convergence time was predefined as T = 20 s. As shown in Figure 5, the performance of the closed-loop system satisfied the constraints, and the system could converge in a predefined time. The control inputs are shown in Figure 5c, which are also bounded. The estimation of the RBFNN weight of the fifth UAV is given in Figure 5d.
Compared with the other three groups of simulation results, the state errors were bounded and evolved in the predefined regions. The system was finally converged within a small zero neighborhood within the defined predefined time T = 20 s, which further demonstrates the validity and practicability of the proposed controller.
1 2 ε ^ t i T M i ε ^ t i + 1 2 t r ( W ˜ i T Λ t i 1 W ˜ i ) + 1 2 τ ˜ w i T τ ˜ w i V t ( 0 ) exp ( χ t i t ) + β t i χ t i ,
which means that when t , one obtains ε ^ t i 2 β t i / χ t i , W ˜ i 2 β t i / χ t i , and τ ˜ w i 2 β t i / χ t i .

6. Conclusions

This paper investigated platoon control for multiple UAVs under time constraints and limited communication constraints. The realistic nonlinear system model was applied to describe the dynamics of the UAV. An adaptive disturbance observer created by embedding an RBFNN approximation for the system uncertainties was proposed to estimate the external bounded disturbance. Then, a versatile controller was proposed with a switching dynamic gain. By using the time transformation approach, rigorous proofs were proposed for the closed-loop system in the sense of uniformly ultimate boundedness (UUB). Under the proposed control approach, the platoon of UAVs could be guaranteed within a predefined time independent of initial conditions and system parameters. In order to better describe the UAV system, a higher fidelity model, which includes nondifferentiable external disturbances, measurement noises and unmodeled dynamics, will be considered in future work. In addition, how to achieve predefined-time stabilization of such a complex nonlinear UAV system is also an interesting and meaningful topic.

Author Contributions

Methodology, J.W. and X.L.; writing—review and editing, J.W., X.F. and X.L.; funding acquisition, J.W. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by National Natural Science Foundation of China under Grants 62103352, 62033011, and 62273294, and also supported in part by Hebei Natural Science Foundation under Grant F2023203056.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A. The Auxiliary Results of the System Error

The derivative of the transformed error (10) is
ζ ˙ ( t ) = ξ ( t ) σ ˙ ( t ) = ξ ( t ) Ξ δ ˙ 0 ( t ) ρ ( t ) Ξ δ 0 ( t ) ρ ˙ ( t ) ρ 2 ( t ) = L ( t ) ,
where ξ ( t ) = d i a g ( [ ξ 1 ( t ) , ξ 2 ( t ) , , ξ n ( t ) ] ) , with
ξ i ( t ) = 1 λ 1 ( 1 + H ) ( H + ρ i 1 ( t ) Ξ δ 0 i ( t ) λ 1 ) ( 1 ρ i 1 ( t ) Ξ δ 0 i ( t ) λ 1 ) > 1 ,
and L ( t ) = [ L 1 ( t ) , L 2 ( t ) , , L n ( t ) ] T . Note the fact that Ξ is an L matrix, which can be derived according to Lemma 1 and is used to derive the conclusion ξ i > 1 .
Then, we can obtain the derivative of (A1) as follows:
L ˙ = Ξ ξ ˙ ( t ) ρ 1 ( t ) δ ˙ 0 ( t ) Ξ ξ ˙ ( t ) ρ ˙ ( t ) ρ 2 ( t ) δ ˙ 0 ( t ) + Ξ ξ ( t ) ρ 1 ( t ) δ ¨ 0 ( t ) 2 Ξ ξ ( t ) ρ ˙ ( t ) ρ 2 ( t ) δ ˙ 0 ( t ) Ξ ξ ( t ) ρ ¨ ( t ) ρ 2 ( t ) δ 0 i ( t ) 2 Ξ ξ ( t ) ρ ˙ ( t ) ρ 3 ( t ) δ 0 ( t ) = Ξ ξ ( t ) ρ 1 ( t ) δ ¨ 0 ( t ) + a ( t ) = ς ( t ) Ξ ( η ¨ ( t ) η ¯ ¨ 0 ( t ) ) + a ( t ) ,
where ς ( t ) = d i a g ( [ ς 1 ( t ) , ς 2 ( t ) , , ς n ( t ) ] ) , with
ς i ( t ) = ξ i ( t ) ρ i 1 ( t ) , a ( t ) = Ξ ξ ˙ ( t ) ρ 1 ( t ) δ ˙ 0 ( t ) Ξ ξ ˙ ( t ) ρ ˙ ( t ) ρ 2 ( t ) δ 0 ( t ) Ξ ξ ( t ) ρ ˙ ( t ) ρ 2 ( t ) δ ˙ 0 ( t ) 2 Ξ ξ ( t ) ρ ˙ ( t ) ρ 2 ( t ) δ ˙ 0 ( t ) 2 Ξ ξ ( t ) ρ ˙ ( t ) ρ 3 ( t ) δ 0 ( t ) .
Substituting (3) into (A2), we have
L ˙ i = ς i ( M i 1 ( C i ( η i ˙ ) η i ˙ Z i ( η ˙ ) G ( η ) τ ϖ + τ i ) η ¨ i 1 ) + a i ( t ) = ς i M i 1 τ i + a ^ i ( t ) ,
where a ^ i ( t ) = a i ( t ) ς i M i 1 C i ( η i ˙ ) η i ˙ ς i M i 1 Z i ( η ˙ ) ς i M i 1 G ( η ) ς i M i 1 τ ϖ ς i M i 1 η ¨ i 1 ( t ) .

Appendix B. Proof of Theorem 1

The details of the proof for Theorem 1 are given as follows.
Proof. 
The Lyapunov function is chosen as
V = 1 2 ε i T M i ε i + 1 2 t r ( W ˜ i T Λ i 1 W ˜ i ) + 1 2 τ ˜ w i T τ ˜ w i .
Then, differentiating the Lyapunov function (A4), one obtains
V ˙ = ε i T ( C i ( η ˙ ) η ˙ i W i * S i ( X i ) G ( η ) τ w i + M i μ i L i K ε i ε i + C i ( η ˙ ) η ˙ i + W ^ i S i ( X i ) + τ ^ w i + G ( η ) M i μ i L i ) + ε i T W ˜ i T S i ( X i ) + W ˜ i T M i ε ˙ i + τ ˜ w i T ε i τ ˜ w i T K κ i M i 1 W ˜ i S i ( X i ) + τ ˜ w i T τ ˙ w i τ ˜ w i T K κ i M i 1 τ ˜ w i = ε i T K ε i ε i ε i T W ˜ i S i ( X i ) ε i T τ ˜ w i + ε i T W ˜ i T S i ( X i ) τ ˜ w i K κ i M i 1 W ˜ i T S i ( X i ) + τ ˜ w i T ε i τ ˜ w i T K κ i M i 1 τ ˜ w i + τ ˜ w i T τ ˙ w i W ˜ i T S i ( X i ) W ˜ i W ˜ i T τ ˜ w i W ˜ i T K ε i ε i = ε i T K ε i ε i τ ˜ w i K κ i M i 1 W ˜ i T S i ( X i ) + τ ˜ w i T τ ˙ w i τ ˜ w i T K κ i M i 1 τ ˜ w i W ˜ i T S i ( X i ) W ˜ i W ˜ i T τ ˜ w i W ˜ i T K ε i ε i .
Using Young’s inequality [46], one can obtain
τ ˜ w i K κ i M i 1 W ˜ i T S i ( X i ) W ˜ i T W ˜ i 2 l i + l i τ ˜ w i T τ ˜ w i K κ i M i 1 S i * 2 2 ,
τ ˜ w i T τ ˙ w i l i τ ˜ w i T τ ˜ w i 2 + ( τ w i * ) 2 2 l i ,
W ˜ i T τ ˜ w i W ˜ i T W ˜ i 2 l i + l i τ ˜ w i T τ ˜ w i 2 ,
W ˜ i T K ε i ε i W ˜ i T W ˜ i 2 l i + l i K ε i ε i T ε i 2 ,
where S i S i * . Substituting (A6)–(A9) into (A5), we have
V ˙ ε i T K ε i ε i τ ˜ w i T K κ i M i 1 τ ˜ w i + W ˜ i T W ˜ i 2 l i + l i τ ˜ w i T τ ˜ w i 2 + l i τ ˜ w i T τ ˜ w i K κ i M i 1 S i * 2 2 + ( τ w i * ) 2 2 l i + W ˜ i T W ˜ i 2 l i + l i τ ˜ w i T τ ˜ w i 2 + W ˜ i T W ˜ i 2 l i + l i K ε i ε i T ε i 2 W ˜ i T S i ( X i ) W ˜ i min { 2 λ min ( K ε i l i K ε i 2 ) λ max ( M i ) , 2 λ min ( K κ i M i 1 l i l i K κ i M i 1 S i * 2 2 ) , 2 λ min ( S i ( X i ) 3 2 l i ) λ max ( Λ i 1 ) } V + ( τ w i * ) 2 2 ,
where l i is a positive value. Then, one obtains
V ˙ χ i V + β i ,
where χ i = min { 2 λ min ( K ε i l i K ε i 2 ) λ max ( M i ) , 2 λ min ( K κ i M i 1 l i l i K κ i M i 1 S i * 2 2 ) , 2 λ min ( S i ( X i ) 3 2 l i ) λ max ( Λ i 1 ) } with I τ ˜ w i being an identity matrix, and β i = ( τ w i * ) 2 / 2 . Based on Lemma 5 and (A11), we have
V ( V ( 0 ) β i χ i ) exp ( χ i t ) + β i χ i V ( 0 ) exp ( χ i t ) + β i χ i ,
where V ( 0 ) is the initial value of V. V is uniformly ultimate bounded. Based on (A4), we can obtain that ε i , W ˜ i , and τ ˜ w i are uniformly ultimate bounded. And based on (5), (7), (9), (10), and (11), it is easy to arrive at η ˙ being bounded. So, consider the set Ω { ( ε i T 2 + W ˜ i T 2 + τ ˜ w i 2 ) 2 ι } with constant ι > 0 . It is clear that choosing χ i > β i ι ; then, V ˙ 0 on V = ι . Therefore, V ι is an invariant set, i.e., if V ( 0 ) ι , V ( t ) ι , t > 0 .
Substituting (A4) into (A12), we obtain
1 2 ε i T M i ε i + 1 2 t r ( W ˜ i T Λ i 1 W ˜ i ) + 1 2 τ ˜ w i T τ ˜ w i V ( 0 ) exp ( χ i t ) + β i χ i ,
which means that when t , one can obtain ε i 2 β i / χ i , W ˜ i 2 β i / χ i , and τ ˜ w i 2 β i / χ i .
Based on all of the above, we have that the errors ε i , W ˜ i , and τ ˜ w i converge to a small set 2 β i / χ i , and it can be seen that 2 β i / χ i depends on the choice of parameters to ensure that the upper bounded ε i , W ˜ i , and τ ˜ w i tend to small. □

Appendix C. Proof of Theorem 2

The details of the proof for Theorem 2 are given as follows.
Proof. 
Differentiating the lumped state error ε t i , we have
M i ε ˙ t i = τ t i C i ( η ˙ ) η ˙ i W i * S i ( X i ) G ( η ) τ w i + M i μ i L i .
Substituting the control input (25) into (A14), we have
M i ε ˙ t i = Γ τ i K ε t i ε t i W ˜ i S i ( X i ) τ ˜ w i .
By using the time transformation method and by letting t = θ ( s ) and ε ^ t i ( s ) = ε t i ( t ) , we have
M i ε ^ ˙ t i = θ ˙ ( s ) ( Γ τ i K ε t i ε ^ t i W ˜ i S i ( X i ) τ ˜ w i ) = k τ i K ε t i ε ^ t i T e s W ˜ i S i ( X i ) T e s τ ˜ w i .
Let W ˜ i ( s ) = W ˜ i ( t ) , and τ ˜ w i ( s ) = τ ˜ w i ( t ) ; then, the Lyapunov function is defined as
V t = 1 2 ε t i T M i ε t i + 1 2 t r ( W ˜ i T Λ t i 1 W ˜ i ) + 1 2 τ ˜ w i T τ ˜ w i .
Differentiating the Lyapunov function (A17), we obtain
V ˙ t = ε ^ t i T k τ i K ε t i ε ^ t i T e s ε ^ t i T W ˜ i S i ( X i ) T e s ε ^ t i T τ ˜ w i + T e s W ˜ i T ε ^ t i T S i ( X i ) + T e s τ ˜ w i T τ ˙ w i + T e s τ ˜ w i T ε ^ t i T e s K κ t i M i 1 τ ˜ w i T W ˜ i S i ( X i ) T e s W ˜ i T τ ˜ w i T e s τ ˜ w i T K κ t i M i 1 τ ˜ w i T e s W ˜ i T S i ( X i ) W ˜ i W ˜ i T k τ i K ε t i ε ^ t i = ε ^ t i T k τ i K ε t i ε ^ t i T e s τ ˜ w i T K κ t i M i 1 τ ˜ w i T e s W ˜ i T S i ( X i ) W ˜ i + T e s τ ˜ w i T τ ˙ w i T e s W ˜ i T τ ˜ w i T e s K κ t i M i 1 τ ˜ w i T W ˜ i S i ( X i ) W ˜ i T k τ i K ε t i ε ^ t i .
By using the Young’s inequality [46], we have
K κ t i M i 1 τ ˜ w i T W ˜ i S i ( X i ) W ˜ i T W ˜ i 2 l i + l i τ ˜ w i T τ ˜ w i K κ t i M i 1 S i * ( X i ) 2 2 ,
τ ˜ w i T τ ˙ w i l i τ ˜ w i T τ ˜ w i 2 + ( τ w i * ) 2 2 l i ,
W ˜ i T τ ˜ w i W ˜ i T W ˜ i 2 l i + l i τ ˜ w i T τ ˜ w i 2 ,
W ˜ i T K ε t i ε ^ t i W ˜ i T W ˜ i 2 l i + l i k τ i 2 K ε i 2 ε ^ t i T ε ^ t i 2 ,
where S i S i * , and τ w i * denotes the upper bound of τ ˙ w i . Substituting (A19)–(A22) into (A18), one can obtain
V ˙ t ε ^ t i T k τ i K ε t i ε ^ t i + T e s l i τ ˜ w i T τ ˜ w i K κ t i M i 1 S i * 2 2 T e s τ ˜ w i T K κ t i M i 1 τ ˜ w i + T e s W ˜ i T W ˜ i 2 l i + T e s l i τ ˜ w i T τ ˜ w i 2 + T e s ( τ w i * ) 2 2 l i T e s W ˜ i T S i ( X i ) W ˜ i + T e s W ˜ i T W ˜ i 2 l i + T e s l i τ ˜ w i T τ ˜ w i 2 + T e s W ˜ i T W ˜ i 2 l i + l i k τ i 2 K ε i 2 ε ^ t i T ε ^ t i 2 min { 2 λ min ( k τ i K ε t i l i k τ i 2 K ε i 2 2 ) λ max ( M i ) , 2 λ min ( T e s l i + T e s K κ t i M i 1 T e s l i K κ t i M i 1 S i * 2 2 ) , 2 λ min ( T e s S i ( X i ) 3 T e s 2 l i ) λ max ( Λ t i 1 ) } V + T e s ( τ w i * ) 2 2 l i .
Then, (A23) can be written as
V ˙ t χ t i V t + β t i ,
where
χ t i = min { 2 λ min ( k τ i K ε t i l i k τ i 2 K ε i 2 2 ) λ max ( M i ) , 2 λ min ( T e s l i + T e s K κ t i M i 1 T e s l i K κ t i M i 1 S i * 2 2 ) , 2 λ min ( T e s S i ( X i ) 3 T e s 2 l i ) λ max ( Λ t i 1 ) } , β t i = T e s ( τ w i * ) 2 2 l i .
Based on Lemma 5 and (A24), we have
V t ( V t ( 0 ) β t i χ t i ) exp ( χ t i t ) + β t i χ t i V t ( 0 ) exp ( χ t i t ) + β t i χ t i ,
where V t ( 0 ) is the initial value of V t . Then, V t is uniformly ultimate bounded. Based on (A17), we can obtain that ε ^ t i , W ˜ i , and τ ˜ w i are uniformly ultimate bounded. And based on (5), (7), (9), (10), and (11), it is easy to obtain η ˙ as bounded. So, consider the set Ω { ( ε ^ t i T 2 + W ˜ i T 2 + τ ˜ w i 2 ) 2 ι t } with constant ι t > 0 . It is clear that when choosing χ t i > β t i ι t , then V ˙ t 0 when V t = ι t . So, V t ι t is an invariant set, since V t ( 0 ) ι t , V t ( t ) ι t , and t > 0 .
Substituting (A17) into (A25), we obtain W ˜ i and τ ˜ w i to converge to a small set 2 β t i / χ t i , and 2 β t i / χ t i depends on the choice of parameters to ensure that the upper bounds of ε t i , W ˜ i , and τ ˜ w i tend to small. Now the proof is completed. □

Appendix D. Proof of Theorem 3

The details of the proof for Theorem 3 are given as follows.
Proof. 
Differentiating the controller (25), we have
τ ˙ t i = Γ ˙ τ i K ε t i ε t i + Γ τ i K ε t i M i 1 C i ( η ˙ i ) η ˙ i + Γ τ i K ε t i M i 1 W i * S i ( X i ) + Γ τ i K ε t i M i 1 G i ( η ) + Γ τ i K ε t i M i 1 τ w i Γ τ i K ε t i M i 1 τ t i Γ τ i K ε t i μ t i L i M i μ i L ˙ i + C i ( η ˙ ) μ i L ˙ i + C i 2 ( η ˙ ) M i 1 η ˙ i + C i ( η ˙ ) M i 1 W i * S i ( X i ) + C i ( η ˙ ) M i 1 G i ( η ) + C i ( η ˙ ) M i 1 τ w i C i ( η ˙ ) M i 1 τ t i C i ( η ˙ ) μ t i L i + W ^ ˙ i S i ( X i ) + W ^ i S ˙ i ( X i ) ε t i K κ t i M i 1 C i ( η ˙ ) η ˙ i K κ t i M i 1 W ^ i S i ( X i ) K κ t i M i 1 G ( η ) K κ t i M i 1 τ ^ w i + K κ t i M i 1 τ t i + K κ t i μ t i L i + K κ t i M i 1 C i ( η ˙ i ) η ˙ i + K κ t i M i 1 W i * S i ( X i ) + K κ t i M i 1 G i ( η ) + K κ t i M i 1 τ w i K κ t i M i 1 τ t i K κ t i μ t i L i = Γ ˙ τ i K ε t i ε t i + Γ τ i K ε t i M i 1 C i ( η ˙ i ) η ˙ i + Γ τ i K ε t i M i 1 W i * S i ( X i ) + Γ τ i K ε t i M i 1 G i ( η ) + Γ τ i K ε t i M i 1 τ w i Γ τ i K ε t i M i 1 τ t i Γ τ i K ε t i μ t i L i M i μ i L ˙ i + C i ( η ˙ ) μ i L ˙ i + C i 2 ( η ˙ ) M i 1 η ˙ i + C i ( η ˙ ) M i 1 W i * S i ( X i ) + C i ( η ˙ ) M i 1 G i ( η ) + C i ( η ˙ ) M i 1 τ w i C i ( η ˙ ) M i 1 τ t i C i ( η ˙ ) μ t i L i + W ^ ˙ i S i ( X i ) + W ^ i S ˙ i ( X i ) ε t i + K κ t i M i 1 W ˜ i S i ( X i ) + K κ t i M i 1 τ ˜ w i .
According to [47], we only consider the case of t < T . Then, the control input is written as a matrix, and, by substituting (A26) into it, we obtain
τ ˙ t = k τ i ( T t ) 2 K ε t i ε t + k τ i T t K ε t i M a 1 C ( η ˙ ) η ˙ + k τ i T t K ε t i M a 1 W * S ( X ) k τ i T t K ε t i M a 1 τ t + k τ i T t K ε t i M a 1 τ w + k τ i T t K ε t i M a 1 G g ( η ) k τ i T t K ε t i μ t i L M a μ ( ς Ξ M a 1 τ t + a ^ ( t ) ) + C ( η ˙ ) μ t i ( ς Ξ M a 1 τ t + a ^ ( t ) ) + C T ( η ˙ ) C ( η ˙ ) M a 1 η ˙ + C ( η ˙ ) M a 1 W * S ( X ) + C ( η ˙ ) M a 1 G g ( η ) + C ( η ˙ ) M a 1 τ w C ( η ˙ ) M a 1 τ t C ( η ˙ ) μ t i L S T ( X ) S ( X ) Λ t ε t k τ i T t K ε t i S ^ ( X ) Λ t ε t S T ( X ) S ( X ) W ˜ Λ t S ^ ( X ) Λ t τ ˜ w + W ^ S ˙ ( X ) + K κ t M a 1 W ˜ S ( X ) ε t + K κ t M a 1 τ ˜ w = k τ i T t K ε t i M a 1 τ t C ( η ˙ ) M a 1 τ t μ t i ς Ξ τ t + C ( η ˙ ) μ t i ς Ξ M a 1 τ t + 1 T t τ t + P ( t ) ,
where ε t = [ ε t 1 , ε t 2 , , ε t n ] T , M a = d i a g ( [ M 1 , M 2 , M n ] ) , C = d i a g ( [ C 1 , C 2 , C n ] ) , η ˙ = [ η ˙ 1 , η ˙ 2 , , η ˙ n ] T , W * = d i a g ( [ W 1 * , W 2 * , , W n * ] ) , a ^ = [ a ^ 1 , a ^ 2 , , a ^ n ] T , τ w = [ τ w 1 , τ w 2 , , τ w n ] T , G g ( η ) = [ G ( η ) , G ( η ) , , G ( η ) ] T , τ w = [ τ w 1 , τ w 2 , , τ w n ] T , Λ t = d i a g ( [ Λ t 1 , Λ t 2 , , Λ t n ] ) , W ˜ = d i a g ( [ W ˜ 1 , W ˜ 2 , , W ˜ n ] ) , S ^ = d i a g ( [ S 1 ( X ) , S 2 ( X ) , , S n ( X ) ] ) , τ ˜ w = [ τ ˜ w 1 , τ ˜ w 2 , , τ ˜ w n ] T , and
P ( t ) = 1 ( T t ) ( M a μ t i L C ( η ˙ ) η ˙ W ^ S ( X ) τ ^ w G g ( η ) ) + k τ i T t K ε t i M a 1 C ( η ˙ ) η ˙ + k τ i T t K ε t i M a 1 G g ( η ) + k τ i T t K ε t i M a 1 W * S ( X ) + k τ i T t K ε t i M a 1 τ w k τ i T t K ε t i μ t i L M a μ t i a ^ ( t ) + C T ( η ˙ ) C ( η ˙ ) M a 1 η ˙ + C ( η ˙ ) μ t i a ^ ( t ) + C ( η ˙ ) M a 1 W * S ( X ) C ( η ˙ ) μ t i L + C ( η ˙ ) M a 1 τ w + C ( η ˙ ) M a 1 G g ( η ) S ^ ( X ) Λ t τ ˜ w S T ( X ) S ( X ) Λ t ε t k τ i T t K ε t i S ^ ( X ) Λ t ε t ε t S T ( X ) S ( X ) W ˜ Λ t + W ^ S ˙ ( X ) + K κ t M a 1 τ ˜ w + K κ t M a 1 W ˜ S ( X ) .
Based on Lemma 3 and that Υ ( t ) is the solution of (A27) where t = θ ( s ) , thus Θ ( s ) = Υ ( t ) . Then, (A27) can be written as
Θ ˙ ( s ) = θ ˙ ( s ) ( k τ i T T ( 1 e s ) K ε t i M a 1 Θ ( s ) + 1 T T ( 1 e s ) Λ t Θ ( s ) C ( η ˙ ) M a 1 Θ ( s ) μ t i ς Ξ Θ ( s ) + C ( η ˙ ) μ t i ς Ξ M a 1 Θ ( s ) ) + P ^ ( s ) = k τ i K ε t i M a 1 Θ ( s ) T e s C ( η ˙ ) M a 1 Θ ( s ) T e s μ t i ς Ξ Θ ( s ) + T e s C ( η ˙ ) μ t i ς Ξ M a 1 Θ ( s ) + Θ ( s ) + P ^ ( s ) ,
where
P ^ ( s ) = M a μ t i L + T e s k τ i K ε t i M a 1 C ( η ˙ ) η ˙ ( s ) T e s C ( η ˙ ) η ˙ ( s ) + k τ i K ε t i M a 1 W * S ( X ) k τ i K ε t i S ^ ( X ) Λ t ε t + k τ i K ε t i M a 1 τ w k τ i K ε t i μ t i L τ ^ w G g ( η ) + k τ i K ε t i M a 1 G g ( η ) W ^ S ( X ) T e s ε t + T e 2 s C T ( η ˙ ) C ( η ˙ ) M a 1 η ˙ + T e s C ( η ˙ ) M a 1 G g ( η ) + T e s C ( η ˙ ) μ t i a ^ ( s ) + T e s K κ t i M a 1 W ˜ S ( X ) T e s C ( η ˙ ) μ t i L + T e s C ( η ˙ ) M a 1 W * S ( X ) T e s S T ( X ) S ( X ) Λ t ε t T T e s S T ( X ) S ( X ) W ˜ Λ t + T e s K κ t i M a 1 τ ˜ w + T e s C ( η ˙ ) M a 1 τ w + T e s W ^ S ˙ ( X ) T e s S ^ ( X ) Λ t τ ˜ w T e s M a μ t i a ^ ( t ) .
Based on the previous proof, we can obtain
lim s P ^ ( s ) = M a μ t i L + k τ i K ε t i M a 1 W * S ( X ) τ ^ w G g ( η ) + k τ i K ε t i M a 1 τ w k τ i K ε t i S ^ ( X ) Λ t ε t W ^ S ( X ) + k τ i K ε t i M a 1 G g ( η ) = P ´ ( s ) .
Based on the previous proof, P ´ ( s ) is bounded. So, Θ ( τ ) is a bounded solution of (A28) for τ 0 , [48] if ( k τ i K ε t i M a 1 + T e s C ( η ˙ ) M a 1 + T e s μ t i ς Ξ T e s C ( η ˙ ) μ t i ς Ξ M a 1 I n × n ) is Hurwitz. □

References

  1. Barakou, S.C.; Tzafestas, C.S.; Valavanis, K.P. A Review of Real-Time Implementable Cooperative Aerial Manipulation Systems. Drones 2024, 8, 196. [Google Scholar] [CrossRef]
  2. Wu, Q.; Zhu, Q. Prescribed Performance Fault-Tolerant Attitude Tracking Control for UAV with Actuator Faults. Drones 2024, 8, 204. [Google Scholar] [CrossRef]
  3. Qin, J.; Ma, Q.; Shi, Y.; Wang, L. Recent advances in consensus of multi-agent systems: A brief survey. IEEE Trans. Ind. Electron. 2016, 64, 4972–4983. [Google Scholar] [CrossRef]
  4. Zhang, D.; Feng, G.; Shi, Y.; Srinivasan, D. Physical safety and cyber security analysis of multi-agent systems: A survey of recent advances. IEEE/CAA J. Autom. Sin. 2021, 8, 319–333. [Google Scholar] [CrossRef]
  5. Ding, C.; Zhang, Z.; Zhang, J. Dynamics Event-Triggered-Based Time-Varying Bearing Formation Control for UAVs. Drones 2024, 8, 185. [Google Scholar] [CrossRef]
  6. Chen, M.; Hu, Q.; Mackin, C.; Fisac, J.F.; Tomlin, C.J. Safe platooning of unmanned aerial vehicles via reachability. In Proceedings of the 2015 54th IEEE Conference on Decision and Control (CDC), Osaka, Japan, 15–18 December 2015; pp. 4695–4701. [Google Scholar]
  7. Fang, X.; Xie, L.; Li, X. Distributed localization in dynamic networks via complex laplacian. Automatica 2023, 151, 110915. [Google Scholar] [CrossRef]
  8. Li, X.; Wen, C.; Chen, C. Adaptive formation control of networked robotic systems with bearing-only measurements. IEEE Trans. Cybern. 2020, 51, 199–209. [Google Scholar] [CrossRef] [PubMed]
  9. Fang, X.; Xie, L.; Li, X. Integrated relative-measurement-based network localization and formation maneuver control. IEEE Trans. Autom. Control 2023, 69, 1906–1913. [Google Scholar] [CrossRef]
  10. Liu, C.; Li, H.; Shi, Y. A unitary distributed subgradient method for multi-agent optimization with different coupling sources. Automatica 2020, 114, 108834. [Google Scholar] [CrossRef]
  11. Verginis, C.K.; Bechlioulis, C.P.; Dimarogonas, D.V.; Kyriakopoulos, K.J. Robust Distributed Control Protocols for Large Vehicular Platoons With Prescribed Transient and Steady-State Performance. IEEE Trans. Control Syst. Technol. 2018, 26, 299–304. [Google Scholar] [CrossRef]
  12. Liu, Y.; Pan, C.; Gao, H.; Guo, G. Cooperative Spacing Control for Interconnected Vehicle Systems With Input Delays. IEEE Trans. Veh. Technol. 2017, 66, 10692–10704. [Google Scholar] [CrossRef]
  13. Ploeg, J.; Wouw, N.V.D.; Nijmeijer, H. Lp String Stability of Cascaded Systems: Application to Vehicle Platooning. IEEE Trans. Control Syst. Technol. 2014, 22, 786–793. [Google Scholar] [CrossRef]
  14. Liu, C.; Li, H.; Shi, Y. Resource-aware exact decentralized optimization using event-triggered broadcasting. IEEE Trans. Autom. Control 2020, 66, 2961–2974. [Google Scholar] [CrossRef]
  15. Fang, X.; Xie, L. Distributed Formation Maneuver Control Using Complex Laplacian. IEEE Trans. Autom. Control 2023, 69, 1850–1857. [Google Scholar] [CrossRef]
  16. Guo, L.; Liu, W.; Li, L.; Xu, J.; Zhang, K.; Zhang, Y. Fast Finite-Time Super-Twisting Sliding Mode Control with an Extended State Higher-Order Sliding Mode Observer for UUV Trajectory Tracking. Drones 2024, 8, 41. [Google Scholar] [CrossRef]
  17. Yang, Y.; Ge, C.; Wang, H.; Li, X.; Hua, C. Adaptive neural network based prescribed performance control for teleoperation system under input saturation. J. Frankl. Inst. 2015, 352, 1850–1866. [Google Scholar] [CrossRef]
  18. Zheng, R.; Zhu, Q.; Huang, S.; Du, Z.; Shi, J.; Lyu, Y. Extended State Observer-Based Sliding-Mode Control for Aircraft in Tight Formation Considering Wake Vortices and Uncertainty. Drones 2024, 8, 165. [Google Scholar] [CrossRef]
  19. Ruan, X.; Feng, J.; Xu, C.; Wang, J. Observer-Based Dynamic Event-Triggered Strategies for Leader-Following Consensus of Multi-Agent Systems With Disturbances. IEEE Trans. Netw. Sci. Eng. 2020, 7, 3148–3158. [Google Scholar] [CrossRef]
  20. Guo, X.; Wang, J.; Liao, F.; Teo, R. Distributed Adaptive Sliding Mode Control Strategy for Vehicle-Following Systems with Nonlinear Acceleration Uncertainties. IEEE Trans. Veh. Technol. 2017, 66, 981–991. [Google Scholar] [CrossRef]
  21. Guo, X.; Wang, J.; Liao, F.; Teo, R.S.H. CNN-Based Distributed Adaptive Control for Vehicle-Following Platoon With Input Saturation. IEEE Trans. Intell. Transp. Syst. 2017, 19, 3121–3132. [Google Scholar] [CrossRef]
  22. Liu, Y.; Yao, D.; Li, H.; Lu, R. Distributed cooperative compound tracking control for a platoon of vehicles with adaptive NN. IEEE Trans. Cybern. 2021, 99, 7039–7048. [Google Scholar] [CrossRef]
  23. Zhang, Y.; Cortes, J. Characterizing Tolerable Disturbances for Transient-State Safety in Power Networks. IEEE Trans. Netw. Sci. Eng. 2019, 6, 210–224. [Google Scholar] [CrossRef]
  24. Koksal, N.; An, H.; Fidan, B. Backstepping-based adaptive control of a quadrotor UAV with guaranteed tracking performance. ISA Trans. 2020, 105, 98–110. [Google Scholar] [CrossRef] [PubMed]
  25. Dai, S.L.; He, S.; Chen, X.; Jin, X. Adaptive leader–follower formation control of nonholonomic mobile robots with prescribed transient and steady-state performance. IEEE Trans. Ind. Inform. 2019, 16, 3662–3671. [Google Scholar] [CrossRef]
  26. He, S.; Wang, M.; Dai, S.L.; Luo, F. Leader–follower formation control of USVs with prescribed performance and collision avoidance. IEEE Trans. Ind. Inform. 2018, 15, 572–581. [Google Scholar] [CrossRef]
  27. Jin, X.; Du, W.; He, W.; Kocarev, L.; Tang, Y.; Kurths, J. Twisting-Based Finite-Time Consensus for Euler-Lagrange Systems With an Event-Triggered Strategy. IEEE Trans. Netw. Sci. Eng. 2020, 7, 1007–1018. [Google Scholar] [CrossRef]
  28. Shi, X.; Cao, J.; Wen, G.; Yu, X. Finite-Time Stability for Network Systems With Nonlinear Protocols Over Signed Digraphs. IEEE Trans. Netw. Sci. Eng. 2020, 7, 1557–1569. [Google Scholar] [CrossRef]
  29. Liu, X.; Lam, J.; Yu, W.; Chen, G. Finite-Time Consensus of Multiagent Systems With a Switching Protocol. IEEE Trans. Neural Netw. Learn. Syst. 2016, 27, 853–862. [Google Scholar] [CrossRef]
  30. Wang, J.L.; Wang, Q.; Wu, H.N.; Huang, T. Finite-Time Consensus and Finite-Time H Consensus of Multi-Agent Systems Under Directed Topology. IEEE Trans. Netw. Sci. Eng. 2020, 7, 1619–1632. [Google Scholar] [CrossRef]
  31. Hwang, C.; Hung, J.Y. Stratified Adaptive Finite-Time Tracking Control for Nonlinear Uncertain Generalized Vehicle Systems and Its Application. IEEE Trans. Control Syst. Technol. 2018, PP, 1–9. [Google Scholar] [CrossRef]
  32. Huang, X.; Lin, W.; Yang, B. Global finite-time stabilization of a class of uncertain nonlinear Systems. Automatica 2005, 41, 881–888. [Google Scholar] [CrossRef]
  33. Huang, J.; Wen, C.; Wei, W.; Song, Y. Adaptive finite-time consensus control of a group of uncertain nonlinear mechanical systems. Automatica 2015, 51, 292–301. [Google Scholar] [CrossRef]
  34. Ploeg, J.; Shukla, D.P.; Wouw, N.V.D.; Nijmeijer, H. Controller Synthesis for String Stability of Vehicle Platoons. IEEE Trans. Intell. Transp. Syst. 2014, 15, 854–865. [Google Scholar] [CrossRef]
  35. Ghasemi, A.; Kazemi, R.; Azadi, S. Stable Decentralized Control of a Platoon of Vehicles With Heterogeneous Information Feedback. IEEE Trans. Veh. Technol. 2013, 62, 4299–4308. [Google Scholar] [CrossRef]
  36. Wang, J.; Luo, X.; Wong, W.C.; Guan, X. Specified-time Vehicular Platoon Control with Flexible Safe Distance Constraint. IEEE Trans. Veh. Technol. 2019, 68, 10489–10503. [Google Scholar] [CrossRef]
  37. Li, Y.; Tang, C.; Li, K.; Peeta, S.; He, X.; Wang, Y. Nonlinear finite-time consensus-based connected vehicle platoon control under fixed and switching communication topologies. Transp. Res. Part C Emerg. Technol. 2018, 93, 525–543. [Google Scholar] [CrossRef]
  38. Yang, Y.; Hua, C.; Guan, X. Finite Time Control Design for Bilateral Teleoperation System With Position Synchronization Error Constrained. IEEE Trans. Cybern. 2016, 46, 609–619. [Google Scholar] [CrossRef] [PubMed]
  39. Dai, S.L.; He, S.; Lin, H.; Wang, C. Platoon formation control with prescribed performance guarantees for USVs. IEEE Trans. Ind. Electron. 2017, 65, 4237–4246. [Google Scholar] [CrossRef]
  40. Plemmons, R.J. M-matrix characterizations.I-nonsingular M-matrices. Linear Algebra Appl. 1977, 18, 175–188. [Google Scholar] [CrossRef]
  41. Benner, P.; Findeisen, R.; Flockerzi, D.; Reichl, U.; Kai, S. Large-Scale Networks in Engineering and Life Sciences; Springer: Berlin/Heidelberg, Germany, 2014; pp. 362–367. [Google Scholar]
  42. Slotine, J.J.; Li, W. Applied Nonlinear Control; China Machine Press: Beijing, China, 1991. [Google Scholar]
  43. Lewis, F.W.; Jagannathan, S.; Yesildirak, A. Neural Network Control of Robot Manipulators and Non-Linear Systems; CRC Press: Boca Raton, FL, USA, 1998. [Google Scholar]
  44. Chen, C.; Lewis, F.L.; Xie, S.; Modares, H.; Liu, Z.; Zuo, S.; Davoudi, A. Resilient adaptive and H controls of multi-agent systems under sensor and actuator faults. Automatica 2019, 102, 19–26. [Google Scholar] [CrossRef]
  45. Hardy, G.H.; Littlewood, J.E. Notes on the Theory of Series (V): On Parseval’s Theorem. Proc. Lond. Math. Soc. 1927, 2, 287–294. [Google Scholar] [CrossRef]
  46. Wong, F.H.; Yeh, C.C.; Yu, S.L.; Hong, C.H. Young’s inequality and related results on time scales. Appl. Math. Lett. 2005, 18, 983–988. [Google Scholar] [CrossRef]
  47. Wang, J.; Luo, X.; Li, X.; Guan, X. Specified-time bearing-based formation control of multi-agent systems via a dynamic gain approach. J. Frankl. Inst. 2018, 355, 8619–8641. [Google Scholar] [CrossRef]
  48. Akhtar, A.; Nielsen, C.; Waslander, S.L. Path following using dynamic transverse feedback linearization for car-like robots. IEEE Trans. Robot. 2015, 31, 269–279. [Google Scholar] [CrossRef]
Figure 1. The control scheme of the proposed controller in (23).
Figure 1. The control scheme of the proposed controller in (23).
Drones 08 00263 g001
Figure 2. Platoon control of UAVs under the controller in [20].
Figure 2. Platoon control of UAVs under the controller in [20].
Drones 08 00263 g002
Figure 3. Platoon control of UAVs under the controller (23).
Figure 3. Platoon control of UAVs under the controller (23).
Drones 08 00263 g003
Figure 4. Platoon control of UAVs under the controller with time constraint and without prescribed performance.
Figure 4. Platoon control of UAVs under the controller with time constraint and without prescribed performance.
Drones 08 00263 g004
Figure 5. The result under the controller (25).
Figure 5. The result under the controller (25).
Drones 08 00263 g005
Table 1. The simulation setup and parameters.
Table 1. The simulation setup and parameters.
NameParametersSetup
UAV numberN5
UAV mass M i 5kg
Desired reference η 0 [ 0.2 π , 0.3 π , 0.1 π , 0.6 , 0.3 , 0.5 ] T
Initial states η i ( 0 ) [ 0 , 0 , 0 , 0 , 0 , 0 ] T
Safety distance ϰ a 0.05m
Communication distance ϰ c 10m
Control gain k τ i 12
Performance parameters ϱ 0.05
l0.2
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

Wang, J.; Fang, X.; Li, X. Predefined-Time Platoon Control of Unmanned Aerial Vehicle with Range-Limited Communication. Drones 2024, 8, 263. https://doi.org/10.3390/drones8060263

AMA Style

Wang J, Fang X, Li X. Predefined-Time Platoon Control of Unmanned Aerial Vehicle with Range-Limited Communication. Drones. 2024; 8(6):263. https://doi.org/10.3390/drones8060263

Chicago/Turabian Style

Wang, Jiange, Xu Fang, and Xiaolei Li. 2024. "Predefined-Time Platoon Control of Unmanned Aerial Vehicle with Range-Limited Communication" Drones 8, no. 6: 263. https://doi.org/10.3390/drones8060263

APA Style

Wang, J., Fang, X., & Li, X. (2024). Predefined-Time Platoon Control of Unmanned Aerial Vehicle with Range-Limited Communication. Drones, 8(6), 263. https://doi.org/10.3390/drones8060263

Article Metrics

Back to TopTop