Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Next Article in Journal
Existence and Stability of Solutions for p-Proportional ω-Weighted κ-Hilfer Fractional Differential Inclusions in the Presence of Non-Instantaneous Impulses in Banach Spaces
Previous Article in Journal
High-Order Numerical Approximation for 2D Time-Fractional Advection–Diffusion Equation under Caputo Derivative
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Advanced Observation-Based Bipartite Containment Control of Fractional-Order Multi-Agent Systems Considering Hostile Environments, Nonlinear Delayed Dynamics, and Disturbance Compensation

1
Metaverse Research Institute, School of Computer Science and Cyber Engineering, Guangzhou University, Guangzhou 510006, China
2
School of Transportation, Southeast University, Nanjing 211189, China
3
Department of Mathematics and Statistics, The University of Lahore, Sargodha 40100, Pakistan
4
School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Fractal Fract. 2024, 8(8), 473; https://doi.org/10.3390/fractalfract8080473
Submission received: 2 June 2024 / Revised: 31 July 2024 / Accepted: 1 August 2024 / Published: 13 August 2024
(This article belongs to the Topic Fractional Calculus: Theory and Applications, 2nd Edition)

Abstract

:
This paper introduces an advanced observer-based control strategy designed for fractional multi-agent systems operating in hostile environments. We take into account the dynamic nature of the agents with nonlinear delayed dynamics and consider external disturbances affecting the system. The manuscript presents an improved observation-based control approach tailored for fractional-order multi-agent systems functioning in challenging conditions. We also establish various applicable conditions governing the creation of observers and disturbance compensation controllers using the fractional Razmikhin technique, signed graph theory, and matrix transformation. Furthermore, our investigation includes observation-based control on switching networks by employing a typical Lyapunov function approach. Finally, the effectiveness of the proposed strategy is demonstrated through the analysis of two simulation examples.

1. Introduction

Multi-agent systems (MASs) are composed of multiple interacting autonomous subsystems that utilize shared information to tackle challenging or complex tasks. Consensus is a critical aspect of MASs’ collective actions and ensures that through effective distributed control based solely on local knowledge, each agent’s state converges to a desired common state. The existing literature has proposed several significant results addressing consensus problems under conditions of limited communication, dynamically changing topologies, uniform or non-uniform time delays, and external disturbances [1,2,3,4,5]. Additionally, the exploration of output containment control strategies has been a focal point of research efforts [6]. Various techniques, ranging from those leveraging the principles of Laplace transforms to sophisticated frequency domain analysis approaches, have been employed to address this intricate problem space [7]. In contrast to the cooperative frameworks typically studied in academia [8], real-world MASs frequently operate within environments characterized by a delicate interplay of cooperative and hostile connections among agents [9]. This detailed dynamic is enclosed within the framework of signed networks, where positive and negative edge weights encode the nature of the connection between agents [10]. These signed networks find widespread application across different domains, including social networks and multi-robot systems, where understanding and navigating the complex inter-dependencies between agents is preeminent [11,12]. The appreciation of these antagonistic–cooperative dynamics underscores the need for adaptive and robust control strategies capable of accommodating the intricate interplay between the agents within such networks. Numerous significant investigations have focused on bipartite containment control. References [13,14,15] present fascinating works in this field. In reference [16], the authors convert bipartite containment control into a general form using matrix transformation techniques. An observer-based strategy to tackle bipartite containment control is introduced in [17]. Reference [18] explores the bipartite output containment issue by developing various control protocols. Moreover, other approaches have been employed, such as an output feedback method [19], a fuzzy observer method [20], and a delayed event-triggered mechanism [21]. It is important to note that the majority of existing research focuses on bipartite containment control for integer-order multi-agent systems (MASs). However, fractional calculus has demonstrated substantial benefits in modeling complex phenomena, including the transient response of elastomers and the motion of objects in viscoelastic materials [22,23]. In recent years, there has been significant research on control systems for connected vehicle platooning. Niazi et al. have made important contributions in this area [24]. The latest advancements in multi-agent system control have addressed various challenges, including communication delays and nonlinear couplings. Given the inherent uncertainties and nonlinearities in physical applications, substantial research has focused on the robust formation and consensus control problems in uncertain multi-agent systems (MASs). Studies such as those in [25,26] have introduced a fully distributed adaptive consensus protocol for higher-order systems with general linear and Lipschitz nonlinear dynamics. This protocol effectively reduces the consensus error to a small neighborhood around the origin and implements exponential convergence. In a similar way, adaptive techniques have been used to deal with the formation tracking problem in teams of uncertain systems with nonlinear terms satisfying Lipschitz conditions [27,28]. The motivation for studying fractional-order multi-agent systems (FMASs) with delays is grounded in both practical applications and theoretical advancements. Practically, FMASs can model complex systems in engineering, biology, and social networks and capture memory effects and long-term dependencies more accurately than traditional models. Communication delays are inherent in distributed systems and smart devices, necessitating robust control strategies. Theoretically, this research fills a gap in existing studies by providing new insights into the stability and control of FMASs with delays, leading to improved performance and resilience in real-world applications.
Inspired by these findings, this paper proposes advanced observer-based bipartite containment control of fractional multi-agent systems considering hostile environments, nonlinear delayed dynamics, and disturbance compensation. The specific contributions of this paper are given below.
  • As compared to [29], we use a fractional-order multi-agent system instead of an integer-order derivative; our work contributes to the field by providing a more general and flexible framework for modeling and controlling dynamic behaviors in complex networks.
  • By incorporating disturbances into the controller, our work enhances the robustness and practical applicability of the control strategy for fractional-order multi-agent systems, addressing real-world uncertainties.
  • By incorporating a nonlinear delayed function in the dynamics, our work provides a more accurate and comprehensive framework for modeling and controlling fractional-order multi-agent systems, capturing complex temporal interactions and delays that have not been addressed in previous studies [29].
1.
Section 1 is the introduction of the paper.
2.
Section 2 presents the foundational knowledge that is useful for our main results.
3.
Observation-based analyses of bipartite containment control for fixed and switching signed digraphs are discussed in Section 3.2 and Section 4.
4.
Numerical examples are presented in Section 5.
5.
The paper is summarized in Section 6.
Figure 1 represents the framework of this paper.

2. Foundational Knowledge

2.1. Graph Theory

Consider a weighted signed digraph G = ( N , E ) , where N = { n 1 , , n N } is the set of nodes and E N × N is the set of directed edges. The adjacency matrix F = [ f i j ] N × N is defined such that f i j 0 if ( n i , n j ) E and f i j = 0 otherwise. An edge ( n i , n j ) means that node n i is capable of receiving information from node n j ; f i j > 0 indicates a cooperative relationship, and f i j < 0 indicates a hostile connection between nodes n i and n j . The Laplacian matrix L = [ i j ] N × N for G is defined such that i j = f i j for i j and i i = j = 1 , j i N | f i j | . Additionally, G is considered to be structurally balanced if the node set N of the signed graph G can be divided into two disjoint subsets N 1 and N 2 such that f i j > 0 for any n i , n j N 1 or n i , n j N 2 and f i j < 0 for any n i N 1 and n j N 2 .

2.2. Basic Lemmas and Fractional Operators

In this subsection, various valuable definitions and lemmas are revisited.
Definition 1 
([30]). The Caputo derivative of order γ for a function ψ ( s ) that is c-differentiable is expressed as:
D γ ψ ( s ) = 1 Γ ( c γ ) s 0 s ψ ( c ) ( t ) ( s t ) μ c + 1 d t , 0 c 1 < γ c , c Z + .
Lemma 1 
([31]). If Q ( s ) R n is an absolutely continuous and differentiable function, then the following property holds:
1 2 D γ ( Q T ( s ) Q ( s ) ) Q T ( s ) [ D γ Q ( s ) ] 0 , γ ( 0 , 1 ) .
Remark 1. 
It is significant to observe that the Leibniz rule for the Caputo fractional derivative does not have a simple form. The fractional Leibniz rule, which is appropriate for the Caputo derivative, includes complex integral expressions that account for the non-local properties of the fractional derivative. For detailed discussions on the Leibniz rule for fractional derivatives, refer to foundational works on fractional calculus like [32].
Lemma 2 
([31]). Let β 1 , β 2 R n and ρ > 0 ; then the following inequality holds:
2 β 1 T β 2 ρ β 1 T β 1 + 1 ρ β 2 T β 2
Consider a delayed fractional-order system for 0 < γ < 1 that can present both switching and non-switching behaviors:
D γ z ( s ) = k σ ( s ) ( s , z s ) , s s 0 z s 0 ( θ ) = ϕ ( θ ) , θ [ e 2 , 0 ]
where z s ( θ ) = z ( s + θ ) , θ [ e 2 , 0 ] , for any s s 0 and time delay e 2 > 0 , ϕ P . The function k σ ( s ) maps R × (bounded sets of P ) into bounded sets of R n and k σ ( s ) ( s , 0 ) = 0 . Here, σ ( s ) is a piecewise constant switching signal that can be constant in both cases (switching or non-switching).
Lemma 3. 
The equilibrium point at zero of system (1), whether it presents switching or non-switching behavior, is asymptotically stable provided there exist positive numbers c 1 , c 2 , c 3 and a quadratic Lyapunov function V : R n R such that
c 1 z ( s ) 2 V ( z ( s ) ) c 2 z ( s ) 2
and whenever
V ( z ( s + θ ) ) κ V ( z ( s ) ) , θ [ e 2 , 0 ] , D γ V ( z ( s ) ) c 3 z ( s ) 2 ,
where κ > 1 ; for more details see [33].

3. Observation-Based Bipartite Containment Control Analysis

In this section, we examine observation-based bipartite containment control of nonlinear FMASs with delays and disturbance in controllers for fixed signed directed networks as well as switching signed directed networks employing the common Lyapunov function approach. This is done by using the fractional Razmikhin technique, signed graph theory, and matrix transformation.

3.1. Model Building

In a fractional-order multi-agent system (FMAS) containing F followers and N F leaders, represented as F = { 1 , 2 , , F } and B = { F + 1 , F + 2 , , N } , respectively, the behavior of the followers is governed by:
D γ y i ( s ) = D y i ( s ) + p ( s , y i ( s ) ) + p 1 ( s , y i ( s e 2 ) ) + E e 1 0 y i ( s + ϕ ) d ϕ + F v i ( s ) + Δ v i ( s ) z i = G y i ( s ) i F
and the behavior of the leaders is described by
D γ y i ( s ) = D y i ( s ) + p ( s , y i ( s ) ) + p 1 ( s , y i ( s e 2 ) ) + E e 1 0 y i ( s + ϕ ) d ϕ z i = G y i ( s ) i B
Each agent i in the system is described by its state y i R n , output z i R a , and control input v i R b ; also, e 2 and e 1 are positive constants representing the communication and distributed delay, respectively. The function p : R R n is continuous and odd with respect to y i and satisfyies p ( s , 0 ) = 0 and p ( s , y i ) = p ( s , y i ) . The term p 1 is the nonlinear known function satisfying the Lipschitz condition. Matrices D, E R n × n , F R n × b , and G R a × n are constant. Furthermore, we assume that every agent can access relative output measurements of its neighboring agents and that the i t h agent belongs to the set B ; the control input v i is equal to zero.
Definition 2. 
([1]). The set δ R n is convex if, for any pair of points x 1 , x 2 in δ and any λ, where 0 < λ < 1 , the point λ x 1 + ( 1 λ ) x 2 is also in δ. The convex hull formed by a finite set of points x 1 , x 2 , , x n R n is the set of all possible convex combinations of these points and is defined as follows: it consists of all points of the form
c o { x 1 , x 2 , . . . x n } = i = 1 n λ i x i | λ i 0 , i = 1 n λ i = 1
Definition 3. 
Observation-based bipartite containment control of the FMAS described in Equations (2) and (3) is achieved if certain followers converge to the convex hull of y q for q B , while others converge to c o { y q , q B } .
Assumption 1. 
If the functions p i are Lipschitz continuous, then for each p i , there exists a constant k i > 0 such that for any vectors θ and α in R n , the condition below is satisfied:
| | p i ( s , θ ) p i ( θ , α ) | | k i | | θ α | | , i = 1 , 2 .
Assumption 2. 
The nonlinear function p complies with the following inequality: for any z , z i R n , where λ i 0 and i = 1 N F λ i = 1 , and for a given r > 0 ,
p ( s , z ) i = 1 N F λ i p ( s , z i ) r z i = 1 N F λ i z i .
Assumption 3. 
The signed digraph G exhibits structural balance.
Assumption 4. 
Each follower within the signed digraph G is connected by a directed link to at least one leader.
Remark 2. 
If Assumption 2 holds, this implies that the Lipschitz condition is fulfilled; however, the converse is not true. The condition outlined in Assumption 2 guarantees both the existence and uniqueness of the solution for a nonlinear fractional-order system under delays [34]. Assumption 4 is crucial to ensure the absence of isolated vertices, ensuring that every agent can receive information from its neighboring agent. This configuration is commonly encountered in various containment control problems [35].
Remark 3. 
If Assumption 3 holds, then the followers may be split into two separate non-overlapping subsets: F 1 and F 2 . Within each subset, agents connect cooperatively, while connections between agents from different subsets are hostile in behavior. By using Definition 3, observation-based bipartite containment control of the system defined by (2) and (3) is accomplished if the following conditions are satisfied:
lim s y i c o { y q , q B } = 0 , i F 1 , lim s y i + c o { y q , q B } = 0 , i F 2 .

3.2. Observation-Based Analysis of Bipartite Multi-Agent System for Fixed Signed Digraph

Based on the idea from the containment control protocols presented by [9,29], we introduce an observation-based bipartite containment controller for every i F . This study leverages the state, which is observed information, to enhance the system’s performance:
D γ y ^ i ( s ) = D y ^ i ( s ) + p ( s , y ^ i ( s ) ) + p 1 ( s , y ^ i ( s e 2 ) ) + E e 1 0 y ^ i ( s + ϕ ) d ϕ + F v i ( s ) + Δ v i ( s ) + μ A j = 1 F | f i j | ( z i s g n ( f i j ) z j ) j = 1 F | f i j | ( z ^ i s g n ( f i j ) z ^ j ) + j = F + 1 N | f i j | ( z i z ^ i ) ) , z ^ i = G y ^ i ( s ) i F
v i = β T j = 1 N | f i j | y ^ i ( s e 2 ) sgn ( f i j ) y ^ j ( s e 2 ) + j = F + 1 N | f i j | y ^ i ( s e 2 ) sgn ( f i j ) y j ( s e 2 ) + Δ v i ( s )
Here, y ^ i denotes the state estimate of y i for each i F , and z ^ i is the output of the observer. The parameters μ and A R n × a are the coupling strength and the gain matrix of the observer, respectively, both of which are designed; e 2 > 0 represents the input delay. Moreover, T R b × n and β represent the gain matrix and coupling constant for the controller, respectively. The term f i j refers to entries of the adjacency matrix of digraph G , and Δ v i ( s ) is the disturbance in the controller. Since v i = 0 for all i B , the Laplacian matrix L of the signed digraph G is defined as:
L = L F L B 0 ( N F ) × F 0 ( N F ) × ( N F )
where L F R F × F and L B R F × ( N F ) . If Assumption 3 is met, a diagonal matrix exists such that ψ = diag ( ψ 1 , ψ 2 , , ψ F , ψ F + 1 , , ψ N ) ; the matrix is defined by its elements as:
ψ i = 1 i f i F 1 B ψ i = 1 i f i F 2
such that
L = ψ L ψ = L ¯ F L ¯ B 0 ( N F ) × F 0 ( N F ) × ( N F )
Here, L ¯ F = [ ¯ i j ] F × F if i j ; then [ ¯ i j ] F × F is equal to | f i j | ; otherwise, it is equal to j = 1 N | f i j | . Also, L ¯ B = [ ¯ i j ] F × ( N F ) ¯ i j = | f i j | 0 for i = 1 , 2 , 3 , . . . F , j = F + 1 , . . . , N .
Lemma 4 
([1]). If Assumption 4 holds, L ¯ F is a non-singular M-matrix, and each component of L ¯ F 1 L ¯ B is nonnegative, with each row summing to 1.
Remark 4. 
Dealing with fractional-order systems is significantly more complex than handling integer-order systems [15]. Fractional-order systems have memory effects and non-locality, meaning their future states depend on their entire past history rather than just the current state. This complexity requires more advanced mathematical tools, such as fractional derivatives and integrals, which often lack closed-form solutions and require numerical methods and approximations. Analyzing the stability of fractional-order systems is more intricate and requires extensions or adaptations of traditional methods like Lyapunov functions. Controller design is also more challenging due to the need to account for fractional dynamics, demanding more sophisticated techniques. Additionally, the application of fractional-order Laplace transforms and the formulation of linear matrix inequalities (LMIs) introduce further complexities. These factors collectively make the analysis and control of fractional-order systems significantly more challenging than that of integer-order systems [21].
Theorem 1. 
Observer-based bipartite containment control of the FMAS defined by Equations (2) and (3), with the controller given in Equation (7) and under Assumptions 1, 2, 3, and 4, can be successfully realized if there exists a diagonal matrix Φ = diag ( ϕ 1 , , ϕ F ) > 0 such that Φ L F + L F T Φ > 0 along with positive definite matrices S 1 and S 2 satisfying the following set of inequalities:
( 1 r ) S 1 S 1 E E T S 1 S 1 < 0
S 1 D + D T S 1 + S 1 2 + ( k 2 + 2 ) I n + ( 1 + r e 1 ) S 1 ρ G T G S 1 S 1 I n < 0
( 1 b ) S 2 1 E S 2 1 S 2 1 E T S 2 1 < 0
D S 2 1 + S 2 1 D T + ( 1 + b e 1 ) S 2 1 + ( 2 + q ν ) I n + ω F F T ( 2 I n + S 2 1 ) 1 S 2 F F T k S 2 1 k S 2 1 I n < 0
Given the parameters ρ , ω > 0 and r , b > 1 , the observer and controller are designed with the following specifications:
  • A = S 1 1 G T
  • μ ρ ϕ max λ 1 , where:
    -
    λ 1 = λ min { Φ L ¯ F + L ¯ F }
    -
    ϕ max = max 1 j F { ϕ j }
  • T = F T S 2
  • 0 < β ω ϕ min λ 2 , where:
    -
    λ 2 = λ max { L ¯ F T Φ L ¯ F }
    -
    ϕ min = min 1 j F { ϕ j }
Proof. 
First, we define the observed state y i ^ and the state y i for each i F using Equations (2), (6) and (7):
D γ y i ( s ) = D y i ( s ) + p ( s , y i ( s ) ) + p 1 ( s , y i ( s e 2 ) ) + E e 1 0 y i ( s + ϕ ) d ϕ β F T j = 1 N | f i j | y ^ i ( s e 2 ) sgn ( f i j ) y ^ j ( s e 2 ) + j = F + 1 N | f i j | y ^ i ( s e 2 ) sgn ( f i j ) y j ( s e 2 ) + 2 Δ v i ( s ) D γ y ^ i ( s ) = D y ^ i ( s ) + p ( s , y ^ i ( s ) ) + p 1 ( s , y ^ i ( s e 2 ) ) + E e 1 0 y ^ i ( s + ϕ ) d ϕ β F T j = 1 N | f i j | y ^ i ( s e 2 ) sgn ( f i j ) y ^ j ( s e 2 ) + j = F + 1 N | f i j | y ^ i ( s e 2 ) sgn ( f i j ) y j ( s e 2 ) + 2 Δ v i ( s ) + μ A j = 1 F | f i j | ( z i s g n ( f i j ) z j ) j = 1 F | f i j | ( z ^ i s g n ( f i j ) z ^ j ) + j = F + 1 F | f i j | ( z i z j ^ )
Consider the coordinate transformation x i = ψ i y i and x ^ i = ψ i y ^ i , where ψ i = 1 for i F 1 B , and ψ i = 1 for i B 2 . Hence, we can obtain
D γ x i ( s ) = D x i ( s ) + p ( s , x i ( s ) ) + p 1 ( s , x i ( s e 2 ) ) + E e 1 0 x i ( s + ϕ ) d ϕ β F T ψ i ( j = 1 N | f i j | ψ i x ^ i ( s e 2 ) sgn ( f i j ) ψ j x ^ j ( s e 2 ) + j = F + 1 N | f i j | ( ψ i x ^ i ( s e 2 ) sgn ( f i j ) ψ j x j ( s e 2 ) ) ) + 2 Δ v i ( s ) , i F
D γ x ^ i ( s ) = D x ^ i ( s ) + p ( s , x ^ i ( s ) ) + p 1 ( s , x ^ i ( s e 2 ) ) + E e 1 0 x ^ i ( s + ϕ ) d ϕ β F T ψ i j = 1 N | f i j | ψ i x ^ i ( s e 2 ) sgn ( f i j ) ψ j x ^ j ( s e 2 ) + j = F + 1 N | f i j | ψ i x ^ i ( s e 2 ) sgn ( f i j ) ψ j x j ( s e 2 ) + μ A G ψ i j = 1 F | f i j | ψ i ( x i s g n ( f i j ) ψ j x j ) j = 1 F | f i j | ( ψ i x ^ i s g n ( f i j ) ψ j x ^ j ) + j = F + 1 F | f i j | ( ψ i x i ψ j x j ^ ) + 2 Δ v i ( s ) , i F
D γ x i ( s ) = D x i ( s ) + p ( s , x i ( s ) ) + p 1 ( s , x i ( s e 2 ) ) + E e 1 0 x i ( s + ϕ ) d ϕ i B
Let X F ( s ) = ( x 1 T ( s ) , x 2 T ( s ) , , x F T ( s ) ) T ; X B ( s ) = ( x F + 1 T ( s ) , x F + 2 T ( s ) , , x N T ( s ) ) T ;
P ( s , X F ) = ( p T ( s , x 1 ) , p T ( s , x 2 ) , , p T ( s , x F ) ) T ; P ( s , X B ) = ( p T ( s , x F + 1 ) , p T ( s , x F + 2 ) , , p T ( s , x N ) ) T
X ^ F ( s ) = ( x ^ 1 T ( s ) , x ^ 2 T ( s ) , , x ^ F T ( s ) ) T ; P ( s , X ^ F ) = ( p T ( s , x ^ 1 ) , p T ( s , x ^ 2 ) , , p T ( s , x ^ F ) ) T ;
P 1 ( s , X F ( s e 2 ) = ( p 1 T ( s , x 1 ( s e 2 ) ) , p 1 T ( s , x 2 ( s e 2 ) , , p T ( s , x F ( s e 2 ) ) T ;
P 1 ( s , X B ( s e 2 ) = ( p 1 T ( s , x F + 1 ( s e 2 ) ) , p 1 T ( s , x F + 1 ( s e 2 ) , , p T ( s , x N ( s e 2 ) ) T ;
P 1 ( s , X ^ F ( s e 2 ) = ( p 1 T ( s , x ^ 1 ( s e 2 ) ) , p 1 T ( s , x ^ 2 ( s e 2 ) , , p T ( s , x ^ F ( s e 2 ) ) T ;
From Equations (12)–(14), we derive the following results:
D γ X F = ( I F D ) X F + P ( s , X F ) + P 1 ( s , X F ( s e 2 ) ) + e 1 0 ( I F E ) X F ( s + ϕ ) d ϕ ( L ¯ F β F T ) X ^ F ( s e 2 ) ( L ¯ B β F T ) X B ( s e 2 ) + 2 Δ v i ( s )
D γ X ^ F = ( I F D ) X ^ F + P ( s , X ^ F ) + P 1 ( s , X ^ F ( s e 2 ) ) + e 1 0 ( I F E ) X ^ F ( s + ϕ ) d ϕ ( L ¯ F β F T ) X ^ F ( s e 2 ) ( L ¯ B β F T ) X B ( s e 2 ) + ( L ¯ F μ A G ) X F ( L ¯ F μ A G ) X ^ F + 2 Δ v i ( s )
D γ X B = ( I N F D ) X B + P ( s , X B ) + P 1 ( s , X B ( s e 2 ) ) + e 1 0 ( I N F E ) X B ( s + ϕ ) d ϕ
Let observation error α 1 ( . ) = X ^ F ( . ) X F ( . ) and bipartite containment control error α 2 ( . ) = X F ( . ) ( L ¯ F 1 L ¯ B I n ) X B ( . ) ; one has
D γ α 1 = ( I F D ) α 1 + P ( s , X ^ F ) P ( s , X F ) + P 1 ( s , X ^ F ( s e 2 ) ) P 1 ( s , X F ( s e 2 ) ) e 1 0 ( I F E ) α 1 ( s + ϕ ) d ϕ ( L ¯ F μ A G ) α 1 .
D γ α 2 = ( I F D ) X F + ( L ¯ F 1 L ¯ B D ) X B + P ( s , X F ) + ( L ¯ F 1 L ¯ B I n ) P ( s , X B ) + P 1 ( s , X F ( s e 2 ) ) + ( L ¯ F 1 L ¯ B I n ) P 1 ( s , X B ( s e 2 ) ) + e 1 0 ( I F E ) X F ( s + ϕ ) d ϕ + e 1 0 ( L ¯ F 1 L ¯ B E ) X B ( s + ϕ ) d ϕ ( L ¯ F β F T ) X ^ F ( s e 2 ) + ( L ¯ F β F T ) X F ( s e 2 ) ( L ¯ F β F T ) X F ( s e 2 ) ( L ¯ B β F T ) X F ( s e 2 ) + 2 Δ v i ( s ) .
D γ α 2 = ( I F D ) α 2 + + P ( s , X F ) + ( L ¯ F 1 L ¯ B I n ) P ( s , X B ) + P 1 ( s , X F ( s e 2 ) ) + ( L ¯ F 1 L ¯ B I n ) P 1 ( s , X B ( s e 2 ) ) + e 1 0 ( I F E ) α 2 ( s + ϕ ) d ϕ ( L ¯ F β F T ) α 1 ( s e 2 ) ( L ¯ F β F T ) α 2 ( s e 2 ) + 2 Δ v i ( s )
Let α ( . ) = [ α 1 T ( . ) , α 2 T ( . ) ] T represent the error system and
D γ α = R 1 α + P ¯ ( s , α ) + P ¯ 1 ( s , α ( s e 2 ) ) + R 2 α ( s e 2 ) + e 1 0 R 3 α ( s + ϕ ) d ϕ + 2 Δ v i ( s ) ,
where
R 1 = ( I F D ) ( L ¯ F μ A G ) 0 0 I F D ; R 2 = 0 0 L ¯ F β F T L ¯ F β F T ;
R 3 = I F E 0 0 I F E ;
P ¯ ( s , α ) = P ( s , X ^ F ) P ( s , X F ) P ( s , X F ) + ( L ¯ F 1 L ¯ B I n ) P ( s , X B ) ,
P ¯ 1 ( s , α ( s e 2 ) = P 1 ( s , X ^ F ( s e 2 ) P 1 ( s , X F ( s e 2 ) P 1 ( s , X F ( s e 2 ) + ( L ¯ F 1 L ¯ B I n ) P 1 ( s , X B ( s e 2 ) .
Let us delve into the asymptotic stability analysis of the error system (21). Given that L ¯ F is a non-singular M-matrix according to Lemma 4, then there exists a positive definite diagonal matrix Φ = diag ( ϕ 1 , ϕ 2 , , ϕ F ) such that Φ L ¯ F + L ¯ F T Φ > 0 . With this in mind, let us formulate the following Lyapunov function:
V ( α ( s ) ) = V 1 ( α 1 ( s ) ) + V 2 ( α 2 ( s ) ) = α 1 T ( Φ S 1 ) α 1 + α 2 T ( η Φ S 2 ) α 2
where η > 0 is very small scalar.
Remark 5. 
Our method extends traditional Lyapunov techniques, which typically rely on a single positive definite matrix P. Instead of using P, we introduce a matrix Φ with a structured diagonal form, offering greater versatility and adaptability to various system dynamics. Recent research on adaptive and robust control also supports the use of structured Lyapunov functions [29]. Our approach aligns with these recent advancements, as it provides a structured yet adaptable framework to guarantee stability even when dealing with changing system parameters.
It follows from Lemma 1 that
D γ V 1 ( α 1 ( s ) ) = D γ [ α 1 T ( Φ S 1 ) α 1 ] 2 α 1 T ( Φ S 1 ) [ D γ α 1 ] 2 α 1 T ( Φ S 1 ) [ ( I F D L ¯ F μ A G ) α 1 + P ( s , X ^ F ) P ( s , X F ) + P 1 ( s , X ^ F ( s e 2 ) ) P 1 ( s , X F ( s e 2 ) ) + e 1 0 ( I F E ) α 1 ( s + ϕ ) d ϕ ] = α 1 T Φ ( S 1 D + D T S 1 ) ( Φ L ¯ F μ S 1 A G ) ( L ¯ F T Φ μ G T A T S 1 ) α 1 + 2 α 1 T ( Φ S 1 ) P ( s , X ^ F ) P ( s , X F ) + 2 α 1 T ( Φ S 1 ) P 1 ( s , X ^ F ( s e 2 ) ) P 1 ( s , X F ( s e 2 ) ) + e 1 0 2 α 1 T ( Φ S 1 E ) α 1 ( s + ϕ ) d ϕ
Notice that
2 α 1 T ( Φ S 1 ) P ( s , X ^ F ) P ( s , X F ) = i = 1 F 2 ϕ i α 1 i T S 1 [ p ( s , x ^ i ) p ( s , x i ) ] ;
one has from Assumption 2 and Lemma 2
2 ϕ i α 1 i T S 1 [ p ( s , x ^ i ) p ( s , x i ) ] ϕ i α 1 i T S 1 2 α 1 i + ( p ( s , x ^ i ) p ( s , x i ) ) T p ( s , x ^ i ) p ( s , x i ) ϕ i α 1 i T S 1 α 1 i 2 + k 2 α 1 i T α 1 i
Due to α 1 T Φ ( S 1 2 + k 2 I n ) α 1 = i = 1 F ϕ i α 1 i T S 1 2 α 1 i + k 2 α 1 i T α 1 i , we can derive that
2 α 1 T ( Φ S 1 ) P ( s , X ^ F ) P ( s , X F ) α 1 T Φ ( S 1 2 + k 2 I n α 1
2 α 1 T ( Φ S 1 ) P 1 ( s , X ^ F ( s e 2 ) P 1 ( s , X F ( s e 2 ) = i = 1 F 2 ϕ i α 1 i T S 1 [ p 1 ( s , x ^ i ( s e 2 ) p 1 ( s , x i ( s e 2 ) ] ,
using Assumption 1 and Lemma 2, we have
2 ϕ i α 1 i T S 1 [ p 1 ( s , x ^ i ( s e 2 ) p 1 ( s , x i ( s e 2 ) ] ϕ i [ α 1 i T S 1 2 α 1 i + ( p 1 ( s , x ^ i ( s e 2 ) p 1 ( s , x i ( s e 2 ) ) T p 1 ( s , x ^ i ( s e 2 ) p 1 ( s , x i ( s e 2 ) ] ϕ i α 1 i T S 1 α 1 i 2 + 2 α 1 i ( s e 2 ) T α 1 i ( s e 2 )
Due to
α 1 T ( s ) Φ S 1 2 α 1 ( s ) + α 1 T ( s e 2 ) Φ 2 I n α 1 ( s e 2 ) = i = 1 F ϕ i α 1 i T S 1 2 α 1 i + 2 α 1 i T ( s e 2 ) α 1 i ( s e 2 ) ,
we can derive that
2 α 1 T ( Φ S 1 ) P 1 ( s , X ^ F ( s e 2 ) P 1 ( s , X F ( s e 2 ) α 1 T ( s ) Φ S 1 2 α 1 ( s ) + α 1 T ( s e 2 ) Φ 2 I n α 1 ( s e 2 )
By (23)–(25), we have
D γ V 1 α 1 T Φ ( S 1 D + D T S 1 + 2 S 1 2 + k 2 I n ) ( Φ L ¯ F μ S 1 A G ) ( L ¯ F T Φ μ G T A T S 1 ) α 1 + α 1 T ( s e 2 ) Φ 2 I n α 1 ( s e 2 ) + e 1 0 2 α 1 T ( Φ S 1 E ) α 1 ( s + ϕ ) d ϕ
Substituting the gain matrix A = S 1 T G T into the above equation yields
D γ V 1 α 1 T Φ ( S 1 D + D T S 1 + 2 S 1 2 + k 2 I n ) μ ( Φ L ¯ F + L ¯ F T Φ ) G T G α 1 + α 1 T ( s e 2 ) Φ 2 I n α 1 ( s e 2 ) + e 1 0 2 α 1 T ( Φ S 1 E ) α 1 ( s + ϕ ) d ϕ
Now, we utilize the fractional Razumikhin technique on Equation (26). Notice that
2 α 1 T ( Φ S 1 E ) α 1 ( s + ϕ ) = 2 α 1 T ( I F S 1 E ) ( Φ 1 2 S 1 1 2 ) ( Φ 1 2 S 1 1 2 ) α 1 ( s + ϕ ) α 1 T ( I F S 1 E ) ( Φ 1 2 S 1 1 2 ) ( Φ 1 2 S 1 1 2 ) ( I F E T S 1 ) α 1 α 1 T ( s + ϕ ) ( Φ 1 2 S 1 1 2 ) ( Φ 1 2 S 1 1 2 ) α 1 ( s + ϕ ) = α 1 T Φ S 1 E S 1 1 E T S 1 α 1 + α 1 T ( s + ϕ ) ( Φ S 1 ) α 1 ( s + ϕ ) , ϕ [ e 1 , 0 ]
For some κ > 1 , whenever V 1 ( s + h ) κ V 1 ( s ) , h [ e 1 , 0 ] . That is,
α 1 T ( s + h ) ( Φ S 1 ) α 1 ( s + h ) κ α 1 T ( Φ S 1 ) α 1 ; h [ e 1 , 0 ] .
When we substitute (27) and (28) into Equation (26), then for a suitably small δ > 0 , the value of κ equals 1 + δ , and we have following result:
D γ V 1 α 1 T Φ S 1 D + D T S 1 + 2 S 1 2 + k 2 I n ) + S 1 E S 1 1 E T S 1 + S 1 e 1 μ ( Φ L ¯ F + L ¯ F T Φ ) G T G α 1 + α 1 T ( s e 2 ) Φ 2 I n α 1 ( s e 2 )
Denote λ 1 = λ m i n { Φ L ¯ F + L ¯ F T Φ } , ϕ m a x = m a x 1 F { ϕ j } ; the following inequality with μ ρ ϕ m a x λ 1 and ρ > 0 holds:
D γ V 1 α 1 T Φ S 1 D + D T S 1 + 2 S 1 2 + k 2 I n ) + S 1 E S 1 1 E T S 1 + S 1 e 1 ρ G T G α 1 + α 1 T ( s e 2 ) Φ 2 I n α 1 ( s e 2 ) = α 1 T ( Φ Λ 1 ) α 1 + α 1 T ( s e 2 ) Φ 2 I n α 1 ( s e 2 )
Now, again from Lemma 1,
D γ V 2 ( s ) = D γ [ α 2 T ( η Φ S 2 ) α 2 ] 2 α 2 T ( η Φ S 2 ) [ D γ α 2 ] = 2 α 2 T ( η Φ S 2 ) [ ( I F D ) α 2 + P ( s , X F ) + ( L ¯ F 1 L ¯ B I n ) P ( s , X B ) + P 1 ( s , X F ( s e 2 ) ) + ( L ¯ F 1 L ¯ B I n ) P 1 ( s , X B ( s e 2 ) ) + e 1 0 ( I F E ) α 2 ( s + ϕ ) d ϕ ( L ¯ F β F T ) α 1 ( s e 2 ) ( L ¯ F β F T ) α 2 ( s e 2 ) + 2 Δ v i ( s ) ]
By simplifying the above equation, we have
D γ V 2 ( α 2 ( s ) ) = α 2 T η Φ ( S 2 D + D T S 2 ) α 2 + 2 α 2 T ( η Φ S 2 ) [ P ( s , X F ) + ( L ¯ F 1 L ¯ B I n ) P ( s , X B ) ] + 2 α 2 T ( η Φ S 2 ) [ P 1 ( s , X F ( s e 2 ) ) + ( L ¯ F 1 L ¯ B I n ) P 1 ( s , X B ( s e 2 ) ) ] + e 1 0 2 α 2 T ( η Φ S 2 E ) α 2 ( s + ϕ ) d ϕ 2 α 2 T ( η Φ S 2 ) ( L ¯ F β F T ) α 1 ( s e 2 ) 2 α 2 T ( η Φ S 2 ) ( L ¯ F β F T ) α 2 ( s e 2 ) + 4 α 2 T ( η Φ S 2 ) Δ v i ( s )
Let L ¯ F 1 L ¯ B = [ ¯ i j ] F × ( N F ; then
2 α 2 T ( η Φ S 2 ) [ P ( s , X F ) + ( L ¯ F 1 L ¯ B I n ) P ( s , X B ) ] = i = 1 F 2 ϕ i α 2 i T S 2 [ p ( s , x i ) j = 1 N F ¯ i j p ( s , x F + j ) ] .
From Assumption 2 and Lemma 2, we have
2 η ϕ i α 2 i T S 2 [ p ( s , x i ) j = 1 N F ¯ i j p ( s , x F + j ) ] η ϕ i [ α 2 i T S 2 2 α 2 i + p ( s , x i ) j = 1 N F ¯ i j p ( s , x F + j ) T p ( s , x i ) j = 1 N F ¯ i j p ( s , x F + j ) ] η ϕ i [ α 2 i T S 2 2 α 2 i + k 2 α 2 i T α 2 i ]
Due to
α 2 T [ η Φ ( S 2 2 + K 2 I n ) ] α 2 = i = 1 F η ϕ i [ α 2 i T S 2 2 α 2 i + k 2 α 2 i T α 2 i ]
we can derive that
2 α 2 T ( η Φ S 2 ) [ P ( s , X F ) + ( L ¯ F 1 L ¯ B I n ) P ( s , X B ) ] α 2 T [ η Φ ( S 2 + k 2 I n ) ] α 2
Also, we have
2 α 2 T ( η Φ S 2 ) [ P ( s , X F ) + ( L ¯ F 1 L ¯ B I n ) P ( s , X B ) ] = i = 1 F 2 ϕ i α 2 i T S 2 [ p ( s , x i ) j = 1 N F ¯ i j p ( s , x F + j ) ] ,
Again, by using Assumption 1 and Lemma 2, we have
2 η ϕ i α 2 i T S 2 [ p 1 ( s , x i ( s e 2 ) ) j = 1 N F ¯ i j p 1 ( s , x F + j ( s e 2 ) ) ] η ϕ i [ α 2 i T S 2 2 α 2 i + p 1 ( s , x i ( s e 2 ) ) j = 1 N F ¯ i j p 1 ( s , x F + j ( s e 2 ) ) T × p 1 ( s , x i ( s e 2 ) ) j = 1 N F ¯ i j p 1 ( s , x F + j ( s e 2 ) ) η ϕ i [ α 2 i T S 2 2 α 2 i + 2 α 2 i ( s e 2 ) T α 2 i ( s e 2 ) ]
Due to
α 2 T ( η Φ S 2 2 ) α 2 + α 2 T ( s e 2 ) ( η Φ 2 I n ) α 2 ( s e 2 ) = i = 1 F η ϕ i [ α 2 i T S 2 2 α 2 i + 2 α 2 i T ( s e 2 ) α 2 i ( s e 2 ) ]
we can derive that
2 α 2 T ( η Φ S 2 ) [ P 1 ( s , X F ( s e 2 ) ) + ( L ¯ F 1 L ¯ B I n ) P 1 ( s , X B ( s e 2 ) ) ] α 2 T ( η Φ S 2 2 ) α 2 + α 2 T ( s e 2 ) ( η Φ 2 I n ) α 2 ( s e 2 )
By (30), (31), and (33),
D γ V 2 ( α 2 ( s ) ) α 2 T η Φ ( S 2 D + D T S 2 + 2 S 2 2 + k 2 I n ) α 2 + e 1 0 2 α 2 T ( η Φ S 2 E ) α 2 ( s + ϕ ) d ϕ 2 α 2 T ( η Φ S 2 ) ( L ¯ F β F T ) α 1 ( s e 2 ) 2 α 2 T ( η Φ S 2 ) ( L ¯ F β F T ) α 2 ( s e 2 ) + α 2 T ( s e 2 ) ( η Φ 2 I n ) α 2 ( s e 2 ) + 4 α 2 T ( η Φ S 2 ) Δ v i ( s )
To simplify (29) and (34), we define
Q 1 ( . ) = ( I F S 2 ) α 1 ( . )
Q 2 ( . ) = ( I F S 2 ) α 2 ( . )
Q ( . ) = ( I 2 F S 2 ) α ( . )
By applying the above condition on Equation (29), we have
D γ V 1 ( α 1 ( s ) ) Q 1 Φ S 2 1 Λ 1 S 2 1 Q 1 + Q 1 T ( s e 2 ) ( Φ S 2 1 2 I n S 2 1 ) Q 1 ( s e 2 )
and also, from (34), we have
D γ V 2 Q 2 T η Φ ( D S 2 1 + S 2 1 D T + 2 I n + k 2 S 2 2 ) Q 2 e 1 0 Q 2 T ( η Φ E S 2 1 ) Q 2 ( s + ϕ ) d ϕ 2 Q 2 T ( η Φ L ¯ F β F T S 2 1 ) Q 2 ( s e 2 ) 2 Q 2 T ( η Φ L ¯ F β F T S 2 1 ) Q 1 ( s e 2 ) + Q 2 T ( s e 2 ) ( η Φ 2 S 2 2 ) Q 2 ( s e 2 ) + 4 Q 2 T ( η Φ I n ) Δ v i ( s )
Substituting the gain matrix T = F T S 2 into (36), we have
D γ V 2 Q 2 T η Φ ( D S 2 1 + S 2 1 D T + 2 I n + k 2 S 2 2 ) Q 2 e 1 0 Q 2 T ( η Φ E S 2 1 ) Q 2 ( s + ϕ ) d ϕ 2 Q 2 T ( η Φ L ¯ F β F F T S 2 1 ) Q 2 ( s e 2 ) 2 Q 2 T ( η Φ L ¯ F β F F T S 2 1 ) Q 1 ( s e 2 ) + Q 2 T ( s e 2 ) ( η Φ 2 S 2 2 ) Q 2 ( s e 2 ) + 4 Q 2 T ( η Φ I n ) Δ v i ( s )
Now, from (35) and (37), we have
D γ V ( α ( s ) ) = D γ V 1 ( α 1 ( s ) ) + D γ V 2 ( α 2 ( s ) ) Q 1 Φ S 2 1 Λ 1 S 2 1 Q 1 + Q 1 T ( s e 2 ) ( Φ 2 S 2 2 Q 1 ( s e 2 ) + Q 2 T η Φ ( D S 2 1 + S 2 1 D T + 2 I n + k 2 S 2 2 ) Q 2 e 1 0 Q 2 T ( η Φ E S 2 1 ) Q 2 ( s + ϕ ) d ϕ 2 Q 2 T ( η Φ L ¯ F β F F T ) Q 2 ( s e 2 ) 2 Q 2 T ( η Φ L ¯ F β F F T ) Q 1 ( s e 2 ) + Q 2 T ( s e 2 ) ( η Φ 2 S 2 2 ) Q 2 ( s e 2 ) + 4 Q 2 T ( η Φ I n ) Δ v i ( s )
For some κ > 0 , whenever
V 1 ( s + h ) κ V 1 ( s ) , V 2 ( s + h ) κ V 2 ( s ) , h [ e 3 , 0 ] ,
where e 3 = m a x { e 1 , e 2 } , then we can derive
D γ V ( α ( s ) ) Q 1 Φ S 2 1 Λ 1 S 2 1 Q 1 + Q 1 T ( s e 2 ) ( Φ 2 S 2 1 S 2 1 ) Q 1 ( s e 2 ) + Q 2 T η Φ ( D S 2 1 + S 2 1 D T + 2 I n + k 2 S 2 2 ) Q 2 e 1 0 2 Q 2 T ( η Φ E S 2 1 ) Q 2 ( s + ϕ ) + κ Q 2 T ( η ϕ S 2 1 ) Q 2 Q 2 T ( s + ϕ ) ( η Φ S 2 1 ) Q 2 ( s + ϕ ) d ϕ 2 Q 2 T ( η Φ L ¯ F β F F T ) Q 2 ( s e 2 ) + κ Q 1 T ( ϕ S 2 1 S 1 S 2 1 ) Q 1 + κ Q 2 T ( η Φ S 2 1 ) Q 2 Q 1 T ( s e 2 ) ( ϕ S 2 1 S 1 S 2 1 ) Q 1 ( s e 2 ) Q 2 T ( s e 2 ) ( η Φ S 2 1 ) Q 2 ( s e 2 ) 2 Q 2 T ( η Φ L ¯ F β F F T ) Q 1 ( s e 2 ) + Q 2 T ( s e 2 ) ( η Φ 2 S 2 2 ) Q 2 ( s e 2 ) + 4 Q 2 T ( η Φ I n ) Δ v i ( s )
Let κ 1 + ; one has for some b > 1
D γ V ( α ( s ) ) Q 1 Φ S 2 1 ( Λ 1 + S 1 ) S 2 1 Q 1 + Q 1 T ( s e 2 ) ( Φ S 2 1 ( 2 I n + S 1 ) S 2 1 ) Q 1 ( s e 2 ) + Q 2 T η Φ ( D S 2 1 + S 2 1 D T + 2 I n + k 2 S 2 2 + ( 1 + b e 1 ) S 2 1 Q 2 e 1 0 2 Q 2 T ( η Φ E S 2 1 ) Q 2 ( s + ϕ ) + Q 2 T ( η ϕ ( 1 b ) S 2 1 ) Q 2 Q 2 T ( s + ϕ ) ( η Φ S 2 1 ) Q 2 ( s + ϕ ) d ϕ 2 Q 2 T ( η Φ L ¯ F β F F T ) Q 2 ( s e 2 ) Q 2 T ( s e 2 ) ( η Φ S 2 1 ( 2 + S 2 1 ) ) Q 2 ( s e 2 ) 2 Q 2 T ( η Φ L ¯ F β F F T ) Q 1 ( s e 2 ) + Q 2 T ( s e 2 ) ( η Φ 2 S 2 2 ) Q 2 ( s e 2 ) + 4 Q 2 T ( η Φ I n ) Δ v i ( s )
Inequality (10) implies
Q 2 T Q 2 T ( s + ϕ ) η Φ ( 1 b ) S 2 1 η Φ E S 2 1 η Φ S 2 1 E T η Φ S 2 1 Q 2 Q 2 ( s + ϕ ) < 0
Then
e 1 0 2 Q 2 T ( η Φ E S 2 1 ) Q 2 ( s + ϕ ) + Q 2 T ( η ϕ ( 1 b ) S 2 1 ) Q 2 Q 2 T ( s + ϕ ) ( η Φ S 2 1 ) Q 2 ( s + ϕ ) d ϕ < 0
Substituting (42) into (41), we have
D γ V ( α ( s ) ) Q 1 Φ S 2 1 ( Λ 1 + S 1 ) S 2 1 Q 1 + Q 1 T ( s e 2 ) ( Φ S 2 1 ( 2 I n + S 1 ) S 2 1 ) Q 1 ( s e 2 ) + Q 2 T η Φ ( D S 2 1 + S 2 1 D T + 2 I n + k 2 S 2 2 + ( 1 + b e 1 ) S 2 1 Q 2 Q 2 T ( η Φ L ¯ F β F F T ) Q 2 ( s e 2 ) Q 2 T ( s e 2 ) ( η Φ L ¯ F β F F T ) Q 2 Q 2 T ( s e 2 ) ( η Φ S 2 1 ( 2 I n + S 2 1 ) ) Q 2 ( s e 2 ) Q 2 T ( η Φ L ¯ F β F F T ) Q 1 ( s e 2 ) Q 1 ( s e 2 ) T ( η Φ L ¯ F β F F T ) Q 2 + 4 Q 2 T ( η Φ I n ) Δ v i ( s )
Now, let J = ( Q T , Q T ( s e 2 ) ) , where Q ( . ) = ( I 2 F S 2 ) α ( . ) . Also let Λ 2 = D S 2 1 + S 2 1 D T + 2 I n + k 2 S 2 2 + ( 1 + b e 1 ) S 2 1 , ν = Q 2 , and q = 4 Δ v i ( s ) . We can reduce the above equation in the following matrix:
J T Φ S 2 1 ( Λ 1 + S 1 ) S 2 1 0 0 0 0 η Φ ( Λ 2 + q ν I n ) η Φ L ¯ F β F F T η Φ L ¯ F β F F T 0 η L ¯ F Φ β F F T Φ S 2 1 ( 2 I n + S 1 ) S 2 1 0 0 η L ¯ F Φ β F F T 0 η Φ S 2 1 ( 2 I n + S 2 1 ) J J T λ 3 J = α T ( s ) α T ( s e 2 ) ( I 4 F S 2 ) Λ 3 ( I 4 F S 2 ) α ( s ) α ( s e 2 )
Let
U 1 η Φ ( Λ 2 + q ν I n ) η Φ L ¯ F β F F T η Φ L ¯ F β F F T η L ¯ F Φ β F F T Φ S 2 1 ( 2 I n + S 1 ) S 2 1 0 η L ¯ F Φ β F F T 0 η Φ S 2 1 ( 2 I n + S 2 1 )
Then there is an invertible matrix
W = 0 I F I n 0 I F I n 0 0 0 0 I F I n
that is used as
W 1 U 1 W = Φ S 2 1 ( 2 I n + S 1 ) S 2 1 η L ¯ F Φ β F F T 0 η Φ L ¯ F β F F T η Φ ( Λ 2 + q ν I n ) η Φ L ¯ F β F F T 0 η L ¯ F Φ β F F T η Φ S 2 1 ( 2 I n + S 2 1 ) U 2 .
From Equations (44) and (45), one can easily say that matrices U 1 and U 2 are similar matrices and have the same eigenvalues. Now, we divide matrix U 2 into matrix
Φ S 2 1 ( 2 I n + S 1 ) S 2 1 η C 1 T η C 1 η C 2
where matrices C 1 and C 2 are defined as
C 1 = Φ L ¯ F β F F T 0 , C 2 Φ ( Λ 2 + q ν I n ) Φ L ¯ F β F F T L ¯ F Φ β F F T Φ S 2 1 ( 2 I n + S 2 1 )
Next, we have to prove that U 2 is less than zero. Since by Lemma 4, L ¯ F is invertible,
for any non - zero vector x ( L ¯ F x ) T Φ L ¯ F x = x T ( L ¯ F T Φ L ¯ F ) x > 0 L ¯ F T Φ L ¯ F > 0
Suppose that 0 < β ω ϕ m i n λ 2 , where λ 2 = λ m a x { L ¯ F T Φ L ¯ F T } , ϕ m i n = m i n 1 j F { ϕ j } ,
Φ Λ 2 + q ν I n L ¯ F T Φ L ¯ F β 2 F F T ( 2 I n + S 2 1 ) 1 S 2 F F T Φ Λ 2 + q ν I n + λ 2 ϕ m i n β 2 F F T ( 2 I n + S 2 1 ) 1 S 2 F F T Φ Λ 2 + q ν I n + ω F F T ( 2 I n + S 2 1 ) 1 S 2 F F T
From (11) Λ 2 + q ν I n + ω F F T ( 2 I n + S 2 1 ) 1 S 2 F F T < 0 ; hence, Φ Λ 2 + q ν I n L ¯ F T Φ L ¯ F β 2 F F T ( 2 I n + S 2 1 ) 1 S 2 F F T > 0 , which implies that C 2 > 0 .
Now, by choosing a small scalar η > 0 such that
Φ S 2 1 ( 2 I n + S 1 ) S 2 1 + η C 1 C 2 1 C 1 < 0
U 2 < 0 ; hence, we proved that U 1 < 0 . As a result Λ 1 + S 1 < 0 and U 1 < 0 from (8)–(11). Hence,
Λ 3 = Φ S 2 1 ( Λ 1 + S 1 ) S 2 1 0 0 U 1 < 0
Then, from (43), D γ V ( α ( s ) ) < 0 . Hence, there exists a scalar κ > 0 such that
D γ V ( α ( s ) ) κ | | α ( s ) | | 2 .
Based on Lemma 3, it can be concluded that lim s α = 0 , indicating that the zero solutions of systems (18) and (21) are asymptotically stable. As a result, observer-based bipartite containment control of the FMAS described by Equations (2) and (3) with the delayed controller (7) is achieved. □

4. Observation-Based Analysis of Bipartite Containment Control for Switching Signed Digraph

Firstly, some important preliminaries on switching signed digraphs are introduced. Let σ : [ s 0 , ) T = { 1 , 2 , , M } be a piecewise switching signal, and let G σ ( s ) = ( N , E σ ( s ) ) show a switching signed digraph. When σ ( s ) = t T for s [ s g , s g + 1 ) , where s g is a switching instant, the t-th topology is activated. Suppose that there is an arbitrarily small Ξ such that s g + 1 s g Ξ for all s g and q g Z + { 0 } to avoid Zeno behavior. The matrices F σ ( s ) = [ f i j σ ( s ) ] N × N and L σ ( s ) = [ i j σ ( s ) ] N × N are called the adjacency matrices and Laplacian matrices of G σ ( s ) , respectively. For any σ ( s ) = w T , it holds that G w = G . Next, we propose the following state observer and observation-based switching controller for each i F .
D γ y ^ i ( s ) = D y ^ i ( s ) + p ( s , y ^ i ( s ) ) + p 1 ( s , y ^ i ( s e 2 ) ) + E e 1 0 y ^ i ( s + ϕ ) d ϕ + F v i ( s ) + Δ v i ( s ) + μ A j = 1 F | f i j σ ( s ) | ( z i s g n ( f i j σ ( s ) ) z j ) j = 1 F | f i j σ ( s ) | ( z ^ i s g n ( f i j σ ( s ) ) z ^ j ) + j = F + 1 N | f i j σ ( s ) | ( z i z ^ i ) ) , z ^ i = G y ^ i ( s ) i F
v i = β T j = 1 N | f i j σ ( s ) | y ^ i ( s e 2 ) sgn ( f i j σ ( s ) ) y ^ j ( s e 2 ) + j = F + 1 N | f i j σ ( s ) | y ^ i ( s e 2 ) sgn ( f i j σ ( s ) ) y j ( s e 2 ) + Δ v i ( s )
Assumption 5. 
The signed digraph G σ ( s ) exhibits structural balance for any σ ( s ) T .
Assumption 6. 
Every follower in the signed digraph G σ ( s ) has a directed link from at least one leader for any σ ( s ) T .
Remark 6. 
Since v i = 0 for all i B , the Laplacian matrix L of the signed digraph G σ ( s ) for some σ ( s ) T is defined as:
L σ ( s ) = L F σ ( s ) L B σ ( s ) 0 ( N F ) × F 0 ( N F ) × ( N F )
Here, L F σ ( s ) R F × F and L B σ ( s ) R F × ( N F ) . If Assumption 5 is met, a diagonal matrix exists such that ψ = diag ( ψ 1 , ψ 2 , , ψ F , ψ F + 1 , , ψ N ) for which the elements are defined as
ψ i = 1 i f i F 1 B ψ i = 1 i f i F 2
such that
L ¯ σ ( s ) = ψ L σ ( s ) ψ = L ¯ F σ ( s ) L ¯ B σ ( s ) 0 ( N F ) × F 0 ( N F ) × ( N F )
where L ¯ F σ ( s ) = [ ¯ i j σ ( s ) ] F × F if i j then [ ¯ i j σ ( s ) ] F × F is equal to | f i j σ ( s ) | otherwise it is equal to j = 1 N | f i j σ ( s ) | , also L ¯ B σ ( s ) = [ ¯ i j σ ( s ) ] F × ( N F ) ¯ i j σ ( s ) = | f i j σ ( s ) | 0 for i = 1 , 2 , 3 , . . . F , j = F + 1 , . . . , N
Lemma 5. 
([1]). If Assumption 6 holds, then for any σ ( s ) T L ¯ F σ ( s ) , is a non-singular M-matrix, and every element of - L ¯ F σ ( s ) 1 L ¯ B σ ( s ) is nonnegative, with each row summing to 1.
Theorem 2. 
Observer-based bipartite containment control of FMAS (2) and (3) with controller (48) under Assumptions 1, 2, 5, and 6 is successfully realized if there exists a diagonal matrix Φ = diag ( ϕ 1 , , ϕ F ) > 0 such that Φ L F σ ( s ) + L F σ ( s ) T Φ > 0 along with positive definite matrices S 1 and S 2 that satisfy the following set of inequalities:
( 1 r ) S 1 1 E S 1 1 S 1 1 E T S 1 1 < 0
S 1 D + D T S 1 + S 1 2 + ( k 2 + 2 ) I n + ( 1 + r e 1 ) S 1 ρ G T G S 1 S 1 I n < 0
( 1 b ) S 2 1 E S 2 1 S 2 1 E T S 2 1 < 0
D S 2 1 + S 2 1 D T + ( 1 + b e 1 ) S 2 1 + ( 2 + q ν ) I n + ω F F T ( 2 I n + S 2 1 ) 1 S 2 F F T k S 2 1 k S 2 1 I n < 0
Given the parameters ρ , ω > 0 and r , b > 1 , the observer and controller are designed with the following specifications:
  • A = S 1 1 G T
  • μ ρ ϕ max λ 1 , where:
    -
    λ 3 = m i n σ ( s ) T λ min Φ L ¯ F σ ( s ) + L ¯ F σ ( s ) T Φ
    -
    ϕ max = max 1 j F { ϕ j }
  • T = F T S 2
  • 0 < β ω ϕ min λ 2 , where:
    -
    λ 4 = m a x σ ( s ) T λ max L ¯ F σ ( s ) T Φ L ¯ F σ ( s )
    -
    ϕ min = min 1 j F { ϕ j }
Proof. 
Suppose that α 1 ( . ) = X ^ F ( . ) X F ( . ) denotes the observation error and
α 2 ( . ) = X F ( . ) L ¯ F σ ( s ) 1 L ¯ B σ ( s ) I n X B ( . ) is the bipartite containment control error; then under controller (48),
D γ α 1 = ( I F D ) α 1 + P ( s , X ^ F ) P ( s , X F ) + P 1 ( s , X ^ F ( s e 2 ) ) P 1 ( s , X F ( s e 2 ) ) e 1 0 ( I F E ) α 1 ( s + ϕ ) d ϕ ( L ¯ F σ ( s ) μ A G ) α 1 .
and
D γ α 2 = ( I F D ) α 2 + + P ( s , X F ) + L ¯ F σ ( s ) 1 L ¯ B σ ( s ) I n P ( s , X B ) + P 1 ( s , X F ( s e 2 ) ) + L ¯ F σ ( s ) 1 L ¯ B σ ( s ) I n P 1 ( s , X B ( s e 2 ) ) + e 1 0 ( I F E ) α 2 ( s + ϕ ) d ϕ ( L ¯ F σ ( s ) β F T ) α 1 ( s e 2 ) ( L ¯ F σ ( s ) β F T ) α 2 ( s e 2 ) + 2 Δ v i ( s )
Let α ( . ) = [ α 1 T ( . ) , α 2 T ( . ) ] T represent the error system, and
D γ α = R ¯ 1 α + P ¯ ( s , α ) + P ¯ 1 ( s , α ( s e 2 ) ) + R ¯ 2 α ( s e 2 ) + e 1 0 R ¯ 3 α ( s + ϕ ) d ϕ + 2 Δ v i ( s ) ,
where R ¯ 1 = ( I F D ) ( L ¯ F σ ( s ) μ A G ) 0 0 I F D ; R ¯ 2 = 0 0 L ¯ F σ ( s ) β F T L ¯ F σ ( s ) β F T ;   R ¯ 3 = I F E 0 0 I F E ;   P ¯ ( s , α ) = P ( s , X ^ F ) P ( s , X F ) P ( s , X F ) + L ¯ F σ ) s ) 1 L ¯ B σ ( s ) I n P ( s , X B ) ,
P ¯ 1 ( s , α ( s e 2 ) = P 1 ( s , X ^ F ( s e 2 ) P 1 ( s , X F ( s e 2 ) × P 1 ( s , X F ( s e 2 ) + L ¯ F σ ( s ) 1 L ¯ B σ ( s ) I n P 1 ( s , X B ( s e 2 ) .
Let us delve into the asymptotic stability analysis of the error system in Equation (55). Given that L ¯ F σ ( s ) for any σ ( s ) T is a non-singular M-matrix according to Lemma 4, then there exists a positive definite diagonal matrix Φ = diag ( ϕ 1 , ϕ 2 , , ϕ F ) such that Φ L ¯ F σ ( s ) + L ¯ F σ ( s ) T Φ > 0 . In this context, the following Lyapunov function is proposed for the stability analysis:
V ( s ) = V 1 ( s ) + V 2 ( s ) = α 1 T ( Φ S 1 ) α 1 + α 2 T ( η Φ S 2 ) α 2
where η > 0 is very small scalar.
By using Theorem 1,
D γ V 1 α 1 T Φ S 1 D + D T S 1 + 2 S 2 2 1 + k 2 I n ) + S 1 E S 1 1 E T S 1 + S 1 e 1 μ ( Φ L ¯ F σ ( s ) + L ¯ F σ ( s ) T Φ ) G T G α 1 + α 1 T ( s e 2 ) Φ 2 I n α 1 ( s e 2 )
Denote λ 3 = λ m i n { Φ L ¯ F σ ( s ) + L ¯ F σ ( s ) T Φ } , ϕ m a x = m a x 1 F { ϕ j } . The following inequality with μ ρ ϕ m a x λ 3 and ρ > 0 holds:
D γ V 1 α 1 T Φ S 1 D + D T S 1 + 2 S 2 2 1 + k 2 I n ) + S 1 E S 1 1 E T S 1 + S 1 e 1 ρ G T G α 1 + α 1 T ( s e 2 ) Φ 2 I n α 1 ( s e 2 ) = α 1 T ( Φ Λ 1 ) α 1 + α 1 T ( s e 2 ) Φ 2 I n α 1 ( s e 2 )
Now, by using Theorem 1 and Equation (48),
D γ V ( s ) Q 1 Φ S 2 1 ( Λ 1 + S 1 ) S 2 1 Q 1 + Q 1 T ( s e 2 ) ( Φ S 2 1 ( 2 I n + S 1 ) S 2 1 ) Q 1 ( s e 2 ) + Q 2 T η Φ ( D S 2 1 + S 2 1 D T + 2 I n + k 2 S 2 2 + ( 1 + b e 1 ) S 2 1 Q 2 Q 2 T ( η Φ L ¯ F σ ( s ) β F F T ) Q 2 ( s e 2 ) Q 2 T ( s e 2 ) ( η Φ L ¯ F σ ( s ) β F F T ) Q 2 Q 2 T ( s e 2 ) ( η Φ S 2 1 ( 2 I n + S 2 1 ) ) Q 2 ( s e 2 ) Q 2 T ( η Φ L ¯ F σ ( s ) β F F T ) Q 1 ( s e 2 ) Q 1 ( s e 2 ) T ( η Φ L ¯ F σ ( s ) β F F T ) Q 2 + 4 Q 2 T ( η Φ I n ) Δ v i ( s ) = J T Φ S 2 1 ( Λ 1 + S 1 ) S 2 1 0 0 U 3 J
where
U 3 η Φ ( Λ 2 + q ν I n ) η Φ L ¯ F σ ( s ) β F F T η Φ L ¯ F σ ( s ) β F F T η L ¯ F σ ( s ) Φ β F F T Φ S 2 1 ( 2 I n + S 1 ) S 2 1 0 η L ¯ F σ ( s ) Φ β F F T 0 η Φ S 2 1 ( 2 I n + S 2 1 ) Λ 2 = D S 2 1 + S 2 1 D T + 2 I n + k 2 S 2 2 + ( 1 + b e 1 ) S 2 1 a n d q = 4 Δ v i ( s )
Then there is an invertible matrix
W = 0 I F I n 0 I F I n 0 0 0 0 I F I n
which is used as
W 1 U 3 W = Φ S 2 1 ( 2 I n + S 1 ) S 2 1 η L ¯ F σ ( s ) Φ β F F T 0 η Φ L ¯ F σ ( s ) β F F T η Φ ( Λ 2 + q ν I n ) η Φ L ¯ F σ ( s ) β F F T 0 η L ¯ F σ ( s ) Φ β F F T η Φ S 2 1 ( 2 I n + S 2 1 ) U 4 .
One can easily say that matrices U 3 and U 4 are similar matrices and have the same eigenvalues. Now, we divide matrix U 4 into matrix
Φ S 2 1 ( 2 I n + S 1 ) S 2 1 η C 1 T η C 3 η C 4
where matrices C 3 and C 4 are defined as
C 3 = Φ L ¯ F σ ( s ) β F F T 0 , C 4 Φ ( Λ 2 + q ν I n ) Φ L ¯ F σ ( s ) β F F T L ¯ F σ ( s ) Φ β F F T Φ S 2 1 ( 2 I n + S 2 1 )
Next, we have to prove that U 4 is less than zero. Since, by Lemma 5, L ¯ F σ ( s ) is invertible,
for any non - zero vector x L ¯ F σ ( s ) x T Φ L ¯ F σ ( s ) x = x T L ¯ F σ ( s ) T Φ L ¯ F σ ( s ) x > 0 L ¯ F σ ( s ) T Φ L ¯ F σ ( s )
Suppose that 0 < β ω ϕ m i n λ 4 , where λ 4 = λ m a x L ¯ F σ ( s ) T Φ L ¯ F σ ( s ) , ϕ m i n = m i n 1 j F { ϕ j } ,
Φ Λ 2 + q ν I n L ¯ F σ ( s ) T Φ L ¯ F σ ( s ) β 2 F F T ( 2 I n + S 2 1 ) 1 S 2 F F T Φ Λ 4 + q ν I n + λ 2 ϕ m i n β 2 F F T ( 2 I n + S 2 1 ) 1 S 2 F F T Φ Λ 4 + q ν I n + ω F F T ( 2 I n + S 2 1 ) 1 S 2 F F T
From (52) Λ 2 + q ν I n + ω F F T ( 2 I n + S 2 1 ) 1 S 2 F F T < 0 ; hence
Φ Λ 2 + q ν I n L ¯ F σ ( s ) T Φ L ¯ F σ ( s ) β 2 F F T ( 2 I n + S 2 1 ) 1 S 2 F F T > 0
⇒ that C 4 > 0 . Now, by choosing a small scalar η > 0 such that
Φ S 2 1 ( 2 I n + S 1 ) S 2 1 + η C 3 C 4 1 C 3 < 0
U 4 < 0 ; hence, we proved that U 3 < 0 . As a result, Λ 1 + S 1 < 0 , and U 3 < 0 from (49)–(52). Hence,
= Φ S 2 1 ( Λ 1 + S 1 ) S 2 1 0 0 U 3 < 0
Then from (58), D γ V ( s ) < 0 . Hence, there exists a scalar κ > 0 such that
D γ V ( α ( s ) ) κ | | α ( s ) | | 2 .
Based on Lemma 3, it can be concluded that lim s α = 0 , indicating that the zero solution of the system (55) is asymptotically stable. As a result, observer-based bipartite containment control of the FMAS described by Equations (2) and (3) with the delayed controller (48) is achieved. □

5. Numerical Illustrations

Two examples will be offered to illustrate the practical significance of the conclusions drawn.
Example 1. 
In the context of observation-based bipartite containment control having five followers and two leaders, the signed digraph illustrated in Figure 2 is noted for its structural balance and division into bi-partitioned subgroups F 1 and F 2 , where F 1 = { 0 , 1 } and F 2 = { 2 , 3 , 4 } . First, we define the matrices that are used in FMAS Equations (2) and (3) as follows:
D = 1.25 0.05 0.05 1.6 , G = 0.5 0.25 0.1 0.3
E = 0.2 0.1 0.05 0.07 , F = 1 0.5
and
p 1 ( s , y i ( s e 2 ) ) = y i ( s ) 4 7 y i ( s ) sin ( s e 2 ) ,
p ( s , y i ( s ) = c o s ( y i ( s )
⇒ we can take the value of constant k = 0.5 and = 0.4 . We take Δ v i ( s ) = 30 c o s ( 0.3 ) and ν = 0.3 . Now, by using Figure 2,
F = 0 0.9 0 0 0 0.7 0 0 0 0 0 1 0 0.5 0.5 0 0 0.2 0 0.5 0 0 0 0 0 1 0 0 0 0 0.5 0 0 0 0.6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 then L =   1.6 0.9 0 0 0 0.7 0 0 1.5 0 0 1 0 0.5 0.5 0 1.2 0.2 0 0.5 0 0 0 0 1 1 0 0 0 0 0.5 0 1.1 0 0.6 0 0 0 0 0 0 0 0 0 0 0 0 0 0
ψ = 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1
Now, since L ¯ = ϕ L ϕ ,
L ¯ = 1.6 0.9 0 0 0 0.7 0 0 1.5 0 0 1 0 0.5 0.5 0 1.2 0.2 0 0.5 0 0 0 0 1 1 0 0 0 0 0.5 0 1.1 0 0.6 0 0 0 0 0 0 0 0 0 0 0 0 0 0
from the above matrix, one can obtain
L ¯ F = 1.6 0.9 0 0 0 0 1.5 0 0 1 0.5 0 1.2 0.2 0 0 0 0 1 1 0 0 0.5 0 1.1 and L ¯ B = 0.7 0 0 0.5 0.5 0 0 0 0 0.6 . Suppose that e 1 = 0.4 ; then by solving inequalities (8)–(11), one can have ρ = 0.0213 and r = 0.2148 .
S 1 = 0.3208 0.0021 0.0021 0.2145
ω = 0.0023 , b = 0.2312
S 2 1 = 0.4521 0.0123 0.0123 0.4325 S 2 = 2.2136 0.0630 0.0630 2.3139
We can select Φ = I 5 for Φ L ¯ F + L ¯ F T Φ > 0 ; thus, ϕ m i n = ϕ m a x = 1 .
λ 1 = 0.6414
and
λ 2 = 5.2776
μ ρ ϕ m a x λ 1 = 0.0332 and 0 < β ω ϕ m i n λ 2 = 0.02085 Now If we take
β = 0.02 μ = 0.1 gain matrices A = 1.5511 0.3026 1.1503 1.3956 and T = 2.1821 1.0939
Now, if γ = 0.7 and e 2 = 0.7 , then the state of the agents and the observation error of FMAS (2) and (3) are given in Figure 3 and Figure 4, respectively. Figure 3 shows that
lim s α 1 = 0 and lim s α 1 = 0
where
α 1 = y ^ i y i , i = 0 , 1 y ^ i + y i , i = 2 , 3 , 4 α 2 = y i co { y 5 , y 6 } i = 0 , 1 ( y i + co { y 5 , y 6 } ) i = 2 , 3 , 4 .
Notice that
lim s y ^ i y i = 0 , i = 0 , 1 , 2 , 3 , 4 lim s y i co { y 5 , y 6 } = 0 , i = 0 , 1 , lim s y i + co { y 5 , y 6 } = 0 , i = 2 , 3 , 4 .
Drawing from the simulation results, it is determined that the observation-based bipartite containment control for FMAS (2) and (3) using controller (7) is successfully implemented. Furthermore, the results confirm that the asymptotic stability of the observation error is assured.
Example 2. 
Consider the bipartite containment control for a system having five followers and two leaders. The system’s dynamics are governed by switching topology graphs G 1 , G 2 , and G 3 , which are illustrated in Figure 5 and Figure 6. These graphs, G 1 , G 2 , and G 3 , are signed digraphs that are structurally balanced, meaning that they can be split into bipartition subgroups where each link connecting nodes of the same subgroup is positively signed, and each edge connecting nodes of different subgroups is negatively signed. Specifically, the bipartition subgroups are F 1 = { 0 , 1 } and F 2 = { 2 , 3 , 4 } . The coefficient matrices used in the finite multi-agent system (FMAS) Equations (2) and (3) are the same as those presented in Example 1, ensuring consistency in the system’s behavior and analysis.
From Figure 5 and Figure 6.
F 1 = 0 0.9 0 0 0 0.7 0 0 0 0 0 0 0 0.5 0 0 0 0.2 0 0.5 0 0 0 0 0 1 0 0 0.5 0 0 0 0 0 0.6 0 0 0 0 0 0 0 0 0 0 0 0 0 0   F 2 = 0 0.9 0 0 0 0.7 0 0 0 0 0 1 0 0.5 0.5 0 0 0.2 0 0.5 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0.6 0 0 0 0 0 0 0 0 0 0 0 0 0 0
F 3 = 0 0 0.7 0 0 1 0 1.2 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0.5 0 0 0 0 0 1.5 0 0.6 0 0 0.2 0 0 0 0 0 0 0 0 0 0 0 0 0 0
ψ = 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1
Then
L ¯ F 1 = 1.6 0.9 0 0 0 0 0.5 0 0 0 0 0 0.7 0.2 0 0 0 0 0.5 0.5 0.5 0 0 0 1.1 L ¯ B 1 = 0.7 0 0 0.5 0.5 0 0 0 0 0.6 L ¯ F 2 = 1.6 0.9 0 0 0 0 1.5 0 0 1 0.5 0 1.2 0.2 0 0 0 0 1 1 0 0 0 0 0.6 L ¯ B 2 = 0.7 0 0 0.5 0.5 0 0 0 0 0.6 L ¯ F 3 = 1.7 0 0.7 0 0 1.2 2.2 0 0 0 0 0 1 0 0 0 0 0.5 0.5 0 0 1.5 0 0.6 2.3 L ¯ B 3 = 1 0 0 1 1 0 0 0 0 0.2
In this scenario, the dynamical equations governing each agent remain unchanged; only the communication switching among the agents is different. Consequently, the feasible solutions to inequalities (49)–(52) are identical to those in Example 1. We can select Φ = I 5 for Φ L ¯ F σ ( s ) + L ¯ F σ ( s ) T Φ > 0 thus ϕ m i n = ϕ m a x = 1 .
λ m i n Φ L ¯ F 1 + L ¯ F 1 T Φ = 0.6372 λ m i n Φ L ¯ F 2 + L ¯ F 2 T Φ = 0.2234 λ m i n Φ L ¯ F 3 + L ¯ F 3 T Φ = 0.6467
Hence, λ 3 = 0.2234 . Also,
λ m a x L ¯ F 1 Φ L ¯ F 1 T = 3.7233 λ m a x L ¯ F 2 Φ L ¯ F 2 T = 4.9827 λ m a x L ¯ F 3 Φ L ¯ F 3 T = 10.7194
Hence, λ 4 = 10.7194 , μ ρ ϕ m i n λ 3 = 0.09534 , and 0 < β ω ϕ m a x λ 4 = 0.0144
Now , if we take β = 0.1 and μ = 0.01 ,
and we choose γ = 0.7 and e 2 = 0.9 , then the states of the agents and the observation error under switching topologies of FMAS (2) and (3) are given in Figure 7 and Figure 8, respectively.

6. Conclusions

In networks that incorporate both fixed and switching attributes along with signed directed edges where both cooperative and hostile agent interactions occur, observation-based bipartite containment control of nonlinear FMASs has been investigated. Assuming the associated signed digraph is structurally balanced and at least one leader has a directed link to each follower, delayed and disturbance compensation control methods have been developed for both fixed and switching signed directed systems to address observation-based bipartite containment control networks. Using the Lyapunov function approach and the fractional Razumikhin technique, a reliable and practical solution has been proposed to tackle the issues resulting from switching topologies, fractional calculus, and delay. Basic matrix inequalities have been employed to guarantee multiple bipartite containment control. The validity and feasibility of the main findings are demonstrated through concrete numerical examples.

Author Contributions

Conceptualization, A.U.K.N.; Software, A.K. and M.A.J.; Validation, Y.Z.; Resources, A.K. and M.A.J.; Data curation, S.R.; Writing—original draft, S.R.; Writing—review and editing, A.U.K.N.; Supervision, A.U.K.N. and Y.Z.; Project administration, Y.Z., A.K. and M.A.J. All authors have read and agreed to the published version of the manuscript.

Funding

This research was sponsored by the Key Laboratory of Philosophy and Social Sciences in Guangdong Province of Maritime Silk Road of Guangzhou University (GD22TWCXGC15), the National Natural Science Foundation of China (grant No. 622260-101 and 12250410247), and also by the Ministry of Science and Technology of China (No. WGXZ2023054L).

Data Availability Statement

The code is considered intellectual property of the Guangzhou government project and is therefore not publicly available.

Acknowledgments

This work has been carried out at the University of Lahore, Sargodha Campus. The authors are also grateful for the support from Guangzhou University, China.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

References

  1. Dai, J.; Guo, G. Event-triggered leader-following consensus for multi-agent systems with semi-Markov switching topologies. Inf. Sci. 2018, 459, 290–301. [Google Scholar] [CrossRef]
  2. Zhang, J.; Peng, S. Exponential Consensus of Multi-Agent Systems under Event-Triggered Impulsive Control with Actuation Delays. Entropy 2023, 25, 877. [Google Scholar] [CrossRef]
  3. Zhang, Y.; Liu, Z.; Wang, F.; Chen, Z. Rotating Consensus for Leader-Follower Multi-Agent Systems with a Smart Leader. In Proceedings of the 2023 42nd Chinese Control Conference (CCC), Tianjin, China, 24–26 July 2023; pp. 5719–5724. [Google Scholar]
  4. Ali, M.S.; Agalya, R.; Orman, Z.; Arik, S. Leader-following consensus of non-linear multi-agent systems with interval time-varying delay via impulsive control. Neural Process. Lett. 2021, 53, 69–83. [Google Scholar] [CrossRef]
  5. Ali, M.S.; Agalya, R.; Shekher, V.; Joo, Y.H. Non–fragile sampled data control for stabilization of non-linear multi-agent system with additive time varying delays, Markovian jump and uncertain parameters. Nonlinear Anal. Hybrid Syst. 2020, 36, 100830. [Google Scholar] [CrossRef]
  6. Zhao, L.; Chen, X.; Yu, J.; Shi, P. Output feedback-based neural adaptive finite-time containment control of non-strict feedback nonlinear multi-agent systems. IEEE Trans. Circuits Syst. Regul. Pap. 2021, 69, 847–858. [Google Scholar] [CrossRef]
  7. Mohammed, K.S.; Pata, U.K. Linking the utilization of mineral resources and climate change: A novel approach with frequency domain analysis. Geosci. Front. 2024, 15, 101683. [Google Scholar] [CrossRef]
  8. Jiang, Y.; Fan, J.; Gao, W.; Chai, T.; Lewis, F.L. Cooperative adaptive optimal output regulation of nonlinear discrete-time multi-agent systems. Automatica 2020, 121, 109149. [Google Scholar] [CrossRef]
  9. Khan, A.; Niazi, A.U.K.; Rehman, S.; Ahmed, S. Hostile-based bipartite containment control of nonlinear fractional multi-agent systems with input delays: A signed graph approach under disturbance and switching networks. AIMS Math. 2024, 9, 12678–12699. [Google Scholar] [CrossRef]
  10. Yang, R.; Liu, S.; Li, X.; Xiao, J. Bipartite containment control of fractional multi-agent systems with input delay on switching signed directed networks. ISA Trans. 2023, 135, 130–137. [Google Scholar] [CrossRef]
  11. Yin, M.; Liu, L.; Cheng, L.; Li, Z.; Tu, Y. A novel group multi-criteria sorting approach integrating social network analysis for ability assessment of health rumor-refutation accounts. Expert Syst. Appl. 2024, 238, 121894. [Google Scholar] [CrossRef]
  12. Madridano, Á.; Al-Kaff, A.; Martín, D.; De La Escalera, A. Trajectory planning for multi-robot systems: Methods and applications. Expert Syst. Appl. 2021, 173, 114660. [Google Scholar] [CrossRef]
  13. Meng, X.; Gao, H. High-order bipartite containment control in multi-agent systems over time-varying cooperation-competition networks. Neurocomputing 2019, 359, 509–516. [Google Scholar] [CrossRef]
  14. Liu, Z.; Zhan, X.; Han, T.; Yan, H. Distributed adaptive finite-time bipartite containment control of linear multi-agent systems. IEEE Trans. Circuits Syst. II Express Briefs 2022, 69, 4354–4358. [Google Scholar] [CrossRef]
  15. Zhu, Z.H.; Hu, B.; Guan, Z.H.; Zhang, D.X.; Li, T. Observer-based bipartite containment control for singular multi-agent systems over signed digraphs. IEEE Trans. Circuits Syst. I Regul. Pap. 2020, 68, 444–457. [Google Scholar] [CrossRef]
  16. Ahsan, M.; Ma, Q. Bipartite containment control of multi-agent systems. In Proceedings of the 2019 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM), Hong Kong, China, 8–12 July 2019; pp. 895–900. [Google Scholar]
  17. Wang, L.; Han, T.; Zhan, X.S.; Wu, J.; Yan, H. Bipartite containment for linear multi-agent systems subject to unknown exogenous disturbances. Asian J. Control 2022, 24, 1836–1845. [Google Scholar] [CrossRef]
  18. Zuo, S.; Song, Y.L.; Lewis, F.; Davoudi, A. Bipartite output containment of general linear heterogeneous multi-agent systems on signed digraphs. IET Control Theory Appl. 2018, 12, 1180–1188. [Google Scholar] [CrossRef]
  19. Zhou, Y.; Zhang, H.; Yu, L.; Sun, S. Cooperative bipartite containment control for heterogeneous networks with structurally balanced graph. IEEE Trans. Circuits Syst. II Express Briefs 2021, 68, 2885–2889. [Google Scholar] [CrossRef]
  20. Zhou, Q.; Wang, W.; Liang, H.; Basin, M.V.; Wang, B. Observer-based event-triggered fuzzy adaptive bipartite containment control of multiagent systems with input quantization. IEEE Trans. Fuzzy Syst. 2019, 29, 372–384. [Google Scholar] [CrossRef]
  21. Cai, Y.; Zhang, H.; Zhang, J.; He, Q. Distributed bipartite leader-following consensus of linear multi-agent systems with input time delay based on event-triggered transmission mechanism. ISA Trans. 2020, 100, 221–234. [Google Scholar] [CrossRef]
  22. Rahman, R.U.; Hammouch, Z.; Alsubaie, A.S.A.; Mahmoud, K.H.; Alshehri, A.; Az-Zo’bi, E.A.; Osman, M.S. Dynamical behavior of fractional nonlinear dispersive equation in Murnaghan’s rod materials. Results Phys. 2024, 56, 107207. [Google Scholar] [CrossRef]
  23. Di Paola, M.; Alotta, G.; Burlon, A.; Failla, G. A novel approach to nonlinear variable-order fractional viscoelasticity. Philos. Trans. R. Soc. A 2020, 378, 20190296. [Google Scholar] [CrossRef] [PubMed]
  24. Khan, A.; Hassan, W.U.; Manzor, A.; Ahmed, S.; Niazi, A.U.K. Strengthening stability with centralized event-triggered control system with the disturbances and artificial time delay in wireless connected vehicle platooning (CVSs). Syst. Sci. Control Eng. 2024, 12, 2342818. [Google Scholar] [CrossRef]
  25. Wenlong, Y.; Ruiliang, D.; Weixian, Z.; Zongying, S.; Yisheng, Z. Fully Distributed Robust Adaptive Formation Control for Linear Multi-agent System with Uncertainties and Communication Delays. IFAC-PapersOnLine 2023, 56, 9227–9232. [Google Scholar] [CrossRef]
  26. Luo, L.; Mi, W.; Zhong, S. Adaptive consensus control of fractional multi-agent systems by distributed event-triggered strategy. Nonlinear Dyn. 2020, 100, 1327–1341. [Google Scholar] [CrossRef]
  27. Hua, Y.; Dong, X.; Li, Q.; Ren, Z. Distributed time-varying formation robust tracking for general linear multiagent systems with parameter uncertainties and external disturbances. IEEE Trans. Cybern. 2017, 47, 1959–1969. [Google Scholar] [CrossRef] [PubMed]
  28. Yu, J.; Wu, M.; Yang, W.; Ji, J. A system decomposition method for region tracking control of a non-holonomic mobile robot with dynamic parameter uncertainties. Asian J. Control 2024, 26, 1459–1471. [Google Scholar] [CrossRef]
  29. Yang, R.; Liu, S.; Li, X. Observer-based bipartite containment control of fractional multi-agent systems with mixed delays. Inf. Sci. 2023, 626, 204–222. [Google Scholar] [CrossRef]
  30. Zhou, Y. Basic Theory of Fractional Differential Equations; World Scientific: Singapore, 2023. [Google Scholar]
  31. Sevinik Adigüzel, R.; Aksoy, Ü.; Karapinar, E.; Erhan, Ä.M. On the solution of a boundary value problem associated with a fractional differential equation. Math. Methods Appl. Sci. 2020. early view. [Google Scholar] [CrossRef]
  32. Huseynov, I.T.; Ahmadova, A.; Mahmudov, N.I. Fractional Leibniz integral rules for Riemann-Liouville and Caputo fractional derivatives and their applications. arXiv 2020, arXiv:2012.11360. [Google Scholar]
  33. Wen, Y.; Zhou, X.F.; Zhang, Z.; Liu, S. Lyapunov method for nonlinear fractional differential systems with delay. Nonlinear Dyn. 2015, 82, 1015–1025. [Google Scholar] [CrossRef]
  34. Arık, I.A.; Araz, S.I. Delay differential equations with fractional differential operators: Existence, uniqueness and applications to chaos. Commun. Anal. Mech. 2024, 16, 169–192. [Google Scholar] [CrossRef]
  35. Ye, Y.; Wei, H.; Lu, R.; Su, H.; Wu, Y. Containment control for networked fractional-order systems with sampled position data. IEEE Trans. Circuits Syst. I Regul. Pap. 2021, 68, 3881–3889. [Google Scholar] [CrossRef]
Figure 1. Framework of the paper.
Figure 1. Framework of the paper.
Fractalfract 08 00473 g001
Figure 2. Signed digraph of G .
Figure 2. Signed digraph of G .
Fractalfract 08 00473 g002
Figure 3. Agent state y i ( s ) and y ^ i ( s ) , where i = { 1 , 2 , . . . , 7 } , for fixed signed digraph.
Figure 3. Agent state y i ( s ) and y ^ i ( s ) , where i = { 1 , 2 , . . . , 7 } , for fixed signed digraph.
Fractalfract 08 00473 g003
Figure 4. Observation error α 1 ( s ) and bipartite containment error α 2 ( s ) for fixed signed digraph.
Figure 4. Observation error α 1 ( s ) and bipartite containment error α 2 ( s ) for fixed signed digraph.
Fractalfract 08 00473 g004
Figure 5. Signed digraph of G 1 .
Figure 5. Signed digraph of G 1 .
Fractalfract 08 00473 g005
Figure 6. Signed digraphs of G 2 and G 3 .
Figure 6. Signed digraphs of G 2 and G 3 .
Fractalfract 08 00473 g006
Figure 7. Agent state y i ( s ) and y ^ i ( s ) , where i = { 1 , 2 , . . . , 7 } , for switching signed digraph.
Figure 7. Agent state y i ( s ) and y ^ i ( s ) , where i = { 1 , 2 , . . . , 7 } , for switching signed digraph.
Fractalfract 08 00473 g007
Figure 8. Observation error α 1 ( s ) and bipartite containment error α 2 ( s ) for switching signed digraph.
Figure 8. Observation error α 1 ( s ) and bipartite containment error α 2 ( s ) for switching signed digraph.
Fractalfract 08 00473 g008
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.; Javeed, M.A.; Rehman, S.; Niazi, A.U.K.; Zhong, Y. Advanced Observation-Based Bipartite Containment Control of Fractional-Order Multi-Agent Systems Considering Hostile Environments, Nonlinear Delayed Dynamics, and Disturbance Compensation. Fractal Fract. 2024, 8, 473. https://doi.org/10.3390/fractalfract8080473

AMA Style

Khan A, Javeed MA, Rehman S, Niazi AUK, Zhong Y. Advanced Observation-Based Bipartite Containment Control of Fractional-Order Multi-Agent Systems Considering Hostile Environments, Nonlinear Delayed Dynamics, and Disturbance Compensation. Fractal and Fractional. 2024; 8(8):473. https://doi.org/10.3390/fractalfract8080473

Chicago/Turabian Style

Khan, Asad, Muhammad Awais Javeed, Saadia Rehman, Azmat Ullah Khan Niazi, and Yubin Zhong. 2024. "Advanced Observation-Based Bipartite Containment Control of Fractional-Order Multi-Agent Systems Considering Hostile Environments, Nonlinear Delayed Dynamics, and Disturbance Compensation" Fractal and Fractional 8, no. 8: 473. https://doi.org/10.3390/fractalfract8080473

Article Metrics

Back to TopTop