Next Article in Journal
Intensification of Thermal Performance of a Heat Exchanger Tube with Knitted Wire Coil Turbulators Installed
Previous Article in Journal
Autonomous Energy-Harvesting Sensor for Building Health Monitoring
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Observer-Based Robust Containment Control of Multi-Agent Systems with Structural Uncertainties and Multiple Delays

by
Tuo Zhou
1,2
1
School of Information and Electronic Engineering, Shandong Technology and Business University, Yantai 264005, China
2
Research Institute of Information Fusion, Naval Aviation University, Yantai 264001, China
Eng 2025, 6(12), 336; https://doi.org/10.3390/eng6120336
Submission received: 11 October 2025 / Revised: 15 November 2025 / Accepted: 22 November 2025 / Published: 25 November 2025

Abstract

In this paper, a distributed output-feedback control law is proposed to explore the containment control problem for uncertain multi-agent systems with nonlinear dynamics. First, unlike the existing control schemes, an improved observer-based robust containment controller without utilizing the observation of leaders is developed, where the inaccuracy of the model structure is considered. Second, different from previous studies that considered a single transmission delay, both parameter uncertainties and multiple time delays are investigated over a directed graph. Notably, the considered delays are nonuniform: the state delay is related to the nonlinearities, and the transmission delay is taken into account in the controller design. In addition, making use of the delay-product-type quadratic approach, sufficient conditions are rigorously derived to realize containment control, and it is proved that the containment error converges to zero. Finally, a simulation model is constructed in MATLAB R2021a platform to validate the effectiveness of the algorithm.

1. Introduction

Over the previous 20 years, consensus problems of multi-agent systems (MASs), encompassing synchronization, swarming, flocking, consensus tracking, and containment, have been an active research area in various fields, such as unmanned aerial vehicles [1,2], urban traffic management [3,4], energy efficiency and energy integration [5,6], attitude of astrovehicle alignment [7], optimization [8,9], and so on. Numerous studies have investigated the consensus and containment problems of MASs. In [10], the secure consensus is analyzed via a fully distributed robust consensus protocol in the presence of Denial-of-Service attacks under Markovian switching graphs. For heterogeneous dynamics, the consensus tracking of a dynamic leader is solved by a data-driven consensus protocol [11]. Moreover, for containment and formation–containment problems of multiple leaders, several remarkable achievements have been reported [12,13,14,15,16]. It is worth noting that the cited papers [10,11,12,13,14,15,16] focus on particular MASs. However, parameter uncertainties [17] lead to system performance degradation or even loss of stability. Thus, it is of great significance to further explore consensus problems for MASs subject to structural uncertainties.
The robust consensus of uncertain first-order and second-order MASs is discussed by developing parameter-dependent Lyapunov functions in [18]. Depending on the relative states among neighboring agents, the distributed H containment problem of second-order MASs is solved in [19]. Different from low-order dynamics [18,19], many consensus results of high-order dynamics with structural uncertainties have been reported. Specifically, for linear dynamics, an adaptive control algorithm is adopted to address the consensus problem in the presence of heterogeneous matching uncertainties [20]. Based on a neural network approximation method, the quasi-containment and asymptotic containment results for uncertain dynamics are, respectively, shown in [21]. By using a state feedback control protocol, the H 2 consensus is studied in [22] subject to parametric uncertainties and measurement noises. Further, in [23], a fixed-time control algorithm is developed to discuss the robustness and convergence speed for uncertain robotic systems. Also, for uncertain heterogeneous singular MASs, the adaptive fault-tolerant consensus tracking problem is investigated in [24] via a proportional and differential control algorithm. Moreover, the containment reports of heterogeneous MASs with uncertain parameters can be found in [25,26,27,28].
The above results only focus on consensus problems with parameter uncertainties, yet the time delays in the network communication are ignored. However, delays inevitably arise in practical complex environments. Regarding an observer-based adaptive algorithm, the consensus tracking problem with state time delay is addressed in [29]. By introducing a unified D-type learning algorithm, the results of a consensus tracking problem with state time delay are obtained in [30]. In the presence of transmission delay, ref. [31] is concerned with the bipartite containment control issue, where an event-based protocol with a state-dependent trigger function is developed. When subject to multiple delays, a great number of achievements are presented [32,33,34,35,36,37]. Particularly, a data-based adaptive dynamic programming algorithm is constructed. Further, optimal consensus tracking with multiple delays is discussed in [33]. Taking into account both unknown state and input delays, a truncated prediction feedback algorithm is introduced to cope with the output-feedback control problem of interconnected MASs [36]. Further, aiming at heterogeneous multi-human MASs, ref. [37] considers the containment problem subject to transmission delays as well as human reaction delays. Moreover, in the study of fractional MASs with mixed delays, the bipartite containment control problem is addressed via a delayed control algorithm [38].
Indeed, some results for uncertain MASs with delays that have been presented attract research attention, such as weighted consensus [39], output consensus tracking control [40], and robust containment control [41]. However, only limited results have been obtained for MASs with different delays and parameter uncertainties, which motivates us to undertake the present study. Inspired by the above discussion, this paper focuses on the robust containment control of high-order MASs with structural uncertainties and multiple delays.
The three main contributions of the paper are as follows: (1) Without taking the observations of leaders into account, an observer-based output-feedback control protocol is proposed over the directed graph, where the design of the feedback-gain matrices is carried out independently. (2) For dynamics considering structural uncertainties, in comparison with leaderless consensus [18,22] and consensus tracking control [20,24] in the absence of delays, the proposed control protocol aims to deal with the robust containment problems of multi-leader MASs with multiple delays. (3) Our designed protocol not only handles parameter uncertainties but also state delay and transmission delay, in contrast with existing results considering delays that ignore structural uncertainties [29,30,31,32,33,34,35,36].

2. Preliminaries and Problem Formulation

2.1. Preliminaries and Notations

Let G = V , E , A represent the interaction graph where G has N nodes and E = ( k , j ) : k , j V represent edges. Define the adjacency matrix A = [ a k j ] R N × N for a k j = 1 if ( k , j ) E and a k j = 0 otherwise. Further, denote L = [ l k j ] R N × N the Laplacian matrix for l k j = a k j with k j and l k k = j = 1 , j k N a k j [42]. Moreover, He ( X ) = X + X T , diag { z 1 , z 2 , , z n } represents a diagonal matrix, col ( z 1 , z 2 , , z n ) denotes a column vector, and X Y stands for the Kronecker product. Further, the convex hull C o ( Π ) is defined by C o ( Π ) = { k = 1 n ϖ k π k π k R , ϖ k 0 , k = 1 n ϖ k = 1 } with the set Π = { π 1 , π 2 , , π n } .

2.2. Problem Formulation

The system consists of M followers with k S F = { 1 , 2 , , M } and N M leaders with k S L = { M + 1 , M + 2 , , N } . Consider the MASs with the following uncertain dynamics:
x ˙ k ( t ) = ( A + Δ A ( t ) ) x k ( t ) + ( B + Δ B ( t ) ) u k ( t ) + D g ( x k ( t τ 1 ) ) , y k ( t ) = C x k ( t ) , k V ,
where A R n × n , B R n × m , D R n × n , C R q × n . x k ( t ) R n , y k ( t ) R q , and u k ( t ) R m represent the state, measurement output, and control input of the system. g ( x k ( t τ 1 ) ) denotes the inner nonlinear function, and the known constant τ 1 0 stands for the state delay. Note that A, B, C, and D are known constant matrices. Δ A ( t ) R n × n and Δ B ( t ) R n × m are the unknown uncertainties satisfying
[ Δ A ( t ) Δ B ( t ) ] = E H ( t ) [ F 1 F 2 ] ,
where E R n × n , F 1 R n × n , and F 2 R n × m are known constant matrices and H ( t ) R n × n is an unknown time-varying matrix satisfying
H T ( t ) H ( t ) I .
In addition, note that u k ( t ) = 0 for k S L . Then, L can be expressed as
L = L 11 L 12 0 0 ,
where L 11 R M × M and L 12 R M × ( N M ) , and it yields L 11 1 M + L 12 1 N M = 0 ; thus, it derives L 11 1 L 12 1 N M = 1 M , and L 11 1 L 12 is nonnegative.
Remark 1.
It should be pointed out that the state delays inherent in the system are frequently overlooked. In [29,30], the consensus tracking problems with state time delay are discussed, while the structural uncertainties are not addressed. Thus, considering both the state delays and uncertain dynamics, the model (1) is paid attention to in the presence of multiple leaders.
Definition 1
([25]). The containment control of MAS (1) with uncertain parameters Δ A ( t ) and Δ B ( t ) is achieved when lim t dist ( x k , C o ( x M + 1 , , x N ) ) = 0 , k S F holds.
Assumption 1.
For each follower, there exists at least one leader that has a directed path to that follower.
Lemma 1
([43]). There exist a matrix Δ > 0 and a constant ζ > 0 such that
t ζ t φ T ( s ) Δ φ ( s ) d s 1 ζ t ζ t φ ( s ) d s T Δ t ζ t φ ( s ) d s .
Lemma 2
([13]). For matrices Z = Z T , X, and Y with compatible dimensions,
Z + X Φ ( t ) Y + Y T Φ T ( t ) X T < 0
satisfies Φ T ( t ) Φ ( t ) I , and then there exists a constant δ > 0 such that
Z + δ X X T + δ 1 Y T Y < 0 .

3. Robust Containment Control Design Condition

In order to enforce the agents to research containment control, a robust transmission delay controller for follower k is presented
ϕ ˙ k ( t ) = ( A + Δ A ( t ) ) ϕ k ( t ) + ( B + Δ B ( t ) ) G 1 j S F a k j ( ϕ k ( t τ 2 ) ϕ j ( t τ 2 ) ) + G 2 j S F S L a k j ( y k ( t τ 2 ) y j ( t τ 2 ) ) C ϕ k ( t ) , u k ( t ) = G 1 ϕ k ( t ) ,
where ϕ k ( t ) stands for the state estimation, G 1 and G 2 are feedback-gain matrices, and the known constant τ 2 0 represents the transmission delay.
Remark 2.
Unlike the protocols that only focus on structural uncertainties [18,19,20,21,22,23,24], by making use of the measurement output information, our proposed protocol (2) is employed to cope with the structural uncertainties, as well as the multiple delays.
Let ε k ( t ) = j S F S L a k j x k ( t ) x j ( t ) , k S F , and ε ( t ) = col ( ε 1 ( t ) , , ε M ( t ) ) . Then, it has
ε ( t ) = ( L 11 I n ) x F ( t ) + ( L 12 I n ) x L ( t ) ,
where x F ( t ) = col ( x 1 ( t ) , , x M ( t ) ) , x L ( t ) = col ( x M + 1 ( t ) , , x N ( t ) ) .
Let Υ ( x ( t τ 1 ) ) = ( L 11 D ) [ Υ 1 ( x ( t τ 1 ) ) + ( L 11 1 L 12 I n ) Υ 2 ( x ( t τ 1 ) ) ] , Υ 1 ( x ( t τ 1 ) ) = col ( g ( x 1 ( t τ 1 ) ) , , g ( x M ( t τ 1 ) ) ) , Υ 2 ( x ( t τ 1 ) ) = col ( g ( x M + 1 ( t τ 1 ) ) , , f ( x N ( t τ 1 ) ) ) . It follows from (1)–(3) that
ε ˙ ( t ) = ( I M ( A + Δ A ( t ) ) ) ε ( t ) + ( L 11 ( B + Δ B ( t ) ) G 1 ) ϕ F ( t ) + Υ ( x ( t τ 1 ) ) ,
where ϕ F ( t ) = col ( ϕ 1 ( t ) , , ϕ M ( t ) ) .
Let ϕ ˜ k ( t ) = j S F S L a k j x k ( t ) x j ( t ) ϕ k ( t ) denote the containment estimation error, and it has ϕ F ( t ) = ε ( t ) ϕ ˜ F ( t ) , where ϕ ˜ F ( t ) = col ( ϕ ˜ 1 ( t ) , , ϕ ˜ M ( t ) ) . It follows from (4) that
ε ˙ ( t ) = ( I M ( A + Δ A ( t ) ) + L 11 ( B + Δ B ( t ) ) G 1 ) ε ( t ) ( L 11 ( B + Δ B ( t ) ) G 1 ) ϕ ˜ F ( t ) + Υ ( x ( t τ 1 ) ) .
And, based on (2), it has
ϕ ˙ F ( t ) = ( I M ( A + Δ A ( t ) G 2 C ) ) ϕ F ( t ) + ( L 3 ( B + Δ B ( t ) ) G 1 ) ϕ F ( t τ 2 ) + ( I M G 2 C ) ε ( t τ 2 ) ,
where
L 3 = j S F a 1 j a 12 a 1 M a M 1 a M 2 j S F a M j .
Further, it yields
ϕ ˜ ˙ F ( t ) = ε ˙ ( t ) ϕ ˙ F ( t ) = ( I M G 2 C + L 11 ( B + Δ B ( t ) ) G 1 ) ε ( t ) + Υ ( x ( t τ 1 ) ) + ( I M ( A + Δ A ( t ) G 2 C ) L 11 ( B + Δ B ( t ) ) G 1 ) ϕ ˜ F ( t ) + ( L 3 ( B + Δ B ( t ) ) G 1 ) ϕ ˜ F ( t τ 2 ) ( L 3 ( B + Δ B ( t ) ) G 1 + I M G 2 C ) ε ( t τ 2 ) .
Thus, from (5) and (7), it yields
β ˙ ( t ) = R 1 ( t ) β ( t ) + R 2 ( t ) β ( t τ 2 ) + Υ ˜ ( x ( t τ 1 ) ) ,
where
β ( t ) = ε ( t ) ϕ ˜ F ( t ) , Υ ˜ ( x ( t τ 1 ) ) = Υ ( x ( t τ 1 ) ) Υ ( x ( t τ 1 ) ) , Z ( t ) = L 11 ( B + Δ B ( t ) ) G 1 , R 1 ( t ) = I M ( A + Δ A ( t ) ) + Z ( t ) Z ( t ) Z ( t ) + I M G 2 C I M ( A + Δ A ( t ) G 2 C ) Z ( t ) , R 2 ( t ) = 0 0 L 3 ( B + Δ B ( t ) ) G 1 I M G 2 C L 3 ( B + Δ B ( t ) ) G 1 .
In order to facilitate reading, the following symbols are given:
Γ 6 = Γ 7 , Γ 7 = Γ 2 , Γ 8 = Γ 5 , Λ ¯ 2 = L 3 F 2 G 1 , Λ 2 = L 11 F 2 G 1 , Γ ¯ 4 = Γ ¯ 3 , Θ ^ 1 = L 11 T V 1 T B T , Θ ^ 2 = I M C T V 2 T , Λ 1 = I M P 1 E , Θ ˜ 1 = L 3 B V 1 , Θ 2 = I M A T P 1 , Θ 4 = I M S 1 , Θ ^ 4 = I M S 2 , Λ ¯ 1 = I M F 1 , Θ 3 = Θ 1 + Θ 4 , Θ ^ 3 = Θ 1 + Θ ^ 4 , Θ 1 = I M P 1 , Θ 11 = Θ 4 + Θ ^ 4 2 Θ 1 + He ( Θ ^ 1 + Θ 2 ) , Θ 12 = Θ ^ 1 T + Θ ^ 1 + Θ ^ 2 , Θ 22 = Θ 4 + Θ ^ 4 2 Θ 1 + He ( Θ 2 Θ ^ 2 Θ ^ 1 ) , Θ 25 = Θ ˜ 1 Θ ^ 2 T , Θ 26 = Θ 1 + Θ ˜ 1 , Θ ˜ 11 = μ ( Θ 2 + Θ ^ 1 ) + Θ 1 , Θ ˜ 12 = μ ( Θ ^ 2 + Θ ^ 1 ) , Θ ˜ 21 = μ Θ ^ 1 , Θ ˜ 22 = μ ( Θ 2 Θ ^ 2 Θ ^ 1 ) + Θ 1 , Θ ˜ 13 = τ 1 ( Θ 2 + Θ ^ 1 ) , Θ ˜ 14 = τ 1 ( Θ ^ 1 + Θ ^ 2 ) , Θ ˜ 23 = τ 1 Θ ^ 1 , Θ ˜ 24 = τ 1 ( Θ 2 Θ ^ 2 Θ ^ 1 ) , Θ ˜ 15 = τ 2 ( Θ 2 + Θ ^ 1 ) , Θ ˜ 16 = τ 2 ( Θ ^ 2 + Θ ^ 1 ) , Θ 44 = μ Θ 12 , Θ ˜ 25 = τ 2 Θ ^ 1 , Θ ˜ 26 = τ 2 ( Θ 2 Θ ^ 2 Θ ^ 1 ) , Θ 66 = Θ 55 = Θ 12 .
Theorem 1.
Suppose that Assumption 1 holds. For given parameters τ 1 > 0 , τ 2 > 0 and μ = τ 1 2 + τ 2 2 , the distributed robust containment control of MAS (1) with uncertain parameters can be achieved by (2) if there exist matrices P 1 > 0 , S 1 > 0 , S 2 > 0 , V 1 > 0 , V 2 > 0 , P and scalars δ j , δ j , j = 1 , 2 , , 8 and the following linear matrix inequality (LMI) holds:
Θ Γ Λ < 0 ,
with
Γ = [ Γ ¯ 1 , , Γ ¯ 8 , Γ ^ 1 , , Γ ^ 8 , δ 1 Γ 1 , , δ 8 Γ 8 , δ 1 Γ 1 , , δ 8 Γ 8 ] , Λ = diag { δ 1 , , δ 8 , δ 1 , , δ 8 , δ 1 , , δ 8 , δ 1 , , δ 8 } , Θ = Θ 11 Θ 12 Θ 13 Θ 14 Θ 15 Θ 16 Θ 22 0 0 0 0 Θ 33 Θ 34 Θ 35 Θ 36 Θ 44 0 0 Θ 55 0 Θ 66 ,
Θ 11 = Θ 11 Θ 12 Θ 22 , Θ 12 = Θ 1 0 Θ 1 , Θ 13 = Θ 1 0 Θ 25 Θ 26 , Θ 14 = Θ ˜ 11 Θ ˜ 12 Θ ˜ 21 Θ ˜ 22 , Θ 15 = Θ ˜ 13 Θ ˜ 14 Θ ˜ 23 Θ ˜ 24 , Θ 16 = Θ ˜ 15 Θ ˜ 16 Θ ˜ 25 Θ ˜ 26 , Θ 22 = Θ 3 0 Θ 3 , Θ 33 = Θ ^ 3 0 Θ ^ 3 , Θ 34 = 0 Θ ˜ 52 0 Θ ˜ 62 , Θ 35 = 0 Θ ˜ 54 0 Θ ˜ 64 , Θ 36 = 0 Θ ˜ 56 0 Θ ˜ 66 ,
where
Γ ¯ 1 = col Λ 1 0 0 0 0 0 0 0 0 0 0 0 , Γ 1 = Λ ¯ 1 0 0 0 0 0 0 0 0 0 0 0 , Γ ¯ 2 = col Λ 1 Λ 1 0 0 0 0 0 0 0 0 0 0 , Γ 2 = Λ 2 Λ 2 0 0 0 0 0 0 0 0 0 0 , Γ ¯ 3 = col 0 Λ 1 0 0 0 0 0 0 0 0 0 0 , Γ 3 = 0 Λ ¯ 1 0 0 0 0 0 0 0 0 0 0 , Γ 4 = 0 0 0 0 Λ ¯ 2 Λ ¯ 2 0 0 0 0 0 0 , Γ ¯ 5 = col μ Λ ¯ 1 T 0 0 0 0 0 0 0 0 0 0 0 , Γ 5 = 0 0 0 0 0 0 Λ 1 T 0 0 0 0 0 , Γ ¯ 6 = col μ Λ 2 T μ Λ 2 T 0 0 0 0 0 0 0 0 0 0 , Γ 6 = 0 0 0 0 0 0 Λ 1 T Λ 1 T 0 0 0 0 , Γ ¯ 7 = col 0 μ Λ ¯ 1 T 0 0 0 0 0 0 0 0 0 0 , Γ 7 = 0 0 0 0 0 0 0 Λ 1 T 0 0 0 0 , Γ ¯ 8 = col τ 1 Λ ¯ 1 T 0 0 0 0 0 0 0 0 0 0 0 , Γ 8 = 0 0 0 0 0 0 0 0 Λ 1 T 0 0 0 ,
and
Γ ^ 1 = col τ 1 Λ ¯ 2 T τ 1 Λ ¯ 2 T 0 0 0 0 0 0 0 0 0 0 , Γ 1 = 0 0 0 0 0 0 0 0 Λ 1 T Λ 1 T 0 0 , Γ ^ 2 = col 0 τ 1 Λ ¯ 1 T 0 0 0 0 0 0 0 0 0 0 , Γ 2 = 0 0 0 0 0 0 0 0 0 Λ 1 T 0 0 , Γ ^ 3 = col τ 2 Λ ¯ 1 T 0 0 0 0 0 0 0 0 0 0 0 , Γ 3 = 0 0 0 0 0 0 0 0 0 0 Λ 1 T 0 , Γ ^ 4 = col τ 2 Λ 2 T τ 2 Λ 2 T 0 0 0 0 0 0 0 0 0 0 , Γ 4 = 0 0 0 0 0 0 0 0 0 0 Λ 1 T Λ 1 T , Γ ^ 5 = col 0 τ 2 Λ ¯ 1 T 0 0 0 0 0 0 0 0 0 0 , Γ 5 = 0 0 0 0 0 0 0 0 0 0 0 Λ 1 T , Γ ^ 6 = col 0 0 0 0 μ Λ ¯ 2 T μ Λ ¯ 2 T 0 0 0 0 0 0 , Γ ^ 7 = col 0 0 0 0 τ 1 Λ ¯ 2 T τ 1 Λ ¯ 2 T 0 0 0 0 0 0 , Γ ^ 8 = col 0 0 0 0 τ 2 Λ ¯ 2 T τ 2 Λ ¯ 2 T 0 0 0 0 0 0 .
Moreover, the gain matrices are calculated by B P = P 1 B , G 1 = P 1 V 1 and G 2 = P 1 1 V 2 .
Proof. 
Choose the following Lyapunov–Krasovskii functional (LKF) candidate for MAS (1):
V ( t ) = p = 1 4 V p ( t ) ,
where
V 1 ( t ) = β T ( t ) P ¯ β ( t ) , V 2 ( t ) = t τ 1 t β T ( s ) S ¯ β ( s ) d s + t τ 2 t β T ( s ) S ˜ β ( s ) d s , V 3 ( t ) = τ 1 τ 1 0 t + θ t β ˙ T ( s ) P ¯ β ˙ ( s ) d s d θ , V 4 ( t ) = τ 2 τ 2 0 t + θ t β ˙ T ( s ) P ¯ β ˙ ( s ) d s d θ ,
with
P ¯ = Θ 1 0 0 Θ 1 , S ¯ = Θ 4 0 0 Θ 4 , S ˜ = Θ ^ 4 0 0 Θ ^ 4 ,
and Θ 1 , Θ 4 , Θ ^ 4 are defined in Theorem 1.
Calculating the time derivative of V ( t ) along the trajectories of (8) yields
V ˙ 1 ( t ) = β T ( t ) He ( P ¯ R 1 ( t ) ) β ( t ) + He ( β T ( t ) P ¯ R 2 ( t ) β ( t τ 2 ) ) + He ( β T ( t ) P ¯ Υ ˜ ( x ( t τ 1 ) ) ) ,
and
V ˙ 2 ( t ) = β T ( t ) S ¯ β ( t ) β T ( t τ 1 ) S ¯ β ( t τ 1 ) + β T ( t ) S ˜ β ( t ) β T ( t τ 2 ) S ˜ β ( t τ 2 ) .
Also, we have
V ˙ 3 ( t ) = τ 1 2 β ˙ T ( t ) P ¯ β ˙ ( t ) τ 1 t τ 1 t β ˙ T ( s ) P ¯ β ˙ ( s ) d s = τ 1 2 [ β T ( t ) R 1 T ( t ) P ¯ R 1 ( t ) β ( t ) + He ( β T ( t ) R 1 T ( t ) P ¯ R 2 ( t ) β ( t τ 2 ) ) + β T ( t τ 2 ) R 2 T ( t ) P ¯ R 2 ( t ) β ( t τ 2 ) + He ( β T ( t ) R 1 T ( t ) P ¯ Υ ˜ ( x ( t τ 1 ) ) ) + He ( β T ( t τ 2 ) R 2 T ( t ) P ¯ Υ ˜ ( x ( t τ 1 ) ) ) + Υ ˜ T ( x ( t τ 1 ) ) P ¯ Υ ˜ ( x ( t τ 1 ) ) ] τ 1 t τ 1 t β ˙ T ( s ) P ¯ β ˙ ( s ) d s ,
by Lemma 1, it yields
τ 1 t τ 1 t β ˙ T ( s ) P ¯ β ˙ ( s ) d s ( β ( t ) β ( t τ 1 ) ) T P ¯ ( β ( t ) β ( t τ 1 ) ) .
Adopting the same method in taking the derivative of V 3 ( t ) yields
V ˙ 4 ( t ) τ 2 2 [ β T ( t ) R 1 T ( t ) P ¯ R 1 ( t ) β ( t ) + He ( β T ( t ) R 1 T ( t ) P ¯ R 2 ( t ) β ( t τ 2 ) ) + β T ( t τ 2 ) R 2 T ( t ) P ¯ R 2 ( t ) β ( t τ 2 ) + He ( β T ( t ) R 1 T ( t ) P ¯ Υ ˜ ( x ( t τ 1 ) ) ) + He ( β T ( t τ 2 ) R 2 T ( t ) P ¯ Υ ˜ ( x ( t τ 1 ) ) ) + Υ ˜ T ( x ( t τ 1 ) ) P ¯ Υ ˜ ( x ( t τ 1 ) ) ] ( β ( t ) β ( t τ 2 ) ) T P ¯ ( β ( t ) β ( t τ 2 ) ) .
Let ξ ( t ) = col ( β ( t ) , β ( t τ 1 ) , β ( t τ 2 ) , Υ ˜ ( x ( t τ 1 ) ) ) . From Theorem 1, it is obtained that V 1 = P G 1 and V 2 = P 1 G 2 . Further, combining with (11)–(14), it has
V ˙ ( t ) ξ T ( t ) Ψ ˜ ( t ) ξ ( t ) ,
where
Ψ ˜ ( t ) = θ ˜ 11 ( t ) P ¯ θ ˜ 13 ( t ) θ ˜ 14 ( t ) S ¯ P ¯ 0 0 θ ˜ 33 ( t ) θ ˜ 34 ( t ) θ ˜ 44 ( t ) , θ ˜ 11 ( t ) = He ( R 1 T ( t ) P ¯ ) + S ¯ + S ˜ 2 P ¯ + μ R 1 T ( t ) P ¯ R 1 ( t ) , θ ˜ 13 ( t ) = P ¯ + P ¯ R 2 ( t ) + μ R 1 T ( t ) P ¯ R 2 ( t ) , θ ˜ 14 ( t ) = P ¯ + μ R 1 T ( t ) P ¯ , θ ˜ 34 ( t ) = μ R 2 T ( t ) P ¯ , θ ˜ 33 ( t ) = S ˜ P ¯ + μ R 2 T ( t ) P ¯ R 2 ( t ) , θ ˜ 44 ( t ) = μ P ¯ .
For Ψ ˜ ( t ) < 0 , depending on Schur Complement Lemma, (15) turns into
Ψ ^ ( t ) = θ ^ 11 ( t ) P ¯ P ¯ + P ¯ R 2 ( t ) θ ˜ 14 ( t ) θ ^ 15 ( t ) θ ^ 16 ( t ) S ¯ P ¯ 0 0 0 0 S ˜ P ¯ θ ˜ 34 ( t ) θ ^ 35 ( t ) θ ^ 36 ( t ) θ ˜ 44 ( t ) 0 0 P ¯ 0 P ¯ < 0 ,
where
θ ^ 11 ( t ) = He ( R 1 T ( t ) P ¯ ) + S ¯ + S ˜ 2 P ¯ , θ ^ 15 ( t ) = τ 1 R 1 T ( t ) P ¯ , θ ^ 35 ( t ) = τ 1 R 2 T ( t ) P ¯ , θ ^ 16 ( t ) = τ 2 R 1 T ( t ) P ¯ , θ ^ 36 ( t ) = τ 2 R 2 T ( t ) P ¯ , ϑ 11 = I M P 1 ( A + Δ A ( t ) ) + L 11 P 1 ( B + Δ B ( t ) ) G 1 , ϑ 22 = I M P 1 ( A + Δ A ( t ) G 2 C ) L 11 P 1 ( B + Δ B ( t ) ) G 1 ,
P ¯ R 1 ( t ) = ϑ 11 L 11 P 1 ( B + Δ B ( t ) ) G 1 L 11 P 1 ( B + Δ B ( t ) ) G 1 + I M P 1 G 2 C , ϑ 22 , P ¯ R 2 ( t ) = 0 0 L 3 P 1 ( B + Δ B ( t ) ) G 1 I M P 1 G 2 C L 3 P 1 ( B + Δ B ( t ) ) G 1 .
Further, substituting [ Δ A ( t ) Δ B ( t ) ] = E H ( t ) [ F 1 F 2 ] into (16), it yields
Θ + Δ Ψ ( t ) < 0 ,
and Θ can be found in (9), where
Δ Ψ ( t ) = He ( Γ ¯ 1 H ( t ) Γ 1 + Γ ¯ 2 H ( t ) Γ 2 + Γ ¯ 3 H ( t ) Γ 3 + Γ ¯ 4 H ( t ) Γ 4 ) + He ( Γ ¯ 5 H T ( t ) Γ 5 + Γ ¯ 6 H T ( t ) Γ 6 + Γ ¯ 7 H T ( t ) Γ 7 + Γ ¯ 8 H T ( t ) Γ 8 ) + He ( Γ ^ 1 H T ( t ) Γ 1 + Γ ¯ 2 H T ( t ) Γ 2 + Γ ¯ 3 H T ( t ) Γ 3 + Γ ¯ 4 H T ( t ) Γ 4 ) + He ( Γ ^ 5 H T ( t ) Γ 5 + Γ ¯ 6 H T ( t ) Γ 6 + Γ ¯ 7 H T ( t ) Γ 7 + Γ ¯ 8 H T ( t ) Γ 8 ) .
Making use of Lemma 2, there exist scalars δ i > 0 , δ i 1 > 0 , δ i > 0 , δ i 1 > 0 , i = 1 , 2 , 8 ; then, (17) can be changed to
Θ + δ 1 Γ ¯ 1 Γ ¯ 1 T + δ 1 1 Γ 1 T Γ 1 + δ 2 Γ ¯ 2 Γ ¯ 2 T + δ 2 1 Γ 2 T Γ 2 + δ 3 Γ ¯ 3 Γ ¯ 3 T + δ 3 1 Γ 3 T Γ 3 + δ 4 Γ ¯ 4 Γ ¯ 4 T + δ 4 1 Γ 4 T Γ 4 + δ 5 Γ ¯ 5 Γ ¯ 5 T + δ 5 1 Γ 5 T Γ 5 + δ 6 Γ ¯ 6 Γ ¯ 6 T + δ 6 1 Γ 6 T Γ 6 + δ 7 Γ ¯ 7 Γ ¯ 7 T + δ 7 1 Γ 7 T Γ 7 + δ 8 Γ ¯ 8 Γ ¯ 8 T + δ 8 1 Γ 8 T Γ 8 + δ 1 Γ ^ 1 Γ ^ 1 T + δ 1 1 Γ 1 T Γ 1 + δ 2 Γ ^ 2 Γ ^ 2 T + δ 2 1 Γ 2 T Γ 2 + δ 3 Γ ^ 3 Γ ^ 3 T + δ 3 1 Γ 3 T Γ 3 + δ 4 Γ ^ 4 Γ ^ 4 T + δ 4 1 Γ 4 T Γ 4 + δ 5 Γ ^ 5 Γ ^ 5 T + δ 5 1 Γ 5 T Γ 5 + δ 6 Γ ^ 6 Γ ^ 6 T + δ 6 1 Γ 6 T Γ 6 + δ 7 Γ ^ 7 Γ ^ 7 T + δ 7 1 Γ 7 T Γ 7 + δ 8 Γ ^ 8 Γ ^ 8 T + δ 8 1 Γ 8 T Γ 8 < 0 .
Clearly, the inequality (18) is guaranteed by LMI (9). Hence, V ˙ ( t ) < 0 is induced. This completes the proof. □
Remark 3.
In [32,33,34,35,36,37], the consensus and containment problems for certain MASs with multiple delays are researched. For uncertain MASs with one leader, only the transmission delay is handled in [40]. Although the containment problem concerned with structural uncertainties is dealt with in [41] considering multiple delays, the communication graph is undirected.
Remark 4.
It is noteworthy that the study in [12] only focuses on certain dynamics and transmission delay. In the case of uncertain dynamics, the multiple delays involving both state delay and transmission delay are investigated in this paper. Furthermore, compared with [29,30] considering single state delay, the multiple delays make the construction of LKFs and solving of LMIs more difficult. Especially, the dimension of matrix Θ in (9) significantly surpasses that in [12]. In addition, the computational complexity of solving LMIs will increase accordingly as the number of agents increases.

4. Simulation Results

The directed connection graph is shown in Figure 1, and Assumption 1 holds. From Figure 1, the nodes 1–8 stand for followers and 9–11 are the leaders.
The matrices L 11 and L 12 are expressed as
L 11 = 2 0 0 0 0 0 0 1 1 3 0 0 0 0 1 0 0 1 3 0 0 0 0 0 0 0 1 2 0 0 0 0 0 0 0 1 2 0 0 0 0 0 1 0 1 2 0 0 0 1 0 0 0 1 2 0 1 0 0 0 0 0 1 2 ,
and
L 12 = 1 0 0 0 1 0 0 1 1 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 .
Based on (1), we set
x k = x k 1 x k 2 , A = 1 1.6 1.6 0 , B = 1 2 , C = 1 1 , D = 0.1 0 0 0.1 , g ( x k ( t τ 1 ) ) = 0.5 sin ( x k 1 ( t 0.2 ) ) 0.5 sin ( x k 2 ( t 0.2 ) ) .
Before solving the LMI (9), we set that
E = 2 0 0 2 , F 1 = 0.05 0 0 0.05 , F 2 = 0.05 0.05 , τ 1 = 0.2 , τ 2 = 0.35 , ( δ 1 , δ 2 , δ 3 , δ 4 , δ 5 , δ 6 , δ 7 , δ 8 ) = ( 1.09 , 1.08 , 1.10 , 1.13 , 1.12 , 1.13 , 1.14 , 1.15 ) , ( δ 1 , δ 2 , δ 3 , δ 4 , δ 5 , δ 6 , δ 7 , δ 8 ) = ( 1.12 , 1.05 , 1.11 , 1.15 , 1.14 , 1.07 , 1.20 , 1.16 ) .
Further, applying the LMI techniques to (9), we obtain that
P 1 = 0.6396 0.0952 0.0952 0.7825 , S 1 = 0.3521 0.0385 0.0385 0.1364 , V 1 = 0.0161 0.0318 , V 2 = 0.0159 0.2652 T ,
and the gain matrices G 1 and G 2 are shown as
G 1 = 0.0194 0.0383 , G 2 = 0.0768 0.3482 T .
We set initial states as x 1 = [ 6 , 3 ] T , x 2 = [ 4 , 8 ] T , x 3 = [ 0 , 7 ] T , x 4 = [ 8 , 4 ] T , x 5 = [ 6 , 8 ] T , x 6 = [ 2 , 1 ] T , x 7 = [ 4 , 5 ] T , x 8 = [ 7 , 6 ] T , x 9 = [ 2 , 8 ] T , x 10 = [ 8 , 7 ] T , x 11 = [ 8 , 3 ] T and let H ( t ) = 0.1 × sin ( t ) 0 0 0.1 , τ 1 = 0.2 and τ 2 = 0.35 . Figure 2 and Figure 3 display the trajectories of containment errors and observer errors for followers, respectively. Obviously, when T = 30 s, ϕ ˜ F k 0 and ε k 0 . Furthermore, the trajectories of containment error for followers when τ 1 = 0.2 and τ 2 = 0.1 and when τ 1 = 0.2 and τ 2 = 0.75 are, respectively, presented in Figure 4 and Figure 5. It can be seen that the convergence speed of the error curve becomes slower when the transmission delay τ 2 becomes larger. In addition, the trajectories of containment error for followers in [12] are shown in Figure 6. Then, it follows that the convergence speed of the error trajectories in Figure 5 becomes slower than that in Figure 6 because of multiple time delays.
Moreover, in Figure 7, the small black circles denote leaders and the colorful diamonds denote followers, and the snapshots of the agents are depicted at moments 0 s, 10 s, 20 s, and 30 s, respectively. Clearly, the colorful diamonds enter into the convex hull surrounded by the black circles when t , and then the agents achieve robust containment with uncertain parameters.

5. Conclusions

This article focused on the robust cooperative containment problem of uncertain MASs with nonlinearities in the presence of multiple time delays. In order to address model uncertainties and transmission delay, an observer-based control protocol was employed without exploiting any knowledge of the leaders. Furthermore, solutions originating from the LMI equation were obtained, relying on developing novel quadratic-type LKFs. Based on Lyapunov theory, the stability of the observer dynamics and containment-error time-delay systems was proven. Moreover, under the framework of the developed containment strategy, the followers asymptotically converged to a convex hull created by the leaders. In the near future, it will be interesting to extend the current results into the time-varying group formation–containment control of MASs with heterogeneous uncertainties and multiple varying delays over switching directed graphs [15,16].

Funding

This work was supported by the Key Research and Development Program of Shandong Province under Grant 2024CXGC010704, the Shandong Provincial Natural Science Foundation under Grant ZR2024QF255 and the Yantai Science and Technology Innovation Development Plan under Grant 2024YT06000226.

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 author declares that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References

  1. Yuan, C.; Du, Y.; Huangfu, Y.; Gong, C.; Gao, F.; Li, Z. Consensus-based powered cruise and yaw controls for unmanned aerial vehicle with distributed electric propulsion system. IEEE J. Emerg. Sel. Top. Power Electron. 2025, 13, 1769–1782. [Google Scholar] [CrossRef]
  2. Wu, W.; Lu, Z.; Sun, Y.; Ang, M.; Gong, C. Dynamic task assignment of multiple heterogeneous unmanned aerial vehicles based on consensus with uncertainties. IEEE Aerosp. Electron. Syst. Mag. 2025, 40, 48–60. [Google Scholar] [CrossRef]
  3. Gao, J.; Manogaran, G.; Nguyen, T.; Kadry, S.; Hsu, C.; Kumar, P. A vehicle-consensus information exchange scheme for traffic management in vehicular ad-hoc networks. IEEE Trans. Intell. Transp. Syst. 2022, 23, 19602–19612. [Google Scholar] [CrossRef]
  4. Guo, J.; Ding, X.; Wu, W. Reliable traffic monitoring mechanisms based on blockchain in vehicular networks. IEEE Trans. Reliab. 2021, 71, 1219–1229. [Google Scholar] [CrossRef]
  5. Zhou, Y.; Liu, J. Advances in emerging digital technologies for energy efficiency and energy integration in smart cities. Energy Build. 2024, 315, 114289. [Google Scholar] [CrossRef]
  6. Wang, Q.; Wang, Y.; Chen, Z.; Soares, J. Multi-agent system consistency-based cooperative scheduling strategy of regional integrated energy system. Energy 2024, 295, 130904. [Google Scholar] [CrossRef]
  7. Pan, J.; Zhou, G.; Gong, M.; Li, B.; Gao, F.; Tian, G. Estimation and correction of azimuth and attitude errors of attitude tracking for vehicular spacecraft. IEEE Trans. Instrum. Meas. 2023, 72, 1–10. [Google Scholar] [CrossRef]
  8. Liu, C.; Loxton, R.; Lin, Q.; Teo, K. Dynamic optimization for switched time-delay systems with state-dependent switching conditions. Siam J. Control Optim. 2018, 56, 3499–3523. [Google Scholar] [CrossRef]
  9. Liu, C.; Loxton, R.; Teo, K.; Wang, S. Optimal state-delay control in nonlinear dynamic systems. Automatica 2022, 135, 109981. [Google Scholar] [CrossRef]
  10. Wang, J.; Li, Y.; Duan, Z.; Zeng, J. A fully distributed robust secure consensus protocol for linear multi-agent systems. IEEE Trans. Circuits Syst. II Express Briefs 2022, 69, 3264–3268. [Google Scholar] [CrossRef]
  11. Zhou, Y.; Wen, G.; Zhou, J.; Liu, H.; Lü, J. Data-driven output consensus tracking control for heterogeneous multi-agent systems with a dynamic leader. IEEE Trans. Control Netw. Syst. 2025, 12, 2029–2039. [Google Scholar] [CrossRef]
  12. Wang, D.; Huang, Y.; Guo, S.; Wang, W. Distributed h containment control of multiagent systems over switching topologies with communication time delay. Int. J. Robust Nonlinear Control 2020, 30, 5221–5232. [Google Scholar] [CrossRef]
  13. Zhou, T.; Liu, Q.; Wang, W. Nonfragile containment control of nonlinear multi-agent systems via a disturbance observer-based approach. Int. J. Robust Nonlinear Control 2024, 34, 3726–3741. [Google Scholar] [CrossRef]
  14. Zhou, T.; Liu, C.; Wang, W. Nonfragile robust H containment control for multi-agent systems with a time-varying delay. J. Frankl. Inst. 2024, 361, 106732. [Google Scholar] [CrossRef]
  15. Lu, Y.; Dong, X.; Li, Q.; Lü, J.; Ren, Z. Time-varying group formation-containment tracking control for general linear multiagent systems with unknown inputs. IEEE Trans. Cybern. 2022, 52, 11055–11067. [Google Scholar] [CrossRef]
  16. Feng, L.; Huang, B.; Sun, J.; Sun, Q.; Xie, X. Adaptive event-triggered time-varying output group formation containment control of heterogeneous multiagent systems. IEEE/CAA J. Autom. Sin. 2024, 11, 1398–1409. [Google Scholar] [CrossRef]
  17. Wang, P.; Jia, Y. Robust h containment control for uncertain multi-agent systems with inherent nonlinear dynamics. Int. J. Syst. Sci. 2016, 47, 1073–1083. [Google Scholar] [CrossRef]
  18. Han, D.; Chesi, G.; Hung, Y. Robust consensus for a class of uncertain multi-agent dynamical systems. IEEE Trans. Ind. Inform. 2013, 9, 306–312. [Google Scholar] [CrossRef]
  19. Wang, P.; Jia, Y. Robust h containment control for second-order multi-agent systems with nonlinear dynamics in directed networks. Neurocomputing 2015, 153, 235–241. [Google Scholar] [CrossRef]
  20. Li, Z.; Duan, Z.; Lewis, F. Distributed robust consensus control of multi-agent systems with heterogeneous matching uncertainties. Automatica 2014, 50, 883–889. [Google Scholar] [CrossRef]
  21. Wen, G.; Wang, P.; Huang, T.; Yu, W.; Sun, J. Robust neuro-adaptive containment of multileader multiagent systems with uncertain dynamics. IEEE Trans. Syst. Man Cybern. Syst. 2019, 49, 406–417. [Google Scholar] [CrossRef]
  22. Zhang, S.; Li, Z.; Wang, X. Robust h2 consensus for multi-agent systems with parametric uncertainties. IEEE Trans. Circuits Syst. II Express Briefs 2021, 68, 2473–2477. [Google Scholar]
  23. Hu, Y.; Yan, H.; Zhang, H.; Wang, M.; Zeng, L. Robust adaptive fixed-time sliding-mode control for uncertain robotic systems with input saturation. IEEE Trans. Cybern. 2023, 53, 2636–2646. [Google Scholar] [CrossRef]
  24. Zhang, L.; Zhang, X.; Chang, X.; Zhao, N. Adaptive fault-tolerant control-based real-time reachable set synthesis of heterogeneous nonlinear singular multiagent systems with uncertain parameters. IEEE Trans. Autom. Sci. Eng. 2024, 21, 4526–4535. [Google Scholar] [CrossRef]
  25. Huang, W.; Liu, H.; Huang, J. Distributed robust containment control of linear heterogeneous multi-agent systems: An output regulation approach. IEEE/CAA J. Autom. Sin. 2022, 9, 864–877. [Google Scholar] [CrossRef]
  26. Atrianfar, H.; Karimi, A. Robust containment control of heterogeneous multi-agent systems with structured uncertainty and external disturbances. Int. J. Robust Nonlinear Control 2022, 32, 698–714. [Google Scholar] [CrossRef]
  27. Wang, Q.; Shu, P.; Yan, B.; Shi, Z.; Hua, Y.; Lü, J. Robust predefined output containment for heterogeneous nonlinear multiagent systems under unknown nonidentical leaders’ dynamics. IEEE Trans. Cybern. 2024, 54, 5770–5780. [Google Scholar] [CrossRef] [PubMed]
  28. Tian, B.; Zhang, H.; Cui, P.; Wang, Z.; Yan, H. Robust finite-time containment of networked heterogeneous nonlinear systems with intermittent measurement only. IEEE Trans. Netw. Sci. Eng. 2025, 12, 2823–2834. [Google Scholar] [CrossRef]
  29. Xiao, W.; Cao, L.; Li, H.; Lu, R. Observer-based adaptive consensus control for nonlinear multi-agent systems with time-delay. Sci. China Inf. Sci. 2020, 63, 1–17. [Google Scholar] [CrossRef]
  30. Zhou, X.; Wang, H.; Tian, Y.; Dai, X. Consensus tracking via quantized iterative learning control for singular nonlinear multi-agent systems with state time-delay and initial state error. Nonlinear Dyn. 2021, 103, 2701–2719. [Google Scholar] [CrossRef]
  31. Shi, L.; Li, W.; Shi, M.; Lin, B. Event-based bipartite containment control for multi-agent networks subject to communication delay. IEEE Trans. Netw. Sci. Eng. 2024, 11, 2024–2033. [Google Scholar] [CrossRef]
  32. Li, H.; Zhang, C.; Liu, S.; Zhang, X. A dynamic gain approach to consensus control of nonlinear multiagent systems with time delays. IEEE Trans. Cybern. 2022, 52, 6993–7001. [Google Scholar] [CrossRef]
  33. Zhang, H.; Ren, H.; Mu, Y.; Han, J. Optimal consensus control design for multiagent systems with multiple time delay using adaptive dynamic programming. IEEE Trans. Cybern. 2022, 52, 12832–12842. [Google Scholar] [CrossRef] [PubMed]
  34. Sun, H.; Yang, H.; Han, H.; Sun, J.; Qiao, J. Consensus of mass with input and communication delays by predictor-based protocol. IEEE Trans. Cybern. 2023, 11, 7126–7135. [Google Scholar] [CrossRef]
  35. Zhang, K.; Zhou, B.; Duan, G. Leader-following consensus of multi-agent systems with time delays by fully distributed protocols. Syst. Control Lett. 2023, 178, 105582. [Google Scholar] [CrossRef]
  36. Hua, C.; Feng, S.; Zhang, L. Output-feedback control of interconnected nonlinear systems with both state and input delays based on truncated prediction. IEEE Trans. Circuits Syst. II Express Briefs 2023, 70, 4108–4112. [Google Scholar] [CrossRef]
  37. Koru, A.; Ramírez, A.; Sarsılmaz, S.; Sipahi, R.; Yucelen, T.; Dogan, K. Containment control of multi-human multi-agent systems under time delays. IEEE Trans. Syst. Man Cybern. Syst. 2024, 54, 3344–3356. [Google Scholar] [CrossRef]
  38. Yang, R.; Liu, S.; Li, X. Observer-based bipartite containment control of fractional multi-agent systems with mixed delays. Inf. Sci. 2023, 626, 204–222. [Google Scholar] [CrossRef]
  39. Chen, L.; Liu, C.; Chu, Z.; Lopes, A.; Chen, Y. Leader follower weighted consensus of nonlinear fractional-order multiagent systems using current and time delay state information. IEEE Trans. Syst. Man Cybern. Syst. 2024, 54, 5814–5823. [Google Scholar] [CrossRef]
  40. Shariati, A.; Tavakoli, M. A descriptor approach to robust leader-following output consensus of uncertain multi-agent systems with delay. IEEE Trans. Autom. Control 2017, 62, 5310–5317. [Google Scholar] [CrossRef]
  41. Parsa, M.; Danesh, M. Robust containment control of uncertain multi-agent systems with time-delay and heterogeneous lipschitz nonlinearity. IEEE Trans. Syst. Man Cybern. Syst. 2021, 51, 2312–2321. [Google Scholar] [CrossRef]
  42. Mesbahi, M.; Egerstedt, M. Graph Theoretic Methods in Multiagent Networks; Princeton University Press: Princeton, NJ, USA, 2010. [Google Scholar]
  43. Gu, K.; Chen, J.; Kharitonov, V. Stability of Time-Delay Systems; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2003. [Google Scholar]
Figure 1. The directed communication graph.
Figure 1. The directed communication graph.
Eng 06 00336 g001
Figure 2. Containment error of each follower.
Figure 2. Containment error of each follower.
Eng 06 00336 g002
Figure 3. Observer error of each follower.
Figure 3. Observer error of each follower.
Eng 06 00336 g003
Figure 4. Containment error of followers when τ 1 = 0.2 and τ 2 = 0.1 . (a) ϕ ˜ F k 1 ( t ) ; (b) ϕ ˜ F k 2 ( t ) .
Figure 4. Containment error of followers when τ 1 = 0.2 and τ 2 = 0.1 . (a) ϕ ˜ F k 1 ( t ) ; (b) ϕ ˜ F k 2 ( t ) .
Eng 06 00336 g004
Figure 5. Containment error of followers when τ 1 = 0.2 and τ 2 = 0.75 . (a) ϕ ˜ F k 1 ( t ) ; (b) ϕ ˜ F k 2 ( t ) .
Figure 5. Containment error of followers when τ 1 = 0.2 and τ 2 = 0.75 . (a) ϕ ˜ F k 1 ( t ) ; (b) ϕ ˜ F k 2 ( t ) .
Eng 06 00336 g005
Figure 6. Containment error of followers in [12]. (a) ϕ ˜ F k 1 ( t ) ; (b) ϕ ˜ F k 2 ( t ) .
Figure 6. Containment error of followers in [12]. (a) ϕ ˜ F k 1 ( t ) ; (b) ϕ ˜ F k 2 ( t ) .
Eng 06 00336 g006
Figure 7. Snapshots of all the agents. (a) T = 0 s, (b) T = 10 s, (c) T = 20 s, and (d) T = 30 s.
Figure 7. Snapshots of all the agents. (a) T = 0 s, (b) T = 10 s, (c) T = 20 s, and (d) T = 30 s.
Eng 06 00336 g007
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

Zhou, T. Observer-Based Robust Containment Control of Multi-Agent Systems with Structural Uncertainties and Multiple Delays. Eng 2025, 6, 336. https://doi.org/10.3390/eng6120336

AMA Style

Zhou T. Observer-Based Robust Containment Control of Multi-Agent Systems with Structural Uncertainties and Multiple Delays. Eng. 2025; 6(12):336. https://doi.org/10.3390/eng6120336

Chicago/Turabian Style

Zhou, Tuo. 2025. "Observer-Based Robust Containment Control of Multi-Agent Systems with Structural Uncertainties and Multiple Delays" Eng 6, no. 12: 336. https://doi.org/10.3390/eng6120336

APA Style

Zhou, T. (2025). Observer-Based Robust Containment Control of Multi-Agent Systems with Structural Uncertainties and Multiple Delays. Eng, 6(12), 336. https://doi.org/10.3390/eng6120336

Article Metrics

Back to TopTop