Next Article in Journal
A Fast Computational Scheme for Solving the Temporal-Fractional Black–Scholes Partial Differential Equation
Next Article in Special Issue
Influences of the Order of Derivative on the Dynamical Behavior of Fractional-Order Antisymmetric Lotka–Volterra Systems
Previous Article in Journal
The Convolution Theorem Involving Windowed Free Metaplectic Transform
Previous Article in Special Issue
Approximate Solutions for Time-Fractional Fornberg–Whitham Equation with Variable Coefficients
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fractional-Order Nonlinear Multi-Agent Systems: A Resilience-Based Approach to Consensus Analysis with Distributed and Input Delays

1
School of Computer Science and Cyber Engineering, Guangzhou University, Guangzhou 510006, China
2
Department of Mathematics and Statistics, The University of Lahore, Sargodha 40100, Pakistan
3
Department of Computer Science and IT, Superior University, Lahore 54000, Pakistan
4
Department of Mathematics, Superior University, Lahore 54000, Pakistan
*
Authors to whom correspondence should be addressed.
Fractal Fract. 2023, 7(4), 322; https://doi.org/10.3390/fractalfract7040322
Submission received: 5 March 2023 / Revised: 28 March 2023 / Accepted: 10 April 2023 / Published: 11 April 2023
(This article belongs to the Special Issue Advances in Fractional Differential Operators and Their Applications)

Abstract

:
In this article, a resilient consensus analysis of fractional-order nonlinear leader and follower systems with input and distributed delays is assumed. To make controller design more practical, it is considered that the controller is not implemented as it is, and a disturbance term is incorporated into the controller part. A multi-agent system’s topology ahead to a weighted graph which may be directed or undirected is used. The article examines a scenario of leader–follower consensus through the application of algebraic graph theory and the fractional-order Razumikhin method. Numerical simulations are also provided to show the effectiveness of the proposed design for the leader–follower consensus.

1. Introduction

There are different fields where cooperative control has achieved rising importance for its vast application, for example satellite formation flying [1], -multi-vehicle cooperative control [2], etc. Multi-agent system consensus has attained great attention. Great investigation is made on leader–follower consensus [3,4,5,6,7] and nonleader–follower consensus [8,9,10,11,12,13,14,15]. Some researchers give importance to dynamical standards of integer order [16,17,18]. Therefore, fractional derivatives are convenient for describing many complicated phenomena and processes in comparing with classical derivatives of integer order [19]. By using graph theory and the Lyapunov function method, Yu et al. suppose a group of fractional-order leader–follower consensus [20]. Bai et al. investigated a multi-agent system’s consensus by designing a useful controller [21]. By using the proposed lemma and by constructing a suitable Lyapunov function, Xu et al. analyse the replica of complicated systems of fractional-order [22,23].
In a real dynamical system, a delay in time is a common phenomenon which influences the behavioural system of dynamical standards, and due to it, the system can become ambiguous.
An investigation of the fractional-order-delayed system’s consensus can be conducted by an analysis method of frequency-domain, such as in [24,25], considering the system’s delay in input. Directed multi-agent systems with delays in nonuniform input and communication were studied by Shen et al. [26]. With a delay in heterogeneous input, an undirected multi-agent system is considered in [27]. In time domain analysis, the most suitable access was given by the theory of Lyapunov stability for finding adherence and a complicated dynamical system’s consensus.
For dealing with the adherence of differential equations of fractional-order, the most suitable approach was presented by Liu et al. in inequality on Riemann–Liouville derivatives of quadratic function [28]. In many systems of fractional-order, certain stability criteria are obtained by using a proposed lemma [29,30]. By using Caputo sense, a little progress is made in systems of fractional-order through stability analysis. Since the fractional-order operational composition property does not hold, some problems may occur while studying a Caputo fractional-order delayed system’s consensus. The main reason for using the Lyapunov direct method is convenience. Xu et al. investigated a fractional-order nonautonomous system’s global asymptotical stability by selecting the convenient Lyapunov function [31]. It is still a challenging problem involving which Lyapunov function to select and how to show certain conditions for a fractional-order nonlinear delayed system consensus. Wang et al. compared a fractional-order delayed system’s exponential consensus with heterogeneous impulsive controllers, where an undirected graph was drawn with the topology of coupling [32]. Zhu et al. studied systems of fractional-order with delay in input by finding states of error where the topology of coupling headed a directed graph [33]. Generally, the topology of coupling leads to a weighted graph (directed).
The objective of this paper is to analyze the resilient consensus of a nonlinear multi-agent system with distributed and input delays. To achieve this goal, the authors employ the fractional Razumikhin approach and algebraic graph theory to derive algebraic conditions for leader–follower consensus. This paper also includes examples to demonstrate the applicability of the presented cases for consensus checking.
The main contributions can be described as follows.
(1)
The parameters of controllers and multi-agent systems are co-designed based on the model of nonlinear MASs. Compared with published results, the obtained fractional-order controller is resilient to uncertainties.
(2)
The majority of the results mentioned in previous related references [24,25,26,27,28] deals with the assumptions that the nonlinear part  f ( τ , u ( τ ) ) = 0  as  u ( τ ) = 0 . However, the remainder of the nonlinear term  f ( τ , u ( τ ) )  in the system dynamics model is not negligible and cannot be completely canceled. Since  f ( τ , u ( τ ) ) 0  and  u ( τ ) = 0  in many cases, it should be well addressed in the design of the controller. Furthermore, in the abovementioned references, it is assumed that the controllers derived by these techniques are precise, accurate and exactly implemented, but this is not always appropriate as it is difficult to have exact dynamics of the system. Therefore, in this paper, we consider both the effect of uncertainty in the controller and the nonvanishing nonlinearity in multi-agent dynamic systems to enhance the implementation of the controller.

2. Preliminaries

First, we offer some definitions and some important lemmas which will be subsequently used. Consider a directed weighted graph  A = ( μ , ϵ ) , which contains a set of vertices  B = { ς 1 , ς 2 , ς 3 , , ς M }  and a directed edge’s set  ϵ { { ς j , ς k } : ς j , ς k B } , where every directed edge  ϵ j k  is an ordered pair of vertices  ( ς j , ς k )  which shows an edge which originates at vertices  ς k  and ends at vertices  ς j ς j  is called the tail, and  ς k  is the head.  M j = { ς k | ( ς k , ς j ) : ς j , ς k ϵ }  shows the neighbor’s set of the vertices  ς j . Consider  C = ( c j k ) M × M  as a weighted adjacency matrix, where  c j k > 0  for  ( ς j , ς k ) ϵ . Otherwise,  c j k = 0 . Let A be a digraph. Then, its directed spanning tree is a subgraph of A, where by following the directed edge, the root vertices can approach every other vertex [34].
Let  D = ( I j k ) M × M  be the Laplacian matrix of graph A
I j k = c j k , j k I j j = k = 1 , k j M c j k j = k .
It is obvious that  k = 1 M I j k = 0 f o r j = 1 , 2 , , M .
Lemma 1 
([34]). The directed graph A has a directed spanning tree if and only if the eigenvalue of the Laplacian matrix D is zero, and all other eigenvalue’s real components are non-negative.
Definition 1 
([19]). Let  f ( τ )  be a function. Then, the annotation of Caputo derivative with order α is
τ 0 C D τ α f ( τ ) = 1 Γ ( n α ) τ 0 τ f n ( s ) ( τ s ) α n + 1 d s .
0 n 1 < α n , n Z + .
Definition 2 
([35]). Let  f : R m × R R m  be a function. Then, it is  Q U A D ( Δ , e )  if there exists a diagonal matrix  Δ R m × m  and a constant  e > 0  satisfy
( x y ) T [ f ( τ , x ) f ( τ , y ) ] ( x y ) T Δ ( x y ) e ( x y ) T ( x y ) , f o r a n y x , y R m .
Lemma 2 
([36]). Let E, F, G be three matrices. Then, the inequality
E F E T G < 0
is equivalent to these inequalities
E < 0 a n d G F T E 1 F < 0 .
Lemma 3 
([37]). Let  x ( t ) R m  be a continuously differentiable function,  H > 0 . The following relationship holds
1 2 τ 0 C D τ α ( x τ ( τ ) H x ( τ ) x T ( τ ) H τ 0 C D τ α x ( τ ) , α ( 0 , 1 ) .
Consider  G = { θ | θ : [ r 1 , 0 ] R m i s c o n t i n o u s }  denotes the Banach space containing a supremum norm. Suppose a general fractional nonlinear equation with delay in time
τ 0 C D τ α u ( τ ) = f ( τ , u τ ) , τ τ 0
for  0 < α 1  and  u τ ( ϖ ) = u ( τ + ϖ ) ϖ [ r 1 , 0 ] , f maps  R ×  (bounded sets of G) into bounded sets of  R m  which satisfy  f ( τ , 0 ) = 0 .
Lemma 4 
([38]). Suppose  γ 1 , γ 2 , γ 3 : R R  are continuous increasing functions,  γ 1 ( s )  and  γ 2 ( s )  are positive if s is positive, and  γ 1 ( 0 ) = γ 2 ( 0 ) = 0 γ ˙ 2 > 0  if differential function  J : R × R m R  and continuous increasing function  η ( s )  greater than s for  s > 0  exists such that for  θ G  and  u R m
γ 1 ( | | u | | ) J ( τ , u ) γ 2 ( | | u | | ) ,
if
J ( τ + ϕ , θ ( ϕ ) ) η ( J ( τ , θ ( 0 ) ) ) .
τ 0 C D τ α J ( τ , θ ( 0 ) ) γ 3 ( | | θ ( 0 ) | | ) , τ τ 0 .
Zero solution  u = 0  of Equation (6) is asymptotically stable for  ϕ [ ϖ , 0 ] u = 0  is globally stable if  γ 1 ( s )  as  s .
Lemma 5 
([39]). If  λ 1 , λ 2 , , λ n  are the eigenvalues of matrix  E R n x n  and  μ 1 , μ 2 , , μ m ,  are eigenvalues of matrix  F R m x m , then  λ j μ k ( j = 1 , 2 , , n , k = 1 , 2 , , m )  are the eigenvalues of  E F .

3. Leader-Following Consensus

Here, with distributed and input delay, resilient-based consensus analysis of a fractional-order nonlinear multi-agent system is discussed. On the basis of a fractional-order Razumikhin approach, many convenient conditions are shown.
Consider the jth agent is
τ 0 C D τ α u j ( τ ) = F u j ( τ ) + f ( τ , u j ( τ ) ) + G r 1 0 u j ( τ + ϕ ) d ϕ + x ^ j ( τ ) + Δ x j ( τ ) .
j = 1 , 2 , , M ,  where  u j ( τ ) = ( u j 1 ( τ ) , u j 2 ( τ ) , , u j m ( τ ) ) T  and F is a constant matrix, and  Δ x j ( τ )  is a disturbance in the controller and  Δ x j ( τ ) = s i n t , which is assumed to be bounded here. The leader satisfies
τ 0 C D τ α u 0 ( τ ) = F u 0 ( τ ) + f ( τ , u 0 ( τ ) ) + G r 1 0 u 0 ( τ + ϕ ) d ϕ .
The controller will be designed as follows:
x j ( τ ) = K k = 1 M c j k ( u k ( τ r 2 ) u j ( τ r 2 ) ) + K c j 0 ( u 0 ( τ r 2 ) u j ( τ r 2 ) ) + Δ x j ( τ ) , j = 1 , 2 , , M
where  r 2  is the input delay,  r 1  is the distributed delay, and K is the constant matrix whose eigenvalues are positive. If a directed connection is present from  u k ( τ )  to  u j ( τ ) , j = 1 , 2 , , M , k = 0 , 1 , , M .  Then,  E = ( c j k ) M × M , and  c j k = 0  otherwise.
Definition 3 
([6]). Under the control law (11), leader–follower consensus of the multi-agent system (9) and (10) is attained if for any  j = 1 , 2 , , M .
lim τ | | u j ( τ ) u 0 ( τ ) | | = 0 .
We need some lemmas and assumptions for obtaining results.
(H1). f is  Q U A D ( Δ , e ) .
(H2). With the leader rooted, the multi-agent system’s corresponding diagraph has a spanning tree.
Lemma 6 
([33]). Consider  L = D + A 0 A 0 = d i a g ( c 10 , , c M 0 ) . (H2) holds if and only if all eigenvalues of matrix L have positive real parts.
Lemma 7.
According to Lemma 5, if  ( H 2 )  is satisfied, then eigenvalues of matrix of  L K  have non-negative real parts.
Lemma 8.
If there are a scalar  β > 0  and a scalar  σ > 0  and a positive definite matrix  R > 0  and if  ( H 1 )  and  ( H 2 )  hold, then under the control law (11) the leader and follower consensus of system (9) and (10) can be obtained.
I M ( F + F T + 2 Δ 2 e I m + β I m + R + 4 Δ x ( τ ) σ ) + 1 β ( L T K T ) ( L K ) < 0 .
I M ( β I m 1 r 1 R ) + 1 β ( I M G T ) ( I M G ) < 0 .
Proof. 
Putting Equation (11) in Equation (9)
τ 0 C D τ α u j ( τ ) = F u j ( τ ) + f ( τ , u j ( τ ) ) + G r 1 0 u j ( τ + ϕ ) d ϕ + K k = 1 M c j k ( u k ( τ r 2 ) u j ( τ r 2 ) ) + K c j 0 ( u 0 ( τ r 2 ) u j ( τ r 2 ) ) + Δ x j ( τ ) + Δ x j ( τ ) ) .
Subtracting Equation (10) from Equation (15)
τ 0 C D τ α u j ( τ ) τ 0 C D τ α u 0 ( τ ) = F u j ( τ ) + f ( τ , u j ( τ ) ) + G r 1 0 u j ( τ + ϕ ) d ϕ + K k = 1 M c j k ( u k ( τ r 2 ) u j ( τ r 2 ) ) + K c j 0 ( u 0 ( τ r 2 ) u j ( τ r 2 ) ) + 2 Δ x j ( τ ) F u 0 ( τ ) f ( τ , u 0 ( τ ) ) G r 1 0 u 0 ( τ + ϕ ) d ϕ τ 0 C D τ α [ u j ( τ ) u 0 ( τ ) ] = F [ u j ( τ ) u 0 ( τ ) ] + f ( τ , u j ( τ ) ) f ( τ , u 0 ( τ ) ) + G r 1 0 [ u j ( t + ϕ ) u 0 ( τ + ϕ ) ] d ϕ + K k = 1 M c j k [ u k ( τ r 2 ) u 0 ( τ r 2 ) + u 0 ( τ r 2 ) u j ( τ r 2 ) ] K c j 0 [ u j ( τ r 2 ) u 0 ( τ r 2 ) ] + 2 Δ x j ( τ ) .
τ 0 C D τ α [ u j ( τ ) u 0 ( τ ) ] = F [ u j ( τ ) u 0 ( τ ) ] + f ( τ , u j ( τ ) ) f ( τ , u 0 ( τ ) ) + G r 1 0 [ u j ( t + ϕ ) u 0 ( τ + ϕ ) ] d ϕ + K k = 1 M c j k [ u k ( τ r 2 ) u 0 ( τ r 2 ) ] K k = 1 M c j k [ u j ( τ r 2 ) u 0 ( τ r 2 ) ] K c j 0 [ u j ( τ r 2 ) u 0 ( τ r 2 ) ] + 2 Δ x j ( τ ) .
Suppose
ω j ( τ ) = u j ( τ ) u 0 ( τ ) , j = 1 , 2 , , M .
Then, Equation (13) becomes
τ 0 C D τ α ω j ( τ ) = F ω j ( τ ) + f ( τ , u j ( τ ) ) f ( τ , u 0 ( τ ) ) + G r 1 0 ω j ( τ + ϕ ) d ϕ + K k = 1 M c j k ( ω k ( τ r 2 ) ω j ( τ r 2 ) ) K c j 0 ω j ( τ r 2 ) + 2 Δ x j ( τ ) .
Choose a quadratic Lyapunov function
J ( τ ) = j = 1 M ω j T ( τ ) ω j ( τ ) .
From Lemma 3 and along the solutions of (18), find the  α -order derivative of  J ( τ ) .
τ 0 C D τ α J ( τ ) 2 j = 1 M ω j T ( τ ) τ 0 c D τ α ω j ( τ ) .
Putting Equation (18) in Equation (20).
τ 0 C D τ α J ( τ ) 2 j = 1 M ω j T ( τ ) [ F ω j ( τ ) + f ( τ , u j ( τ ) ) f ( τ , u 0 ( τ ) ) + G r 1 0 ω j ( τ + ϕ ) d ϕ + K k = 1 M c j k ( ω k ( τ r 2 ) ω j ( τ r 2 ) ) K c j 0 ω j ( τ r 2 ) + 2 Δ x j ( τ ) ] .
From (H1), we have
ω j T ( τ ) [ f ( τ , u j ( τ ) ) f ( τ , u 0 ( τ ) ) ] ω j T ( τ ) Δ ω j ( τ ) e ω j T ( τ ) ω j ( τ ) .
Then,
ω j T ( τ ) [ f ( τ , u j ( τ ) ) f ( τ , u 0 ( τ ) ) ] ω j T ( τ ) Δ ω j ( τ ) e I m ω j T ( τ ) ω j ( τ ) .
which implies that
ω j T ( τ ) [ f ( τ , u j ( τ ) ) f ( τ , u 0 ( τ ) ] ω j T ( τ ) ( Δ e I m ) ω j ( τ ) .
Notice that
I j k = c j k , j k a n d I j j = k = 1 , k j M c j k ,
We obtain
k = 1 M c j k ( ω k ( τ ) ω j ( τ ) ) = k = 1 , k j M c j k ( ω k ( τ ) ω j ( τ ) ) = k = 1 , k j M c j k ω k ( τ ) k = 1 , k j M c j k ω j ( τ ) = k = 1 , k j M I j k ω k ( τ ) I j j ω j ( τ ) .
Then, we obtain
k = 1 M c j k ( ω k ( τ ) ω j ( τ ) ) = k = 1 M I j k ω k ( τ ) .
Now, putting values in Equation (21)
τ 0 C D τ α J ( τ ) 2 ω j T ( τ ) j = 1 M [ F ω j ( τ ) + f ( τ , u j ( τ ) ) f ( τ , u 0 ( τ ) ) + G r 1 0 ω j ( τ + ϕ ) d ϕ + K k = 1 M c j k ( ω k ( τ r 2 ) ω j ( τ r 2 ) ) K c j 0 ω j ( τ r 2 ) + 2 Δ x j ( τ ) ] 2 j = 1 M [ ω j T ( τ ) F ω j ( τ ) + ω j T ( τ ) ( f ( τ , u j ( τ ) ) f ( τ , u 0 ( τ ) ) ) + 2 r 1 0 j = 1 M ω j T ( τ ) G ω j ( τ + ϕ ) d ϕ + 2 j = 1 M ω j T ( τ ) K k = 1 M c j k ( ω k ( τ r 2 ) ω j ( τ r 2 ) ) 2 j = 1 M ω j T ( τ ) K c j 0 ω j ( τ r 2 ) + 2 j = 1 M ω j T ( τ ) [ 2 Δ x j ( τ ) ] ] .
By using Equation (22),
τ 0 C D τ α J ( τ ) 2 j = 1 M [ ω j T ( τ ) F ω j ( τ ) + ω j T ( τ ) ( Δ 2 e I m ) ω j ( τ ) ] + 2 r 1 0 j = 1 M ω j T ( τ ) G ω j ( τ + ϕ ) d ϕ + 2 j = 1 M ω j T ( τ ) K k = 1 M c j k ( ω k ( τ r 2 ) ω j ( τ r 2 ) ) 2 j = 1 M ω j T ( τ ) K c j 0 ω j ( τ r 2 ) + 4 Δ x ( τ ) ω T ( τ ) .
τ 0 C D τ α J ( τ ) 2 j = 1 M ω j T ( τ ) ( F + Δ e I m ) ω j ( τ ) + 2 r 1 0 j = 1 M ω j T ( τ ) G ω j ( τ + ϕ ) d ϕ + 2 j = 1 M ω j T ( τ ) K ( k = 1 M I j k ω k ( τ r 2 ) ) 2 j = 1 M ω j T ( τ ) K c j 0 ω j ( τ r 2 ) + Δ x j ( τ ) ω j ( τ r 2 ) + 4 Δ x ( τ ) ω T ( τ ) 2 j = 1 M ω j T ( τ ) ( F + Δ e I m ) ω j ( τ ) + 2 r 1 0 j = 1 M ω j T ( τ ) ω j ( τ + ϕ ) d ϕ 2 j = 1 M ω j T ( τ ) K k = 1 M I j k e k ( τ r 2 ) 2 j = 1 M ω j T ( τ ) K c j 0 ω j ( τ r 2 ) + 4 Δ x ω T ( τ ) . 2 ω T ( τ ) ( I M ( F + Δ e I m ) ω ( τ ) + 2 r 1 0 ω T ( τ ) ( I M G ) ω ( τ + ϕ ) d ϕ 2 ω T ( τ ) ( D K ) ω ( τ r 2 ) 2 ω T ( τ ) ( A 0 K ) ω ( τ r 2 ) + 4 Δ x ( τ ) ω T ( τ ) 2 ω T ( τ ) ( I M ( F + Δ e I m ) ω ( τ ) + 2 r 1 0 ω T ( τ ) ( I M G ) ω ( τ + ϕ ) d ϕ 2 ω T ( τ ) ( D + A 0 ) K ω ( τ r 2 ) + 4 Δ x ( τ ) ω T ( τ ) .
By using Lemma 6,
τ 0 C D τ α J ( τ ) 2 ω T ( τ ) ( I M ( F + Δ e I m ) ω ( τ ) + 2 r 1 0 ω T ( τ ) ( I M G ) ω ( τ + ϕ ) d ϕ ω T ( τ ) ( L K ) ω ( τ r 2 ) + 4 Δ x ( τ ) ω T ( τ ) ω T ( τ ) ( I M ( 2 F + 2 Δ 2 e I m ) ω ( τ ) + 2 r 1 0 ω T ( τ ) ( I M G ) ω ( τ + ϕ ) d ϕ 2 ω T ( τ ) ( L K ) ω ( τ r 2 ) + 4 Δ x ( τ ) ω T ( τ ) ω T ( τ ) ( I M ( F + F T + 2 Δ 2 e I m ) ω ( τ ) + 2 r 1 0 ω T ( τ ) ( I M G ) ω ( τ + ϕ ) d ϕ 2 ω T ( τ ) ( L K ) ω ( τ r 2 ) + 4 Δ x ( τ ) ω T ( τ ) .
where
ω T ( τ ) = ( ω 1 T ( τ ) , , ω M T ( τ ) ) T .
Whenever
J ( τ + ϖ , u ( τ + ϖ ) ) < η J ( τ , u ( τ ) ) , f o r a l l r ϖ < 0
here  r = max { r 1 , r 2 }  ,for any  β > 0  and for some  η > 1
τ 0 C D τ α J ( τ ) ω T ( τ ) ( I M ( F + F T + 2 Δ 2 e I m ) ω ( τ ) + 2 r 1 0 ω T ( τ ) ( I M G ) ω ( τ + ϕ ) d ϕ 2 ω T ( τ ) ( L K ) ω ( τ r 2 ) + 4 Δ x ( τ ) ω T ( τ ) + β [ η ω T ( τ ) ( I M I m ) ω ( τ ) ω T ( τ r 2 ) ( I M I m ) ω ( τ r 2 ) ] + r 1 0 β [ η ω T ( τ ) ( I M I m ) ω ( τ ) ω T ( τ + ϕ ) ( I M I m ) ω ω ( τ + ϕ ) ] d ϕ .
Which implies that
τ 0 C D τ α J ( τ ) ω T ( τ ) [ I M ( F + F T + 2 Δ 2 e I m + β η I m + R ) ] ω ( τ ) 2 ω T ( τ ) ( L K ) ω ( τ r 2 ) β ω T ( τ r 2 ) ( I M I m ) ω ( τ r 2 ) + r 1 0 [ ω T ( τ ) ( I M ( β η I m 1 r 1 R ) ω ( τ ) ) ) + 2 ω T ( τ ) ( I M G ) ω ( τ + ϕ ) β ω T ( τ + ϕ ) ( I M I m ) ω ( τ + ϕ ) ] d ϕ + 4 Δ x ( τ ) ω T ( τ ) ω ( τ ) ω ( τ ) .
τ 0 C D τ α J ( τ ) χ r 2 T
I M ( F + F T + 2 Δ 2 e I m + β η I m + R + 4 Δ x ( τ ) ω ( τ ) ) L K L T K T β I M I m χ r 2 + r 1 0 χ ϕ T I M ( β η I m 1 r 1 R I M G I M G T β I M I m χ ϕ d ϕ .
where  χ r 2 = ( ω T ( τ ) , ω T ( τ r 2 ) ) T  , χ ϕ = ( ω T ( τ ) , ω T ( τ + ϕ ) ) T  , σ = 1 ω ( τ )  and  ϕ [ r 1 , 0 ] . Suppose  η + 1
τ 0 C D τ α J ( τ ) χ r 2 T
I M ( F + F T + 2 Δ 2 e I m + β I m + R + 4 Δ x ( τ ) σ ) L K L T K T β I M I m χ r 2 + r 1 0 χ ϕ T I M ( β I m 1 r 1 R ) I M G I M G T β I M I m χ ϕ d ϕ .
By using inequalities (13) and (14) and Lemma 2
I M ( F + F T + 2 Δ 2 e I m + β I m + R + 4 Δ x ( τ ) σ ) L K L T K T β I M I m < 0 ,
and
I m ( β I m 1 r 1 R ) I M G I M G T β I M I m < 0 .
Systems (13) and (14) are satisfied in the sense of Lemma 2. It shows that if  J ( τ + ϖ , u ( τ + ϖ ) ) < η J ( τ , u ( τ ) ) , then  τ 0 c D τ α J ( τ ) < 0 , for some  ϖ [ r , 0 ]  and  η > 1 . Hence, according to Lemma 4, the system (15) is asymptotically stable. Under the control law (11), for systems (9) and (10), leader–follower consensus is obtained. □
Corollary 1.
If (H1) and (H2) are satisfied, and there are a scalar  β > 0 , a scalar  σ > 0  and a non-negative definite matrix  R > 0 , then under control law (11), leader–follower consensus of (9) and (10) can be obtained.
λ m a x [ I M ( F + F T + 2 Δ 2 e I m + β I m + R + 4 Δ x ( τ ) σ ) + 1 β ( L T K T ) ( L K ) ] < 0 ,
and
λ m a x ( β I m 1 r 1 R + 1 β G T G ) < 0 .
Lemma 9.
By using our criteria, it is more suitable to calculate a multi-agent system’s consensus, in spite of criteria used in [33]. In this paper, the system which is being considered not only contains input and distributed delay, but it leads to a weighted directed graph too. Our criteria can be used for more general multi-agent systems because criteria used in [33] lead to a directed graph only. If “ ω T ( τ ) ( I M R ) ω ( τ ) ” is replaced with  r 1 ω T ( τ ) ( I M R ) ω ( τ )  in the first equation of Formula (24), then we obtain the following theorem.
Lemma 10.
If (H1) and (H2) are satisfied and if there are scalars  σ a n d β > 0  and a non-negative definite matrix  R > 0 , then under the control law (11), we can obtain leader–follower consensus of (9) and (10).
I M ( F + F T + 2 Δ 2 e I m + β I m + r 1 R + 4 Δ x ( τ ) σ ) + 1 β ( L T K T ) ( L K ) < 0 ,
and
I M ( β I m R ) + 1 β ( I M G T ) ( I M G ) < 0 .
The results that are obtained must be suitable for FOMAS having undirected topology.
Lemma 11 
([34]). A graph A is considered connected if and only if its corresponding Laplacian matrix D is a non-negative semi-definite matrix in an undirected graph A. The Laplacian matrix D has a single, nonrepeated eigenvalue of zero, and all other eigenvalues are non-negative.
Lemma 12.
The system leads to a directed weighted graph in Lemmas 8 and 11. If the system’s topology is a connected undirected graph, then only Lemma 1 is replaced, and the proof is continued in the same way.

4. Numerical Examples

Consider some examples for determining the convenience of results.
Example 1.
Under the control law (11), consider nonlinear system (9) and (10) with four followers and one leader, as shown in Figure 1. Consider the matrices F and G.
F = 5.3 0 1.1 0 3.2 0 0 0 2.5 ,
and
G = 0.19 0 0 0.12 0.35 0 0 0 0.17
From Figure 1
E = 0 0 0 0.5 0.2 0 0 0 0 0 0 1.4 0 0 0.6 0
A 0 = 0.5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.9
D = 0.5 0 0 0.5 0.2 0.2 0 0 0 0 1.4 1.4 0 0 0.6 0.6
L = 0.5 0 0 0.5 0.2 0.2 0 0 0 0 1.4 1.4 0 0 0.6 0.6 + 0.5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.9
which implies that
L = 1 0 0 0.5 0.2 0.2 0 0 0 0 1.4 1.4 0 0 0.6 0.75
here  f ( τ , u j ( τ ) ) = cos ( u j ( τ ) ) j = 0 , 1 , , 4  ,  α = 0.6  ,  r 1 = 0.7 .
Consider  e = 0.3  by using assumption (H1).
Δ = 0.7 0 0 0 0.7 0 0 0 0.7
Take  β = 0.4 , we have according to (14)
I M ( β I m 1 r 1 R ) + 1 β ( I M G T ) ( I M G ) .
= I M ( β I m 1 r 1 R ) + I M 1 β G T G .
= I M ( β I m + 1 β G T G 1 r 1 R ) < 0 . That is,
β r 1 I m + r 1 β G T G R < 0 .
Therefore,
R = 0.72 0 0.08 0 0.56 0 0.08 0 0.64
for satisfying (30) can be chosen.
Similarly, (13) implies
β I M ( F + F T + 2 Δ 2 e I m + R + 4 Δ x ( τ ) σ ) + L T L K T K < 0 .
Here  Δ x ( τ ) = 20 cos ( 0.2 ) , and  σ = 0.1 .  Hence,
K = 0.2 0 0 0.3 0.5 0 0 0 0.1
for satisfying (31) can be chosen. According to Lemma 8, systems’ (9) and (10) leader–follower consensuses under the control law (11) are obtained, and in Figure 2, Figure 3, Figure 4 and Figure 5 the error states  ω j ( τ )  are discussed.
Example 2.
Let nonlinear systems (9) and (10) under control law (11) with a leader and four followers be as shown in Figure 3. Consider matrices F and G
F = 3.8 0.4 0.9 0 4.5 0 1 0.3 3.7 , G = 0.19 0 0.1 0.16 0.3 0.1 0 0.2 0.1
From Figure 6,
E = 0 0.4 0 0 0 0 1.1 0.3 0 1.1 0 0 0 0.3 0 0
and
A 0 = 0.2 0 0 0 0 0.7 0 0 0 0 0 0 0 0 0 0
D = 0.4 0.4 0 0 0.4 1.8 1.1 0.3 0 1.1 1.1 0 0 0.3 0 0.3
and
L = 0.4 0.4 0 0 0.4 1.8 1.1 0.3 0 1.1 1.1 0 0 0.3 0 0.3 + 0 0.4 0 0 0 0 1.1 0.3 0 1.1 0 0 0 0.3 0 0
which implies that
L = 0.4 0 0 0 0.4 1.8 0 0 0 0 1.1 0 0 0 0 0.3
here  f ( τ , u j ( τ ) ) = 1 4 tanh u j ( τ )  ,  j = 0 , 1 , , 4  , α = 0.5  ,  r 1 = 0.3 .
Let  e = 0.3 Δ x ( τ ) = 20 sin ( 0.3 )  and
Δ = 0.6 0 0 0 0.6 0 0 0 0.6
Take  α = 0.9 . For fulfilling the consensus’s conditions
R = 0.48 0 0.04 0.2 0.52 0 0.04 0 0.56
and
K = 0.3 0 0 0.2 0.5 0 0 0 0.4
can be taken. According to Lemma 8 under control law (11), the leader–follower consensus of systems (9) and (10) with undirected topology is obtained. In Figure 7,Figure 8, Figure 9 and Figure 10, the error states  ω j ( τ )  are explained.

5. Conclusions

Fractional-order nonlinear leader and follower systems with input and distributed delay-resilient-based consensus were studied. By using the Razumikhin approach, some suitable conditions were achieved. The criteria were expressed as linear matrix inequalities, providing a suitable way to calculate consensus. This multi-agent system leads to a weighted directed graph, and the results obtained are convenient for an undirected graph. This shows that our criteria is more convenient for vast leader and follower systems. Our upcoming research focuses on fractional-order singular multi-agent systems with delayed consensus.

Author Contributions

Conceptualization, W.A.; Software, W.A.; Validation, A.K. (Asad Khan); Formal analysis, A.K. (Anam Khan); Resources, A.K. (Asad Khan); Data curation, A.K. Anum Khan; Writing—original draft, F.A.; Writing—review & editing, A.U.K.N.; Supervision, A.U.K.N.; Project administration, A.K. (Asad Khan). All authors have read and agreed to the published version of the manuscript.

Funding

This research was sponsored by the Guangzhou Government Project under Grant No. 62216235, and the National Natural Science Foundation of China (Grant No. 622260-1).

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.

References

  1. Wei, R.; Beard, R. Distributed Consensus in Multi-Vehicle Cooperative Control: Theory and Applications; Springer: London, UK, 2008. [Google Scholar]
  2. Carpenter, J. Decentralized control of sattellite formations. Int. J. Robust Nonlinear Control 2002, 12, 141–161. [Google Scholar] [CrossRef]
  3. Zhu, W.; Jiang, Z.P. Event-based-following consensus of multi-agent systems with input time delay. IEEE Trans. Autom. Control 2015, 60, 1362–1367. [Google Scholar] [CrossRef]
  4. Liu, L.; Shan, J. Event-triggered consensus of nonlinear multi-agent systems with stochastic switching topology. J. Frankl. Inst. 2017, 354, 5350–5373. [Google Scholar] [CrossRef]
  5. Wu, J.; Li, H.; Chen, X. Leader-following consensus of nonlinear discrete-time multi-agent systems with limited communication channel capacity. J. Frankl. Inst. 2017, 354, 4179–4195. [Google Scholar] [CrossRef]
  6. Ni, W.; Cheng, D. Leader-following consensus of multi-agent systems under fixed and switching topologies. Syst. Control Lett. 2010, 59, 209–217. [Google Scholar] [CrossRef]
  7. Yang, R.; Liu, S.; Tan, Y.; Zhang, Y.; Jiang, W. Consensus analysis of fractional-order nonlinear multi-agent systems with distributed and input delays. Neurocomputing 2019, 329, 46–52. [Google Scholar] [CrossRef]
  8. Gong, P. Distributed consensus of nonlinear fractional-order multi-agent systems with directed topologies. IET Control Theory Appl. 2016, 10, 2515–2525. [Google Scholar] [CrossRef]
  9. Zhu, W.; Li, W.; Zhou, P.; Yang, C. Consensus of fractional-order multi-agent systems with linear models via oberver-type protocol. Neurocomputing 2017, 230, 60–65. [Google Scholar] [CrossRef]
  10. Ren, G.; Yu, Y. Robust consensus of fractional multi-agent systems with external disturbances. Neurocomputing 2016, 218, 339–345. [Google Scholar] [CrossRef]
  11. Yu, H.; Xia, X. Adaptive leaderless consensus of agents in jointly connected networks. Neurocomputing 2017, 241, 64–70. [Google Scholar] [CrossRef] [Green Version]
  12. Bai, J.; Wen, G.; Rahmani, A.; Yu, Y. Consensus problem with a reference state for fractional-order multi-agent systems. Asian J. Control 2017, 19, 1009–1018. [Google Scholar] [CrossRef]
  13. Ma, X.; Sun, F.; Li, H.; He, B. The consensus region design and analysis of fractional-order multi-agent systems. Int. J. Syst. Sci. 2017, 48, 629–636. [Google Scholar] [CrossRef]
  14. Zhang, X.; Wu, R. Modified projective synchronization of fractional-order chaotic systems with different dimensions. Acta Math. Appl. Sin. Engl. Ser. 2020, 36, 527–538. [Google Scholar] [CrossRef]
  15. Tian, Y.; Xia, Q.; Chai, Y.; Chen, L.; Lopes, A.; Chen, Y. Guaranteed cost leaderless consensus protocol design for fractional-order uncertain multi-agent systems with state and input delays. Fractal Fract. 2021, 5, 141. [Google Scholar] [CrossRef]
  16. Qin, J.; Gao, H.; Zheng, W.X. Second-order consensus for multi-agent systems with switching topology and communication delay. Syst. Control Lett. 2011, 60, 390–397. [Google Scholar] [CrossRef]
  17. Liu, H.; Karimi, H.; Du, S.; Xia, W.; Zhong, C. Leader-following consensus of discrete-time multi-agent systems with time-varying delay based on large delay theory. Inf. Sci. 2017, 417, 236–246. [Google Scholar] [CrossRef]
  18. Wang, Z.; Zhang, H.; Song, X.; Zhang, H. Consensus problems for discrete-time agents with communication delay. Int. J. Control Autom. Syst. 2017, 15, 1515–1523. [Google Scholar] [CrossRef]
  19. Podlubny, I. Fractional Differential Equations; Academic Press: New York, NY, USA, 1999. [Google Scholar]
  20. Yu, Z.; Jiang, H.; Hu, C. Leader-following consensus of fractional-order multi-agent systems under fixed topology. Neurocomputing 2015, 149, 613–620. [Google Scholar] [CrossRef]
  21. Bia, J.; Wen, G.; Rahmani, A.; Yu, Y. Distributed consensus tracking for the fractional-order multi-agent systems based on the sliding mode control method. Neurocomputing 2017, 235, 210–216. [Google Scholar]
  22. Xu, Q.; Zhuang, S.; Che, C.; Xia, Y. stabalization of a class of fractional-order nonautonomous systems using quadratic Lyapunov functions. Adv. Differ. Equ. 2018, 2018, 1–15. [Google Scholar] [CrossRef] [Green Version]
  23. Xu, Q.; Xu, X.; Zhuang, S.; Xiao, J.; Che, C. New complex projective synchronization strategies for derive -response networks with fractional-complex variable dynamics. Appl. Math. Comput. 2018, 338, 552–566. [Google Scholar]
  24. Liu, X.; Zhang, Z.; Li, X. Consensus control of fractional-order systems based on delayed state fractional order derivative. Asian J. Control 2017, 19, 2199–2210. [Google Scholar] [CrossRef]
  25. Liu, J.; Qin, K.; Chen, W.; Li, P.; Shi, M. Consensus of fractional-order multi-agent systems with nonuniform time delays. Math. Probl. Eng. 2018, 2018, 2850757. [Google Scholar]
  26. Shen, J.; Cao, J.; Lu, J. Consensus of fractional-order systems with non-nuniform input and communication delays. Proc. Inst. Mech. Eng. Part I-J. Syst. Control Eng. 2012, 226, 271–283. [Google Scholar] [CrossRef]
  27. Shen, J.; Cao, J. Necessary and sufficient conditions for consensus of delayed fractional-order systems. Asian J. Control 2012, 14, 1690–1697. [Google Scholar] [CrossRef]
  28. Liu, S.; Wu, X.; Zhou, X.; Jiang, W. Asymptotical stability of Riemann-Liouville fractional nonlinear systems. Nonlinear Dyn. 2016, 86, 65–71. [Google Scholar] [CrossRef]
  29. Liu, S.; Zhou, X.; Li, X.; Jiang, W. Asymptotical stability of Riemann-Liouville fractional singular systems with multiple time-varying delays. Appl. Math. Lett. 2017, 65, 32–39. [Google Scholar] [CrossRef]
  30. Liu, S.; Wu, X.; Zhang, Y.; Yang, R. Asymptotical stability of Riemann-Liouville fractional neutral systems. Appl. Math. Lett. 2017, 69, 168–173. [Google Scholar] [CrossRef]
  31. Xu, Q.; Zhuang, S.; Liu, S.; Xiao, J. Decentralized adaptive coupling synchronization of fractional-order complex-variable dynamical networks. Neurocomputing 2016, 186, 119–216. [Google Scholar] [CrossRef]
  32. Wang, F.; Yang, Y. Leader-following exponential consensus of fractional-order nonlinear multi-agents system with hybrid time-varying delay: A heterogenous impulsive method. Phys. A 2017, 482, 158–172. [Google Scholar] [CrossRef]
  33. Zhu, W.; Chen, B.; Yang, J. Consensus of fractional-order multi-agent systems with input time delay. Fract. Calc. Appl. Anal. 2017, 20, 52–70. [Google Scholar] [CrossRef]
  34. Yu, W.; Wen, G.; Chen, G.; Cao, J. Distributed Cooperative Control of Multi-Agent Systems; Higher Education Press: Beijing, China, 2016. [Google Scholar]
  35. DeLellis, P.; di Bernardo, M.; Russo, G. On QUAD, Lipschitz, and contracting vector fields for consensus and synchronization of networks. IEEE Trans. Circuits Syst. I 2011, 58, 576–583. [Google Scholar] [CrossRef]
  36. Gu, K.; Kharitonov, V.; Chen, J. Stability of Time-Delay Systems; Birkhauser: Boston, MA, USA, 2022. [Google Scholar]
  37. Duarte-Mermoud, M.; Aguila-Camacho, N.; Gallegos, J. Castro-Linares, Using general quadratic Lyapunov functions to prove Lyapunov uniform stability for fractional order systems. Commun. Nonlinear Sci. Numer. Simul. 2015, 22, 650–659. [Google Scholar] [CrossRef]
  38. Wen, Y.; Zhou, X.; Zhang, Z.; Liu, S. Lyapunov method for nonlinear fractional differential systems with delay. Nonlinear Dyn. 2015, 82, 1015–1025. [Google Scholar] [CrossRef]
  39. Xu, Z.; Zhang, K.; Lu, Q.; Leng, G. Concise Tutorial of Matrix Theory; Science Press: Beijing, China, 2001. (In Chinese) [Google Scholar]
Figure 1. Directed spanning tree shown by nonlinear multi-agent system topology.
Figure 1. Directed spanning tree shown by nonlinear multi-agent system topology.
Fractalfract 07 00322 g001
Figure 2. The graph represents the error state  ω j ( τ )  of a multi-agent system following leader.
Figure 2. The graph represents the error state  ω j ( τ )  of a multi-agent system following leader.
Fractalfract 07 00322 g002
Figure 3. Leader–follower multi-agent system’s error state  ω j ( τ ) .
Figure 3. Leader–follower multi-agent system’s error state  ω j ( τ ) .
Fractalfract 07 00322 g003
Figure 4. The leader–follower multi-agent system error states  ω j ( τ ) .
Figure 4. The leader–follower multi-agent system error states  ω j ( τ ) .
Fractalfract 07 00322 g004
Figure 5. The leader–follower multi-agent system error states  ω j ( τ ) .
Figure 5. The leader–follower multi-agent system error states  ω j ( τ ) .
Fractalfract 07 00322 g005
Figure 6. Undirected connected graph shown by topology of a nonlinear multi-agent system.
Figure 6. Undirected connected graph shown by topology of a nonlinear multi-agent system.
Fractalfract 07 00322 g006
Figure 7. Graph represents error state  ω j ( τ )  of a multi-agent system following leader.
Figure 7. Graph represents error state  ω j ( τ )  of a multi-agent system following leader.
Fractalfract 07 00322 g007
Figure 8. Leader–follower multi-agent system’s error state  ω j ( τ )  .
Figure 8. Leader–follower multi-agent system’s error state  ω j ( τ )  .
Fractalfract 07 00322 g008
Figure 9. The leader–follower multi-agent system error states  ω j ( τ ) .
Figure 9. The leader–follower multi-agent system error states  ω j ( τ ) .
Fractalfract 07 00322 g009
Figure 10. The leader–follower multi-agent system error states  ω j ( τ ) .
Figure 10. The leader–follower multi-agent system error states  ω j ( τ ) .
Fractalfract 07 00322 g010
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

Khan, A.; Niazi, A.U.K.; Abbasi, W.; Awan, F.; Khan, A. Fractional-Order Nonlinear Multi-Agent Systems: A Resilience-Based Approach to Consensus Analysis with Distributed and Input Delays. Fractal Fract. 2023, 7, 322. https://doi.org/10.3390/fractalfract7040322

AMA Style

Khan A, Niazi AUK, Abbasi W, Awan F, Khan A. Fractional-Order Nonlinear Multi-Agent Systems: A Resilience-Based Approach to Consensus Analysis with Distributed and Input Delays. Fractal and Fractional. 2023; 7(4):322. https://doi.org/10.3390/fractalfract7040322

Chicago/Turabian Style

Khan, Asad, Azmat Ullah Khan Niazi, Waseem Abbasi, Faryal Awan, and Anam Khan. 2023. "Fractional-Order Nonlinear Multi-Agent Systems: A Resilience-Based Approach to Consensus Analysis with Distributed and Input Delays" Fractal and Fractional 7, no. 4: 322. https://doi.org/10.3390/fractalfract7040322

APA Style

Khan, A., Niazi, A. U. K., Abbasi, W., Awan, F., & Khan, A. (2023). Fractional-Order Nonlinear Multi-Agent Systems: A Resilience-Based Approach to Consensus Analysis with Distributed and Input Delays. Fractal and Fractional, 7(4), 322. https://doi.org/10.3390/fractalfract7040322

Article Metrics

Back to TopTop