Next Article in Journal
Analysis of Phenolic Compounds in Food by Coulometric Array Detector: A Review
Previous Article in Journal
Review of State-of-the-Art FPGA Applications in IoT Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Target Enclosing and Coverage Control for Quadrotors with Constraints and Time-Varying Delays: A Neural Adaptive Fault-Tolerant Formation Control Approach

1
School of Aeronautic Science and Engineering, Beihang University, Beijing 100191, China
2
Institute of Unmanned System, Beihang University, Beijing 100191, China
*
Author to whom correspondence should be addressed.
Sensors 2022, 22(19), 7497; https://doi.org/10.3390/s22197497
Submission received: 27 August 2022 / Revised: 22 September 2022 / Accepted: 27 September 2022 / Published: 2 October 2022
(This article belongs to the Section Fault Diagnosis & Sensors)

Abstract

:
This paper investigates the problem of formation fault-tolerant control of multiple quadrotors (QRs) for a mobile sensing oriented application. The QRs subject to faults, input saturation and time-varying delays can be controlled to perform a target-enclosing and covering task while guaranteeing the state constraints will not be exceeded. A distributed formation control scheme is proposed, using a radial basis function neural network (RBFNN)-based time-delay position controller and an adaptive fault-tolerant attitude controller. The Lyapunov–Krasovskii approach is used to analyze the time-varying delay. Barrier Lyapunov function is deployed to handle the prescribed constraints, and an auxiliary system combined with a command filter is designed to resolve the saturation problem. An RBFNN and adaptive estimators are deployed to provide estimates of disturbances, fault signals and uncertainties. It is proven that all the closed-loop signals are bounded under the proposed protocol, while the prescribed constraints will not be violated, which enhances the flight safety and QR formation’s applicability. Comparative simulations based on application scenarios further verify the effectiveness of the proposed method.

1. Introduction

Formation control technology, which is based on the theory of multi-agent systems (MAS), enables multiple unmanned aerial vehicles (UAVs) to efficiently complete a shared task and is widely used in aerial mapping, atmospheric environment monitoring and even coordinated military missions [1,2,3].
As a typical small-scale UAV, quadrotor (QR) is qualified to be a formation platform for a variety of applications due to its simple structure, strong maneuverability and hovering capability [4], particularly for mobile sensing tasks, such as target-enclosing and covering, which have been studied by several works so far. The main purpose of the former was to control several mobile sensors to rotate around or above a detected target to obtain detailed information from all angles [5,6,7]. The objective of the latter was to optimize the deployment location of multiple sensors to achieve effective coverage of the interest area, where the methods are mainly Voronoi partitioning-based [8,9], coverage cost function-based [10], K-means-based [11] and reinforcement learning-based [12]. However, these methods cannot be directly applied to small-scale aerial platforms due to the contradiction between the complex location optimization algorithms and limited computing resources. In this paper, a consensus-based formation controller was designed. The UAV’s movement and placement can be directly and flexibly set by time-varying formation functions and virtual leader trajectory, which ensures that the mobile sensing task, including the above two, can be performed when the formation tracking is realized by QR members.
With the expansion of formation technology applications, formation operation reliability has become more prominent, with the fault-tolerant control (FTC) being one of the most important factors. Due to the possibility of a topological chain reaction [13,14], a formation composed of multiple interconnected individuals is more susceptible to malfunction effects than a single system. In recent years, formation FTC has garnered considerable interest, and typical methods can be categorized as either active or passive. In the active FTC design, actuator faults are diagnosed, and parameters can be reconfigured online to achieve the desired performance [15]. An iterative learning observer-based reconstructive-FTC protocol for spacecraft formation was designed in [16]. A reinforcement learning-based data-driven active FTC method for multiple QRs was studied in [17]. However, active FTC approaches are also difficult to implement with small UAVs due to their complexity and high computational requirements. In contrast, the passive FTC requires less computational power due to its algorithm’s simplicity [18,19]. The actuator fault effect for multiple aircraft is addressed in [20] using an adaptive H scheme. A projection-based adaptive FTC protocol was proposed in [21] for a group of UAV formation systems. In [22], a sliding mode-based adaptive FTC scheme for a heterogeneous MAS is presented. Taking into account the limited computing resources of QRs, the adaptive FTC method is adopted in this paper, which is one of the state-of-the-art FTC methods.
Even though UAV formation FTC has made significant progress, there are still problems, obstacles and limitations to its practical application. The fact that practical engineering systems have limitations is one of them. On the one hand, due to the hardware’s physical limitations, the control forces and torques generated by UAV actuators are naturally constrained, also known as the saturation phenomenon, which may result in a decline in performance [23]. In [24], anti-windup compensators are employed against input saturations of a linear MAS. In [25], an auxiliary dynamic system is introduced to address the saturation problem for multiple UAVs. On the other hand, due to safe operation or system-specific requirements, certain UAV system states must be constrained. For example, Some sensor payloads that directly attached to the UAV frame require that the UAV’s attitude angular velocity be constrained within the sensor’s allowed range, and the pan-tilt-zoom (PTZ) system used to stabilize optical sensors also has constraint requirements on UAV’s attitude states [26]. Such consideration is crucial, particularly when actuator faults exist and may result in constraints being violated. According to [27], the associated state constraint problem for a second-order MAS was resolved using a combination of the barrier function and sliding mode control technique. According to [28], motion and visibility constraint problems for multiple robots were resolved by planning a feasible trajectory. By employing performance function and error transformation, Ref. [29] solved the field of view constraint problem for mobile robots formation. However, without modifying the control structure, the methods in [27,28,29] cannot be applied to unconstrained scenarios. Moreover, the aforementioned two types of constraints are typically studied separately and have never been investigated simultaneously in the formation FTC domain.
In addition, due to the formation network’s limited communication capabilities, time delays are unavoidable, which may reduce system performance [30,31]. Based on LMIs theory, Ref. [32] solved the equality communication time delay problem for a group of UAVs. By developing the Lyapunov–Krasovskii (L–K) function, Ref. [33] addressed time-varying delay problem for a 2nd-order MAS. By applying generalized Halanay inequality, Ref. [34] investigated the formation tracking control of 2nd-order MAS with time-varying delays. However, the formation configuration cannot be adjusted dynamically in these works, limiting the application scope. In addition, wind disturbance has a significant impact on the movement of small UAVs in the real world, particularly when the modeling is inaccurate. To circumvent this issue, the mainstream techniques typically include neural networks estimators [35,36,37], nonlinear observers [38,39] and adaptive estimators [40,41], etc. On the basis of the aforementioned factors, we neutralize the effect of disturbances, uncertainties and time-varying communication delays and achieve precise control of time-varying formations.
In light of the aforementioned obstacles, we propose a novel QR formation FTC framework for a mobile sensing oriented application. The main contribution of this work is threefold. Firstly, based on a distributed adaptive FTC mechanism, the effect of time-varying multiplicative and additive faults can be effectively compensated for each QR, and the desired formation flight can still be achieved. Secondly, by applying the barrier Lyapunov function (BLF) technique and designing an auxiliary system, the attitude states of QRs can be constrained in the presence of input saturation, and our BLF analysis can also be applied to unconstrained scenarios without modifying the control structure. Compared to the methods in [27,28,29], the scope of application is expanded. Thirdly, the time-varying delay of each QR is different. Only delayed neighbor information is needed to realize formation flight; that is, the proposed protocol is distributed, and the time-varying formation configuration can be flexibly designed to adapt to target enclosing, area covering and other scenarios. Meanwhile, the disturbances and uncertainties are handled properly by radial basis function neural network (RBFNN) and an adaptive estimator; the application restrictions in real-word environments are relaxed compared to [32,33,34].
N o t a t i o n s : Let a b denote the Kronecker product of matrices a and b , and σ m i n ( ) and σ m a x ( ) indicate the minimum and maximum singular value of a matrix. We denote | | as the absolute value of a real number, the Euclidean norm of a vector and F the Frobenius norm of a matrix.

2. Preliminaries and Problem Formulation

2.1. Basic Concepts on Graph Theory

An undirected graph G = { V , E , W } represents the communication topology of the N QRs, which contains a set of nodes V = { q 1 , q 2 , . . . , q N } , a set of edges E { ( q i , q j ) : q i , q j V } and a weighted adjacency matrix W = [ a i j ] R N × N . If agent i is connected by an edge with agent j, that is ( q i , q j ) E , then a i j = a j i > 0 . Otherwise a i j = a j i = 0 , and a i i = 0 for all i Σ = { 1 , 2 , . . . , N } . The set of neighbors of node q i is defined by N i = { q j V : ( q i , q j ) E } . The out-degree of node q i is defined by D e g o u t ( q i ) = j N i a i j . The degree matrix of graph G is represented by D = d i a g { D e g o u t ( q i ) , i Σ } , and the Laplacian matrix of graph G is represented by L = D W . The undirected graph G is said to be connected if a path exists between any two nodes q i , q j V , where the path represents a series of diverse adjacent points from q i to q j . If q i can access information from the leader, then the connection weight between them b i > 0 . Otherwise b i = 0 , and the matrix form is B = d i a g { b 1 , b 2 , . . . , b N } . Throughout this brief, the following assumption is made for the communication topology.
Assumption 1.
The undirected graph for N QRs is connected, and there exists at least one path between the leader and follower.

2.2. Problem Formulation and Modeling

Consider a group of N QRs following a virtual leader labeled as 0, of which the interaction topology is described by an undirected graph G ; it is assumed that graph G is connected. Taking practical factors into account, the dynamic model of QR can be formulated by using Newton’s laws [42]:
{ P ˙ i = V i V ˙ i = g e 3 + R i t T i m i e 3 + F i P ( P i , V i , t )
{ A ˙ i = R i r Ω i Ω ˙ i = Δ F i F i A + J i 1 U i A + D i A
where i Σ , P i = [ P i 1 , P i 2 , P i 3 ] T , V i = [ V i 1 , V i 2 , V i 3 ] T and A i = [ ϕ i , θ i , ψ i ] T are position, velocity and attitude of the i-th QR in inertia frame, respectively. Ω i = [ p i , q i , r i ] T represents the angular velocity in a body-fixed frame. In addition, m i and J i = d i a g { J x i , J y i , J z i } represents the total mass and inertia matrix, respectively. T i represents the total thrust, e 3 = [ 0 , 0 , 1 ] T and g represents the gravity constant, and F i P ( P i , V i , t ) = [ f i 1 , f i 2 , f i 3 ] T represents the lumped uncertainty term including disturbance and inaccurate modeling in (1). F i A = J i 1 S ( Ω i ) J i Ω i J i 1 K i D Ω i , K i D = d i a g { K i 1 D , K i 2 D , K i 3 D } represents the aerodynamic damping coefficient. U i A = [ U i 1 A , U i 2 A , U i 3 A ] T represent the control input torque. Unknown time-varying function Δ F i R 3 × 3 and D i A represent parameter perturbation and external disturbance in (2), respectively. R i t , R i r and S ( Ω i ) are shown below:
R t i = [ c θ i c ψ i s θ i c ψ i s ϕ i s ψ i c ϕ i s θ i c ψ i c ϕ i + s ψ i s ϕ i c θ i s ψ i s θ i s ψ i s ϕ i + c ψ i c ϕ 1 s θ i s ψ i c ϕ i c ψ i s ϕ s θ i c θ i s ϕ i c θ i c ϕ i ] ,
R r i = 1 c θ i [ c θ i s ϕ i s θ i c ϕ i s θ i 0 c ϕ i c θ i s ϕ i c θ i 0 s ϕ i c ϕ i ] ,   S ( Ω i ) = [ 0 r i q i r i 0 p i q i p i 0 ] ,
where s ( ) sin ( ) , c ( ) cos ( ) .
The model of input saturation is expressed as follows:
U i k A = { U i k , H , i f U i k A F > U i k , H U i k A F , i f U i k , L U i k A F U i k , H U i k , L , i f U i k A F < U i k , L
where k = 1 , 2 , 3 , U i A F ( t ) = [ U i 1 A F , U i 2 A F , U i 3 A F ] T R 3 represents the control input free from limits but subject to actuator faults, which are expressed as follows
U i A F ( t ) = Γ i ( t ) U i A C ( t ) + δ i ( t )
where δ i ( t ) = [ δ i 1 , δ i 2 , δ i 3 ] T R 3 and Γ i ( t ) = d i a g { Γ i 1 , Γ i 2 , Γ i 3 } R 3 × 3 are time-varying additive and multiplicative actuator faults, respectively. U i A C ( t ) R 3 is generated by the attitude controller to be designed.
Considering that most sensors and PTZ systems have constraint requirements for rotational motion, the attitude states of QRs will be constrained and are defined as follows
{ A i < C ¯ i 1 ( t ) Ω i < C ¯ i 2 ( t )
where C ¯ i m ( t ) R , m = 1 , 2 represents the time-varying constraints.
The formation center is regarded as the virtual leader, which is specified by P 0 = 1 N i N P i , and its trajectory is P d = [ P 1 d ( t ) , P 2 d ( t ) , P 3 d ( t ) ] T , which is piecewise 2nd-order differentiable. The time-varying formation pattern is set by a vector Λ F ( t ) = [ Λ 1 T ( t ) , Λ 2 T ( t ) , . . . , Λ N T ( t ) ] T with the geometric center set as Λ 0 = 1 N 1 N Λ i ( t ) , where Λ i = [ Λ i 1 ( t ) , Λ i 2 ( t ) , Λ i 3 ( t ) ] T , i = 1 , , N , Λ i k ( t ) are 2nd-order differentiable functions defining the motion mode of i-th QR with respect to the geometric center, k = 1 , 2 , 3 . Based on consensus theory, we give the following definition:
Definition 1.
The formation tracking flight is said to be achieved when
{ lim t ( P i P j ) = Δ i j , i , j Σ lim t P 0 = P d
where Δ i j = Λ i Λ j .
Except the communication delay τ i j ( t ) between i-th QR and j-th QR, this paper also considers the self delay τ i i ( t ) of i-th QR caused by calculation or measurement. τ i j ( t ) and τ i i ( t ) are generally regarded as uniform delay τ i ( t ) in the MAS consensus control problem [43].
Assumption 2.
The time-varying delay has upper bound, that is, τ i τ M , i Σ .

2.3. Control Objective

As depicted in Figure 1, the objective of this work is to design a formation control scheme for the QR mobile sensing platforms to perform the following tasks. The first one is a covering task, in which the QRs can follow the virtual leader to track a moving target and fully cover the target’s adjacent area to carry out sensing or surveillance. The second task is target enclosing, in which the QRs can be controlled to gather and rotate above the moving target to monitor or observe it. The detailed control objectives of proposed formation control protocol are as follows:
  • Consensus-based time-varying formation control protocol (10) is designed based on the demands of the target-enclosing and covering tasks;
  • Distributed adaptive FTC mechanism is deployed to compensate the fault signals (4);
  • BLF and auxiliary system are designed to ensure that the constraint requirements (5) of sensor payload will not be violated in the presence of input saturation (3);
  • The influence of time-varying communication delay τ i can be eliminated by the L–K technique;
  • The problem of uncertainties and disturbances in (1) and (2) can be neutralized RBFNN (12) and adaptive estimators (49).

3. Main Results

The desired formation control scheme is proposed in Figure 2, which can be divided into a RBFNN-based time-delay position controller (NTDPC) (outer-loop) and an adaptive fault-tolerant attitude controller (AFTAC) (inner-loop). The inputs of outer-loop, including time-delayed neighbor information ( P j τ , V j τ ) j N i , time-delayed self information P i τ , V i τ and time-delayed leader information P d τ , Λ F τ are entered to NTDPC. In the mean time, the lumped uncertainties F i P ( P i , V i , t ) are compensated by the RBFNN approximation law. Then, the command attitude signals ϕ i C , θ i C and total thrust T i C are calculated from the outputs of NTDPC. The inputs of inner-loop, including command attitude signals ϕ i C , θ i C , ψ i C , are transferred to AFTAC. Meanwhile, the external disturbances D i A , actuator faults Γ i , δ i and model uncertainties Δ F i are compensated by adaptive estimation laws. Finally, the control inputs U i A and T i d are applied to i-th QR for formation flight. It should be pointed out that the derivatives of ϕ i C , θ i C are obtained from Command Filter_1 for the sake of reducing computational burden.

3.1. RBFNN Approximation

Suppose an unknown smooth nonlinear function f ( x ) : R m R can be approximated over a prescribed compact set Σ R R m as follows
f ( x ) = W T Ψ ( x ) + ϵ
where Ψ ( x ) = [ ψ 1 ( x ) , , ψ l ( x ) ] T : Σ R R l denotes the radial basis function vector, of which the element is expressed as follows
ψ k ( x ) = e x p ( ( x ς k ) 2 μ k 2 ) , k = 1 , , l
where ς k R m and μ k R are the center and spread. ϵ R is the bounded RBFNN approximation error on Σ R , that is, | ϵ | ϵ ¯ with ϵ ¯ is an unknown constant. W R l is the ideal RBFNN weight vector expressed as follows
W = a r g min W ^ { sup x Σ R | f ( x ) W ^ T Ψ ( x ) | }
where W ^ represents the estimation of W .

3.2. Design of NTDPC

For i-th QR, the local tracking errors are defined as follows
e i P = j N i a i j [ P i ( t ) P j ( t ) Δ i j ( t ) ] + b i ( P i ( t ) P d ( t ) Δ i 0 ( t ) )
e i V = j N i a i j [ V i ( t ) V j ( t ) Δ ˙ i j ( t ) ] + b i ( V i ( t ) P ˙ d ( t ) Δ ˙ i 0 ( t ) )
where Δ i j = Λ i Λ j , Δ i 0 = Λ i Λ 0 .
Then the error dynamics of system (2) can be expressed in a compact form as follows
{ e ˙ P = e V e ˙ V = ( ( L + B ) I 3 × 3 ) ( U P + F P e n P ¨ d Δ ¨ Σ )
where e P = [ e 1 P T , e 2 P T , . . . , e N P T ] T , e V = [ e 1 V T , e 2 V T , . . . , e N V T ] T , U P = [ U 1 P T , U 2 P T , . . . , U N P T ] T , U i P = g e 3 + R t i T i m i e 3 , F P = [ F 1 P T , F 2 P T , . . . , F N P T ] T , Δ Σ = [ Δ 10 T , Δ 20 T , . . . , Δ N 0 T ] T , e n = [ 1 , 1 , . . . , 1 ] T R n .
Assumption 3.
The second derivatives of P d and Δ Σ are bounded; there exists positive constants P M and Δ M , such that e n P ¨ d P M and Δ ¨ Σ Δ M .
To obtain the approximation of the lumped uncertainty F i P , we adopt an adaptive RBFNN with time-delayed states P i ( t τ i ) and V i ( t τ i ) as inputs and approximation value as output, which is expressed as
F ^ i P = W ^ i T Ψ i
where W ^ i = d i a g { W ^ i 1 , W ^ i 2 , W ^ i 3 } is the current RBFNN weights estimation value of i-th QR, Ψ i = [ Ψ i 1 T , Ψ i 2 T , Ψ i 3 T ] T , W ^ i k R l i k , Ψ i k R l i k , k = 1 , 2 , 3 .
Then F P can be expressed as
F P = W T Ψ + ϵ
where W = d i a g { W 1 , W 2 , . . . , W N } , Ψ = [ Ψ 1 T , Ψ 2 T , . . . , Ψ N T ] T , ϵ = [ ϵ 1 T , ϵ 2 T , . . . , ϵ N T ] T with ϵ i = [ ϵ i 1 , ϵ i 2 , ϵ i 3 ] T , the approximation of F P is
F ^ P = W ^ T Ψ
where W ^ = d i a g { W ^ 1 , W ^ 2 , . . . , W ^ N } .
In addition, the RBFNN weights estimation error is denoted as W ˜ = W W ^ .
Remark 1.
In the light of Stone–Weierstrass approximation theorem [44], Ψ , W and ϵ are bounded, namely, Ψ Ψ M , W W M and ϵ ϵ M , Ψ M , W M and ϵ M are positive numbers.
Now we design the control inputs U i P of i-th QR position subsystem (2) and update laws of RBFNN weights W ^ i as:
U i P = k P e i P τ k V e i V τ W ^ i T Ψ i + Δ ¨ i 0 τ
W ^ ˙ i = Π i ( Ψ i ( K P e i P τ + K V e i V τ ) K W W ^ i )
where k P , k V > 0 . Δ i 0 τ = Δ i 0 ( t τ i ) , e i P τ = e i P ( t τ i ) and e i V τ = e i V ( t τ i ) . K P , K V and K W are positive design constants, Ψ i = d i a g { Ψ i 1 , Ψ i 2 , Ψ i 3 } , Π i = d i a g { Π i 1 , Π i 2 , Π i 3 } , Π i k = κ i k I l i k × l i k is positive definite with κ i k > 0 , k = 1 , 2 , 3 .
Combining (14) and (15), we have
e ˙ V = ( ( L + B ) I 3 × 3 ) ( k P e P τ k V e V τ + W ˜ T Ψ + ϵ e n P ¨ d + Δ ¨ Σ τ Δ ¨ Σ )
where e P τ = e P ( t τ i ) , e V τ = e V ( t τ i ) and Δ Σ τ = Δ Σ ( t τ i ) .
Lemma 1.
Under Assumption 1, G = ( L + B ) I 3 × 3 is positive definite [45], so Δ P e P σ m i n 1 ( G ) and Δ V e V σ m i n 1 ( G ) [44], in which Δ P and Δ V are formation tracking errors, Δ P = P e n P d Δ Σ with P = [ P 1 , P 2 , . . . , P N ] T , Δ V = Δ ˙ P .
Lemma 2.
According to [46], we can conclude that the following inequality is always valid:
τ 0 1 [ h ( t ) h ( t τ ) ] T U [ h ( t ) h ( t τ ) ] t τ t h ˙ T ( ξ ) U h ˙ ( ξ ) d ξ t τ 0 t h ˙ T ( ξ ) U h ˙ ( ξ ) d ξ
where t > 0 , h ( t ) R n and τ ( t ) [ 0 , τ 0 ] are arbitrary differentiable vector and scalar functions, respectively, and τ 0 > 0 . U = U T is an arbitrary positive definite constant matrix.
Theorem 1.
Under Assumptions 1–3, with the control law (14) and update law (15), the time-varying formation tracking for N QRs position systems (2) subject to time-varying delays and uncertainties can be achieved if the positive design constants K P = 4 M 2 τ M 2 k v , K V = 4 M 2 τ M 2 k p , K 0 = 4 M 2 τ M 2 k P k V and k P , k V , K W , M 1 , M 2 are chosen appropriately to make the symmetric matrix M be positive definite, which is
M = [ k P K V 2 M 2 τ M 2 k P 2 0 0 0 0 0 k V K P M 1 τ M 2 K V σ m a x ( G 1 ) 2 M 2 τ M 2 k V 2 0 0 0 0 0 M 1 2 M 2 τ M 2 k P 2 2 M 2 τ M 2 k P k V K V 2 Ψ M 0 0 0 M 2 ( σ m i n ( B 1 ) 2 τ M 2 k V 2 ) K P 2 Ψ M 0 0 0 0 K W 2 M 2 τ M 2 Ψ M 2 ]
where B = G T G .
Proof. 
Consider the Lyapunov–Krasovskii candidate function as V ( t ) = V 1 ( t ) + V 2 ( t ) + V 3 ( t ) + V 4 ( t ) with
V 1 ( t ) = 1 2 K P e V T G 1 e V + 1 2 K 0 e P T e P + K V e P T G 1 e V
V 2 ( t ) = M 1 τ M t τ M t ( ξ t + τ M ) e ˙ P T ( ξ ) e ˙ P ( ξ ) d ξ
V 3 ( t ) = M 2 τ M t τ M t ( ξ t + τ M ) e ˙ V T ( ξ ) B 1 e ˙ V ( ξ ) d ξ
V 4 = t r { W ˜ T Π 1 W ˜ }
where Π = d i a g { Π 1 , Π 2 , . . . , Π N } .
Taking the time derivative of V 1 and V 4 we have
V ˙ 1 + V ˙ 4 = ( K P e V T + K V e P T ) G 1 e ˙ V + K 0 e P T e V + e V T K V G 1 e V + t r { W ˜ T Π 1 W ˜ ˙ } = ( K P e V T + K V e P T ) ( k P Δ e P k P e P k V Δ e V k V e V ) + K 0 e P T e V + ( K P e V T + K V e P T ) H + e V T K V G 1 e V + t r { W ˜ T K W W ^ } + t r { W ˜ T Ψ [ ( K P e V T + K V e P T ) ( K P e V τ T + K V e P τ T ) ] } = ( K P e V T + K V e P T ) ( k P Δ e P k P e P k V Δ e V k V e V ) + K W W M t r W ˜ F + ( K P e V T + K V e P T ) H + K 0 e P T e V T + e V T K V G 1 e V K W W ˜ F 2 + t r { W ˜ T Ψ [ ( K P e V T + K V e P T ) ( K V e P T + K V Δ e P T + K P e V T + K P Δ e V T ) ] }
where Δ e P = e P τ e P , Δ e V = e V τ e V and H = ϵ e n P ¨ d + Δ ¨ Σ τ Δ ¨ Σ .
By Lemma 2, we obtain the time derivatives of V 2 and V 3 as follows
V ˙ 2 = M 1 τ M 2 e ˙ P T ( t ) e ˙ P ( t ) M 1 τ M t τ M t e ˙ P T ( ξ ) e ˙ P ( ξ ) d ξ M 1 Δ e P T Δ e P + M 1 τ M 2 e V T ( t ) e V ( t ) M 1 Δ e P 2 + M 1 τ M 2 e V 2
and
V ˙ 3 = M 2 τ M 2 e ˙ V T ( t ) B 1 e ˙ V ( t ) M 2 τ M t τ M t e ˙ V T ( ξ ) B 1 e ˙ V ( ξ ) d ξ M 2 Δ e V T B 1 Δ e V + M 2 τ M 2 e ˙ V T ( t ) B 1 e ˙ V ( t ) M 2 σ m i n ( B 1 ) Δ e V 2 + M 2 τ M 2 ( k P Δ e P k P e P k V Δ e V k V e V + W ˜ T Ψ + H ) T ( k P Δ e P k P e P k V Δ e V k V e V + W ˜ T Ψ + H ) M 2 σ m i n ( B 1 ) Δ e V 2 + 2 M 2 τ M 2 W ˜ F 2 Ψ M 2 + 2 M 2 τ M 2 ( k P Δ e P k P e P k V Δ e V k V e V + H ) T ( k P Δ e P k P e P k V Δ e V k V e V + H ) M 2 σ m i n ( B 1 ) Δ e V 2 + M 2 τ M 2 ( 2 k P 2 Δ e P 2 + 4 k P 2 e P T Δ e P + 4 k P k V Δ e V T Δ e P + 4 k P k V e V T Δ e P + 4 k P k V e V T e P + 2 k P 2 e P 2 + 4 k P k V Δ e V T e P + 2 k V 2 Δ e V 2 + 4 k V 2 e V T Δ e V + 2 k P 2 e V 2 + 2 H M 2 + 2 W ˜ F 2 Ψ M + 4 H T ( k P Δ e P k P e P k V Δ e V k V e V ) )
where H M = 2 Δ M + P M + ϵ M . By applying (23)–(25) we obtain
V ˙ = V ˙ 1 + V ˙ 2 + V ˙ 3 + V ˙ 4 e T M e + e T z + Θ = V e ( e )
where e = [ e P , e V , Δ e P , Δ e V , W ˜ F ] T , z = [ 0 , 0 , 4 k P H M , 4 k V H M , W M K W ] T , and Θ = 2 M 2 τ M 2 H M 2 , M are defined by (18). If M is positive definite, then V e ( e ) > 0 , and
e z + z 2 + 4 σ m i n ( M ) Θ 2 σ m i n ( M )
Thus, e is uniformly ultimately bounded (UUB) according to [47]. Moreover, e P , e V are bounded stable referring to the definition of e , and following Lemma 1, the formation tracking errors Δ P and Δ V are also UUB. So, the desired position control for formation flight can be realized by control law (14) and RBFNN update law (15). □
Remark 2.
In matrix M , k p , k v , K P , K V and K W are control and adaptive parameters, and K 0 , M 1 and M 2 are constants to be selected. τ M is the upper bound of time delays. Except τ M , all of the above parameters are adjustable to ensure the solvability of M . Besides, one can see that all of the diagonal elements of M are positive when τ M being a certain value. Therefore, M is solvable in Theorem 1.

3.3. Design of AFTAC

The command attitude A i C ( t ) = [ ϕ i C , θ i C , ψ i C ] T and total thrust T i C of i-th QR can be obtained from U i P = [ U i 1 P , U i 2 P , U i 3 P ] T , which is derived as
{ T i C = m i U i 1 P 2 + U i 2 P 2 + ( U i 3 P + g ) 2 ϕ i C = a r c s i n ( U i 1 P s i n ψ i C U i 2 P c o s ψ i C m i 1 T i ) θ i C = a r c t a n ( U i 1 P c o s ψ i C + U i 2 P s i n ψ i C U i 3 P + g )
where ψ i C is a free variable and can be set to ψ i C = 0 for simplicity.
Remark 3.
It is feasible to ensure U i 3 P + g is constantly positive to avoid singularity because U i 3 P is bounded by selecting suitable gain constant k P , k V and W ^ i T Ψ i , Δ ¨ i 0 τ is in a cetain range when calculating θ i C in (28).
To deploy the attitude control scheme, the following assumptions and lemma need to be made:
Assumption 4.
There exists a 2nd order differentiable continuous bound C i d ( t ) R of command attitude A i C within the constraint C i 1 , namely, A i C ( t ) C i d ( t ) < C ¯ i 1 ( t ) . The initial state of the attitude subsystem needs to be within the constraints C ¯ i m , m = 1 , 2 , which is the ( 3 m ) -th order differentiable.
Assumption 5.
The actuators will not completely fail during operation, and the fault signals Γ i k ( t ) and δ i ( t ) change continuously within certain ranges, that is, 0 < Γ i k , m i n Γ i k ( t ) Γ i k , m a x , t r ( Γ ˙ i T Γ ˙ i ) Ξ i < , where Γ i k , m i n , Γ i k , m a x are known constants with k = 1 , 2 , 3 , and δ i ( t ) δ ¯ i < , δ ˙ i ( t ) δ ¯ i 0 < .
Assumption 6.
The model uncertainty factor Δ F i ( t ) and its derivatives and unknown disturbances D i A are bounded, which are expressed as t r ( Δ F i T Δ F i ) Ξ i < , t r ( Δ F ˙ i T Δ F ˙ i ) Ξ ¯ i , D i A D ¯ i A , D ¯ i A > 0 R can be unknown.
Lemma 3.
By [48], we know that the following inequality holds:
0 | ρ | ρ t a n h ( ρ λ ) λ κ 0
where λ > 0 , ρ R are arbitrary numbers, κ 0 = 0.2785 .
The attitude tracking error of i-th QR is z i 1 = A i A i C , of which the dynamic can be derived as
z ˙ i 1 = R i r ( z i 2 + α i ) A ˙ i C
where z i 2 = Ω i α i is angular velocity tracking error, α i is the command filtered signal of designed virtual control law α i C , in which the command filter limits the magnitude, rate and bandwidth of α i C and is shown in Figure 3.
In order to deal with the constraints on the attitude states, we adopt the t a n -type BLF as follows
V i 1 B = C i 1 2 π tan ( π z i 1 T z i 1 2 C i 1 2 )
where C i 1 = C ¯ i 1 C i d . It is easy to see that when z i m C i m , then V i m B ; thus, z i m < C i m holds if and only if V i m B is bounded, m = 1 , 2 .
Remark 4.
When there is no attitude constraint on i-th QR, then C ¯ i m ; thus, C i m , m = 1 , 2 , and we have
lim C i m V i m B = 1 2 z i m T z i m
that is, our BLF analysis method is also available for the unconstrained circumstance.
For simplicity of notation, define ν i m = z i m cos 2 ( π z i m T z i m 2 C i m 2 ) , m = 1 , 2 and take the derivative of V i 1 B with respect to time, and we have
V ˙ i 1 B = 2 C i 1 C ˙ i 1 π tan ( π z i 1 T z i 1 2 C i 1 2 ) + ν i 1 T ( R i r ( z i 2 + α i ) A ˙ i C ) ( C ˙ i 1 C i 1 ) ν i 1 T z i 1
The designed virtual control law α i C is shown as below
α i C = R i r 1 ( K i 1 α z i 1 z i 1 T z i 1 C i 1 2 π sin ( π z i 1 T z i 1 2 C i 1 2 ) cos ( π z i 1 T z i 1 2 C i 1 2 ) + K i 1 α E i 1 K i 1 C z i 1 + A ˙ i C K i 1 α 2 2 ν i 1 )
where μ i 1 is a positive small constant, K i 1 α > 2 K i 1 C > 0 , K i 1 α is a design parameter, and K i 1 C = ( C ˙ i 1 C i 1 ) 2 + ϵ i 1 C with the small constant ϵ i 1 C > 0 .
Remark 5.
To make V ˙ i 1 B be negative definite, the terms ( C ˙ i 1 C i 1 ) ν i 1 T z i 1 , ν i 1 T A ˙ i C , K i 1 α 2 2 ν i 1 T ν i 1 in (33) will be canceled by terms K i 1 C z i 1 , A ˙ i C , K i 1 α 2 2 ν i 1 in (34), respectively. Noticing that
K i 1 α ν i 1 T z i 1 z i 1 T z i 1 C i 1 2 π sin ( π z i 1 T z i 1 2 C i 1 2 ) cos ( π z i 1 T z i 1 2 C i 1 2 ) = K i 1 α k i 1 α 2 π tan ( π z i 1 T z i 1 2 C i 1 2 ) ,
this will generate the negative definite BLF-form term in (33).
The auxiliary system E i 1 is designed as
E ˙ i 1 = { K i 1 E E i 1 ϰ i 1 E i 1 + γ i 1 E Δ α i , i f E i 1 > E ¯ i 1 0 , i f E i 1 E ¯ i 1
where E i 1 R 3 , E ¯ i 1 > 0 is a small constant, K i 1 E > 1 , γ i 1 E > 0 are design constants, ϰ i 1 = | ν 1 T R i r Δ α i 1 | + 1 2 γ i 1 E 2 Δ α i T Δ α i E i 1 2 , Δ α i = α i α i C .
Remark 6.
When saturation occurs, the auxiliary system will respond to it. Otherwise, Δ α i = 0 , then E ˙ i 1 = K i 1 E E i 1 ; thus, E i 1 will converge into E i 1 E ¯ i 1 , after which, if saturation occurs again, E i 1 can be reset so that E i 1 > E ¯ i 1 . Then, the auxiliary system can be made responsive again.
As can be seen from (33),
2 C i 1 C ˙ i 1 π tan ( π z i 1 T z i 1 2 C i 1 2 ) = 2 C ˙ i 1 C i 1 C i 1 2 π tan ( π z i 1 T z i 1 2 C i 1 2 ) < 2 K i 1 C C i 1 2 π tan ( π z i 1 T z i 1 2 C i 1 2 ) .
Besides, ν i 1 T K i 1 α E i 1 K i 1 α 2 2 ν i 1 T ν i 1 + 1 2 E i 1 T E i 1 . Set K i 1 = K i 1 α 2 K i 1 C , then we have
V ˙ i 1 B K i 1 C i 1 2 π tan ( π z i 1 T z i 1 2 C i 1 2 ) + ν i 1 T R i r z i 2 + 1 2 E i 1 T E i 1 + | ν i 1 T R i r Δ α i |
The Lyapunov function for this step is constructed as
V i 1 = V i 1 B + 1 2 E i 1 T E i 1
Taking the time derivative of (37) and notice that
E i 1 T γ i 1 E Δ α i γ i 1 E 2 2 Δ α i T Δ α i + 1 2 E i 1 T E i 1
then we have
V ˙ i 1 K i 1 C i 1 2 π tan ( π z i 1 T z i 1 2 C i 1 2 ) ( K i 1 E 1 ) E i 1 T E i 1 + ν i 1 T R i r z i 2
where ν i 1 T R i r z i 2 will be compensated later.
Similarly, the BLF for m = 2 is
V i 2 B = C i 2 2 π tan ( π z i 2 T z i 2 2 C i 2 2 )
where C i 2 = C ¯ i 2 α ¯ i > 0 , and α i < α ¯ i
The dynamics of the angular velocity tracking error z i 2 is derived as
z ˙ i 2 = Δ F i F i A + J i 1 ( Δ U i A + U i A F ) + D i A α ˙ i
where Δ U i A = U i A U i A F . According to (4), the following inequality holds:
U i A U i A F U i A + Γ i U i A C + δ i U ¯ i A
where U i A is the given input, U i A C is produced by our desired control law and Γ i and δ i are known from Assumption 5; thus, U ¯ i A can be determined. Define U i A C as
U i A C = Γ ^ i 1 Φ i
where Γ ^ i is the estimation of the multiplicative fault Γ i , Φ i will be designed later. Notice that
J i 1 U i A F = J i 1 ( Γ i U i A C + δ i ) = J i 1 δ i + J i 1 ( Γ ^ i Γ ^ i 1 Φ i Γ ^ i Γ ^ i 1 Φ i + Γ i U i A C ) = J i 1 δ i J i 1 Γ ˜ i U i A C + J i 1 Φ i
where Γ ˜ i = Γ ^ i Γ i is the estimation error of multiplicative fault Γ i . Then, the desired control law Φ i is designed as
Φ i = δ ^ i + J i ( K i 2 C z i 2 cos 2 ( π z i 2 T z i 2 2 C i 2 2 ) R i r T ν i 1 + α ˙ i Δ F ^ i F i A K i 2 Φ 2 2 ν i 2 + K i 2 Φ E i 2 D ^ i A tanh ( ν i 2 μ i 2 ) K i 2 Φ z i 2 z i 2 T z i 2 C i 2 2 π sin ( π z i 2 T z i 2 2 C i 2 2 ) cos ( π z i 2 T z i 2 2 C i 2 2 ) )
where ϵ i 2 C > 0 , μ i 2 > 0 are small constants, K i 2 Φ > 0 is a design parameter and K i 2 Φ > 2 K i 2 C with K i 2 C = ( C ˙ i 2 C i 2 ) 2 + ϵ i 2 C , D ^ i A is the estimation value of disturbances’ upper bound D ¯ i A .
The update law for Δ F ^ i , δ ^ i , Γ ^ i and D ^ i A are constructed as
Δ F ^ ˙ i = γ i A F i A ν i 2 T β i A Δ F ^ i
δ ^ ˙ i = κ i 1 J i T ν i 2 η i δ ^ i
Γ ^ ˙ i k = { 0 , i f Γ ^ i k = Γ ^ i k , m i n , a n d , χ i k ( t ) < 0 χ i k ( t ) , e l s e
D ^ ˙ i A = ξ i A ( ν i 2 T tanh ( ν i 2 μ i 2 ) λ i A D ^ i A )
where χ i k ( t ) = κ i 2 ν i 2 T J i 1 U i A C Υ i Γ ^ i k , k = 1 , 2 , 3 , γ i 2 > 0 , β i 2 > 1 , η i > 1 , κ i 1 > 0 , κ i 2 > 0 , Υ > 1 , ξ i A > 0 , λ i A > 0 are design constants.
Similarly, auxiliary system E i 2 is designed as
E ˙ i 2 = { K i 2 E E i 2 ϰ i 2 E i 2 + γ i 2 E U ¯ i A , i f E i 2 > E ¯ i 2 0 , i f E i 2 E ¯ i 2
where ϰ i 2 = ν i 2 T J i 1 U ¯ i A + 1 2 γ i 2 E 2 U ¯ i A 2 E i 2 2 , K i 2 E > 1 , γ i 2 E > 0 are design parameters and E ¯ i 2 > 0 is a small constant.
Set K i 2 = K i 2 Φ 2 K i 2 C , similarly as (36), and we can obtain
V ˙ i 2 B K i 2 C i 2 2 π tan ( π z i 2 T z i 2 2 C i 2 2 ) + ν i 2 T D i A + 1 2 E i 2 T E i 2 ν i 2 T D ^ i A tanh ( ν i 2 μ i 2 ) ν i 2 T Δ F ˜ i T F i A ν i 2 T J i 1 Γ ˜ i U i A C + | ν i 2 T J i 1 Δ U i A | ν i 1 T J i 1 z i 2 ν i 2 T J i 1 δ ˜ i
where Δ F ˜ i = Δ F ^ i Δ F i and δ ˜ i = δ ^ i δ i are estimation errors of model uncertainty and additive fault, respectively. The Lyapunov candidate function for this step is derived as
V i 2 = V i 1 + V i 2 B + 1 2 E i 2 T E i 2 + 1 2 γ i 2 t r ( Δ F ˜ i T Δ F ˜ i ) + 1 2 ξ i A D ˜ i A 2 + 1 2 κ i 1 δ ˜ i T δ ˜ i + 1 2 κ i 2 t r ( Γ ˜ i T Γ ˜ i )
where D ˜ i A = D ^ i A D i A . Taking the time derivative of V i 2 and observing that
λ i 1 D ˜ i A D ^ i A = λ i A D ˜ i A ( D ˜ i A + D ¯ i A ) λ i A 2 D ˜ i A 2 + λ i A 2 D ¯ i A 2
ν i 2 T D i A ν i 2 T D ^ i A tanh ( ν i 2 μ i 2 ) + ν i 2 T D ˜ i A tanh ( ν i 2 μ i 2 ) k = 1 3 ( | ν i k 2 | D ¯ i A D ¯ i A ν i k 2 tanh ( ν i k 2 μ i 2 ) ) 3 κ 0 D ¯ i A μ i 2
{ η i κ i 1 δ ˜ i T δ ^ i η i 2 κ i 1 δ ˜ i T δ ˜ i + η i 2 κ i 1 δ ¯ i 2 1 κ i 1 δ ˜ i T δ ˙ i 1 2 κ i 1 δ ˜ i T δ ˜ i + 1 2 κ i 1 δ ¯ i 0 2
{ Υ i κ i 2 t r ( Γ ^ i T Γ ˜ i ) Υ i 2 κ i 2 t r ( Γ ˜ i T Γ ˜ i ) + Υ i 2 κ i 2 k = 1 3 Γ i k , m a x 2 1 κ i 2 t r ( Γ ˜ i T Γ ˙ i ) 1 2 κ i 2 t r ( Γ ˜ i T Γ ˜ i ) + 1 2 κ i 2 Ξ i
then we have
V ˙ i 2 m = 1 2 K i m C i m 2 π tan ( π z i m T z i m 2 C i m 2 ) β i A 1 2 γ i A t r ( Δ F ˜ i T Δ F ˜ i ) λ i A 2 D ˜ i A 2 m = 1 2 ( K i m E 1 ) E i m T E i m + S i Υ i 1 2 κ i 2 t r ( Γ ˜ i T Γ ˜ i ) η i 1 2 κ i 1 δ ˜ i T δ ˜ i + 1 2 κ i 2 Ξ i + η i 2 κ i 1 δ ¯ i 2 + 1 2 κ i 1 δ ¯ i 0 2 + Υ i 2 κ i 2 k = 1 3 Γ i k , m a x 2
where S i = β i 2 2 γ i 2 Ξ i 2 + 1 2 γ i 2 Ξ ¯ i 2 + λ i A 2 D ¯ i A 2 + 3 κ 0 D ¯ i A μ i 2 .
Now, denote S ¯ i = S i + 1 2 κ i 2 Ξ i + Υ i 2 κ i 2 k = 1 3 Γ i k , m a x 2 + η i 2 κ i 1 δ ¯ i 2 + 1 2 κ i 1 δ ¯ i 0 2 , s i = m i n ( K i m , β i A 1 , ξ i A λ i A , 2 ( K i m E 1 ) , Υ i 1 , η i 1 ) , where m = 1 , 2 , s i > 0 . From (57), we have
V ˙ i 2 s i V i 2 + S ¯ i
Theorem 2. 
Under the Assumptions 4–6, with the adaptive estimation laws (46)–(49) and control laws (43), (45), the attitude subsystem (3) of i-th QR subject to input saturation (3), actuator faults (4) and state constraints (5), possesses the following properties:
i.
The attitude state constraints (5) of i-th QR will not be exceeded during formation flight.
ii.
The attitude and angular velocity tracking error will exponentially converge into the set z i m 2 S ¯ i s i , m = 1 , 2 .
iii.
The estimation errors Γ ˜ i , δ ˜ i , Δ F ˜ i , D ˜ i A and the closed-loop signals E i m will be bounded, m = 1 , 2 .
Proof. 
By (58), we have V i 2 ( V i 2 ( 0 ) S ¯ i s i ) e s i t + S ¯ i s i ; thus, V i 2 has upper bound, which means the BLF is bounded. Besides,
z i m 2 2 C i m 2 π tan 1 ( π C i m 2 ( V i 2 ( 0 ) S ¯ i s i ) e s i t + π C i m 2 S ¯ i s i ) < 2 C i m 2 π π 2 = C i m 2
then we get z i m < C i m , m = 1 , 2 . Due to A i = z i 1 + A i C and Ω i = z 2 + α i , we have A i z i 1 + A i C < C ¯ i 1 C i d + C i d = C ¯ i 1 and Ω i z i 2 + α i < C ¯ i 2 α ¯ i + α ¯ i = C ¯ i 2 ; hence, during formation flight, no violation of attitude state constraints will occur. Additionally,
1 2 z i m T z i m C i m 2 π tan ( π z i m T z i m 2 C i m 2 ) ( V i 2 ( 0 ) S ¯ i s i ) e s i t + S ¯ i s i
where m = 1 , 2 , which indicates that z i m will exponentially converge into z i m 2 S ¯ i s i , and the estimation errors and closed-signals mentioned above will also be bounded. □

4. Simulations

To demonstrate the effectiveness of the proposed scheme, some comparative simulations were carried out, which were programmed via Matlab 2016a and performed on a PC with a 4-core Intel [email protected] GHz CPU and 16 GB of RAM. The application scenario of using 5 QRs to enclose and cover a moving ground target is considered. Suppose a target is detected at t = 0   s and moving along T g = [ 15 s i n ( 0.026 t ) , 15 c o s ( 0.026 t ) , 0 ] T . Meanwhile, the QRs will follow the virtual leader to fly right above the target and cover its adjacent area to monitor or sense. Then, the QR formation will converge towards its center at T 1 , start spinning at T 2 and lower the altitude at T 3 to enclose the target closely. The target’s adjacent area is defined as a circular area with the radius being 3.5 m and centered on the target. The coverage area of i-th QR is centered on [ P i 1 , P i 2 , 0 ] , with the radius being P i 3 t a n θ S 2 , and θ S = 50 represents the angle of view of the sensor payload. The trajectory of the virtual leader is set as P d = ( 1 e 2 t ) T g + [ 0 , 0 , ( 5 + h t ) ( 1 e 0.3 t ) ] T , with h t = 2 π a t a n ( T 3 t ( i ) ) 1 . The formation function is designed as Λ F = [ Λ 1 T , Λ 2 T , Λ 3 T ] T , where Λ i = A t [ c o s ( ω t ( t T 2 ) + ( 4 i + 1 ) π 10 ) , s i n ( ω t ( t T 2 ) + ( 4 i + 1 ) π 10 ) , 0 ] T , with A t = 1 π a r c t a n ( 5 ( t ( i ) + T 1 ) ) + 0.5 , ω t = ω 0 π [ a r c t a n ( 50 ( t T 2 ) ) + π 2 ] and ω 0 = 0.8 ( r a d / s ) . The topology graph is shown in Figure 4, which is undirected and connected, with the weights being a 12 = a 21 = 1 , a 23 = a 32 = 1 , a 34 = a 43 = 1 , a 45 = a 54 = 1 and b 1 = b 5 = 1 .
Remark 7.
In practical applications, the motion information of some non-cooperative targets may not be directly obtained. In this case, the estimated motion information can be obtained by other means and used for formation control, but it is not within the scope of this study. More details can be seen in [49,50]. ( Λ F , P d ) can be designed carefully according to different sensing tasks, sensor performances and quality-of-service policies. The ( Λ F , P d ) chosen in this paper is a basic example to demonstrate the effectiveness of the proposed method.
With reference to a physical product, the parameters of the QRs are set as m i = 0.856 (kg), J i = d i a g { 0.02351 , 0.02351 , 0.04701 } and K i D = d i a g { 0.003 , 0.003 , 0.003 } . The time-varying delays are set as τ 1 = 0.025 + 0.01 s i n ( 0.15 t ) (s), τ 2 = 0.03 + 0.0125 s i n ( 0.15 t ) (s) and τ 3 = 0.035 + 0.015 s i n ( 0.15 t ) (s). The initial conditions are P 1 = [ 0 , 17.64 , 0 ] T (m), P 2 = [ 2.5 , 15.83 , 0 ] T (m), P 3 = [ 1.56 , 12.88 , 0 ] T (m), P 4 = [ 1.54 , 12.86 , 0 ] T (m), P 5 = [ 2.51 , 15.8 , 0 ] T (m), A i = 0 (rad), and V i = 0 (m/s), Ω i = 0 (rad/s). The constraints on attitude state A i is C ¯ i 1 = A i C + 0.065 (rad) and the angular velocity state Ω i is constrained by C ¯ i 2 = 13 π 36 (rad/s). The control input saturation of attitude controller is set as U i A m a x = [ 0.4 , 0.4 , 2 ] T (Nm), U i A m i n = [ 0.4 , 0.4 , 2 ] T (Nm). The position controller parameters are k P = 4.9 , k V = 6.85 , K P = 0.0024 , K V = 0.0036 , K W = 0.001725 , κ i k = 1824 ( k = 1 , 2 , 3 ). The attitude controller parameters are K i 1 α = K i 2 Φ = 3.9 , μ i 1 = μ i 2 = 0.0012 . The adaptive laws parameters are ξ i A = 8.5 , λ i A = 0.022 , κ i 1 = 0.31 , η i = 1.52 , κ i 2 = 0.7 , Υ i = 0.85 . The design constant of command filter are ω i B = 22 , ξ i B = 1.6 . The parameters for RBFNN are l i k = 10 and the initial weights are set randomly, where k = 1 , 2 , 3 . The lumped uncertainty terms of position subsystem are given as
{ F 1 P = [ s i n ( 0.2 P 11 + V 11 ) , s i n ( 0.1 P 12 + V 12 ) , s i n ( 0.15 P 13 + V 13 2 ) ] T F 2 P = [ s i n ( 0.15 P 21 + V 21 ) , 0.9 s i n ( 0.2 P 22 + V 22 ) , s i n ( 0.1 P 23 + V 23 2 ) ] T F 3 P = [ s i n ( 0.1 P 31 + V 31 ) , s i n ( 0.2 P 32 + V 32 ) , 0.8 s i n ( 0.1 P 33 + V 33 2 ) ] T F 4 P = [ s i n ( 0.12 P 41 + V 41 ) , s i n ( 1.6 P 42 + V 42 ) , s i n ( 0.1 P 43 + V 43 2 ) ] T F 5 P = [ s i n ( 0.18 P 51 + V 51 ) , s i n ( 1.2 P 52 + V 52 ) , 0.7 s i n ( 0.12 P 53 + V 53 2 ) ] T
Besides, the external disturbances of the attitude subsystem containing stable, periodic and aperiodic components are set as follows
{ D 1 A = 0.015 ( s i n ( t + 3.4 ) + c o s ( e 0.1 t t + 6.2 ) ) + 0.01 c o s ( 5 t + 1.2 ) + 0.18 D 2 A = 0.015 ( c o s ( t + 5.7 ) + c o s ( e 0.1 t t + 5.9 ) ) + 0.01 c o s ( 5 t + 4.3 ) + 0.2 D 3 A = 0.015 ( s i n ( t 2.4 ) + c o s ( e 0.1 t t + 4.2 ) ) + 0.01 c o s ( 5 t + 0.6 ) + 0.22 D 4 A = 0.015 ( c o s ( t 1.6 ) + c o s ( e 0.1 t t + 5.1 ) ) + 0.01 c o s ( 5 t + 0.9 ) + 0.26 D 5 A = 0.015 ( s i n ( t + 1.8 ) + c o s ( e 0.1 t t + 3.3 ) ) + 0.01 c o s ( 5 t + 1.7 ) + 0.24
The time-varying multiplicative and additive actuator fault signals are considered as follows
{ Γ 1 = d i a g { 0.7 , 0.85 , 0.77 } + d i a g { 0.3 , 0.15 , 0.23 } e t Γ 2 = d i a g { 0.8 , 0.75 , 0.85 } + d i a g { 0.2 , 0.25 , 0.15 } e t Γ 3 = d i a g { 0.69 , 0.75 , 0.82 } + d i a g { 0.31 , 0.25 , 0.18 } e t Γ 4 = d i a g { 0.73 , 0.8 , 0.81 } + d i a g { 0.27 , 0.22 , 0.19 } e t Γ 5 = d i a g { 0.82 , 0.78 , 0.86 } + d i a g { 0.18 , 0.22 , 0.14 } e t
δ 1 = [ 0.1 , 0.1 , 1.3 ] T ( 1 e t ) + [ 0 , 0.05 s i n ( 0.27 t ) , 0.5 ] T δ 2 = [ 0.15 , 0.1 , 1 ] T ( 1 e t ) + [ 0 , 0.05 c o s ( 0.27 t ) ( 1 e 0.05 t ) , 0.5 ] T δ 3 = [ 0.1 , 0.1 , 1.2 e 0.05 t ] T ( 1 e t ) + [ 0 , 0.05 s i n ( 0.27 t ) e 0.03 t , 0.7 e 0.05 t ] T δ 4 = [ 0.15 , 0.1 , 0.8 ] T ( 1 e t ) + [ 0 , 0.055 s i n ( 0.2 t ) ( 1 e 0.05 t ) , 0.6 ] T δ 5 = [ 0.12 , 0.12 , 0.7 ] T ( 1 e t ) + [ 0 , 0.045 c o s ( 0.15 t ) ( 1 e 0.07 t ) , 0.4 ] T
with Γ ^ i k = 1 , δ ^ i k = 0 , i , k = 1 , 2 , 3 as the initial estimation values.
The simulation results of trajectory, position, attitude, attitude constraints, angular velocity constraints, control inputs, RBFNN, disturbance estimation, multiplicative fault estimation and additive fault estimation are demonstrated in Figure 5, Figure 6, Figure 7, Figure 8, Figure 9, Figure 10, Figure 11, Figure 12, Figure 13 and Figure 14, respectively. The trajectory and position snapshots of QRs and a moving target are illustrated in Figure 5. It can be seen that the QRs can successfully form the desired formation pattern Λ F and track the desired trajectory P d , thereby achieving the full coverage and close-range enclosing. Figure 6 shows the position tracking errors with and without RBFNN. In the case of with RBFNN, the tracking errors converge to the neighborhood of zero rapidly under the influence of lumped uncertainties. The effectiveness of RBFNN is demonstrated by the fact that tracking error cannot be reduced to near zero and continues to oscillate in the absence of RBFNN. Figure 7 demonstrates the robust learning ability of RBFNNs, convergence of approximation errors takes only a few seconds and oscillation at the beginning is caused by randomly selected initial weights. Figure 8 depicts the tracking performance of AFTAC, which, despite initial misalignments, tracks the command signal exceptionally well. Furthermore, Figure 9 and Figure 10 show the norm of attitude A i and norm of angular velocity Ω i always satisfy the predefined constraints C ¯ i 1 and C ¯ i 2 during the whole process. In Figure 9, the unconstrained AFTAC in [51] is compared under identical conditions, and the parameters of the comparison AFTAC are adjusted to achieve relatively good tracking performance. One can observe that the comparison AFTAC tracks the command signal closely throughout the whole process, but it cannot guarantee the state constraints will always be met; the constraints are occasionally exceeded, particularly when the command signal changes rapidly. The comparison results demonstrate that the specific system states can be constrained within a certain range to meet safety or sensor payload requirements, which is an advantage of our method. Figure 11 depicts the input signals of QRs, which contain large spikes at the beginning, T 1 and T 2 . These spikes are effectively filtered out by input saturation, where the actuator’s limitations are fully reflected. As demonstrated by the proof of Theorem 2, the upper bound of external disturbance and actuator fault signals are effectively estimated in Figure 12, Figure 13 and Figure 14.

5. Conclusions

This article presents a distributed formation control scheme for a group of QRs subject to constraints and time-varying delays. The proposed scheme consists of NTDPC for position control and state-constrained AFTAC for attitude regulating. In NTDPC, an adaptive RBFNN is utilized to compensate the lumped uncertainties, and a Lyapunov–Krasovskii analysis is applied to handle the time-varying delay. Based on the backstepping technique, AFTAC employs a tan-type BLF to handle the state constraints, an auxiliary system combined with a command filter to deal with input saturation and adaptive estimators to compensate fault signals and disturbances. To determine the efficacy of the proposed method, comparative simulations were conducted. We demonstrate that the proposed method can be applied for a mobile sensing task; the formation tracking errors are UUB; the estimation errors of actuator faults, uncertainties, and disturbances are also bounded; and the predefined constraints will never be violated during formation flight. However, the current method has some limitations, such as symmetric state constraints and a fixed network topology. Additional research will yield asymmetric state constraints and a mechanism for switching topologies.

Author Contributions

Conceptualization, Z.Z. and X.Z.; methodology, Z.Z.; software, Z.Z.; validation, Z.Z. and X.Z.; formal analysis, Z.Z.; investigation, Z.Z.; resources, Z.Z.; data curation, X.Z.; writing—original draft preparation, Z.Z.; writing—review and editing, Z.Z.; visualization, X.Z.; supervision, M.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Fundamental Research Funds for the Central Universities (Grant No. YWF-22-JC-01,02,03).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The data that support the findings of this study are available from the corresponding author upon reasonable request.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Wang, J.; Zhou, Z.; Wang, C.; Shan, J. Multiple Quadrotors Formation Flying Control Design and Experimental Verification. Unmanned Syst. 2019, 7, 47–54. [Google Scholar] [CrossRef]
  2. Du, H.; Zhu, W.; Wen, G.; Duan, Z.; Lü, J. Distributed Formation Control of Multiple Quadrotor Aircraft Based on Nonsmooth Consensus Algorithms. IEEE Trans. Cybern. 2019, 49, 342–353. [Google Scholar] [CrossRef]
  3. Dong, X.; Hua, Y.; Zhou, Y.; Ren, Z.; Zhong, Y. Theory and Experiment on Formation-Containment Control of Multiple Multirotor Unmanned Aerial Vehicle Systems. IEEE Trans. Autom. Sci. Eng. 2019, 16, 229–240. [Google Scholar] [CrossRef]
  4. Zhao, Z.; Wang, J.; Chen, Y.; Ju, S. Iterative learning-based formation control for multiple quadrotor unmanned aerial vehicles. Int. J. Adv. Robot. Syst. 2020, 17. [Google Scholar] [CrossRef] [Green Version]
  5. Aranda, M.; Mezouar, Y.; Lopez, N.; Sagues, C. Enclosing a moving target with an optimally rotated and scaled multiagent pattern. Sensors 2021, 94, 601–611. [Google Scholar] [CrossRef]
  6. Zhang, D.; Duan, H.; Zeng, Z. Leader-Follower Interactive Potential for Target Enclosing of Perception-Limited UAV Groups. IEEE Syst. J. 2022, 16, 856–867. [Google Scholar] [CrossRef]
  7. Yu, X.; Ma, J.; Ding, N.; Zhang, A. Cooperative Target Enclosing Control of Multiple Mobile Robots Subject to Input Disturbances. IEEE Trans. Syst. Man Cybern. Syst. 2021, 51, 3440–3449. [Google Scholar] [CrossRef]
  8. Huang, H.; Savkin, A.; Li, X. Reactive Autonomous Navigation of UAVs for Dynamic Sensing Coverage of Mobile Ground Targets. Sensors 2020, 20, 3720. [Google Scholar] [CrossRef] [PubMed]
  9. Sun, Q.; Liu, Z.; Chi, M.; Dou, Y.; He, D.; Qin, Y. Coverage control of unicycle multi-agent network in dynamic environment. Math. Methods Appl. Sci. 2021, 7795. [Google Scholar] [CrossRef]
  10. Song, C.; Fan, Y.; Xu, S. Finite-Time Coverage Control for Multiagent Systems With Unidirectional Motion on a Closed Curve. IEEE Trans. Cybern. 2021, 51, 3071–3078. [Google Scholar] [CrossRef]
  11. Yu, D.; Xu, H.; Chen, C.; Bai, W.; Wang, Z. Dynamic Coverage Control Based on K-Means. IEEE Trans. Ind. Electron. 2022, 69, 5333–5341. [Google Scholar] [CrossRef]
  12. Liu, C.; Ma, X.; Guo, X.; Tang, J. Distributed Energy-Efficient Multi-UAV Navigation for Long-Term Communication Coverage by Deep Reinforcement Learning. IEEE Trans. Mob. Comput. 2020, 19, 1274–1285. [Google Scholar] [CrossRef]
  13. Ghasemi, A.; Askari, J.; Menhaj, M.B. Distributed Fault Tolerant Control for Multi-agent Systems with Complex-weighted Directed Communication Topology subject to Actuator Faults. Int. J. Control Autom. Syst. 2019, 17, 415–424. [Google Scholar] [CrossRef]
  14. Cheng, W.; Zhang, K.; Jiang, B.; Ding, S.X. Fixed-Time Fault-Tolerant Formation Control for Heterogeneous Multi- Agent Systems with Parameter Uncertainties and Disturbance. IEEE Trans. Circuits Syst. 2021, 68, 2121–2133. [Google Scholar] [CrossRef]
  15. Abbaspour, A.; Mokhtari, S.; Sargolzaei, A.; Yen, K.K. A Survey on Active Fault-Tolerant Control Systems. Electronics 2020, 9, 1513. [Google Scholar] [CrossRef]
  16. Gui, Y.; Jia, Q.; Li, H.; Cheng, Y. Reconfigurable Fault-Tolerant Control for Spacecraft Formation Flying Based on Iterative Learning Algorithms. Appl. Sci. 2022, 12, 2485. [Google Scholar] [CrossRef]
  17. Zhao, W.; Liu, H.; Wan, Y. Data-driven fault-tolerant formation control for nonlinear quadrotors under multiple simultaneous actuator fault. Syst. Control. Lett. 2021, 158, 105063. [Google Scholar] [CrossRef]
  18. Zheng, Z.; Qian, M.; Li, P.; Yi, H. Distributed Adaptive Control for UAV Formation With Input Saturation and Actuator Fault. IEEE Access 2019, 7, 144638–144647. [Google Scholar] [CrossRef]
  19. Yu, X.; Liu, Z.; Zhang, Y. Fault-tolerant formation control of multiple UAVs in the presence of actuator faults. Int. J. Robust Nonlinear Control 2016, 26, 2668–2685. [Google Scholar] [CrossRef]
  20. Liu, C.; Jiang, B.; Zhang, K. Adaptive Fault-Tolerant H-Infinity Output Feedback Control for Lead–Wing Close Formation Flight. IEEE Trans. Syst. Man Cybern. 2020, 50, 2804–2814. [Google Scholar] [CrossRef]
  21. Zou, Y.; Xia, K.; He, W. Adaptive Fault-Tolerant Distributed Formation Control of Clustered Vertical Takeoff and Landing UAVs. IEEE Trans. Aerosp. Electron. Syst. 2022, 58, 1069–1082. [Google Scholar] [CrossRef]
  22. Gong, J.; Ma, Y.; Jiang, B.; Mao, Z. Distributed adaptive fault-tolerant formation control for heterogeneous multiagent systems under switching directed topologies. J. Frankl. Inst. 2022, 359, 3366–3388. [Google Scholar] [CrossRef]
  23. Liu, F.; Hua, Y.; Dong, X.; Li, Q.; Ren, Z. Adaptive fault-tolerant time-varying formation tracking for multi-agent systems under actuator failure and input saturation. ISA Trans. 2020, 104, 145–153. [Google Scholar] [CrossRef] [PubMed]
  24. Liu, Y.; Dong, X.; Shi, P.L.; Ren, Z.; Liu, J. Distributed Fault-Tolerant Formation Tracking Control for Multiagent Systems With Multiple Leaders and Constrained Actuators. IEEE Trans. Cybern. 2022. [Google Scholar] [CrossRef] [PubMed]
  25. Liu, B.; Li, A.; Guo, Y.; Wang, C. Adaptive distributed finite-time formation control for multi-UAVs under input saturation without collisions. Aerosp. Sci. Technol. 2022, 120, 107252. [Google Scholar] [CrossRef]
  26. Huang, S.; Teo, R.; Leong, W. Multi-Camera Networks for Coverage Control of Drones. Drones 2022, 6, 67. [Google Scholar] [CrossRef]
  27. Yang, J.; Cao, G.; Chen, W.; Zhang, W. Finite-Time Formation Control of Second-Order Linear Multi-Agent Systems with Relative State Constraints: A Barrier Function Sliding Mode Control Approach. IEEE Trans. Circuits Syst. II Express Briefs 2022, 69, 1253–1256. [Google Scholar] [CrossRef]
  28. López-Nicolás, G.; Aranda, M.; Mezouar, Y. Adaptive Multirobot Formation Planning to Enclose and Track a Target With Motion and Visibility Constraint. IEEE Trans. Robot. 2020, 36, 142–156. [Google Scholar]
  29. Miao, Z.; Zhong, H.; Lin, J.; Wang, Y.; Chen, Y.; Fierro, R. Vision-Based Formation Control of Mobile Robots With FOV Constraints and Unknown Feature Depth. IEEE Trans. Control Syst. Technol. 2021, 29, 2231–2238. [Google Scholar] [CrossRef]
  30. Liu, H.; Ma, T.; Lewis, F.L.; Wan, Y. Robust Formation Trajectory Tracking Control for Multiple Quadrotors With Communication Delays. IEEE Trans. Control Syst. Technol. 2020, 28, 2633–2640. [Google Scholar] [CrossRef]
  31. Ren, H.; Karimi, H.R.; Lu, R.; Wu, Y. Synchronization of Network Systems via Aperiodic Sampled-Data Control With Constant Delay and Application to Unmanned Ground Vehicles. IEEE Trans. Ind. Electron. 2020, 67, 4980–4990. [Google Scholar] [CrossRef]
  32. Ma, P.; Ji, J.; Sui, J.; Lei, M. Research on Cooperative Formation Flight Control of Multi-UAV with Communication Time Delay. In Proceedings of the International Conference on Control Science and Electric Power Systems (CSEPS), Shanghai, China, 28–30 May 2021; pp. 54–58. [Google Scholar]
  33. Wang, M.; Zhang, T. Leader-following Formation Control of Second-order Nonlinear Systems with Time-varying Communication Delay. Int. J. Control Autom. Syst. 2021, 19, 1729–1739. [Google Scholar] [CrossRef]
  34. Liu, X.; Deng, F.; Wei, W.; Wan, F. Formation Tracking Control of Networked Systems With Time-Varying Delays and Sampling Under Fixed and Markovian Switching Topology. IEEE Trans. Control Netw. Syst. 2022, 9, 601–612. [Google Scholar] [CrossRef]
  35. Ren, H.P.; Jiao, S.S.; Wang, X.; Kaynak, O. Fractional Order Integral Sliding Mode Controller Based on Neural Network: Theory and Electro-Hydraulic Benchmark Test. IEEE-ASME Trans. Mechatronics 2022, 27, 1457–1466. [Google Scholar] [CrossRef]
  36. Singh, P.; Giri, D.K.; Ghosh, A.K. Robust backstepping sliding mode aircraft attitude and altitude control based on adaptive neural network using symmetric BLF. Aerosp. Sci. Technol. 2022, 126, 107653. [Google Scholar] [CrossRef]
  37. Ge, Y.; Zhou, J.; Deng, W.; Yao, J.; Xie, L. Neural network robust control of a 3-DOF hydraulic manipulator with asymptotic tracking. Asian J. Control 2022. [Google Scholar] [CrossRef]
  38. Nuss, U. Design of a disturbance observer based on an already existing observer without disturbance model. At-Automatisierungstechnik 2022, 70, 134–141. [Google Scholar]
  39. Huang, Z.G.; Chen, M. Coordinated Disturbance Observer-Based Flight Control of Fixed-Wing UAV. IEEE Trans. Circuits Syst.-Express Briefs 2022, 69, 3545–3549. [Google Scholar] [CrossRef]
  40. Xie, W.; Cabecinhas, D.; Cunha, R.; Silvestre, C. Adaptive Backstepping Control of a Quadcopter With Uncertain Vehicle Mass, Moment of Inertia, and Disturbances. IEEE Trans. Ind. Electron. 2022, 69, 549–559. [Google Scholar] [CrossRef]
  41. Wang, N.; Hao, F. Event-based adaptive sliding mode control for Euler-Lagrange systems with parameter uncertainties and external disturbances. Int. J. Robust Nonlinear Control 2022, 32, 5420–5435. [Google Scholar] [CrossRef]
  42. Matouk, D.; Gherouat, O.; Abdessemed, F.; Hassam, A. Quadrotor position and attitude control via backstepping approach. In Proceedings of the International Conference on Modelling, Identification and Control (ICMIC), Algiers, Algeria, 15–17 November 2016; pp. 73–79. [Google Scholar]
  43. Liu, K.; Xie, G.; Wang, L. Consensus for multi-agent systems under double integrator dynamics with time-varying communication delays. Int. J. Robust Nonlinear Control 2012, 22, 1881–1898. [Google Scholar] [CrossRef]
  44. Zhang, H.; Lewis, F.L. Adaptive cooperative tracking control of higher-order nonlinear systems with unknown dynamics. Automatica 2012, 46, 1432–1439. [Google Scholar] [CrossRef]
  45. Ni, W.; Cheng, D. Leader-following consensus of multi-agent systems under fixed and switching topologies. Syst. Control Lett. 2010, 59, 209–217. [Google Scholar] [CrossRef]
  46. Zhu, Z.; Guo, Y.; Zhong, C. Distributed attitude coordination tracking control for spacecraft formation with time-varying delays. Trans. Inst. Meas. Control 2018, 40, 2082–2087. [Google Scholar] [CrossRef]
  47. Khalil, H.K. Nonlinear Systems, 3rd ed.; Prentice Hall: Upper Saddle River, NJ, USA, 2001; pp. 168–174. [Google Scholar]
  48. Li, P.; Yang, G.H. Fault-tolerant control of uncertain nonlinear systems with nonlinearly parameterized fuzzy system. In Proceedings of the IEEE Control Applications, (CCA) & Intelligent Control, (ISIC), St. Petersburg, Russia, 8–10 October 2009; pp. 382–387. [Google Scholar]
  49. Zhou, B.; Cai, G.; Liu, Y.; Liu, P. Motion prediction of a non-cooperative space target. Adv. Space Res. 2018, 61, 207–222. [Google Scholar] [CrossRef]
  50. Zhu, Z.; Xiang, W.; Huo, J.; Yang, M.; Zhang, G. Non-cooperative target pose estimation based on improved iterative closest point algorithm. J. Syst. Eng. Electron. 2022, 33, 1–10. [Google Scholar] [CrossRef]
  51. Yu, W.; Yan, J.; Pan, X.; Tan, S.; Cao, H.; Song, Y. Fault-tolerant attitude tracking control with practical finite time convergence for unmanned aerial vehicles under actuation faults. Int. J. Robust Nonlinear Control 2022, 32, 3737–3753. [Google Scholar] [CrossRef]
Figure 1. Depiction of the target-enclosing and covering task.
Figure 1. Depiction of the target-enclosing and covering task.
Sensors 22 07497 g001
Figure 2. Block diagram of proposed formation control scheme scheme.
Figure 2. Block diagram of proposed formation control scheme scheme.
Sensors 22 07497 g002
Figure 3. Framework of the command filter, with ω i B and ξ i B being design constants, i Σ .
Figure 3. Framework of the command filter, with ω i B and ξ i B being design constants, i Σ .
Sensors 22 07497 g003
Figure 4. The communication topology graph.
Figure 4. The communication topology graph.
Sensors 22 07497 g004
Figure 5. Trajectory, position snapshots and coverage areas of Quadrotors (QRs) and a moving target with T 1 = 35 s , T 2 = 40 s , T 3 = 45 s .
Figure 5. Trajectory, position snapshots and coverage areas of Quadrotors (QRs) and a moving target with T 1 = 35 s , T 2 = 40 s , T 3 = 45 s .
Sensors 22 07497 g005
Figure 6. Comparison of position tracking errors with and without radial basis function neural network (RBFNN).
Figure 6. Comparison of position tracking errors with and without radial basis function neural network (RBFNN).
Sensors 22 07497 g006
Figure 7. RBFNN approximation errors on 3 axes.
Figure 7. RBFNN approximation errors on 3 axes.
Sensors 22 07497 g007
Figure 8. Attitude signals of QRs.
Figure 8. Attitude signals of QRs.
Sensors 22 07497 g008
Figure 9. A i , A i C and constraints C ¯ i 1 , i = 1 , 2 , 3 , 4 , 5 .
Figure 9. A i , A i C and constraints C ¯ i 1 , i = 1 , 2 , 3 , 4 , 5 .
Sensors 22 07497 g009
Figure 10. Ω i , α i and constraints C ¯ i 2 , i = 1 , 2 , 3 , 4 , 5 .
Figure 10. Ω i , α i and constraints C ¯ i 2 , i = 1 , 2 , 3 , 4 , 5 .
Sensors 22 07497 g010
Figure 11. Input signals of QRs.
Figure 11. Input signals of QRs.
Sensors 22 07497 g011
Figure 12. Estimation of external disturbances’ upper bounds.
Figure 12. Estimation of external disturbances’ upper bounds.
Sensors 22 07497 g012
Figure 13. Estimation of multiplicative faults.
Figure 13. Estimation of multiplicative faults.
Sensors 22 07497 g013
Figure 14. Estimation of additive faults.
Figure 14. Estimation of additive faults.
Sensors 22 07497 g014
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Zhao, Z.; Zhu, M.; Zhang, X. Target Enclosing and Coverage Control for Quadrotors with Constraints and Time-Varying Delays: A Neural Adaptive Fault-Tolerant Formation Control Approach. Sensors 2022, 22, 7497. https://doi.org/10.3390/s22197497

AMA Style

Zhao Z, Zhu M, Zhang X. Target Enclosing and Coverage Control for Quadrotors with Constraints and Time-Varying Delays: A Neural Adaptive Fault-Tolerant Formation Control Approach. Sensors. 2022; 22(19):7497. https://doi.org/10.3390/s22197497

Chicago/Turabian Style

Zhao, Ziqian, Ming Zhu, and Xiaojun Zhang. 2022. "Target Enclosing and Coverage Control for Quadrotors with Constraints and Time-Varying Delays: A Neural Adaptive Fault-Tolerant Formation Control Approach" Sensors 22, no. 19: 7497. https://doi.org/10.3390/s22197497

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