Skip to Content
AxiomsAxioms
  • Article
  • Open Access

20 August 2026

17 Pages

Nonfragile Tracking Consensus of Stochastic Delayed MASs with Randomly Occurring Nonlinearities and Uncertainties

and
1
School of Information and Electronic Engineering, Shandong Technology and Business University, Yantai 264005, China
2
Key Laboratory of Sensing Technology and Control in Universities of Shandong, Shandong Technology and Business University, Yantai 264005, China
*
Author to whom correspondence should be addressed.

Abstract

A distributed nonfragile controller is developed for stochastic delayed multi-agent systems in which nonlinear terms, plant uncertainties, and gain perturbations are activated randomly. The directed topology is assumed to admit a spanning tree whose root is the leader. Each follower uses relative-state data from both the present and delayed instants; this construction is used to obtain asymptotic stochastic tracking in the presence of state and communication delays. For a constant delay, the analysis produces tractable linear-matrix-inequality tests and the corresponding gain matrices. The construction is then adapted to time-varying delays. The predicted tracking behavior is illustrated by two numerical examples.

1. Introduction

Cooperative behavior in multi-agent systems (MASs) is studied in a variety of engineering settings [1,2,3,4,5,6]. Examples include formation tracking [7], coordinated motion of nonholonomic mobile robots [8], unmanned-aircraft trajectory optimization [9], and joint regulation of current sharing and voltage [10]. Random environmental excitation makes agreement analysis substantially more difficult, which has prompted sustained interest in stochastic consensus problems (CPs) [11]. For first-order stochastic MASs, ref. [12] employed a time-varying protocol to analyze almost-sure consensus under strong temporal variation. Random total disturbances in second-order systems were addressed through disturbance-rejection method in [13]. In the higher-order system, ( − β , − α ) -stability and H ∞ CPs with ( x , u , v ) -dependent noise were developed in [14]. Further stochastic nonlinear results can be found in [15,16,17,18,19,20].
Neither model uncertainty nor controller-gain variation can be avoided in an implementation. Both features have consequently appeared in a number of consensus designs [21,22,23,24,25]. Random activation of nonlinearities and uncertainties was incorporated into stochastic tracking consensus in [26]. For discrete stochastic MASs driven by state- and control-dependent noise, a completing-the-square construction in [27] produced a nonfragile near-optimal controller. The finite-time case with multiple nonlinear and uncertain components was investigated in [28]. Uncertain stochastic nonlinear MASs were also treated through compensator-based output feedback in [29]. For cooperative–antagonistic networks, ref. [30] used sampled data to formulate nonfragile bipartite-tracking conditions.
Delay introduces another constraint in addition to uncertainty and gain fragility [31,32]. Several delayed CP formulations have been proposed. The stochastic-delay analysis in [33] relied on a Halanay-type inequality. An observer-based nonfragile H ∞ protocol was given in [34], whereas mean-square H ∞ consensus with disturbances and state delays was examined in [35]. For switching topologies satisfying an average-dwell-time rule, ref. [36] studied nonfragile L 2 – L ∞ CPs of delayed stochastic nonlinear MASs. The communication-delay problem in [37] was handled by a robust tracking law containing a stochastic faulty intermediate estimator. More recently, H ∞ CPs for delayed stochastic MASs with ( x , u , v ) -dependent noise and Markov jumps were considered in [38].
Comparatively little attention has been paid to nonfragile stochastic tracking in delayed high-order MASs. This paper addresses that setting when the nonlinearities and uncertainties occur randomly. The protocol is adapted from [39]. Its main features are summarized next. Present and delayed relative states are used together in a distributed control law, allowing the tracking analysis to cover time-varying delays (TVDs). The plant description retains diffusion noise, Bernoulli-activated nonlinearities, uncertain matrices, and perturbations of the implemented gains within one model. For a directed interaction topology, sufficient matrix conditions are obtained for the resulting high-order nonlinear MASs; two numerical cases are then used to examine feasibility.
Section 2 specifies the notation, network model, and control objective. The stability analysis and controller conditions are presented in Section 3. Section 4 contains the numerical cases, and Section 5 closes the paper.

2. Preliminaries and Problem Formulation

2.1. Preliminaries and Notations

Let the directed interaction network be G = V , E . Its vertex set is V = { 1 , 2 , … , Y } , and E = ( i , j ) : i , j ∈ V specifies the oriented communication links. The adjacency matrix is written as A = [ a i j ] ∈ R Y × Y for topology G . Its entry is a i j = 1 when ( i , j ) ∈ E and a i j = 0 otherwise. The Laplacian matrix is L = [ l i j ] ∈ R Y × Y , with l i j = − a i j for i ≠ j and l i i = ∑ j = 1 , j ≠ i Y a i j . Let G ¯ = V ¯ , E ¯ denote the communication graph G augmented by the leader indexed by 0. A directed spanning tree of G ¯ contains every vertex of G ¯ . The matrix H describes G ¯ and satisfies H = L + B , where B = diag { b 1 , b 2 , ⋯ , b Y } . Here, b i = 1 when ( 0 , i ) ∈ V ¯ , whereas b i = 0 otherwise [40].
We use Tr { Z } , λ max ( ∗ ) , and I Y for the trace, largest eigenvalue, and identity matrix, respectively, with Z denoting a matrix. We use diag { k 1 , k 2 , ⋯ , k Y } for diagonal assembly and Sym ( P ) for P + P T . All random quantities are defined on the complete probability space ( Ω , F , { F t } , P ) . The filtration { F t } t ≥ 0 is right continuous and contains all P -null sets. Expectation is written as E { . } .

2.2. Problem Formulation

The dynamics assigned to the nonlinear stochastic MASs are
d x 0 ( t ) = [ Γ 1 ( t ) x 0 ( t ) + Γ 2 ( t ) x 0 ( t − φ ( t ) ) + ϑ ( t ) f ( x 0 ( t − φ ( t ) ) ) ] d t + g ( x 0 ( t ) ) d ω ( t ) , d x i ( t ) = [ Γ 1 ( t ) x i ( t ) + Γ 2 ( t ) x i ( t − φ ( t ) ) + ϑ ( t ) f ( x i ( t − φ ( t ) ) ) + B u i ( t ) ] d t + g ( x i ( t ) ) d ω ( t ) ,
and the follower index is i = 1 , 2 , … , Y . States x 0 ( t ) ∈ R p and x i ( t ) ∈ R p belong to the leader and follower i, respectively; u i ( t ) ∈ R r denotes that follower’s input. A scalar standard Brownian motion ω ( t ) is defined on ( Ω , F , { F t } t ≥ 0 , P ) and satisfies E { d w ( t ) } = 0 and E { [ d w ( t ) ] 2 } = d t ; thus, d ω ( t ) has a normal distribution. The mappings f ( . ) ∈ R p and g ( . ) ∈ R p describe the internal nonlinearities. The delay φ ( t ) is required to satisfy 0 ≤ φ ( t ) ≤ φ ˜ , φ ˙ ( t ) ≤ φ ^ < 1 . Uncertain matrices Γ 1 ( t ) and Γ 2 ( t ) are expressed as
Γ 1 ( t ) = Γ 1 + ϕ 1 ( t ) Δ Γ 1 ( t ) , Γ 2 ( t ) = Γ 2 + ϕ 2 ( t ) Δ Γ 2 ( t ) ,
and the known nominal quantities are Γ 1 ∈ R p × p , Γ 2 ∈ R p × p , B ∈ R p × r . Their uncertain parts, Δ Γ 1 ( t ) and Δ Γ 2 ( t ) , are parameterized by
[ Δ Γ 1 ( t ) , Δ Γ 2 ( t ) ] = E 1 H ¯ 1 ( t ) [ F 1 F 2 ] ,
matrices E 1 , F 1 , and F 2 have mutually compatible dimensions, and H ¯ 1 ( t ) is constrained by H ¯ 1 T ( t ) H ¯ 1 ( t ) ≤ I .
Intermittent uncertainties are represented by ϕ 1 ( t ) Δ Γ 1 ( t ) and ϕ 2 ( t ) Δ Γ 2 ( t ) , whereas ϑ ( t ) f ( . ) represents the intermittent nonlinear contribution. The switches ϕ 1 ( t ) , ϕ 2 ( t ) , ϑ ( t ) follow the Bernoulli laws
Pr { ϕ 1 ( t ) = 1 } = ϕ 1 , Pr { ϕ 1 ( t ) = 0 } = 1 − ϕ 1 , Pr { ϕ 2 ( t ) = 1 } = ϕ 2 , Pr { ϕ 2 ( t ) = 0 } = 1 − ϕ 2 , Pr { ϑ ( t ) = 1 } = ϑ , Pr { ϑ ( t ) = 0 } = 1 − ϑ ,
their activation probabilities are the constants ϕ 1 , ϕ 2 , ϑ ∈ [ 0 , 1 ] , and the switches obey
E { ϑ ( t ) − ϑ } = 0 , E { ϕ 1 ( t ) − ϕ 1 } = 0 , E { ϕ 2 ( t ) − ϕ 2 } = 0 .
Definition 1. 
The nonlinear stochastic MASs (1) are said to reach tracking consensus if lim t → ∞ E { x i ( t ) − x 0 ( t ) 2 } = 0 , i = 1 , 2 , … , Y .
To realize this objective, the input of follower i is generated by the nonfragile protocol
m i ( t ) = ∑ j = 1 Y a i j ( x i ( t ) − x j ( t ) ) + b i ( x i ( t ) − x 0 ( t ) ) , m i ( t − φ ( t ) ) = ∑ j = 1 Y a i j ( x i ( t − φ ( t ) ) − x j ( t − φ ( t ) ) ) + b i ( x i ( t − φ ( t ) ) − x 0 ( t − φ ( t ) ) ) , u i ( t ) = − ( 1 − q ) K 1 ( t ) m i ( t ) − q K 2 ( t ) m i ( t − φ ( t ) ) ,
for 0 ≤ q ≤ 1 , and we write the perturbed gain matrices K 1 ( t ) and K 2 ( t ) as
K 1 ( t ) = K 1 + ϕ 3 ( t ) Δ K 1 ( t ) , K 2 ( t ) = K 2 + ϕ 4 ( t ) Δ K 2 ( t ) ,
and in this representation, the nominal gains are K 1 ∈ R r × p , K 2 ∈ R r × p . Perturbations Δ K 1 ( t ) and Δ K 2 ( t ) are structured as
[ Δ K 1 ( t ) , Δ K 2 ( t ) ] = E 2 H ¯ 2 ( t ) [ F 3 F 4 ] ,
compatible dimensions are assumed for E 2 , F 3 , and F 4 , and H ¯ 2 ( t ) satisfies H ¯ 2 T ( t ) H ¯ 2 ( t ) ≤ I .
The remaining Bernoulli switches ϕ 3 ( t ) and ϕ 4 ( t ) have distributions analogous to (4):
Pr { ϕ 3 ( t ) = 1 } = ϕ 3 , Pr { ϕ 3 ( t ) = 0 } = 1 − ϕ 3 , Pr { ϕ 4 ( t ) = 1 } = ϕ 4 , Pr { ϕ 4 ( t ) = 0 } = 1 − ϕ 4 ,
and their fixed activation probabilities are ϕ 3 , ϕ 4 ∈ [ 0 , 1 ] , which gives
E { ϕ 3 ( t ) − ϕ 3 } = 0 , E { ϕ 4 ( t ) − ϕ 4 } = 0 .
Remark 1. 
All agents are driven by the same scalar Wiener process (Brownian motion), which represents a common environmental excitation. On the tracking manifold, this choice makes the relative diffusion g ( x i ( t ) ) − g ( x 0 ( t ) ) vanish. The continuous-time switches ϕ k ( k = 1 , … , 4 ) and ϑ ( t ) are modeled as Bernoulli processes adapted to F t on ( Ω , F , { F t } t ≥ 0 , P ) [26]. The filtration { F t } t ≥ 0 contains the information available up to time t, including the Brownian motion ω ( t ) and earlier states. More specifically, ϕ k ( k = 1 , … , 4 ) and ϑ ( t ) are mutually independent Bernoulli processes. They are also independent of ω ( t ) . Hence, diffusion noise is statistically independent of the randomly activated plant uncertainty, nonlinearity, and controller-gain variation. Finally, the norm constraints in (3) and (8) are retained through H ¯ i T ( t ) H ¯ i ( t ) ≤ I , i = 1 , 2 .
Remark 2. 
Many controller designs neglect either uncertainty or nonfragility [12,13,14,15,16,17,18,19,20]. In the present model, ϕ 1 ( t ) Δ Γ 1 ( t ) and ϕ 2 ( t ) Δ Γ 2 ( t ) activate plant variations, while ϕ 3 ( t ) Δ K 1 ( t ) and ϕ 4 ( t ) Δ K 2 ( t ) activate gain perturbations. Both mechanisms affect admissible tuning margins [31]; keeping them therefore makes the protocol applicable to a wider class of delayed stochastic nonlinear MASs.
Assumption 1. 
Inputs are restricted by u i ( t ) ∈ U . The set U ∈ R r is nonempty, compact, and convex, with 0 ∈ R r in its interior.
Assumption 2. 
In G ¯ , a directed tree exists from the leader to every follower.
Assumption 3. 
The input matrix B in (1) is of full column rank.
Assumption 4. 
There are Lipschitz bounds for the maps f ( . ) and g ( . ) given by
f ( a ) − f ( b ) ≤ ε a − b , g ( a ) − g ( b ) ≤ ε ˜ a − b ,
where ε and ε ˜ are constant scalars.
Lemma 1 
([41]). Under Assumption 3, matrices V ∈ R p × p and X ∈ R r × r can be found such that B ^ = V B X = V 1 V 2 B X = Φ 0 , where V 1 ∈ R r × p , V 2 ∈ R ( p − r ) × p , and Φ = d i a g { ϕ 1 , ϕ 2 , … , ϕ r } ; each ϕ i is a singular value of B. There is also a nonsingular Q ∈ R r × r for which B Q = Q 1 B . In particular, Q 1 = V 1 T Q 11 V 1 + V 2 T Q 22 V 2 , where Q 1 ∈ R p × p > 0 , Q 11 ∈ R r × r > 0 and Q 22 ∈ R ( p − r ) × ( p − r ) > 0 .
Lemma 2 
([42]). Let matrices Π = Π T , Ω ¯ 1 , and Ω ˜ 1 exist. The relation Π + Ω ¯ 1 H ¯ ( t ) Ω ˜ 1 + Ω ˜ 1 T H ¯ T ( t ) Ω ¯ 1 T < 0 is satisfied whenever H ¯ ( t ) H ¯ T ( t ) ≤ I . It also follows, for a scalar σ > 0 , that Π + σ Ω ˜ 1 T Ω ˜ 1 + σ − 1 Ω ¯ 1 Ω ¯ 1 T < 0 .
Lemma 3 
([42]). Given a positive-definite matrix Θ and a scalar φ, one has
∫ t − φ t ϑ T ( s ) Θ ϑ ( s ) d s ≥ 1 φ ∫ t − φ t ϑ ( s ) d s T Θ ∫ t − φ t ϑ ( s ) d s .

3. Main Results

Introduce e i ( t ) = x i ( t ) − x 0 ( t ) as the leader-following error for i ∈ V . Substitution of (1) and (6) results in
d e i ( t ) = [ Γ 1 ( t ) e i ( t ) + Γ 2 ( t ) e i ( t − φ ( t ) ) + ϑ ( t ) f ( e i ( t − φ ( t ) ) ) ] d t − q B K 2 ( t ) [ ∑ j = 1 Y a i j ( x i ( t − φ ( t ) ) − x j ( t − φ ( t ) ) ) + b i ( x i ( t − φ ( t ) ) − x 0 ( t − φ ( t ) ) ) ] d t − ( 1 − q ) B K 1 ( t ) [ ∑ j = 1 Y a i j ( x i ( t ) − x j ( t ) ) + b i ( x i ( t ) − x 0 ( t ) ) ] d t + g ( e i ( t ) ) d w ( t ) ,
where the nonlinear differences are denoted by f ( e i ( t − φ ( t ) ) ) = f ( x i ( t − φ ( t ) ) ) − f ( x 0 ( t − φ ( t ) ) ) and g ( e i ( t ) ) = g ( x i ( t ) ) − g ( x 0 ( t ) ) .
Collecting all follower errors in e ( t ) = col ( e 1 ( t ) , … , e Y ( t ) ) gives the compact form of (11):
d e ( t ) = I Y ⊗ Γ 1 ( t ) − H ⊗ ( 1 − q ) B K 1 ( t ) e ( t ) + I Y ⊗ Γ 2 ( t ) − H ⊗ q B K 2 ( t ) e ( t − φ ( t ) ) + ϑ I Y ⊗ I p F ( e ( t − φ ( t ) ) ) + ( ϑ ( t ) − ϑ ) I Y ⊗ I p F ( e ( t − φ ( t ) ) ) } d t + G ( e ( t ) ) d w ( t ) ,
where
F ( e ( t − φ ( t ) ) ) = col ( f ( e 1 ( t − φ ( t ) ) ) , … , f ( e Y ( t − φ ( t ) ) ) ) , G ( e ( t ) ) = col ( g ( e 1 ( t ) ) , … , g ( e Y ( t ) ) ) .

3.1. Conditions for Nonfragile Stochastic Tracking Under Constant Delays

The constant-delay case φ ( t ) = φ 1 is considered first. Conditions are derived for nonfragile stochastic tracking in the presence of the random nonlinear and uncertain terms. The main analytical steps appear in Figure 1.
Figure 1. Analysis procedure for the constant-delay case.
Theorem 1. 
Under Assumptions 1–4, take ε 1 , ε 2 , ϑ, q, φ 1 , and ϕ k ( k = 1 , … , 4 ) as prescribed. Suppose that matrices Q 1 > 0 , R 1 > 0 , R 2 > 0 , M 1 > 0 , M 2 > 0 , Q and scalars δ 1 , δ 2 , σ 1 , σ 2 can be selected to fulfill
Ψ = ψ 11 ψ 12 0 ψ 14 ψ 15 ψ 16 ψ 17 I Y ⊗ Q 1 ∗ ψ 22 0 0 0 ψ 26 ψ 27 0 ∗ ∗ ψ 33 0 0 0 0 0 ∗ ∗ ∗ − σ 1 Σ 1 0 0 0 0 ∗ ∗ ∗ ∗ − σ 2 Σ 2 0 0 0 ∗ ∗ ∗ ∗ ∗ − σ 1 Σ 1 0 0 ∗ ∗ ∗ ∗ ∗ ∗ − σ 2 Σ 1 0 ∗ ∗ ∗ ∗ ∗ ∗ ∗ − ϑ − 2 δ 2 Σ 1 < 0 , Q 1 < δ 1 I p ,
where
ψ 11 = I Y ⊗ ( Sym ( Q 1 Γ 1 ) + M 1 + φ 1 2 M 2 + δ 1 ε 1 2 I p ) − ( 1 − q ) Sym ( H ⊗ B R 1 ) , ψ 12 = I Y ⊗ Q 1 Γ 2 − q ( H ⊗ B R 2 ) , ψ 22 = − I Y ⊗ M 1 + δ 2 ε 2 2 Σ 1 , ψ 33 = − I Y ⊗ M 2 , ψ 14 = I Y ⊗ Q 1 E 1 , ψ 15 = − H ⊗ Q 1 B E 2 , Σ 1 = I Y ⊗ I p , ψ 16 = σ 1 ϕ 1 ( I Y ⊗ F 1 T ) , ψ 26 = σ 1 ϕ 2 ( I Y ⊗ F 2 T ) , Σ 2 = I Y ⊗ I r , ψ 17 = σ 2 ( 1 − q ) ϕ 3 ( I Y ⊗ F 3 T ) , ψ 27 = σ 2 q ϕ 4 ( I Y ⊗ F 4 T ) ,
then the constant-delay system (1) reaches nonfragile stochastic tracking under protocol (6), despite the stated random nonlinearities and uncertainties. Its gains are K 1 = ( X T ) − 1 Φ − 1 Q 11 − 1 Φ X T R 1 and K 2 = ( X T ) − 1 Φ − 1 Q 11 − 1 Φ X T R 2 .
Proof. 
The proof starts from the following Lyapunov–Krasovskii functional candidate (LKFC) for (12):
Ξ ( t ) = e T ( t ) ( I Y ⊗ Q 1 ) e ( t ) + ∫ t − φ 1 t e T ( s ) ( I Y ⊗ M 1 ) e ( s ) d s + φ 1 ∫ − φ 1 0 ∫ t + θ t e T ( s ) ( I Y ⊗ M 2 ) e ( s ) d s d θ .
Introduce the infinitesimal operator L of Ξ ( t ) through
L Ξ ( t ) = lim ν → 0 + 1 ν ( E { Ξ ( t + ν ) t } − Ξ ( t ) ) ,
where an application of Ito’s formula to (14) produces
d Ξ ( t ) = L Ξ ( t ) d t + G ( e ( t ) ) ∂ Ξ ( t ) ∂ e d w ( t ) ,
the direct expansion of this generator results in
L Ξ ( t ) = 2 e T ( t ) ( I Y ⊗ Q 1 ) [ I Y ⊗ ( Γ 1 + ( ϕ 1 ( t ) − ϕ 1 ) E 1 H ¯ 1 ( t ) F 1 + ϕ 1 E 1 H ¯ 1 ( t ) F 1 ) ] e ( t ) − 2 e T ( t ) ( I Y ⊗ Q 1 ) [ H ⊗ ( 1 − q ) B ( K 1 + ( ϕ 3 ( t ) − ϕ 3 ) E 2 H ¯ 2 ( t ) F 3 + ϕ 3 E 2 H ¯ 2 ( t ) F 3 ) ] e ( t ) + 2 e T ( t ) ( I Y ⊗ Q 1 ) [ I Y ⊗ ( Γ 2 + ( ϕ 2 ( t ) − ϕ 2 ) E 1 H ¯ 1 ( t ) F 2 + ϕ 2 E 1 H ¯ 1 ( t ) F 2 ) ] e ( t − φ 1 ) − 2 e T ( t ) ( I Y ⊗ Q 1 ) [ H ⊗ q B ( K 2 + ( ϕ 4 ( t ) − ϕ 4 ) E 2 H ¯ 2 ( t ) F 4 + ϕ 4 ( t ) E 2 H ¯ 2 ( t ) F 4 ) ] e ( t − φ 1 ) + 2 e T ( t ) ( I Y ⊗ Q 1 ) [ ( ϑ ( t ) − ϑ ) F ( e ( t − φ 1 ) ) + ϑ F ( e ( t − φ 1 ) ) ] + e T ( t ) ( I Y ⊗ M 1 ) e ( t ) − e T ( t − φ 1 ) ( I Y ⊗ M 1 ) e ( t − φ 1 ) + φ 1 2 e T ( t ) ( I Y ⊗ M 2 ) e ( t ) − φ 1 ∫ t − φ 1 t e T ( s ) ( I Y ⊗ M 2 ) e ( s ) d s + Tr [ G T ( e ( t ) ) ( I Y ⊗ Q 1 ) G ( e ( t ) ) ] ,
and from Assumption 4, G T ( e ( t ) ) G ( e ( t ) ) ≤ ε 1 2 e T ( t ) e ( t ) and F T ( e ( t ) ) F ( e ( t ) ) ≤ ε 2 2 e T ( t ) e ( t ) . Using these bounds with (13) and (17) gives
Tr [ G T ( e ( t ) ) ( I Y ⊗ Q 1 ) G ( e ( t ) ) ] ≤ λ max ( Q 1 ) Tr [ G T ( e ( t ) ) G ( e ( t ) ) ] ≤ δ 1 ε 1 2 e T ( t ) e ( t ) ,
the nonlinear cross term in (17) admits the additional estimate
2 ϑ e T ( t ) ( I Y ⊗ Q 1 ) F ( e ( t − φ 1 ) ) ≤ δ 2 − 1 ϑ 2 e T ( t ) ( I Y ⊗ Q 1 T Q 1 ) e ( t ) + δ 2 ε 2 2 e T ( t − φ 1 ) e ( t − φ 1 ) ,
and for the integral term, Lemma 3 gives
− φ 1 ∫ t − φ 1 t e T ( s ) ( I Y ⊗ M 2 ) e ( s ) d s ≤ − ( ∫ t − φ 1 t e ( s ) d s ) T ( I Y ⊗ M 2 ) ( ∫ t − φ 1 t e ( s ) d s ) .
From (5) and (10), we can deduce the following: E { ϑ ( t ) − ϑ } = 0 , E { ϕ k ( t ) − ϕ k } = 0 , ( k = 1 , … , 4 ) . Define ξ ( t ) = col ( e ( t ) , e ( t − φ 1 ) , ∫ t − φ 1 t e ( s ) d s ) . After (17)–(20) are combined, the estimate becomes
E { L Ξ ( t ) } ≤ E { ξ T ( t ) ( Π + Δ Π ) ξ ( t ) } ,
where
Π = π 11 π 12 0 ∗ π 22 0 ∗ ∗ − I Y ⊗ M 2 , Δ Π = Sym ( Ω ¯ 1 H ¯ 1 ( t ) Ω ˜ 1 + Ω ¯ 2 H ¯ 2 ( t ) Ω ˜ 2 ) ,
with
π 11 = I Y ⊗ ( Sym ( Q 1 Γ 1 ) + M 1 + φ 1 2 M 2 + δ 1 ε 1 2 I p + δ 2 − 1 ϑ 2 Q 1 T Q 1 ) − ( 1 − q ) Sym ( H ⊗ Q 1 B K 1 ) , π 12 = I Y ⊗ Q 1 Γ 2 − q ( H ⊗ Q 1 B K 2 ) , π 22 = − I Y ⊗ M 1 + δ 2 ε 2 2 Σ 1 , Ω ¯ 1 = col ( I Y ⊗ Q 1 E 1 , 0 , 0 ) , Ω ¯ 2 = col ( − H ⊗ Q 1 B E 2 , 0 , 0 ) , Ω ˜ 1 = [ ϕ 1 I Y ⊗ F 1 , ϕ 2 I Y ⊗ F 2 , 0 ] , Ω ˜ 2 = [ ( 1 − q ) ϕ 3 I Y ⊗ F 3 , q ϕ 4 I Y ⊗ F 4 , 0 ] .
Lemma 2 removes the norm-bounded uncertainty from the estimate based on (17), yielding
E { L Ξ ( t ) } ≤ E { ξ T ( t ) ( Π + σ 1 Ω ˜ 1 T Ω ˜ 1 + σ 1 − 1 Ω ¯ 1 Ω ¯ 1 T + σ 2 Ω ˜ 2 T Ω ˜ 2 + σ 2 − 1 Ω ¯ 2 Ω ¯ 2 T ) ξ ( t ) } .
The identity B Q = Q 1 B follows from Lemma 1. It determines Q through
Q 1 V T Φ 0 X T = V T Φ 0 X T Q ,
an equivalent expression is
V T Q 11 0 0 Q 22 Φ 0 X T = V T Φ 0 X T Q ,
from which
Q = ( X T ) − 1 Φ − 1 Q 11 Φ X T ,
and the relations used in Theorem 1 are B Q = Q 1 B , R 1 = Q K 1 and R 2 = Q K 2 . The Schur complement of Ψ < 0 in (13) is
Π + σ 1 Ω ˜ 1 T Ω ˜ 1 + σ 1 − 1 Ω ¯ 1 Ω ¯ 1 T + σ 2 Ω ˜ 2 T Ω ˜ 2 + σ 2 − 1 Ω ¯ 2 Ω ¯ 2 T < 0 .
After expectation is applied to (16), one obtains
E { L Ξ ( t ) } ≤ E { ξ T ( t ) Ψ ξ ( t ) } ,
and condition (13) makes E { L Ξ ( t ) } < 0 . Thus, a constant μ can be chosen so that
E { L Ξ ( t ) } ≤ − μ E { e ( t ) 2 } .
By Lemma 1 in [43], the error dynamics (11) are asymptotically stable in mean square [26,35,44]. This establishes the claimed nonfragile stochastic tracking for the delayed nonlinear MASs. Dimensions of the blocks in (13) are listed in Table 1, which concludes the proof of Theorem 1. □
Table 1. Block dimensions in (13).
Remark 3. 
When φ 1 = 0 , model (1) has the delay-free form
d x 0 ( t ) = [ Γ 1 ( t ) x 0 ( t ) + ϑ ( t ) f ( x 0 ( t ) ) ] d t + g ( x 0 ( t ) ) d ω ( t ) , d x i ( t ) = [ Γ 1 ( t ) x i ( t ) + ϑ ( t ) f ( x i ( t ) ) + B u i ( t ) ] d t + g ( x i ( t ) ) d ω ( t ) ,
and with the delay removed, (6) reduces to u i ( t ) = − ( 1 − q ) K 1 ( t ) m i ( t ) . The corresponding conclusion follows by taking Ξ ( t ) = e T ( t ) ( I Y ⊗ Q 1 ) e ( t ) as the LKFC.
Corollary 1. 
Assume that Assumptions 1–4 are valid and that ε 1 , ϑ, q, ϕ 1 , and ϕ 3 are prescribed. If matrices Q 1 > 0 , R 1 > 0 and scalars δ 1 , δ 2 , σ 1 , σ 2 can be chosen to satisfy
Ψ ˜ = ψ ˜ 11 ψ ˜ 12 ψ ˜ 13 ψ ˜ 14 ψ ˜ 15 I Y ⊗ Q 1 ∗ − σ 1 Σ 1 0 0 0 0 ∗ ∗ − σ 2 Σ 2 0 0 0 ∗ ∗ ∗ − σ 1 Σ 1 0 0 ∗ ∗ ∗ ∗ − σ 2 Σ 1 0 ∗ ∗ ∗ ∗ ∗ − ϑ − 2 δ 2 Σ 1 < 0 , Q 1 < δ 1 I p ,
where
ψ ˜ 11 = I Y ⊗ ( Sym ( Q 1 Γ 1 ) + δ 1 ε 1 2 I p ) − ( 1 − q ) Sym ( H ⊗ B R 1 ) , ψ ˜ 12 = I Y ⊗ Q 1 E 1 , ψ ˜ 13 = − H ⊗ Q 1 B E 2 , ψ ˜ 14 = σ 1 ϕ 1 ( I Y ⊗ F 1 T ) , Σ 1 = I Y ⊗ I p , Σ 2 = I Y ⊗ I r , ψ ˜ 15 = σ 2 ( 1 − q ) ϕ 3 ( I Y ⊗ F 3 T ) ,
then the delay-free version of (1) achieves nonfragile stochastic tracking under (6). Its controller gain is K 1 = ( X T ) − 1 Φ − 1 Q 11 − 1 Φ X T R 1 .

3.2. Conditions for Nonfragile Stochastic Tracking Under TVDs

We next allow the delay to vary with time, without removing the randomly activated nonlinear and uncertain terms.
Theorem 2. 
Let Assumptions 1–4 be in force, with ε ˜ 1 , ε ˜ 2 , ϑ, q, φ ^ and ϕ k ( k = 1 , … , 4 ) prescribed. Assume that matrices Q ˜ 1 > 0 , R ˜ 1 > 0 , R ˜ 2 > 0 , M ˜ 1 > 0 , Q and scalars δ ˜ 1 , δ ˜ 2 , σ ˜ 1 , σ ˜ 2 satisfy
Θ = θ 11 θ 12 θ 13 θ 14 θ 15 θ 16 I Y ⊗ Q ˜ 1 ∗ θ 22 0 0 θ 25 θ 26 0 ∗ ∗ − σ ˜ 1 Σ 1 0 0 0 0 ∗ ∗ ∗ − σ ˜ 2 Σ 2 0 0 0 ∗ ∗ ∗ ∗ − σ ˜ 1 Σ 1 0 0 ∗ ∗ ∗ ∗ ∗ − σ ˜ 2 Σ 1 0 ∗ ∗ ∗ ∗ ∗ ∗ − ϑ − 2 δ ˜ 2 Σ 1 < 0 , Q ˜ 1 < δ ˜ 1 I p ,
where
θ 11 = I Y ⊗ ( Sym ( Q ˜ 1 Γ 1 ) + M ˜ 1 + δ ˜ 1 ε ˜ 1 2 I p ) − ( 1 − q ) Sym ( H ⊗ B R ˜ 1 ) , θ 12 = I Y ⊗ Q ˜ 1 Γ 2 − q ( H ⊗ B R ˜ 2 ) , θ 22 = − ( 1 − φ ^ ) ( I Y ⊗ M ˜ 1 ) + δ ˜ 2 ε ˜ 2 2 Σ 1 , θ 13 = I Y ⊗ Q ˜ 1 E 1 , θ 14 = − H ⊗ Q ˜ 1 B E 2 , Σ 1 = I Y ⊗ I p , θ 15 = σ ˜ 1 ϕ 1 ( I Y ⊗ F 1 T ) , θ 25 = σ ˜ 1 ϕ 2 ( I Y ⊗ F 2 T ) , Σ 2 = I Y ⊗ I r , θ 16 = σ ˜ 2 ( 1 − q ) ϕ 3 ( I Y ⊗ F 3 T ) , θ 26 = σ ˜ 2 q ϕ 4 ( I Y ⊗ F 4 T ) ,
then the delayed nonlinear MASs (1) achieve nonfragile stochastic tracking under protocol (6), with TVDs and the randomly occurring nonlinearities and uncertainties. The controller matrices are recovered from K 1 = Q − 1 R ˜ 1 , K 2 = Q − 1 R ˜ 2 , and B Q = Q ˜ 1 B .
Proof. 
For (12), choose the LKFC
Ξ ˜ ( t ) = e T ( t ) ( I Y ⊗ Q ˜ 1 ) e ( t ) + ∫ t − φ ( t ) t e T ( s ) ( I Y ⊗ M ˜ 1 ) e ( s ) d s .
Evaluating (27) by Ito’s formula gives
d Ξ ˜ ( t ) = L Ξ ˜ ( t ) d t + G ( e ( t ) ) ∂ Ξ ˜ ( t ) ∂ e d w ( t ) ,
and the resulting infinitesimal generator can be written as
L Ξ ˜ ( t ) = 2 e T ( t ) ( I Y ⊗ Q ˜ 1 ) [ I Y ⊗ ( Γ 1 + ( ϕ 1 ( t ) − ϕ 1 ) E 1 H ¯ 1 ( t ) F 1 + ϕ 1 E 1 H ¯ 1 ( t ) F 1 ) ] e ( t ) − 2 e T ( t ) ( I Y ⊗ Q ˜ 1 ) [ H ⊗ ( 1 − q ) B ( K 1 + ( ϕ 3 ( t ) − ϕ 3 ) E 2 H ¯ 2 ( t ) F 3 + ϕ 3 E 2 H ¯ 2 ( t ) F 3 ) ] e ( t ) + 2 e T ( t ) ( I Y ⊗ Q ˜ 1 ) [ I Y ⊗ ( Γ 2 + ( ϕ 2 ( t ) − ϕ 2 ) E 1 H ¯ 1 ( t ) F 2 + ϕ 2 E 1 H ¯ 1 ( t ) F 2 ) ] e ( t − φ ( t ) ) − 2 e T ( t ) ( I Y ⊗ Q ˜ 1 ) [ H ⊗ q B ( K 2 + ( ϕ 4 ( t ) − ϕ 4 ) E 2 H ¯ 2 ( t ) F 4 + ϕ 4 E 2 H ¯ 2 ( t ) F 4 ) ] e ( t − φ ( t ) ) + 2 e T ( t ) ( I Y ⊗ Q ˜ 1 ) [ ( ϑ ( t ) − ϑ ) F ( e ( t − φ ( t ) ) ) + ϑ F ( e ( t − φ ( t ) ) ) ] + e T ( t ) ( I Y ⊗ M ˜ 1 ) e ( t ) − ( 1 − φ ˙ ( t ) ) e T ( t − φ ( t ) ) ( I Y ⊗ M ˜ 1 ) e ( t − φ ( t ) ) + Tr [ G T ( e ( t ) ) ( I Y ⊗ Q ˜ 1 ) G ( e ( t ) ) ] .
Assumption 4 supplies G T ( e ( t ) ) G ( e ( t ) ) ≤ ε ˜ 1 2 e T ( t ) e ( t ) and F T ( e ( t ) ) F ( e ( t ) ) ≤ ε ˜ 2 2 e T ( t ) e ( t ) . In conjunction with (26) and (29), these inequalities imply
Tr [ G T ( e ( t ) ) ( I Y ⊗ Q ˜ 1 ) G ( e ( t ) ) ] ≤ λ max ( Q ˜ 1 ) Tr [ G T ( e ( t ) ) G ( e ( t ) ) ] ≤ δ ˜ 1 ε ˜ 1 2 e T ( t ) e ( t ) ,
and a further consequence of (29) is
2 ϑ e T ( t ) ( I Y ⊗ Q ˜ 1 ) F ( e ( t − φ ( t ) ) ) ≤ δ ˜ 2 − 1 ϑ 2 e T ( t ) ( I Y ⊗ Q ˜ 1 T Q ˜ 1 ) e ( t ) + δ ˜ 2 ε ˜ 2 2 e T ( t − φ ( t ) ) e ( t − φ ( t ) ) .
Introduce ζ ( t ) = col ( e ( t ) , e ( t − φ ( t ) ) ) . Applying the same bounding argument as in Theorem 1 to (29)–(31) yields
E { L Ξ ˜ ( t ) } ≤ E { ζ T ( t ) ( Π ˜ + Δ Π ˜ ) ζ ( t ) } ,
where
Π ˜ = π ˜ 11 π ˜ 12 ∗ π ˜ 22 , Δ Π ˜ = Sym ( Λ ¯ 1 H ¯ 1 ( t ) Λ ˜ 1 + Λ ¯ 2 H ¯ 2 ( t ) Λ ˜ 2 ) ,
with
π ˜ 11 = I Y ⊗ ( Sym ( Q ˜ 1 Γ 1 ) + M ˜ 1 + δ ˜ 1 ε ˜ 1 2 I p + δ ˜ 2 − 1 ϑ 2 Q ˜ 1 T Q ˜ 1 ) − ( 1 − q ) Sym ( H ⊗ Q ˜ 1 B K 1 ) , π ˜ 12 = I Y ⊗ Q ˜ 1 Γ 2 − q ( H ⊗ Q ˜ 1 B K 2 ) , π ˜ 22 = − ( 1 − φ ^ ) ( I Y ⊗ M ˜ 1 ) + δ ˜ 2 ε ˜ 2 2 Σ 1 , Λ ¯ 1 = col ( I Y ⊗ Q ˜ 1 E 1 , 0 ) , Λ ˜ 1 = [ ϕ 1 I Y ⊗ F 1 , ϕ 2 I Y ⊗ F 2 ] , Λ ¯ 2 = col ( − H ⊗ Q ˜ 1 B E 2 , 0 ) , Λ ˜ 2 = [ ( 1 − q ) ϕ 3 I Y ⊗ F 3 , q ϕ 4 I Y ⊗ F 4 ] .
Using Lemma 2, inequality (32) becomes
E { L Ξ ˜ ( t ) } ≤ E { ζ T ( t ) ( Π ˜ + σ ˜ 1 Λ ˜ 1 T Λ ˜ 1 + σ ˜ 1 − 1 Λ ¯ 1 Λ ¯ 1 T + σ ˜ 2 Λ ˜ 2 T Λ ˜ 2 + σ ˜ 2 − 1 Λ ¯ 2 Λ ¯ 2 T ) ζ ( t ) } ,
and as in Theorem 1, the construction provides B Q = Q ˜ 1 B , R ˜ 1 = Q K 1 and R ˜ 2 = Q K 2 . Taking the Schur complement of Θ < 0 in (26) gives
Π ˜ + σ ˜ 1 Λ ˜ 1 T Λ ˜ 1 + σ ˜ 1 − 1 Λ ¯ 1 Λ ¯ 1 T + σ ˜ 2 Λ ˜ 2 T Λ ˜ 2 + σ ˜ 2 − 1 Λ ¯ 2 Λ ¯ 2 T < 0 .
The same expectation argument used for Theorem 1 gives E { L Ξ ˜ ( t ) } ≤ E { ς T ( t ) Θ ς ( t ) } . Because of (26), E { L Ξ ˜ ( t ) } < 0 ; moreover, there is a μ ˜ satisfying E { L Ξ ˜ ( t ) } ≤ − μ ˜ E { e ( t ) 2 } . It follows that (11) is mean-square asymptotically stable [26,35,44]. Nonfragile stochastic tracking under TVDs is therefore established. Table 2 gives the dimensions of the blocks in (26), completing the proof of Theorem 2. □
Table 2. Block dimensions in (26).
Remark 4. 
The unknown matrices and the gains in Theorems 1 and 2 are obtained by solving (13) and (26). These linear matrix inequalities (LMIs) avoid the need for an eigenvalue of the structure matrix H, unlike the construction in [26]. As Y grows, however, both LMIs (13) and (26) increase in dimension. A lower-cost formulation is therefore left for future study.

4. Simulation Results

The two theorems are examined through separate numerical cases. In the network of Figure 2, node 0 reaches all other nodes through a directed tree, and nodes 1–7 are the followers.
Figure 2. Directed interaction network adopted in the simulations.
Example 1. 
To examine Theorem 1, take x i 1 , x i 2 , and x i 3 from [ − 20 20 ] × [ − 20 20 ] × [ − 20 20 ] . The matrices used in this case are
Γ 1 = − 3.5 − 1.6 − 1.5 4.9 − 1.7 0.8 − 0.7 − 1.3 − 3.7 , Γ 2 = 2 1 − 1 0.5 0.5 0.2 0.3 0.3 − 0.5 , B = 1 2 0 , F 1 = diag { 0.01 , 0.01 , 0.02 } , F 2 = diag { 0.01 , − 0.01 , 0.03 } , E 1 = diag { 0.01 , − 0.01 , − 0.01 } , F 3 = diag { 0.02 , − 0.03 , 0.02 } , F 4 = diag { 0.02 , − 0.02 , 0.02 } , E 2 = 0.01 .
Use q = 0.5 , ϑ = 0.3 , ε 1 = 0.5 , ε 2 = 0.7 , ϕ 1 = 0.5 , ϕ 2 = 0.3 , ϕ 3 = 0.4 , ϕ 4 = 0.5 , and φ 1 = 0.37 for the remaining quantities.
The feasibility of (13) is checked with feasp in MATLAB R2024a, giving
σ 1 = 9.5773 , σ 2 = 9.5771 , δ 1 = 6.1895 , δ 2 = 0.9234 , Q = 1.2254 , Q 1 = 2.1857 − 0.4802 − 0 . 7041 − 0.4802 1.4655 0.3520 − 0.7041 0.3520 3.1629 , R 1 = 3.3563 7.2019 − 0.8140 T , R 2 = 0.7424 0.5071 − 0.1002 T , M 1 = 8.1479 − 1.0285 − 0.8160 − 1.0285 4.8643 0.9830 − 0.8160 0.9830 8.8122 , M 2 = 8.7984 − 0.6576 0.0470 − 0.6576 7.9108 0.4116 0.0470 0.4116 9.2657 ,
and the gains recovered from Theorem 1 are K 1 and K 2 as shown below:
K 1 = 2.7389 5.8770 − 0.6642 , K 2 = 0.6058 0.4138 − 0.0817 .
For the computed matrices, report the residual B Q − Q 1 B 2 together with the largest eigenvalue of Ψ :
B Q − Q 1 B 2 = 1.666 × 10 − 4 , λ max ( Ψ ) = − 0.1865 .
For this example, specify f ( x i ( t − φ 1 ) ) and g ( x i ( t ) ) by
f ( x i ( t − φ 1 ) ) = [ 0.5 sin ( x i 1 ( t − φ 1 ) ) , 0.5 sin ( x i 2 ( t − φ 1 ) ) , 0.5 sin ( x i 3 ( t − φ 1 ) ) ] T , g ( x i ( t ) ) = [ 0.2 sin ( x i 1 ( t ) ) , 0.2 sin ( x i 2 ( t ) ) , 0.2 sin ( x i 3 ( t ) ) ] T .
The convergence rate, maximum tracking deviation, and integrated mean-square error (IMSE) are reported for both controllers in Table 3.
Table 3. Quantitative comparison of the two controllers.
Let H ¯ 1 ( t ) and H ¯ 2 ( t ) be H ¯ 1 ( t ) = sin ( t ) I 3 and H ¯ 2 ( t ) = [ sin ( t ) , cos ( t ) , sin ( t ) ] , and set q = 0.5 . The state responses in Figure 3 show the followers approaching the leader. Tracking errors obtained with the nonfragile and conventional controllers are plotted in Figure 4 and Figure 5; both sets of curves tend to zero. The numerical behavior is consistent with the constant-delay result under randomly activated nonlinearities and uncertainty. Figure 6 displays the corresponding values of K 1 2 , K 2 2 , ( 1 − q ) K 1 2 , and q K 2 2 as q changes.
Figure 3. State components of the leader and followers: (a) x i 1 , (b) x i 2 , and (c) x i 3 .
Figure 4. Tracking-error components with the nonfragile controller: (a) e i 1 , (b) e i 2 , and (c) e i 3 .
Figure 5. Tracking-error components with the conventional controller: (a) e i 1 , (b) e i 2 , and (c) e i 3 .
Figure 6. Variation of K 1 2 , K 2 2 , ( 1 − q ) K 1 2 and q K 2 2 with q.
Example 2. 
Theorem 2 is examined with x i 1 and x i 2 selected from [ − 13 13 ] × [ − 13 13 ] . In this case,
Γ 1 = − 1 1.5 − 1 0 , Γ 2 = 0.5 − 0.3 0.3 − 0.5 , B = 1 2 , F 1 = diag { 0.01 , 0.01 } , F 2 = diag { 0.01 , − 0.01 } , E 1 = diag { 0.01 , − 0.01 } , F 3 = diag { 0.02 , − 0.03 } , F 4 = diag { 0.02 , 0.02 } , E 2 = 0.01 .
The TVD is φ ( t ) = 0.11 sin 2 ( t ) + 0.01 , for which φ ^ = 0.11 . Take ε ˜ 1 = 0.5 and ε ˜ 2 = 0.7 ; the other parameters are unchanged from Example 1.
Using feasp in MATLAB R2024a to test (26) produces
σ ˜ 1 = 0.5974 , σ ˜ 2 = 0.5973 , δ ˜ 1 = 0.3286 , δ ˜ 2 = 0.0735 , Q = 0.1402 Q ˜ 1 = 0.2482 − 0.0540 − 0.0540 0.1672 , R ˜ 1 = 0.2612 0.4782 T , M ˜ 1 = 0.2017 − 0 . 0037 − 0 . 0037 0.3008 , R ˜ 2 = 0.0343 − 0.0454 T .
Theorem 2 recovers K 1 and K 2 as
K 1 = 1 . 8629 3 . 4100 , K 2 = 0 . 2449 − 0 . 3239 .
The computed residual B Q − Q ˜ 1 B 2 and maximum eigenvalue of Θ satisfy
B Q − Q ˜ 1 B 2 = 1.9065 × 10 − 5 , λ max ( Θ ) = − 0.0047 .
The functions f ( x i ( t − φ 1 ) ) and g ( x i ( t ) ) used here are
f ( x i ( t − φ ( t ) ) ) = [ 0.5 sin ( x i 1 ( t − φ ( t ) ) ) , 0.5 sin ( x i 2 ( t − φ ( t ) ) ) ] T , g ( x i ( t ) ) = [ 0.2 sin ( x i 1 ( t ) ) , 0.2 sin ( x i 2 ( t ) ) ] T .
Let H ¯ 1 ( t ) and H ¯ 2 ( t ) be H ¯ 1 ( t ) = sin ( t ) I 2 and H ¯ 2 ( t ) = [ sin ( t ) , cos ( t ) ] , and set q = 0.5 . Figure 7 presents the agent states. In Figure 8 and Figure 9, every tracking-error curve approaches zero; this behavior supports the result with random nonlinearities and uncertainty.
Figure 7. Leader/follower state components: (a) x i 1 and (b) x i 2 .
Figure 8. Tracking-error components with the nonfragile controller: (a) e i 1 and (b) e i 2 .
Figure 9. Tracking-error components with the conventional controller: (a) e i 1 and (b) e i 2 .

5. Conclusions

This work has investigated nonfragile stochastic tracking in delayed high-order MASs whose Lipschitz nonlinear dynamics exchange information over a directed graph. Randomly activated nonlinearities and plant uncertainty are modeled separately from diffusion noise. The distributed controller combines current and delayed state information under TVDs. Lyapunov analysis and matrix transformations lead to LMI-based stability criteria and computable controller gains. Two simulation studies support the theoretical conclusions. A natural extension is nonfragile stochastic tracking for delayed high-order MASs under switching topologies.

Author Contributions

Writing—Original Draft, Writing—Review, Conceptualization, Supervision, Methodology, Formal Analysis, Software, Simulation, Funding Acquisition, T.Z.; Writing—Review, Conceptualization, Methodology, Formal Analysis, Funding Acquisition, J.M. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the Key R&D Program of Shandong Province, China (No. 2024CXGC010704), the Shandong Provincial Natural Science Foundation (No. ZR2024QF255), and the Yantai Science and Technology Innovation Development Plan (No. 2024YT06000226).

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Wang, P.; Wen, G.; Yu, W.; Huang, T.; Yu, X. An adaptive continuous approach to consensus tracking of nonlinear multiagent systems with a nonautonomous leader. IEEE Trans. Syst. Man Cybern. Syst. 2023, 53, 4684–4695. [Google Scholar] [CrossRef] [Scilit]
  2. Liu, Z.; Guo, M.; Li, Z. Time minimization and online synchronization for multi-agent systems under collaborative temporal logic tasks. Automatica 2024, 159, 111377. [Google Scholar] [CrossRef] [Scilit]
  3. Ye, P.; Shan, Q.; Li, T.; Chen, C.P. Practical time-varying formation-containment tracking for nonlinear multi-agent systems with general noise. J. Frankl. Inst. 2024, 361, 106822. [Google Scholar] [CrossRef] [Scilit]
  4. Xing, Y.; He, X.; Li, X. Disturbance observer-based event-triggered impulsive control for nonlinear systems with unknown external disturbances. Math. Comput. Simul. 2025, 227, 263–271. [Google Scholar] [CrossRef] [Scilit]
  5. Liu, Y.; Dong, X.; Zio, E.; Cui, Y. Event-triggered multiple leaders formation tracking for networked swarm system with resilience to noncooperative nodes. IEEE Trans. Cybern. 2025, 55, 4136–4144. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  6. Zhou, T. H∞ containment control of multi-agent systems with mixed time-varying delays and exogenous disturbances via observer-based output feedback. Asian J. Control 2026, 28, 2108–2118. [Google Scholar] [CrossRef] [Scilit]
  7. Fang, X.; Xie, L.; Dimarogonas, D.V. Simultaneous distributed localization and formation tracking control via matrix-weighted position constraints. Automatica 2025, 175, 112188. [Google Scholar] [CrossRef] [Scilit]
  8. Xu, L.; Su, Y.; Cai, H. Event-triggered consensus of multiple nonholonomic mobile robots. Automatica 2025, 174, 112156. [Google Scholar] [CrossRef] [Scilit]
  9. Aghajari, H.A.; Niknam, T.; Shasadeghi, M.; Sharifhosseini, S.; Taabodi, M.; Sheybani, E.; Javidi, G.; Pourbehzadi, M. Analyzing complexities of integrating renewable energy sources into smart grid: A comprehensive review. Appl. Energy 2025, 383, 125317. [Google Scholar] [CrossRef] [Scilit]
  10. Liu, X.; Wang, Z.; Xing, L.; Wang, Y.; Zhang, C. Distributed current sharing and voltage regulation control for DC microgrids withgrid-forming and grid-feeding converters. Sci. China Inf. Sci. 2025, 55, 2622–2636. [Google Scholar] [CrossRef] [Scilit]
  11. Ma, L.; Wang, Z.; Han, Q.; Liu, Y. Consensus control of stochastic multi-agent systems: A survey. Sci. China Inf. Sci. 2017, 60, 120201. [Google Scholar] [CrossRef] [Scilit]
  12. Niu, X.; Liu, Y.; Li, F. Consensus via time-varying feedback for uncertain stochastic nonlinear multiagent systems. IEEE Trans. Cybern. 2019, 49, 1536–1544. [Google Scholar] [CrossRef] [PubMed]
  13. Li, M.; Wu, Z.; Deng, F.; Guo, B. Active disturbance rejection control to consensus of second-order stochastic multiagent systems. IEEE Trans. Control Netw. Syst. 2023, 10, 993–1004. [Google Scholar] [CrossRef] [Scilit]
  14. Sheng, L.; Ma, P.; Gao, M. H∞ consensus control with spectrum constraints for stochastic multi-agent systems subject to (x, u, v)-dependent noises. Appl. Math. Comput. 2019, 362, 124560. [Google Scholar] [CrossRef] [Scilit]
  15. Li, B.; Wen, G.; Peng, Z.; Huang, T.; Rahmani, A. Fully distributed consensus tracking of stochastic nonlinear multiagent systems with markovian switching topologies via intermittent control. IEEE Trans. Syst. Man Cybern. Syst. 2022, 52, 3200–3209. [Google Scholar] [CrossRef] [Scilit]
  16. Gu, H.; Liu, K.; Lü, J.; Ren, Z. Consensus of stochastic dynamical multiagent systems in directed networks via pi protocols. IEEE Trans. Syst. Man Cybern. Syst. 2022, 33, 6417–6428. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  17. Li, K.; Li, Y. Adaptive NN optimal consensus fault-tolerant control for stochastic nonlinear multiagent systems. IEEE Trans. Neural Netw. Learn. Syst. 2023, 34, 947–957. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  18. Wei, B.; Tian, E.; Gu, Z.; Zhai, J.; Liang, D. Quasi-consensus control for stochastic multiagent systems: When energy harvesting constraints meet multimodal FDI attacks. IEEE Trans. Cybern. 2024, 54, 1755–1767. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  19. Li, Y.; Liu, L.; Hua, C.; Feng, G. Event-triggered/self-triggered leader-following control of stochastic nonlinear multiagent systems using high-gain method. IEEE Trans. Cybern. 2021, 51, 2969–2978. [Google Scholar] [CrossRef] [Scilit]
  20. Li, K.; Li, Y. Fuzzy adaptive optimal consensus fault-tolerant control for stochastic nonlinear multiagent systems. IEEE Trans. Fuzzy Syst. 2022, 30, 2870–2885. [Google Scholar] [CrossRef] [Scilit]
  21. Wang, J.; Wen, G.; Duan, Z.; Hu, Y.; He, W. Distributed H∞ robust control of multiagent systems with uncertain parameters: Performance-region-based approach. IEEE Trans. Syst. Man Cybern. Syst. 2022, 52, 2888–2898. [Google Scholar] [CrossRef] [Scilit]
  22. Wu, T.; Hu, J.; Chen, D. Non-fragile consensus control for nonlinear multi-agent systems with uniform quantizations and deception attacks via output feedback approach. Nonlinear Dyn. 2019, 96, 243–255. [Google Scholar] [CrossRef] [Scilit]
  23. Yang, Y.; He, Y. Non-fragile observer-based robust control for uncertain systems via aperiodically intermittent control. Inf. Sci. 2021, 573, 239–261. [Google Scholar] [CrossRef] [Scilit]
  24. Han, S.; Zhong, Q.; Wang, Y.; Shi, K.; Zhong, S. Nonfragile consensus of nonlinear multiagent systems with intrinsic delays via aperiodic memory sampled-data control. Int. J. Robust Nonlinear Control 2022, 32, 5164–5183. [Google Scholar] [CrossRef] [Scilit]
  25. Stephen, A.; Rajakopal, K.; Raja, R.; Srinidhi, A.; Thamilmaran, K.; Agarwal, R.P. Non-fragile reliable control for multi-agent systems with actuator faults using an improved LK functional. Nonlinear Dyn. 2025, 113, 6645–6669. [Google Scholar] [CrossRef] [Scilit]
  26. Hu, M.; Guo, L.; Hu, A.; Yang, Y. Leader-following consensus of linear multi-agent systems with randomly occurring nonlinearities and uncertainties and stochastic disturbances. Neurocomputing 2015, 149, 884–890. [Google Scholar] [CrossRef] [Scilit]
  27. Yuan, Y.; Wang, Z.; Zhang, P.; Dong, H. Nonfragile near-optimal control of stochastic time-varying multiagent systems with control-and state-dependent noises. IEEE Trans. Cybern. 2019, 49, 2605–2617. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  28. Xiao, G.; Wang, J.; Meng, D. Adaptive finite-time consensus for stochastic multiagent systems with uncertain actuator faults. IEEE Trans. Control Netw. Syst. 2023, 10, 1899–1912. [Google Scholar] [CrossRef] [Scilit]
  29. Li, K.; Hua, C.; You, X.; Ahn, C.K. Leader-following consensus control for uncertain feedforward stochastic nonlinear multiagent systems. IEEE Trans. Neural Netw. Learn. Syst. 2023, 34, 1049–1057. [Google Scholar] [CrossRef] [Scilit]
  30. Yu, L.; Wang, Z.; Liu, Y.; Xue, C. Sampled-data nonfragile bipartite tracking consensus for nonlinear multiagent systems: Dealing with denial-of-service attacks. IEEE Trans. Syst. Man Cybern. Syst. 2025, 55, 1202–1214. [Google Scholar] [CrossRef] [Scilit]
  31. Jiang, X.; Xia, G.; Feng, Z.; Jing, X. Distributed sampled-data nonfragile consensus filtering over sensor networks with topology switching and transmission delay. IEEE/ASME Trans. Mechatron. 2022, 27, 1379–1390. [Google Scholar] [CrossRef] [Scilit]
  32. 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] [Scilit]
  33. Wu, X.; Tang, Y.; Zhang, W. Stability analysis of stochastic delayed systems with an application to multi-agent systems. IEEE Trans. Autom. Control 2016, 61, 4143–4149. [Google Scholar] [CrossRef] [Scilit]
  34. Zhou, J.; Park, J.H.; Ma, Q. Non-fragile observer-based H∞ control for stochastic time-delay systems. Appl. Math. Comput. 2016, 291, 69–83. [Google Scholar] [CrossRef] [Scilit]
  35. Zhou, J.; Sang, C.; Li, X.; Fang, M.; Wang, Z. H∞ consensus for nonlinear stochastic multi-agent systems with time delay. Appl. Math. Comput. 2018, 325, 41–58. [Google Scholar] [CrossRef] [Scilit]
  36. Huang, X.; Liu, Y.; Wang, Y.; Zhou, J.; Fang, M.; Wang, Z. L2-L∞ consensus of stochastic delayed multi-agent systems with adt switching interaction topologies. Appl. Math. Comput. 2020, 368, 124800. [Google Scholar] [CrossRef] [Scilit]
  37. Kaviarasan, B.; Kwon, O.; Park, M.J.; Sakthivel, R. Stochastic faulty estimator-based non-fragile tracking controller for multi-agent systems with communication delay. Appl. Math. Comput. 2021, 392, 125704. [Google Scholar] [CrossRef] [Scilit]
  38. Kang, L.; Ji, Z.; Liu, Y.; Lin, C. Consensus of stochastic multi-agent systems with time-delay and Markov jump. Int. J. Syst. Sci. 2024, 55, 1959–1979. [Google Scholar] [CrossRef] [Scilit]
  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] [Scilit]
  40. Mesbahi, M.; Egerstedt, M. Graph Theoretic Methods in Multiagent Networks; Princeton University Press: Princeton, NJ, USA, 2010. [Google Scholar]
  41. Wang, Z.; Yang, F.; Ho, D.W.; Liu, X. Robust H∞ control for networked systems with random packet losses. IEEE Trans. Syst. Man Cybern. Part B 2007, 37, 916–924. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  42. 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] [Scilit]
  43. Shen, B.; Wang, Z.; Liu, X. Sampled-data synchronization control of dynamical networks with stochastic sampling. IEEE Trans. Autom. Control 2012, 57, 2644–2650. [Google Scholar] [CrossRef] [Scilit]
  44. Xu, S.; Chen, T. Robust H∞ control for uncertain stochastic systems with state delay. IEEE Trans. Autom. Control 2002, 47, 2089–2094. [Google Scholar] [CrossRef] [Scilit]
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.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.