Next Article in Journal
Dynamical Analysis and Solitary Wave Solutions of the Zhanbota-IIA Equation with Computational Approach
Previous Article in Journal
The Extended Goodwin Model and Wage–Labor Paradoxes Metric in South Africa
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Distributed PD Average Consensus of Lipschitz Nonlinear MASs in the Presence of Mixed Delays

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
Math. Comput. Appl. 2025, 30(5), 99; https://doi.org/10.3390/mca30050099
Submission received: 18 July 2025 / Revised: 7 September 2025 / Accepted: 8 September 2025 / Published: 11 September 2025

Abstract

In this work, the distributed average consensus for dynamical networks with Lipschitz nonlinear dynamics is studied, where the network communication switches quickly among a set of directed and balanced switching graphs. Differing from existing research concerning uniform constant delay or time-varying delays, this study focuses on consensus problems with mixed delays, equipped with one class of delays embedded within the nonlinear dynamics and another class of delays present in the control input. In order to solve these problems, a proportional and derivative control strategy with time delays is proposed. In this way, by using Lyapunov theory, the stability is analytically established and the conditions required for solving the consensus problems are rigorously derived over switching digraphs. Finally, the effectiveness of the designed algorithm is tested using the MATLAB R2021a platform.

1. Introduction

Multi-agent systems (MASs), as a class of complex networks, have garnered considerable attention across a variety of fields, encompassing urban transportation [1], smart grids [2], communication optimization [3], the national defense industry [4], and others. Over recent decades, numerous intriguing and valuable insights into the study of MASs have been presented [5,6,7,8,9,10,11,12]. Notably, consensus represents a pivotal collective behavior within MASs, and it stands out as the predominant research focus in this area given its extensive applications in large-scale formation control [13,14] and flocking behavior [15]. Average consensus [16], a distinct type of consensus, pertains to the task of computing the average of certain quantities, differing from seeking a common value. Recently, a substantial number of reports have emerged which broaden the scope of average consensus results to encompass more generalized dynamics and communication environments [17,18,19,20,21].
However, it is noteworthy that physical systems frequently possess delay characteristics. The need to address the consensus challenge in MASs subject to time delays has led to the emergence of many intriguing findings. In particular, Sun et al. [22] discussed the mean square average consensus for first-order integrators with a communication constant time delay (CTD) obtained by means of the stopping time truncation approach. Over a balanced digraph, Liu et al. [23] developed the average consensus filter for first-order integrators with heterogeneous disturbances considering a communication CTD. For arbitrarily large CTDs, Aragues et al. [24] introduced delay compensation techniques to address the average consensus for discrete-time MASs over a strongly connected graph. Furthermore, in [25], the consensus for nonlinear MASs with unknown-state CTDs was studied, and was found to depend on a neural network control law over an undirected graph. Based on [25], Ma et al. [26] dealt with the robust consensus problem with unknown-state CTDs and external noises over an undirected graph. Soon after, Wen et al. [27] investigated the consensus tracking problem in the existence of unknown-state CTDs and exogenous disturbances by proposing an adaptive control algorithm.
It should be pointed out that the studies mentioned above only consider the problems with CTDs; however, delay is usually time-varying in practical systems. For example, Wang et al. [28] adopted a proportional and derivative (PD) control law to cope with average consensus problems subject to a communication time-varying delay (TVD) over switching digraphs. In [29], the reciprocally convex approach was employed to tackle the local consensus problem with communication TVDs under a strongly connected digraph. Inspired by the work [30] subject to CTDs, Ma et al. [31] developed proportional and PD feedback laws to analyze the robust consensus with communication TVDs over both undirected and directed graphs. In the context of a cooperative-antagonistic framework, Caiazzo et al. [32] solved the average consensus with multiple unknown TVDs over a signed graph. Moreover, for a high-order integrator network with nonlinear dynamics, the consensus problem was addressed over a undirected graph in the work of [33] subject to state TVDs by using an edge-based self-triggering impulsive protocol, and consensus conditions were obtained in [34] under switching graphs by proposing a PD protocol in the presence of communication TVDs. In addition, other achievements about consensus problems with different TVDs can be found in [35,36,37,38,39,40,41,42].
From the discussion presented above, it becomes evident that state and communication delays within the system are crucial elements influencing the consensus results. There exists considerable potential for enhancing current research endeavors through the application of novel analysis techniques. Therefore, we investigate the average consensus for nonlinear MASs with mixed TVDs over switching digraphs. Thus, the distinct contributions of this study are highlighted as follows: First, to achieve superior performance index, a distributed PD control law with TVDs is utilized to tackle the average consensus of MASs with Lipschitz nonlinearity. Second, this paper is concerned with the average consensus problems over a balanced graph rather than assuming the communication graph is undirected. Third, we take into account both the state and communication TVDs, as well as inner nonlinearities. Importantly, state TVDs and communication delays are not identical. Fourth, the sufficient conditions of combined linear matrix inequalities (LMIs) can be obtained based on the formulation of appropriate Lyapunov–Krasovskii functionals (LKFs) containing triple integral terms.
The remaining parts are structured as follows: the preliminaries and problem formulation are presented in Section 2. Section 3 shows the average consensus design condition and main results. In Section 4, a simulation example is provided. Finally, Section 5 concludes this paper.

2. Preliminaries and Problem Formulation

2.1. Preliminaries and Notations

The communication graph is described by G = V , E , A , which consists of N nodes V = { 1 , , N } , the edges E = ( i , j ) : i , j V , and an adjacency matrix A = [ a i j ] R N × N , with a i j = 1 if ( i , j ) E and a i j = 0 otherwise. G is a balanced graph when j = 1 N a i j = j = 1 N a j i for i V [43]. The Laplacian matrix is denoted as L = d i a g { j = 1 N a i j } A . Moreover, let ∗ represent the symmetric term, col ( x 1 , , x n ) = [ x 1 T , , x n T ] T and 1 n = [ 1 , , 1 ] T .

2.2. Problem Formulation

The dynamics of the ith agent is denoted by
x ˙ i ( t ) = g ( x i ( t d ( t ) ) ) + u i ( t ) ,
where x i ( t ) R n and u i ( t ) R n represent the state variable and the control input of agent i. For ease of understanding, the dimension n = 1 is used through the paper. g ( x i ( t d ( t ) ) ) denotes the inner nonlinear function, and d ( t ) represents the TVD. Note that 0 d ( t ) k , μ ^ 1 d ˙ ( t ) μ 1 , 0 < μ ^ 1 < 1 , 0 < μ 1 < 1 .
Definition 1
([44]). The average consensus can be achieved if the condition lim t x i ( t ) = 1 N j = 1 N x j ( 0 ) holds for i , j V .
The switching interaction graph of N agents in (1) is modeled by a switched connected graph G σ , and σ : 0 , P indicates a graph in P = Δ { 1 , 2 , , M } at time t, while { G σ : σ P } denotes a fixed graph in set { t 0 G } .
Assumption A1.
G σ is directed, connected, and balanced for each σ P .
Assumption A2.
If a nonlinear function g ( . ) satisfies the Lipschitz condition, there exists a nonnegative constant q such that
g ( t , x ( t ) ) g ( t , y ( t ) ) q 2 x ( t ) y ( t ) , x ( t ) , y ( t ) R n .
Lemma 1
([45]). If Assumption 1 holds, the Laplacian matrix L R N × N satisfies 1 N T L = 0 and L 1 N = 0 .
Lemma 2
([46]). For the matrix Υ = Υ T > 0 and scalar υ > 0 , the subsequent condition holds that
υ 0 t + θ t ϖ T ( s ) Υ ϖ ( s ) d s d θ 1 υ 2 υ 0 t + θ t ϖ ( s ) d s d θ T Υ Υ υ 0 t + θ t ϖ ( s ) d s d θ .

3. Average Consensus Design Condition

A PD control law considering delay τ ( t ) is proposed as follows:
u i ( t ) = β j N i a i j ( t ) [ x i ( t τ ( t ) ) x j ( t τ ( t ) ) ] α j N i a i j ( t ) [ x ˙ i ( t τ ( t ) ) x ˙ j ( t τ ( t ) ) ] ,
where β and α are positive parameters and τ ( t ) is the communication delay which satisfies 0 τ ( t ) h , μ ^ 2 τ ˙ ( t ) μ 2 , 0 < μ ^ 2 < 1 , 0 < μ 2 < 1 .
Remark 1.
Different from the proportional control protocols [11,12,22,29,44], the two parameters β and α are designed in (2), where greater flexibility in the PD control protocol is provided. Furthermore, the convergence rate in (2) is improved in comparison with those proportional protocols. In addition, the PD scheme boasts superior advantages, as shown in [28,30,31,34].
Substituting (2) into (1) yields
x ˙ i ( t ) = β j N i a i j ( t ) [ x i ( t τ ( t ) ) x j ( t τ ( t ) ) ] α j N i a i j ( t ) [ x ˙ i ( t τ ( t ) ) x ˙ j ( t τ ( t ) ) ] + g ( x i ( t d ( t ) ) ) .
Let x ( t ) = col ( x 1 ( t ) , , x N ( t ) ) , x ( t τ ( t ) ) = col ( x 1 ( t τ ( t ) ) , , x N ( t τ ( t ) ) ) and g ( x ( t d ( t ) ) ) = col ( g ( x 1 ( t d ( t ) ) ) , , g ( x N ( t d ( t ) ) ) ) . Then, it follows from (3) that
x ˙ ( t ) = β L σ x ( t τ ( t ) ) α L σ x ˙ ( t τ ( t ) ) + g ( x ( t d ( t ) ) ) .
Furthermore, let x ( t ) = ( 1 N ) i = 1 N x i ( t ) , g ( x ( t d ( t ) ) ) = ( 1 N ) i = 1 N g ( x i ( t d ( t ) ) ) and z ( t ) = x ( t ) 1 N x ( t ) . Thus, Equation (4) can easily be transformed into
z ˙ ( t ) = β L σ z ( t τ ( t ) ) α L σ z ˙ ( t τ ( t ) ) + G ( x ( t d ( t ) ) ) ,
where G ( x ( t d ( t ) ) ) = g ( x ( t d ( t ) ) ) 1 N g ( x ( t d ( t ) ) ) .
According to Assumption 2, this yields
G ( x ( t d ( t ) ) ) g ( x ( t d ( t ) ) ) 1 N g ( x ( t d ( t ) ) ) + 1 N g ( x ( t d ( t ) ) ) 1 N g ( x ( t d ( t ) ) ) ( q 2 ) z ( t d ( t ) ) + ( 1 N ) i = 1 N g ( x i ( t d ( t ) ) ) g ( x ( t d ( t ) ) ) q z ( t d ( t ) ) .
Theorem 1.
Suppose that G σ ( σ P ) is directed, connected, and balanced. For the given parameters μ i > 0 ( i = 1 , 2 ) , α > 0 , β > 0 , q > 0 , h > 0 , k > 0 and μ ^ 1 , the average consensus of nonlinear MASs (1) with mixed TVDs is realized by a PD protocol (2) if there exist the matrices R > 0 , P i > 0 , S i > 0 , Y i > 0 , Q i > 0 , W i > 0 , T i > 0 , Q i i > 0 , i = 1 , 2 , such that P 1 + ( k d ( t ) ) P 2 > 0 and the following conditions hold:
Ψ ˜ σ = Ψ ˜ 1 σ Ψ ˜ 2 σ Ψ ˜ 3 σ Ψ 4 σ Ψ 5 σ Ψ 6 σ d ( t ) = 0 < 0 ,
Ψ ^ σ = Ψ ^ 1 σ Ψ ^ 2 σ Ψ ^ 3 σ Ψ 4 σ Ψ 5 σ Ψ 6 σ d ( t ) = k < 0 ,
Q ˜ 1 = Q 1 Y 1 S 1 > 0 ,
Q ˜ 2 = Q 2 Y 2 S 2 > 0 ,
where
Ψ ˜ 1 σ = θ ˜ 11 σ 0 W 2 θ ˜ 22 σ 0 Q 11 W 2 , Ψ ˜ 2 σ = θ ˜ 14 σ W 1 0 0 0 0 0 0 0 ,
Ψ ˜ 3 σ = θ ˜ 17 σ h R 0 0 0 0 0 0 0 , Ψ 4 σ = θ 44 σ 0 0 Q 1 W 1 Y 1 S 1 , Ψ 6 σ = θ 77 σ 0 0 R 0 1 h T 2 , Ψ ^ 1 σ = θ ^ 11 σ 0 W 2 θ ^ 22 σ 0 Q 11 W 2 , Ψ ^ 2 σ = θ ^ 14 σ W 1 0 0 0 0 0 0 0 , Ψ 5 σ = θ 47 σ 0 0 0 0 0 0 0 0 , Ψ ^ 3 σ = θ ^ 17 σ h R 0 0 0 0 0 0 0 ,
with
Θ = S 1 + S 2 + T 1 + h 2 W 1 + k 2 W 2 + 1 4 h 4 R ; θ ˜ 11 σ = θ ^ 11 σ + k P 2 , θ ˜ 22 σ = θ ^ 22 σ + q 2 P 2 ; θ ^ 11 σ = P 1 μ ^ 1 P 2 + Q 1 + Q 2 + Y 1 + Y 2 + Q 11 + Q 22 + h T 2 h 2 R W 1 W 2 ; θ ^ 22 σ = ( 1 + α + β ) q 2 Θ + q 2 ( P 1 + Y 1 + Y 2 ) ( 1 μ 1 ) Q 22 ; θ ˜ 14 σ = θ ^ 14 σ k β P 2 L σ , θ ˜ 17 σ = θ ^ 17 σ k α P 2 L σ ; θ ^ 14 σ = β ( P 1 + Y 1 ) L σ , θ 47 σ = β α L σ T Θ L σ ( 1 μ 2 ) Y 2 ; θ ^ 17 σ = α ( P 1 + Y 1 + Y ) L σ , θ 44 σ = ( β + β 2 ) L σ T Θ L σ ( 1 μ 2 ) Q 2 ; θ 77 σ = ( α + α 2 ) L σ T Θ L σ ( 1 μ 2 ) ( S 2 + T 1 ) .
Proof. 
Construct the LKF candidate for MASs (1) as
V ( t ) = m = 1 6 V m ( t ) ,
where
V 1 ( t ) = z T ( t ) P 1 z ( t ) + z T ( t ) ( k d ( t ) ) P 2 z ( t ) ; V 2 ( t ) = t h t η T ( s ) Q ˜ 1 η ( s ) d s + t k t z T ( s ) Q 11 z ( s ) d s ; V 3 ( t ) = h h 0 t + θ t z ˙ T ( s ) W 1 z ˙ ( s ) d s d θ + k k 0 t + θ t z ˙ T ( s ) W 2 z ˙ ( s ) d s d θ ; V 4 ( t ) = h 2 2 h 0 θ 0 t + λ t z ˙ T ( s ) R z ˙ ( s ) d s d λ d θ ; V 5 ( t ) = t τ ( t ) t z ˙ T ( s ) T 1 z ˙ ( s ) d s + τ ( t ) 0 t + θ t z T ( s ) T 2 z ( s ) d s d θ ; V 6 ( t ) = t τ ( t ) t η T ( s ) Q ˜ 2 η ( s ) d s + t d ( t ) t z T ( s ) Q 22 z ( s ) d s ; η ( t ) = z ( t ) z ˙ ( t ) , Q ˜ 1 = Q 1 Y 1 S 1 , Q ˜ 2 = Q 2 Y 2 S 2 .
Then, calculating the derivatives of V ( t ) yields
V ˙ 1 ( t ) = z ˙ T ( t ) P 1 z ( t ) + z T ( t ) P 1 z ˙ ( t ) + ( k d ( t ) ) z ˙ T ( t ) P 2 z ( t ) + ( k d ( t ) ) z T ( t ) P 2 z ˙ ( t ) d ˙ ( t ) z T ( t ) P 2 z ( t ) ,
and it has
G T ( x ( t d ( t ) ) ) P 1 z ( t ) + z T ( t ) P 1 G ( x ( t d ( t ) ) ) G T ( x ( t d ( t ) ) ) P 1 G ( x ( t d ( t ) ) ) + z T ( t ) P 1 z ( t ) q 2 z T ( t d ( t ) ) P 1 z ( t d ( t ) ) + z T ( t ) P 1 z ( t ) .
Similarly, it achieves
G T ( x ( t d ( t ) ) ) P 2 z ( t ) + z T ( t ) P 2 G ( x ( t d ( t ) ) ) q 2 z T ( t d ( t ) ) P 2 z ( t d ( t ) ) + z T ( t ) P 2 z ( t ) .
We have
V ˙ 2 ( t ) = z ( t ) z ˙ ( t ) T Q 1 Y 1 S 1 z ( t ) z ˙ ( t ) z ( t h ) z ˙ ( t h ) T Q 1 Y 1 S 1 z ( t h ) z ˙ ( t h ) + z T ( t ) Q 11 z ( t ) z T ( t k ) Q 11 z ( t k ) .
This yields
z ˙ ( t ) S 1 z ˙ ( t ) = β 2 z T ( t τ ( t ) ) L σ T S 1 L σ z ( t τ ( t ) ) + β α z T ( t τ ( t ) ) L σ T S 1 L σ z ˙ ( t τ ( t ) ) + β α z ˙ T ( t τ ( t ) ) L σ T S 1 L σ z ( t τ ( t ) ) + α 2 z ˙ T ( t τ ( t ) ) L σ T S 1 L σ z ˙ T ( t τ ( t ) ) 2 β z T ( t τ ( t ) ) L σ T S 1 L σ G ( x ( t d ( t ) ) ) 2 α z ˙ T ( t τ ( t ) ) L σ T S 1 L σ G ( x ( t d ( t ) ) ) + G T ( x ( t d ( t ) ) ) S 1 G ( x ( t d ( t ) ) ) ,
and we can easily get
2 β z T ( t τ ( t ) ) L σ T S 1 L σ G ( x ( t d ( t ) ) ) β z T ( t τ ( t ) ) L σ T S 1 L σ z ( t τ ( t ) ) + β q 2 z T ( t d ( t ) ) S 1 z ( t d ( t ) ) , 2 α z ˙ T ( t τ ( t ) ) L σ T S 1 L σ G ( x ( t d ( t ) ) ) α z ˙ T ( t τ ( t ) ) L σ T S 1 L σ z ˙ ( t τ ( t ) ) + α q 2 z T ( t d ( t ) ) S 1 z ( t d ( t ) ) , G T ( x ( t d ( t ) ) ) S 1 G ( x ( t d ( t ) ) ) q 2 z T ( t d ( t ) ) S 1 z ( t d ( t ) ) .
It is not difficult to obtain
V ˙ 3 ( t ) = h 2 z ˙ T ( t ) W 1 z ˙ ( t ) h t h t z ˙ T ( s ) W 1 z ˙ ( s ) d s + k 2 z ˙ T ( t ) W 2 z ˙ ( t ) k t k t z ˙ T ( s ) W 2 z ˙ ( s ) d s h 2 z ˙ T ( t ) W 1 z ˙ ( t ) + z ( t ) z ( t h ) T W 1 W 1 W 1 W 1 z ( t ) z ( t h ) + k 2 z ˙ T ( t ) W 2 z ˙ ( t ) + z ( t ) z ( t k ) T W 2 W 2 W 2 W 2 z ( t ) z ( t k ) .
The following can be acquired:
V ˙ 4 ( t ) = h 4 4 z ˙ T ( t ) R z ˙ ( t ) h 2 2 h 0 t + θ t z ˙ T ( s ) R z ˙ ( s ) d s d θ h 4 4 z ˙ T ( t ) R z ˙ ( t ) + h z ( t ) t h t z ( s ) d s T R R R R h z ( t ) t h t z ( s ) d s .
It is derived that
V ˙ 5 ( t ) = z ˙ T ( t ) T 1 z ˙ ( t ) ( 1 τ ˙ ( t ) ) z ˙ T ( t τ ( t ) ) T 1 z ˙ ( t τ ( t ) ) + τ ( t ) z T ( t ) T 2 z ( t ) t τ ( t ) t z T ( s ) T 2 z ( s ) d s z ˙ T ( t ) T 1 z ˙ ( t ) ( 1 μ 2 ) z ˙ T ( t τ ( t ) ) T 1 z ˙ ( t τ ( t ) ) + h z T ( t ) T 2 z ( t ) 1 h ( t τ ( t ) t z ( s ) d s ) T T 2 ( t τ ( t ) t z ( s ) d s ) .
Furthermore, this leads to the following result:
V ˙ 6 ( t ) = η T ( t ) Q ˜ 2 η ( t ) ( 1 τ ˙ ( t ) ) η T ( t τ ( t ) ) Q ˜ 2 η ( t τ ( t ) ) + z T ( t ) Q 22 z ( t ) ( 1 d ˙ ( t ) ) z T ( t d ( t ) ) Q 22 z ( t d ( t ) ) z ( t ) z ˙ ( t ) T Q 2 Y 2 S 2 z ( t ) z ˙ ( t ) ( 1 μ 2 ) z ( t τ ( t ) ) z ˙ ( t τ ( t ) ) T Q 2 Y 2 S 2 z ( t τ ( t ) ) z ˙ ( t τ ( t ) ) + z T ( t ) Q 22 z ( t ) ( 1 μ 1 ) z T ( t d ( t ) ) Q 22 z ( t d ( t ) ) .
Hence, when d ( t ) = 0 , combining this with (9)–(14), we get
V ˙ ( t ) ς 1 T ( t ) Λ ˜ 1 ς 1 ( t ) + ς 2 T ( t ) Λ 2 ς 2 ( t ) + ς 3 T ( t ) Λ 3 ς 3 ( t ) + ς 4 T ( t ) Λ 4 ς 4 ( t ) + ς 5 T ( t ) Λ 5 ς 5 ( t ) + ς 6 T ( t ) Λ 6 ς 6 ( t ) .
where
ς 1 ( t ) = col ( z ( t ) , z ( t d ( t ) ) , z ( t τ ( t ) ) , z ˙ ( t τ ( t ) ) ) , ς 2 ( t ) = col ( z ( t ) , z ( t d ( t ) ) , z ( t k ) , z ( t τ ( t ) ) , z ( t h ) , z ˙ ( t h ) , z ˙ ( t τ ( t ) ) ) , ς 3 ( t ) = col ( z ( t ) , z ( t d ( t ) ) , z ( t k ) , z ( t τ ( t ) ) , z ( t h ) , z ˙ ( t τ ( t ) ) ) , ς 4 ( t ) = col ( z ( t ) , z ( t d ( t ) ) , z ( t τ ( t ) ) , z ˙ ( t τ ( t ) ) , t h t z ( s ) d s ) , ς 5 ( t ) = col ( z ( t ) , z ( t d ( t ) ) , z ( t τ ( t ) ) , z ˙ ( t τ ( t ) ) , t τ ( t ) t z ( s ) d s ) , ς 6 ( t ) = col ( z ( t ) , z ( t d ( t ) ) , z ( t τ ( t ) ) , z ˙ ( t τ ( t ) ) ) , ξ ( t ) = col ( z ( t ) , z ( t d ( t ) ) , z ( t k ) , z ( t τ ( t ) ) , z ( t h ) , z ˙ ( t h ) , z ˙ ( t τ ( t ) ) , t h t z ( s ) d s , t τ ( t ) t z ( s ) d s ) .
Similarly, when d ( t ) = k , this yields
V ˙ ( t ) ς 1 T ( t ) Λ 1 ς 1 ( t ) + ς 2 T ( t ) Λ 2 ς 2 ( t ) + ς 3 T ( t ) Λ 3 ς 3 ( t ) + ς 4 T ( t ) Λ 4 ς 4 ( t ) + ς 5 T ( t ) Λ 5 ς 5 ( t ) + ς 6 T ( t ) Λ 6 ς 6 ( t ) .
where
Λ ˜ 1 = P 1 + ( k μ ^ 1 ) P 2 0 β ( P 1 + k P 2 ) L σ α ( P 1 + k P 2 ) L σ q 2 ( P 1 + k P 2 ) 0 0 0 0 0 , Λ 1 = P 1 μ ^ 1 P 2 0 β P 1 L σ α P 1 L σ q 2 P 1 0 0 0 0 0 ,
Λ 2 = φ 11 0 0 φ 14 0 0 φ 17 φ 22 0 0 0 0 0 Q 11 0 0 0 0 φ 44 0 0 φ 47 Q 1 Y 1 0 S 1 0 φ 77 , Λ 3 = φ ¯ 11 0 W 2 0 W 1 0 φ ¯ 22 0 0 0 0 W 2 0 0 0 φ ¯ 44 0 φ ¯ 46 W 1 0 φ ¯ 66 , Λ 4 = h 2 R 0 0 0 h R φ ˜ 22 0 0 0 φ ˜ 33 φ ˜ 34 0 φ ˜ 44 0 R , Λ 5 = h T 2 0 0 0 0 ϕ 22 0 0 0 ϕ 33 ϕ 34 0 ϕ 44 0 T 2 h , Λ 6 = Q 2 + Y 2 + Q 22 0 β Y 2 L σ α Y 2 L σ ϕ ˜ 22 0 0 ϕ ˜ 33 ϕ ˜ 34 ϕ ˜ 44 ,
with
φ 11 = Q 1 + Y 1 + Q 11 , φ 22 = q 2 ( ( 1 + α + β ) S 1 + Y 1 ) , φ 14 = β Y 1 L σ , φ 44 = ( β + β 2 ) L σ T S 1 L σ , φ 17 = α Y 1 L σ , φ 47 = β α L σ T S 1 L σ , φ 77 = ( α + α 2 ) L σ T S 1 L σ , φ ¯ 44 = ( β + β 2 ) L σ T ( h 2 W 1 + k 2 W 2 ) L σ , φ ¯ 22 = q 2 ( 1 + α + β ) ( h 2 W 1 + k 2 W 2 ) , φ ¯ 11 = W 1 W 2 , φ ¯ 46 = β α L σ T ( h 2 W 1 + k 2 W 2 ) L σ , φ ¯ 66 = ( α + α 2 ) L σ T ( h 2 W 1 + k 2 W 2 ) L σ , φ ˜ 22 = h 4 4 q 2 ( 1 + α + β ) R , φ ˜ 33 = h 4 4 ( β + β 2 ) L σ T R L σ , φ ˜ 34 = h 4 4 β α L σ T R L σ , φ ˜ 44 = h 4 4 ( α + α 2 ) L σ T R L σ , ϕ 22 = q 2 ( 1 + α + β ) T 1 , ϕ 33 = ( β + β 2 ) L σ T T 1 L σ , ϕ 34 = β α L σ T T 1 L σ , ϕ 44 = ( α + α 2 ) L σ T T 1 L σ ( 1 μ 2 ) T 1 ,
ϕ ˜ 22 = q 2 ( ( 1 + α + β ) S 2 + Y 2 ) ( 1 μ 1 ) Q 22 , ϕ ˜ 34 = β α L σ T S 2 L σ ( 1 μ 2 ) Y 2 , ϕ ˜ 33 = ( β + β 2 ) L σ T S 2 L σ ( 1 μ 2 ) Q 2 , ϕ ˜ 44 = ( α + α 2 ) L σ T S 2 L σ ( 1 μ 2 ) S 2 .
Then, from (15) and (16), this results in the conclusion that
V ˙ ( t ) ξ T ( t ) Ψ ˜ σ ξ ( t ) , d ( t ) = 0 , ξ T ( t ) Ψ ^ σ ξ ( t ) , d ( t ) = k ,
and Ψ ˜ σ and Ψ ^ σ are defined in (7a) and (7b). Clearly, V ˙ ( t ) < 0 is guaranteed by Inequalities (7a) and (7d). Hence, the distributed average consensus for nonlinear MASs (1) with mixed TVDs via a PD protocol (2) is achieved. The proof is thus completed. □
Remark 2.
On one hand, the state TVDs are taken into account in the nonlinear dynamics (1), and on the other hand, the communication TVDs are considered in (2). Consequently, the complexities of these mixed delays increase the challenge of proving system stability and constructing LKFs in subsequent work. By making comparisons with [34,35,36,37,38,39,40,41,42] in the presence of communication TVDs, the LKF with triple integral term h 2 2 h 0 θ 0 t + λ t z ˙ T ( s ) R z ˙ ( s ) d s d λ d θ is constructed in this paper to deal with the average consensus problems; thus, the conservatism could be reduced.
Remark 3.
By utilizing a delay-product-type functional approach, we have devised novel LKFs that incorporate both double- and triple-integral components. Subsequently, relying on the LMI technique, less conservative results are obtained by establishing relationships within the vector ξ ( t ) throughout the function derivation process.
Remark 4.
Note that consensus conditions with state delays are shown in the works of [25,26,27,33], while those in the presence of communication TVDs are derived in [28,29,31,32]. It is worth pointing out that only one type of delay is considered in the above, so solving average consensus problems with mixed delays would hold great significance. Moreover, the nonlinearities involving delays increase the complexity of the system, as evidenced through a comparison with [5,22,23,28,32]. Though the state TVDs and communication TVDs are not the same, the state TVDs and communication TVDs are homogeneous. Solving the consensus problems with heterogeneous delays is interesting yet difficult.

4. Numerical Simulation

Consider ten agents (indexed as 0–9) connected to the balanced digraphs in Figure 1, and the graph switches from G 1 to G 4 . Let the initial states be x 0 ( 0 ) = 8.0 , x 1 ( 0 ) = 7.0 , x 2 ( 0 ) = 6.0 , x 3 ( 0 ) = 9.0 , x 4 ( 0 ) = 1.0 , x 5 ( 0 ) = 1.0 , x 6 ( 0 ) = 9.0 , x 7 ( 0 ) = 7.0 , x 8 ( 0 ) = 6.0 , and x 9 ( 0 ) = 8.0 , satisfying i = 1 N x i ( 0 ) = 0 .
The parameters in Theorem 1 are selected as q = 0.5 , α = 0.08 , and β = 1 . Furthermore, the nonlinear function is shown as g ( x i ( t d ( t ) ) ) = 0.5 sin ( x i ( t d ( t ) ) ) , and the state delay is allowed to be d ( t ) = 0.04 sin 2 ( t ) + 0.01 . In addition, we have d ˙ ( t ) = 0.04 sin ( 2 t ) , and it can easily be obtained that k = 0.05 , μ ^ 1 = 0.04 and μ 1 = 0.04 . Moreover, the communication delay is selected as τ ( t ) = 0.03 sin ( t ) + 0.01 , and we have h = 0.04 and μ 2 = 0.03 . Then, by solving the LMIs (7a)–(7d) in MATLAB, we can get
P 1 = 0.414 0.111 0.069 0.012 0.012 0.007 0.035 0.075 0.034 0.161 0.111 0.279 0.170 0.036 0.024 0.019 0.055 0.182 0.006 0.049 0.069 0.170 0.469 0.171 0.034 0.022 0.008 0.009 0.016 0.012 0.012 0.036 0.171 0.421 0.123 0.081 0.067 0.016 0.007 0.010 0.012 0.024 0.034 0.123 0.306 0.209 0.190 0.003 0.022 0.007 0.007 0.019 0.022 0.081 0.209 0.423 0.113 0.028 0.014 0.014 0.035 0.055 0.008 0.067 0.190 0.113 0.271 0.114 0.060 0.017 0.075 0.182 0.009 0.016 0.003 0.028 0.114 0.284 0.184 0.054 0.034 0.006 0.016 0.007 0.022 0.014 0.060 0.184 0.464 0.169 0.161 0.049 0.012 0.010 0.007 0.014 0.017 0.054 0.169 0.437 ,
P 2 = 3.019 0.287 0.158 0.015 0.048 0.014 0.081 0.181 0.003 0.443 0.287 2.083 0.680 0.030 0.137 0.006 0.084 1.071 0.248 0.171 0.158 0.680 3.005 0.473 0.021 0.056 0.008 0.266 0.110 0.003 0.015 0.030 0.473 3.018 0.362 0.118 0.117 0.128 0.027 0.068 0.048 0.137 0.021 0.362 2.225 0.677 0.875 0.244 0.133 0.007 0.014 0.006 0.056 0.118 0.677 2.951 0.187 0.160 0.005 0.066 0.081 0.084 0.008 0.117 0.875 0.187 2.247 0.526 0.090 0.026 0.181 1.071 0.266 0.128 0.244 0.160 0.526 1.973 0.742 0.031 0.003 0.248 0.110 0.027 0.133 0.005 0.090 0.742 2.973 0.467 0.443 0.171 0.003 0.069 0.007 0.066 0.026 0.031 0.467 3.027 ,
Q 1 = 0.922 0.112 0.119 0.092 0.094 0.085 0.077 0.130 0.100 0.147 0.112 0.729 0.204 0.072 0.141 0.070 0.086 0.295 0.022 0.146 0.119 0.204 0.876 0.161 0.091 0.110 0.096 0.019 0.131 0.072 0.092 0.072 0.161 0.928 0.146 0.101 0.108 0.119 0.060 0.093 0.094 0.141 0.091 0.146 0.804 0.200 0.198 0.011 0.126 0.067 0.085 0.070 0.110 0.101 0.200 0.901 0.092 0.155 0.078 0.087 0.077 0.086 0.096 0.108 0.197 0.092 0.861 0.171 0.080 0.108 0.130 0.295 0.019 0.119 0.011 0.155 0.171 0.671 0.235 0.072 0.100 0.022 0.131 0.060 0.126 0.078 0.080 0.235 0.875 0.170 0.147 0.146 0.072 0.093 0.067 0.087 0.108 0.072 0.170 0.915 ,
W 1 = 3.149 0.053 0.022 0.030 0.019 0.024 0.020 0.073 0.061 0.042 0.053 2 . 446 0 . 349 0.152 0.201 0.121 0.105 0.791 0.383 0.145 0.022 0 . 349 3 . 016 0 . 086 0 . 098 0 . 034 0 . 015 0 . 372 0.154 0 . 088 0.030 0.152 0 . 086 3 . 129 0 . 058 0.036 0.022 0.140 0.084 0 . 027 0.019 0.201 0 . 098 0 . 058 2 . 716 0 . 223 0.332 0.402 0.140 0.071 0.024 0.121 0 . 034 0.036 0 . 223 3 . 074 0.136 0.169 0.088 0.023 0.020 0.105 0 . 015 0.022 0.332 0.136 2.874 0.256 0.092 0.015 0.073 0.791 0 . 372 0.140 0.402 0.169 0.256 2.213 0.453 0.204 0.061 0.383 0.154 0.084 0.140 0.088 0.092 0.453 2.968 0.110 0.042 0.145 0 . 088 0 . 027 0.071 0.023 0.015 0.204 0.110 3.117 ,
T 1 = 2.305 0.865 0.569 0.200 0.137 0.153 0.118 0.490 0.002 1.285 0.865 1.742 1.397 0.175 0.143 0.166 0.337 0.921 0.170 0.180 0.569 1.397 3.468 1.435 0.096 0.034 0.274 0.428 1.006 0.151 0.200 0.175 1.435 2.336 0.948 0.852 0.525 0.282 0.421 0.228 0.137 0.143 0.096 0.948 1.918 1.810 1.054 0.132 0.079 0.197 0.153 0.166 0.034 0.852 1.810 2.407 0.752 0.094 0.156 0.146 0.118 0.337 0.274 0.525 1.054 0.752 1.436 0.725 0.519 0.053 0.490 0.921 0.428 0.282 0.132 0.094 0.725 1.898 1.631 0.410 0.002 0.170 1.006 0.421 0.079 0.156 0.519 1.631 3.420 1.402 1.285 0.180 0.151 0.228 0.197 0.146 0.053 0.410 1.402 2.637 ,
Q 11 = 12.746 2.556 0.707 0.602 0.169 0.113 0.951 0.586 0.634 1.654 2.556 14.129 0.375 0.825 0.910 1.420 1.566 1.542 1.837 0.280 0.707 0.375 12.459 1.587 0.067 0.036 1.154 1.407 0.042 0.780 0.602 0.825 1.587 12.533 2.336 2.336 0.893 0.893 0.480 0.059 0.169 0.910 0.067 2.336 13.892 0.632 3.327 0.990 0.177 0.508 0.113 1.420 0.036 2.336 0.632 13.227 4.205 0.214 0.689 0.252 0.951 1.566 1.154 0.893 3.327 4.205 16.931 2.366 2.366 0.002 0.586 1.542 1.407 0.893 0.990 0.214 2.366 13.638 0.064 1.809 0.634 1.837 0.042 0.480 0.177 0.689 0.876 0.064 12.353 1.171 1.654 0.280 0.780 0.059 0.508 0.252 0.002 1.809 1.171 12.463 ,
Q 22 = 7.203 0.706 0.548 0.198 0.210 0.196 0.341 0.567 0.388 0.928 0.706 6 . 923 0.939 0.406 0.250 0.229 0.448 0.722 0.250 0.410 0.548 0.939 7 . 760 1.019 0.392 0.362 0.211 0.093 0.222 0.181 0.198 0.406 1.019 7 . 256 0.789 0.746 0.562 0.146 0.026 0.134 0.210 0.250 0.392 0.789 7 . 060 1.166 0.812 0.226 0.215 0.163 0.196 0.229 0.362 0.746 1.166 7 . 302 0.696 0.235 0.174 0.178 0.341 0.448 0.211 0.562 0.812 0.696 6 . 805 0.611 0.611 0.277 0.567 0.722 0.093 0.146 0.226 0.235 0.611 7 . 018 1.098 0.569 0.388 0.250 0.222 0.026 0.215 0.174 0.611 1.098 7 . 788 1.046 0.928 0.410 0.181 0.134 0.163 0.178 0.277 0.569 1.046 7 . 399 .
Clearly, Figure 2 shows that the average consensus is achieved with g ( x i ( t d ( t ) ) ) = 0.5 sin ( x i ( t d ( t ) ) ) . When d ( t ) = 0 , and we have g ( x i ( t ) ) = 0.5 sin ( x i ( t ) ) ; then, the average consensus is solved with only communication delay τ ( t ) in Figure 3. Furthermore, the trajectories of control inputs in Theorem 1 and in [28] are respectively presented in Figure 4 and Figure 5. Moreover, when g ( x i ( t d ( t ) ) ) = 0 , as can be seen in Figure 6, the states of all agents eventually converge to zero, satisfying the initial condition i = 1 N x i ( 0 ) = 0 in [28]. Based on the analysis and discussion above, we find that the convergence rates of state curves and control inputs in Theorem 1 are slower than those in [28] owing to the mixed TVDs. Thus, it appears that the average consensus problem for nonlinear MASs (1) with mixed TVDs via the PD protocol (2) has been solved under switching directed graphs.

5. Conclusions

Described by fast switching balanced digraphs, the distributed average consensus problems of nonlinear MASs with delays have been discussed. In light of mixed TVDs and their inherent nonlinearities, a distributed PD control algorithm is employed to address these concerns. Given the realities mentioned above, namely that the delays in this paper are varying and nonuniform, by designing novel LKFs containing both double- and triple-integral terms, the resulting conditions for the achievement of average consensus have been developed based on the LMI method. Numerical simulations validating the control scheme have been proposed. Based on these results, future works could include investigations into event-triggered optimal consensus problems of complex MASs with mixed TVDs and cyber-attacks on communication channels [47,48,49,50].

Funding

This work was supported by the Shandong Provincial Natural Science Foundation under Grant ZR2024QF255 and the Fundamental Research Projects of Science & Technology Innovation and Development Plan in Yantai City under Grant 2024YT06000226.

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

Abbreviations

MASsMulti-agent systems
CTDsConstant time delays
PDProportional and derivative
TVDsTime-varying delays
LMIsLinear matrix inequalities
LKFsLyapunov–Krasovskii functionals

References

  1. Liu, Y.; Wang, Y.; Li, Y.; Gooi, H.; Xin, H. Multi-agent based optimal scheduling and trading for multi-microgrids integrated with urban transportation networks. IEEE Trans. Power Syst. 2021, 36, 2197–2210. [Google Scholar] [CrossRef]
  2. Mahela, O.; Khosravy, M.; Gupta, N.; Khan, B.; Alhelou, H.; Mahla, R.; Patel, N.; Siano, P. Comprehensive overview of multi-agent systems for controlling smart grids. CSEE J. Power Energy Syst. 2020, 8, 115–131. [Google Scholar] [CrossRef]
  3. Zhou, L.; Deng, X.; Wang, Z.; Zhang, X.; Dong, Y.; Hu, X.; Ning, Z.; Wei, J. Semantic information extraction and multi-agent communication optimization based on generative pre-trained transformer. IEEE Trans. Cogn. Commun. Netw. 2025, 11, 725–737. [Google Scholar] [CrossRef]
  4. Hou, Y.; Zhao, J.; Zhang, R.; Cheng, X.; Yang, L. UAV swarm cooperative target search: A multi-agent reinforcement learning approach. IEEE Trans. Intell. Veh. 2024, 9, 568–578. [Google Scholar] [CrossRef]
  5. Shi, P.; Yu, J. Dissipativity-based consensus for fuzzy multiagent systems under switching directed topologies. IEEE Trans. Fuzzy Syst. 2021, 29, 1143–1151. [Google Scholar] [CrossRef]
  6. 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]
  7. 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]
  8. Du, Z.; Xie, X.; Qu, Z.; Hu, Y.; Stojanovic, V. Dynamic event-triggered consensus control for interval type-2 fuzzy multi-agent systems. IEEE Trans. Circuits Syst. I Regul. Pap. 2024, 71, 3857–3866. [Google Scholar] [CrossRef]
  9. Liao, Z.; Wang, S.; Shi, J.; Haesaert, S.; Zhang, Y.; Sun, Z. Resilient containment under time-varying networks with relaxed graph robustness. IEEE Trans. Netw. Sci. Eng. 2024, 11, 4093–4105. [Google Scholar] [CrossRef]
  10. Yuan, T.; Li, L. Observer-based consensus control for a class of nonlinear singular multi-agent systems. J. Frankl. Inst. 2024, 361, 107061. [Google Scholar] [CrossRef]
  11. Sun, Y.; Wang, L.; Xie, G. Average consensus in networks of dynamic agents with switching topologies and multiple time-varying delays. Syst. Control Lett. 2008, 57, 175–183. [Google Scholar] [CrossRef]
  12. Wen, G.; Yu, W.; Xia, Y.; Yu, X.; Hu, J. Distributed tracking of nonlinear multiagent systems under directed switching topology: An observer-based protocol. IEEE Trans. Syst. Man Cybern. Syst. 2017, 47, 869–881. [Google Scholar] [CrossRef]
  13. Chen, L.; Mei, J.; Li, C.; Ma, G. Distributed leader-follower affine formation maneuver control for high-order multiagent systems. IEEE Trans. Autom. Control 2020, 65, 4941–4948. [Google Scholar] [CrossRef]
  14. Cui, Y.; Xu, J.; Xing, W.; Huang, F.; Yan, Z.; Du, X. Anti-disturbance cooperative formation containment control for multiple autonomous underwater vehicles with collision-free and actuator saturation constraints. J. Frankl. Inst. 2024, 361, 107063. [Google Scholar] [CrossRef]
  15. Dey, S.; Xu, H. Distributed adaptive flocking control for large-scale multiagent systems. IEEE Trans. Neural Networks Learn. Syst. 2025, 36, 3126–3135. [Google Scholar] [CrossRef] [PubMed]
  16. Xiao, L.; Boyd, S.; Kim, S. Distributed average consensus with least-mean-square deviation. IEEE Trans. Fuzzy Syst. 2007, 67, 33–46. [Google Scholar] [CrossRef]
  17. Liu, J.; Yu, Y.; Xu, Y.; Zhang, Y.; Sun, C. Fixed-time average consensus of nonlinear delayed MASs under switching topologies: An event-based triggering approach. IEEE Trans. Syst. Man Cybern. Syst. 2022, 52, 2721–2733. [Google Scholar] [CrossRef]
  18. Guo, W.; Shi, L.; Sun, W.; Jahanshahi, H. Predefined-time average consensus control for heterogeneous nonlinear multi-agent systems. IEEE Trans. Circuits Syst. II Express Briefs 2023, 70, 2989–2993. [Google Scholar] [CrossRef]
  19. Liu, L.; Cao, J.; Alsaadi, F. Aperiodically intermittent event-triggered optimal average consensus for nonlinear multi-agent systems. IEEE Trans. Neural Networks Learn. Syst. 2024, 35, 10338–10352. [Google Scholar] [CrossRef]
  20. Hui, M.; Liu, X.; Cao, J. Improved fixed-time event-triggered average consensus of multi-agent systems under DoS attacks. IEEE Trans. Circuits Syst. II Express Briefs 2024, 71, 3815–3819. [Google Scholar] [CrossRef]
  21. Martinez, G.; Orchard, M.; Bozhko, S. Dynamic average consensus with anti-windup applied to interlinking converters in AC/DC microgrids under economic dispatch and delays. IEEE Trans. Smart Grid 2023, 14, 4137–4140. [Google Scholar] [CrossRef]
  22. Sun, F.; Guan, Z.; Ding, L.; Wang, Y. Mean square average-consensus for multi-agent systems with measurement noise and time delay. Int. J. Syst. Sci. 2013, 44, 995–1005. [Google Scholar] [CrossRef]
  23. Liu, C.; Shan, L.; Chen, Y.; Zhang, Y. Average-consensus filter of first-order multi-agent systems with disturbances. IEEE Trans. Circuits Syst. II Express Briefs 2018, 65, 1763–1767. [Google Scholar] [CrossRef]
  24. Aragues, R.; González, A.; López-Nicolás, G.; Sagues, C. Convergence speed of dynamic consensus with delay compensation. Neurocomputing 2024, 570, 127130. [Google Scholar] [CrossRef]
  25. Chen, C.; Wen, G.; Liu, Y.; Wang, F. Adaptive consensus control for a class of nonlinear multiagent time-delay systems using neural networks. IEEE Trans. Neural Networks Learn. Syst. 2014, 25, 1217–1226. [Google Scholar] [CrossRef]
  26. Ma, H.; Wang, Z.; Wang, D.; Liu, D.; Yan, P.; Wei, Q. Neural-network-based distributed adaptive robust control for a class of nonlinear multiagent systems with time delays and external noises. IEEE Trans. Syst. Man Cybern. Syst. 2016, 46, 750–758. [Google Scholar] [CrossRef]
  27. Wen, G.; Chen, C.; Liu, Y.; Liu, Z. Neural network-based adaptive leader-following consensus control for a class of nonlinear multiagent state-delay systems. IEEE Trans. Cybern. 2017, 47, 2151–2160. [Google Scholar] [CrossRef] [PubMed]
  28. Wang, D.; Zhang, N.; Wang, J.; Wang, W. A PD-like protocol with a time delay to average consensus control for multi-agent systems under an arbitrarily fast switching topology. IEEE Trans. Cybern. 2017, 47, 898–907. [Google Scholar] [CrossRef]
  29. Qian, W.; Gao, Y.; Wang, L.; Fei, S. Consensus of multiagent systems with nonlinear dynamics and time-varying communication delays. Int. J. Robust Nonlinear Control 2019, 29, 1926–1940. [Google Scholar] [CrossRef]
  30. Ma, D.; Chen, J.; Lu, R.; Chen, J.; Chai, T. Delay consensus margin of first-order multiagent systems with undirected graphs and PD protocols. IEEE Trans. Autom. Control 2021, 66, 4192–4198. [Google Scholar] [CrossRef]
  31. Ma, D. Delay range for consensus achievable by proportional and PD feedback protocols with time-varying delays. IEEE Trans. Autom. Control 2022, 67, 3212–3219. [Google Scholar] [CrossRef]
  32. Caiazzo, B.; Lui, D.; Petrillo, A.; Santini, S. Signed average consensus in cooperative-antagonistic multi-agent systems with multiple communication time-varying delays. IFAC 2024, 58, 114–119. [Google Scholar] [CrossRef]
  33. Tang, Z.; Wang, K.; Feng, J.; Park, J. Edge-based self-triggering impulsive consensus on nonlinear multi-agent systems with proportional delay. IEEE Trans. Autom. Sci. Eng. 2024, 21, 7494–7504. [Google Scholar] [CrossRef]
  34. Peng, X.; He, Y. Consensus of multiagent systems with time-varying delays and switching topologies based on delay-product-type functionals. IEEE Trans. Cybern. 2024, 54, 101–110. [Google Scholar] [CrossRef] [PubMed]
  35. 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 2025, 1–11. [Google Scholar] [CrossRef]
  36. Peng, X.; He, Y.; Liu, Z.; You, L.; Li, H. Time-varying formation H tracking control and optimization for delayed multi-agent systems with exogenous disturbances. IEEE Trans. Autom. Sci. Eng. 2025, 22, 5637–5647. [Google Scholar] [CrossRef]
  37. Liu, Y.; Zhang, C.; Shangguan, X.; Chen, J.; He, Y. H-based tracking control for nonlinear systems with a sampled-data PI-type controller: A nonuniform sampled-time-dependent functional. IEEE Trans. Cybern. 2025, 55, 4286–4299. [Google Scholar] [CrossRef]
  38. Yang, Y.; He, Y. Time-varying formation-containment control for heterogeneous multi-agent systems with communication and output delays via observer-based feedback protocol. IEEE Trans. Autom. Sci. Eng. 2025, 22, 15435–15448. [Google Scholar] [CrossRef]
  39. Zhai, Z.; Yan, H.; Chen, S.; Chang, Y.; Shi, K. Nonlinear multi-agent systems consensus via delayed non-fragile sampled-data control. IEEE Trans. Control Netw. Syst. 2025, 12, 275–286. [Google Scholar] [CrossRef]
  40. Zhang, W.; Chen, J.; Wen, S.; Huang, T. Event-triggered random delayed impulsive consensus of multi-agent systems with time-varying delay. IEEE Trans. Emerg. Top. Comput. Intell. 2025, 9, 2059–2064. [Google Scholar] [CrossRef]
  41. Tang, Z.; Zhen, Z.; Zhao, Z.; Deconinck, G. Observer-based resilient PD-like scaled group consensus for uncertain multiagent systems under time-varying delays. Commun. Nonlinear Sci. Numer. Simul. 2025, 148, 108846. [Google Scholar] [CrossRef]
  42. Aghayan, Z.; Alfi, A.; Mousavi, Y.; Fekih, A. Robust delay-dependent output-feedback PD controller design for variable fractional-order uncertain neutral systems with time-varying delays. IEEE Trans. Syst. Man Cybern. Syst. 2025, 55, 1986–1996. [Google Scholar] [CrossRef]
  43. Mesbahi, M.; Egerstedt, M. Graph Theoretic Methods in Multiagent Networks; Princeton University Press: Princeton, NY, USA, 2010. [Google Scholar]
  44. Bliman, P.; Ferrari-Trecate, G. Average consensus problems in networks of agents with delayed communications. Automatica 2008, 44, 1985–1995. [Google Scholar] [CrossRef]
  45. Lin, P.; Jia, Y.; Li, L. Distributed robust H consensus control in directed networks of agents with time-delay. Syst. Control Lett. 2008, 57, 643–653. [Google Scholar] [CrossRef]
  46. Sun, J.; Liu, G.; Chen, J. Delay-dependent stability and stabilization of neutral time-delay systems. Int. J. Robust Nonlinear Control 2009, 19, 1364–1375. [Google Scholar] [CrossRef]
  47. Wang, D.; Zhou, J.; Wen, G.; Lü, J.; Chen, G. Event-triggered optimal consensus of second-order MASs with disturbances and cyber attacks on communications edges. IEEE Trans. Netw. Sci. Eng. 2023, 10, 3846–3857. [Google Scholar] [CrossRef]
  48. Hu, T.; Song, Q.; Zhang, X.; Shi, K. Hybrid event-triggered and impulsive security consensus control strategy for fractional-order multiagent systems with cyber attacks. IEEE Trans. Syst. Man Cybern. Syst. 2025, 55, 830–842. [Google Scholar] [CrossRef]
  49. Zhang, T.; Ye, D.; Shi, Y. Decentralized false-data injection attacks against state omniscience: Existence and security analysis. IEEE Trans. Autom. Control 2023, 68, 4634–4649. [Google Scholar] [CrossRef]
  50. Zhang, T.; Ye, D.; Yang, G. Ripple effect of cooperative attacks in multi-agent systems: Results on minimum attack targets. Automatica 2024, 159, 111307. [Google Scholar] [CrossRef]
Figure 1. The directed communication graphs.
Figure 1. The directed communication graphs.
Mca 30 00099 g001
Figure 2. Trajectories of the agent state x i ( t ) , i 1 , 2 , , 10 in Theorem 1.
Figure 2. Trajectories of the agent state x i ( t ) , i 1 , 2 , , 10 in Theorem 1.
Mca 30 00099 g002
Figure 3. Trajectories of the agent state x i ( t ) , i 1 , 2 , , 10 when d ( t ) = 0 .
Figure 3. Trajectories of the agent state x i ( t ) , i 1 , 2 , , 10 when d ( t ) = 0 .
Mca 30 00099 g003
Figure 4. Control inputs of the agents in Theorem 1.
Figure 4. Control inputs of the agents in Theorem 1.
Mca 30 00099 g004
Figure 5. Control inputs of the agents in [28].
Figure 5. Control inputs of the agents in [28].
Mca 30 00099 g005
Figure 6. Trajectories of the agent state x i ( t ) , i 1 , 2 , , 10 when g ( x i ( t d ( t ) ) ) = 0 in [28].
Figure 6. Trajectories of the agent state x i ( t ) , i 1 , 2 , , 10 when g ( x i ( t d ( t ) ) ) = 0 in [28].
Mca 30 00099 g006
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. Distributed PD Average Consensus of Lipschitz Nonlinear MASs in the Presence of Mixed Delays. Math. Comput. Appl. 2025, 30, 99. https://doi.org/10.3390/mca30050099

AMA Style

Zhou T. Distributed PD Average Consensus of Lipschitz Nonlinear MASs in the Presence of Mixed Delays. Mathematical and Computational Applications. 2025; 30(5):99. https://doi.org/10.3390/mca30050099

Chicago/Turabian Style

Zhou, Tuo. 2025. "Distributed PD Average Consensus of Lipschitz Nonlinear MASs in the Presence of Mixed Delays" Mathematical and Computational Applications 30, no. 5: 99. https://doi.org/10.3390/mca30050099

APA Style

Zhou, T. (2025). Distributed PD Average Consensus of Lipschitz Nonlinear MASs in the Presence of Mixed Delays. Mathematical and Computational Applications, 30(5), 99. https://doi.org/10.3390/mca30050099

Article Metrics

Back to TopTop