Next Article in Journal
Symmetries, Reductions and Exact Solutions of Nonstationary Monge–Ampère Type Equations
Previous Article in Journal
Generalization of Liu–Zhou Method for Multiple Roots of Applied Science Problems
Previous Article in Special Issue
Partial Stability of Linear Hybrid Discrete–Continuous Itô Systems with Aftereffect
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Dynamic Adaptive Event-Triggered Mechanism for Fractional-Order Nonlinear Multi-Agent Systems with Actuator Saturation and External Disturbances: Application to Synchronous Generators

1
School of Electronic and Electrical Engineering, Kyungpook National University, Daegu 41566, Republic of Korea
2
Centre for Computational Modeling, Chennai Institute of Technology, Chennai 600 009, Tamil Nadu, India
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(3), 524; https://doi.org/10.3390/math13030524
Submission received: 31 December 2024 / Revised: 1 February 2025 / Accepted: 3 February 2025 / Published: 5 February 2025
(This article belongs to the Special Issue Advances in Control Systems and Automatic Control)

Abstract

:
This paper presents a novel dynamic adaptive event-triggered mechanism (DAETM) for addressing actuator saturation in leader–follower fractional-order nonlinear multi-agent networked systems (FONMANSs). By utilizing a sector-bounded condition approach and a convex hull representation technique, the proposed method effectively addresses the effects of actuator saturation. This results in less conservative linear matrix inequality (LMI) criteria, guaranteeing asymptotic consensus among agents within the FONMANS framework. The proposed sufficient conditions are computationally efficient, requiring only simple LMI solutions. The effectiveness of the approach is validated through practical applications, such as synchronous generators within a FONMANS framework, where it demonstrates superior performance and robustness. Additionally, comparative studies with Chua’s circuit system enhance the robustness and efficiency of control systems compared to existing techniques. These findings highlight the method’s potential for broad application across various multi-agent systems, particularly in scenarios with limited communication and actuator constraints. The proposed approach enhances system performance and provides a robust, adaptive control solution for dynamic and uncertain environments.

1. Introduction

A significant area of research in multi-agent systems (MASs) is mainly focused on integer-order systems. However, specific scenarios such as vehicles moving through muddy terrain or drones operating in challenging weather conditions such as rain or snow may endanger system stability depending on integer-order models. In these instances, fractional-order systems offer a more advantageous solution. For example, ref. [1] investigated an adaptive event-triggered (ET) stochastic estimator-based sampled-data controller to ensure bounded mean-square stability in a fractional-order PMSG-based wind energy system. Similarly, ref. [2] proposed a fuzzy memory-based fault-tolerant control framework with external disturbances and maintained stability in a fractional-order nonlinear PMSG model. Fractional-order systems are more adept at modeling the actual physical characteristics of objects and have wide-ranging practical applications [3]. Consequently, growing interest has been in addressing the leader–follower consensus control challenges in fractional-order MASs (FOMASs). For instance, ref. [4] investigated the consensus problem in FOMASs through observer-based boundary value control. The cybersecure consensus issue in FOMASs with distributed delays and DoS attacks was explored in [5]. The fault-tolerant consensus problem for heterogeneous FOMASs with uncertain nonlinearities was analyzed in [6], while [7] focused on containment control in discrete-time FOMASs with input delays. Moreover, ref. [8] addressed the leader–following consensus challenge in FOMASs using output feedback.
To address the challenge of limited resources, recent research has proposed sampled-data control, where agents update their data at predetermined intervals [9,10,11]. However, this approach often requires a conservative sampling period to maintain consensus in FOMASs, leading to unnecessary energy consumption. For example, ref. [12] investigated an ET sampled-data control method for FOMASs that relies on global information and assumes an undirected communication topology. On the other hand, ref. [13] proposed a distributed ET control method for linear FOMASs under directed graphs, although its time-dependent exponential threshold may not fully capture dynamic changes in the system. In [14], a state-dependent triggering function based on neighborhood information was explored; this method continues to demand constant communication, limiting its efficiency. In contrast, dynamic ET mechanisms, which involve non-negative variables, provide significant improvements in resource efficiency, as demonstrated by recent research [15,16,17,18,19,20]. This insight, combined with adaptive controllers that adjust parameters based on dynamic rules, inspired the development of the DAETC mechanism for FOMASs, offering a novel approach to consensus control with enhanced resource utilization.
Although DAETC is mainly focused on enhancing control inputs, actuator saturation remains a significant practical challenge related to control inputs. For example, ref. [21] studied the ET consensus of matrix-weighted networks under actuator saturation, while [22] investigated neural-based formation control in uncertain MASs with actuator saturation. Similarly, ref. [23] analyzed the robustness of MASs under actuator faults and saturation, concentrating on consensus control. However, none of these studies address FONMANS, which forms the foundation of our research. Therefore, this paper extends existing methods by applying the DAETC mechanism to FONMANS, in which both actuator saturation and ET behaviors are essential in maintaining system stability and performance. The proposed approach offers a more energy-efficient and robust strategy for consensus control in sophisticated, resource-limited systems.
Based on the above discussion, this study investigates the issue of leader–follower FONMANS with actuator saturation and general nonlinear dynamics using the DAETM. The main contributions of this paper are as follows:
1.
We developed a DAETM scheme to address leader–follower FONMANS with actuator saturation, achieving asymptotic stability using Mittag–Leffler functions.
2.
This study proposes two strategies, namely the sector-bounded and convex hull methods, that effectively tackle actuator saturation, reduce conservatism, and enhance system flexibility using fractional Lyapunov functions and LMIs.
3.
The proposed controller is validated through simulations using a synchronous generator (SG) model and comparative studies with the Chua circuit system, demonstrating the superior performance of the DAETM approach.

2. Preliminaries

2.1. Algebraic Graph Theory

The collaborative behavior of agents in MASs depends significantly on the structure of the communication network between the agents. A directed graph, denoted by G, is often used to show the interactions and the flow of information among agents. Specifically, G ¯ = ( V , E , A ) is a weighted directed graph, where V = { v 1 , , v M } represents the set of nodes corresponding to the M agents in the system, and E V × V represents the directed edges that indicate the communication links between these agents. The edge ε p q = ( v p , v q ) in the graph G ¯ means that agent v p can communicate with agent v q . The edge ( v p , v q ) E exists if there is a directed connection from agent v p to agent v q with weight a q p > 0 , meaning that agent v p can send information to agent v q . The elements of the adjacency matrix representing the connections in the graph are positive, i.e., ( v p , v q ) E a q p > 0 . Furthermore, a p p = 0 for all p I , where I = { 1 , , M } . The in-degree of an agent v p is defined as deg p in = q = 1 M a q p . The degree matrix of G ¯ is expressed as Deg = diag ( [ deg 1 in , , deg M in ] ) . The weighted Laplacian matrix G ¯ is then given by L = Deg A . A directed path from agent v p to agent v q is defined as a directed subgraph G ¯ containing distinct agents v p , v p 1 , v p 2 , , v p k , v q and the corresponding directed edges ( v p , v p 1 ) , ( v p 1 , v p 2 ) , , ( v p k 1 , v p k ) , ( v p k , v q ) .

2.2. Fractional Calculus

Fractional calculus extends the ideas of classical infinitesimal calculus to use non-integer orders for both integration and differentiation. Inspired by a strong physical foundation, this work focuses on the Caputo definition of real orders, with significant applications in chaotic fractional-order systems and complex-valued memristive neural networks. Below are thorough descriptions of the Caputo approach and Mittag–Leffler function.
Definition 1 
([1] Caputo approach). The Caputo derivative of a function x ( t ) is
D t ζ t 0 C ω ( t ) = 1 Γ ( n ζ ) t 0 t ω ( n ) ( τ ) ( t τ ) 1 n + ζ d τ ,
where 0 n 1 < ζ n , ω ( n ) ( t ) and
Γ ( z ) = 0 e t t z 1 d t .
In particular, when 0 < ζ 1 , then
D t ζ t 0 C ω ( t ) = 1 Γ ( 1 ζ ) t 0 t ω ˙ ( τ ) ( t τ ) ζ d τ .
Moreover, for a constant function ω ( t ) = c , we obtain D t ζ t 0 C c = 0 .
Definition 2 
([24]). If I t ζ t 0 f ( t ) denotes the ζ-fractional-order integral of a function f ( t ) ,
I t ζ t 0 f ( t ) = 1 Γ ( ζ ) t 0 t ( t τ ) ζ 1 f ( τ ) d τ ,
where ζ > 0 .
Definition 3 
([25]). The Mittag–Leffler function is defined as
E c , d ( z ) = k = 0 z k Γ ( c k + d )
where z C . When d = 1 , it reduces to the one-parameter form E c , 1 ( z ) = E c ( z ) . Furthermore, if c = d = 1 , then E 1 ( z ) = e z .
Property 1 
([24]). I t ζ t 0 D t ζ t 0 f ( t ) = f ( t ) f ( t 0 ) , where 0 < ζ 1 and f ( t ) is continuous, shows the relationship between the fractional integral and derivative of order ζ.
Property 2 
([24]). Assuming that ζ > 0 and f ( t ) is a smooth, differentiable function, the Laplace transform of the fractional integral I t ζ t 0 f ( t ) is given by L ( t 0 I t ζ f ( t ) ) = s ζ F ( s ) , where F ( s ) denotes the Laplace transform of f ( t ) .
Property 3 
([24]). Given ζ , γ > 0 , then L t ζ k + γ 1 E ζ , γ ( k ) ( ± a t ζ ) = k ! s ζ γ ( s ζ a ) k + 1 , where k N and Re ( s ) > | a | 1 ζ .

3. Problem Formulation

3.1. System Model

Consider a networked MAS with a leader agent and M follower agents, where each agent is modeled as a node in the graph G ¯ . The dynamics of M agents in FONMANS can be described as follows:
D t ζ 0 C ω p ( t ) = A ω p ( t ) + B sat ( u p ( t ) ) + g ( ω p ( t ) ) + p , p I [ 1 , M ] ,
where ω p ( t ) R n represents the state variable of the pth agent. u p ( t ) R m denotes the control input. The nonlinear function is expressed as g ( ω p ( t ) ) R n . Given the matrices A R M × M and B R M × M . For h I [ 1 , M ] , the saturation function, it is defined as sat ( u p h ) = sign ( u p h ) min { u 0 , | u p h ( t ) | } , where u 0 denotes the saturation threshold. p ( t ) R n is the unknown external disturbance vector for the pth follower agent.
  • The dynamics of the leader agent are defined by p = L :
D t ζ 0 C ω L ( t ) = A ω L ( t ) + g ( ω L ( t ) ) ,
where the subscript L denotes a variable associated with the leader agent.

3.2. Design of a Dynamic Adaptive Event-Triggered Method

To control the pth agent, the following control strategy is formulated:
μ p ( t ) = q M p a p q ( ω p ( t ) ω q ( t ) ) + b p ( ω p ( t ) ω L ( t ) ) , u p ( t ) = L μ p ( t r p ) , p I [ 1 , M ] , t [ t r p , t r + 1 p ] ,
where L denotes the controller gain, a p q and b p represent the communication strengths within the MAS as defined in (1), and t r p refers to the rth trigger time for agent p. The DATEM is expressed as follows:
t r + 1 p = inf t > t r p | e p ( t ) 2 1 2 F ( t ) , F ( t ) = min ξ p ( t ) 2 μ p ( t ) 2 + γ ξ p ( t ) e θ t , ϖ μ p ( t ) 2 , ξ ˙ p ( t ) = d p ξ p 2 ( t ) e p T ( t ) e p ( t ) , 0 < ξ p ( 0 ) 1 ,
where ξ p ( t ) denotes an adaptive parameter, and γ , θ and ϖ are positive constants that define DAETM (4). Moreover, Figure 1 displays the conceptual diagram of the proposed control method for the reader’s reference.
Define ε p ( t ) = ω p ( t ) ω L ( t ) as the deviation between v p and the leader v L , and let e p ( t ) = μ p ( t r p ) μ p ( t ) be the measurement discrepancy for v p . Then, we have
D t ζ 0 C ε p ( t ) = A ε p ( t ) + B sat ( u p ( t ) ) + G ( ε p ( t ) ) + Δ p , p I [ 1 , M ] ,
where G p ( t ) = g ( ω p ( t ) ) g ( ω L ( t ) ) .
System (5) is rewritten in the following compact form:
D t ζ 0 C ε ( t ) = ( I M A ) ε ( t ) + ( I M B ) sat ( u ( t ) ) + G ( ε ( t ) ) + Δ ,
where ε ( t ) = ε 1 T ( t ) , ε 2 T ( t ) , , ε M T ( t ) T ,   G ( ε ( t ) ) = ( ( G ( ε 1 ( t ) ) ) T , ( G ( ε 2 ( t ) ) ) T , ,   ( G ( ε M ( t ) ) ) T ) T ,   u ( t ) = ( u 1 T ( t ) ,   u 2 T ( t ) , , u M T ( t ) ) T ,   Δ ( t ) = Δ 1 T ( t ) , Δ 2 T ( t ) , , Δ M T ( t ) T . Then, the region of MAS (1) is defined as E ( I M P , η ) = { ε : ε T ( I M P ) ε η } , P > 0 .
Lemma 1 
([13]). Let ω ( t ) R n be a continuous vector function with a differentiable derivative. For ζ ( 0 , 1 ] , t [ t 0 , ) , and a symmetric positive matrix P , the following relation holds:
D t ζ t 0 C ω T ( t ) P ω ( t ) 2 ω T ( t ) P D t ζ t 0 C ω ( t ) .
Lemma 2 
([26]). If matrices F , H R m × n are given, and the vector x belongs to the set L ( H , u 0 ) , defined as L ( H , u 0 ) = x R n : | H x | u 0 , then the saturation function sat ( F x ) lies within the convex hull denoted by co ( · ) of the set E r F x + E r H x for all k I [ 1 , 2 m ] . Here, E r is a diagonal matrix with entries that are either 0 or 1, and E r = I E r , where I is the identity matrix. The convex hull co ( · ) ensures that the result captures all possible linear combinations of the specified set, maintaining its bounded nature under the given conditions.
Lemma 3 
([26]). Let the function Φ ( ω ) be defined as Φ ( ω ) = sat ( ω ) ω , where sat ( ω ) represents the saturation function applied to the vector ω. For any diagonal positive definite matrix T R m × m , if ω and ψ belong to the set
S ( ω ψ , u 0 ) = { ω R m , ψ R m : ω ψ u 0 } ,
which is defined as the collection of all vector pairs ω and ψ whose maximum element-wise difference is bounded by u 0 , then the following inequality holds:
Φ T ( ω ) T ( Φ ( ω ) + ψ ) 0 .
This inequality characterizes the behavior of the saturation deviation Φ ( ω ) , the matrix T, and the vector ψ, ensuring stability within the specified set S .
Lemma 4 
([27]). Consider the matrices S > 0 (a positive definite matrix), Y R n × n , and any constant l. The following inequality holds:
Y S 1 Y l 2 S 2 l Y .
Assumption 1. 
The graph G is considered connected, implying that a path exists between any two nodes within the graph, ensuring no node is isolated.
Assumption 2. 
The vector function g ( ω p ( t ) ) is said to satisfy the integral quadratic constraint if, for any ω 1 ( t ) , ω 2 ( t ) R n , the following inequality is satisfied:
ω 2 ( t ) ω 1 ( t ) g ( ω 2 ( t ) ) g ( ω 1 ( t ) ) T Ξ ω 2 ( t ) ω 1 ( t ) g ( ω 2 ( t ) ) g ( ω 1 ( t ) ) 0
where Ξ R 2 n × 2 n is known as an incremental multiplier matrix. According to [28], Ξ can be expressed in the form
Ξ = Ξ 11 Ξ 12 Ξ 22 .
Assumption 3. 
There is an unknown upper bound for the external disturbances such that | p ( t ) | ν ¯ ι p , for p = 1 , , M .
Definition 4. 
Assuming the initial conditions ω p ( 0 ) X , where X R n , if the following condition is satisfied:
lim t ω p ( t ) ω L ( t ) = 0 , p I [ 1 , M ] ,
then FONMANS (1) and (2) are said to have achieved consensus. This implies that, over time, the states of all agents in the system converge to a common value, effectively synchronizing their behaviors.

4. Main Results

This section demonstrates that leader–follower FONMANSs (6) can achieve consensus using a sector-bounded approach and the convex hull method. Additionally, we show that Zeno’s behavior is avoided under certain reasonable assumptions.

4.1. Sector-Bound Condition Approach

In this subsection, we address the saturation term in the system dynamics by using the sector-bound condition. Actuator saturation is a type of “hard nonlinearity”, similar to dead zones, hysteresis, and backlash. To handle this, we introduce a sector nonlinearity model that ensures the solution to the consensus problem in leader–follower FONMASs (6). Based on previous studies [22,26], this approach effectively deals with nonlinearities, especially those caused by input limitations such as actuator saturation. Systems with saturation are difficult to analyze using the standard Lyapunov stability theory, so we must handle the saturation term first. The sector-bound condition ensures that the saturation function stays within a specific range, allowing the use of LMIs for stability analysis. The main idea is to transform the saturation term, sat ( u ( t ) ) , into a dead-band function Φ ( sat ( u ( t ) ) ) = sat ( u ( t ) ) u ( t ) , which enables the application of sector inequalities (see Lemma 3). Unlike low-gain feedback methods, the sector-bound condition and convex hull representation have a specific range of use, known as the consensus domain of attraction. Estimating this domain is a common challenge with these methods. A common approach is to use the Lyapunov function’s level set to estimate the consensus domain of attraction. Compared to the convex hull representation, the sector-bound condition has clear advantages in estimating this domain. As a result, the consensus problem in leader–follower FONMASs (6) can be relaxed using sector conditions that are effective globally.
  • From (3), the control input u ( t ) can be expressed as
u ( t ) = ( I M L ) ( e + μ ) = ( I M L ) e + ( H L ) ε .
Theorem 1. 
Consensus in leader–follower FONMANSs (6) can be attained with the DAETM (4), provided that positive constants β , ρ > 0 , a positive diagonal matrix T > 0 , and Ψ > 0 , L , and ϝ satisfy the following conditions:
Sym ( A Ψ + λ p B L ) B L Φ τ I + Ψ Ξ 12 Ψ 0 2 β ( ρ 2 I 2 ρ Ψ ) L T T 0 0 0 0 2 T 0 0 0 0 0 Ξ 22 0 0 0 0 0 1 2 λ p 2 I + Ξ 11 1 0
Ψ ϝ ( q ) u 0 2 η 0
where Ψ = P 1 , Ψ τ = B λ p L T T ϝ T ,   L = L P 1 , ϝ = P 1 ϝ T ; ϝ ( q ) denotes the qth component of matrix ϝ, p I [ 1 , M ] , q I [ 1 , m ] , then the consensus domain is approximated using the set E ( I M P , η ) .
Proof. 
The Lyapunov function is selected as follows:
W ( t ) = ε T ( I M P ) ε .
By employing Lemmas 1 and 2, we calculate the Caputo derivative W ( t ) by considering (6) and (8), and then derive that
D t ζ 0 C W ( t ) 2 ε T ( I M P ) ( I M A ) ε + ( I M B ) sat ( u ) + F + = 2 ε T ( I M P ) [ ( I M A ) ε + ( I M B ) ϕ + ( I M B L ) e + ( H B L ) ε + F + ] = ε T I M Sym ( P A ) + H Sym ( P B L ) ε + 2 ε T ( I M P B ) ϕ + 2 ε T ( I M P B L ) e + 2 ε T ( I M P ) F + 2 ε T ( I M P ) .
By using Assumption 2, it follows that
ε p T ( t ) Ξ 11 ε p ( t ) + 2 ε p T ( t ) Ξ 12 F p ( t ) + F p T ( t ) Ξ 22 F p ( t ) 0 .
According to Assumption 3, it is obtained that
D t ζ 0 C W ( t ) ε T I M Sym ( PA ) + H Sym ( PBL ) ε + 2 ε T ( I M PB ) Φ + 2 ε T ( I M PBL ) e
+ p = 1 M 1 2 μ p T μ p 2 ω p ( t ) e p T e p + 2 ε T ( I M P ) F 2 Φ T ( I M T ) × Φ + u + ( I M G ) ε + ε T ( I M Ξ 11 ) ε + 2 ε T ( I M Ξ 12 ) F + F T ( I M Ξ 22 ) F + M γ e θ t
ν T Θ ν W ( t ) + M γ e θ t .
Consequently, inequality (9) holds under the given conditions:
ν T Θ ν 0 .
Accordingly, Θ takes the form
Θ = C I M PBL I M PB H L T T I M ϝ T T I M ( Ξ 12 + P ) 2 β I M I M I M L T T 2 I M T I M Ξ 22 0 ,
where C = I M Sym ( PA ) + H Sym ( PBL ) + 1 2 H 2 I M + I M Ξ 11 , and ν = [ ε T e T Φ T F T ] T .
To resolve the issue where condition (16) does not align with the conventional form of an LMI, an alternative method is employed. This method involves the decomposition of the matrix H using an orthogonal matrix J , such that H = J Λ J T , with Λ containing the eigenvalues of H . This allows for a reformulation of the system’s stability conditions in terms of the transformed state variables ν , leading to a simplified expression for stability analysis ( J 1 ) T Θ J 1 0 , which ensures the system’s stability by satisfying the necessary conditions in a more straightforward form:
Θ = D I M PBL I M PB Λ L T T I M G T T I M ( Ξ 12 + P ) 2 β I M I M I M L T T 0 2 I M T 0 I M Ξ 22 0 ,
where D = I M Sym ( PA ) + Λ Sym ( PBL ) + 1 2 Λ 2 I M + I M Ξ 11 .
As a result, (15) is equivalent to
D t ζ 0 C W ( t ) ν ¯ T Θ ν ¯ W ( t ) + M γ e θ t = p = 1 N ε ¯ p T Sym PA + λ i PBL + 1 2 λ p 2 + Ξ 11 ε ¯ p + 2 ε ¯ p T P BL e ¯ p + 2 ε ¯ p T PB λ p L T T ϝ T T × Φ ¯ p + 2 ε ¯ p ( Ξ 12 + P ) F ¯ p 2 β e ¯ p T e ¯ p 2 e ¯ p L T T Φ ¯ p 2 Φ ¯ p T T Φ ¯ p + F ¯ p T Ξ 22 F ¯ p W ( t ) + M γ e θ t .
Therefore, we can infer that D t ζ 0 C W ( t ) 0 if
Ω = P Sym ( A + λ p BL ) + 1 2 λ p 2 I + Ξ 11 PBL PB λ p L T T ϝ T T P + Ξ 12 2 β I L T T 2 T Ξ 22 0 ,
The condition ε φ ( I M G , u 0 ) ensures the validity of the sector-bound condition; φ ( I M G , u 0 ) serves as a domain of consensus in this context, and its range is approximated by E ( I M P , η ) . It can also be concluded that E ( I M P , η ) φ ( I M G , u 0 ) if the following inequality is satisfied:
I M P I M ϝ q T I M u 0 2 η 0
Given the characteristics of the Kronecker product, if we multiply Equation (20) by diag { P 1 , I } on both sides, we can derive the LMIs (10).
From (18), we have
W ( t ) E ζ ( ( t t 0 ) ζ ) W ( t 0 ) + τ ˜ ( t t 0 ) ζ E ζ , 1 + ζ ( ( t t 0 ) ζ ) ) e θ t = E ζ ( ( t t 0 ) ζ ) W ( t 0 ) + τ ˜ e θ t = 0 ( ) ( t t 0 ) ζ ( + 1 ) Γ ( ζ ( + 1 ) + 1 ) = E ζ ( ( t t 0 ) ζ ) W ( t 0 ) + τ ˜ ι e θ t 1 = 0 ( ) ( t t 0 ) ζ Γ ( ζ + 1 ) = E ζ ( ( t t 0 ) ζ ) W ( t 0 ) + τ ˜ ι e θ t ( 1 E ζ ( ( t t 0 ) ζ ) = W ( t 0 ) τ ˜ ι e θ t E ζ ( ( t t 0 ) ζ ) + τ ˜ e θ t .
Therefore, lim t + ε ( t ) = 0 , implying that the consensus of the leader–follower FONMANSs is achieved. This ensures that all agents converge to a common state, satisfying the consensus of the system condition.    □

4.2. Convex Hull Representation Approach

In this subsection, we explore the application of a convex hull approach to handle a saturation term, denoted as sat ( u ( t ) ) . This is often used in control systems, optimization, or numerical methods, where saturation can be interpreted as a nonlinear operation that limits the output of a system or process.
The main idea is to represent the saturation function sat ( u ( t ) ) as a convex combination of multiple points or functions to manage its behavior. In Equation (8), the approach is outlined as follows:
sat ( u ( t ) ) = sat ( I M L ) ( μ + e )
The saturation term can be approximated or represented as a convex combination of several possible outcomes, expressed as
sat ( u ( t ) ) co I M ( E r L + E r H ) ( μ + e ) ,   r I [ 1 , 2 m ] .
Thus, the convex combination approach allows for expressing the saturation term as a weighted sum of different terms that span the space of possible outcomes, providing flexibility in approximating or controlling the saturation behavior.
Remark 1. 
Theorem 1 presents a practical way to calculate the gain matrix for the distributed consensus control strategy and the parameters of the DAETM (4), guaranteeing asymptotic stability and consensus in the leader–follower FONMANS systems (6). The gain matrix L and ET threshold parameters d p , γ, and θ are carefully derived from the feasible solutions of (9) and (10). These solutions are systematically constructed to achieve stability and minimize communication and computational overhead within the network. The derivation process depends on the agent-specific parameters A and B , as well as the communication topology matrix L , which defines the interactions among leaders and followers. This approach provides a clear way to handle the relationships between agents and the network structure, ensuring smooth coordination and control. It is also designed to handle larger and more complex systems without adding too much computational load, making it suitable for practical applications.
Theorem 2. 
Consensus in leader–follower FONMANSs (6) can be attained with the DAETM (4), provided that positive constants β ,   ρ > 0 , a positive diagonal matrix T > 0 , and Ψ > 0 , L , and ϝ satisfy the following conditions:
Sym [ A Ψ + λ p B ( E r L Ψ + E r H Ψ ) ] B ( E r L Ψ + E r H Ψ ) I M + Ψ Ξ 12 Ψ 2 β ( ρ 2 I M 2 ρ Ψ ) Ξ 22 1 2 λ p 2 I + Ξ 11 0 ,
4 ρ I M Ψ 2 ρ 2 I M I M 0 1 η H 2 Ψ I M H Ψ Ψ ( q ) I M H Ψ ( q ) u 0 2 0 I M Ψ 0 1 ϖ I M I M 0 ,
where Ψ = P 1 , p I [ 1 , M ] , q I [ 1 , M m ] , and then the consensus domain is approximated using the set E ( I M P , η ) .
Proof. 
Consider the following Lyapunov function for analyzing the error dynamics of the system (6):
W ( t ) = ε T ( t ) ( I M P ) ε ( t ) .
By Lemma 1, the Caputo derivative W ( t ) along the trajectory of (6) and (21) is obtained as follows:
D t ζ 0 C W ( t ) 2 ε T ( t ) ( I M P ) D t ζ 0 C ε ( t ) co ε T I M Sym ( PA ) + H Sym ( PB Ξ r ) ε + 2 ε T ( I M P ) F + 2 ε T H PB Ξ r e + 2 ε T ( I M P ) .
By applying Lemma 3, the system’s behavior at each time t for each r , where r is indexed over the set I [ 1 , 2 m ] , can be analyzed. The computation of these elements is shaped by the structure and dynamics of the system, which may involve fractional differential equations. In particular, D t ζ 0 C W r ( t ) can be expressed as follows:
D t ζ 0 C W r ( t ) ε T I M Sym ( PA ) + H Sym ( PB Ξ r ) ε + 2 ε T ( I M P ) F + 2 ε T H PB Ξ r e ε T I M Sym ( PA ) + H Sym ( PB Ξ r ) ε + 2 ε T ( I M P ) F + 2 ε T ( I M PB Ξ r ) e + 1 2 ε T ( H 2 I M ) ε 2 β e T e + ε T ( I M Ξ 11 ) ε + 2 ε T ( I M Ξ 12 ) F + F T ( I M Ξ 22 ) F .
The specified expression is Ξ r = E r L + E r H . Then, following the approach similar to that in Theorem 1, if the inequality below is satisfied, it leads to the conclusion that W r ( t ) 0 , as follows:
P r e d Sym ( A + λ p B Ξ r ) + 1 2 H 2 + Ξ 11 P B Ξ r P + Ξ 12 2 β I 0 Ξ 22 0 .
By applying Lemma 4, it follows that W ( t ) max r I [ 1 , 2 m ] W r ( t ) . Furthermore, it is established that the error region E ( I M P , η ) , which defines the acceptable bounds on the error, is a subset of the polyhedral region L ( I M H , u 0 ) . This polyhedral region is defined as the set of error and measurement terms ( ε , μ ) such that the norm of their weighted sum, influenced by the matrix H , is a constrained constant, u 0 , i.e., ( I M H ) ( e + μ ) u 0 . This inclusion enables the use of a geometric approximation, simplifying the analysis of the system’s behavior. The following inequality governs the system’s dynamics, describing the interaction between the error terms e, μ and the system matrices, ensuring that the overall system stability is maintained:
1 η ε T ( I M P ) ε + 2 e T e ϖ μ T μ 1 u 0 2 ( μ + e ) T ( I M H ) ( q ) T ( I M H ) ( q ) ( μ + e ) 0 .
This inequality guarantees that the system’s trajectory remains within the prescribed error bounds, thus confirming that consensus is achieved under the given conditions. Based on the DAETM (4), ε L ( I M H , u 0 ) if and only if ε E ( I M P , η ) , implying that, E ( I M P , η ) L ( I M H , u 0 ) . ε L ( I M H , u 0 ) fulfills the condition required for the introduction of the convex hull notation. Therefore, L ( I M H , u 0 ) is the domain of the consensus in this context, and its domain is approximated by E ( I M P , η ) . Assuming μ = ( H I M ) ε , we proceed to analyze that
[ e μ ] T [ 2 I M I M 0 1 η H 2 P ϖ I M I M ] [ e μ ] 1 u 0 2 e μ T Ξ T ( I M H ) ( q ) T ( I M H ) ( q ) Ξ e μ 0 ,
where Ξ = [ I N n I N n ] . By applying the Schur complement, we can demonstrate that the following inequality leads to the result in (28) as follows:
2 I M I M 0 1 η H 2 P ϖ I M I M ( I M H ) ( q ) ( I M H ) ( q ) u 0 2 0 .
By using the similar proof of Theorem 1, ensuring the system’s stability and consensus analysis,
Z I M B ( E r L Ψ + E r H Ψ ) I M ( I M + Ψ 12 ) I M Ψ 2 β I M ( ρ 2 I M 2 ρ Ψ ) I M Ξ 22 1 2 H 2 I M + I M Ξ 11 0 ,
4 ρ I M Ψ 2 ρ 2 I M I M 0 1 1 η H 2 Ψ I M H Ψ ( q ) I M H Ψ ( q ) u 0 2 0 I M Ψ 0 1 ϖ I M I M 0 ,
where Z = Sym [ I M A Ψ + H ( E r L Ψ + E r H Ψ ) ] ,   Ψ = P 1 , p [ 1 , M ] , q I [ 1 , M m ] , and the domain of consensus is determined by the region E ( I M Ψ , η ) . Consequently, consensus is achieved in the leader–follower FONMANSs.    □

4.3. Zeno Behavior Analysis

This section demonstrates that Zeno behavior is avoided in leader–follower FONMANS systems (6) through the application of the DAETM strategy (4). By analyzing the conditions that prevent infinite switching within a finite time, the system’s smooth evolution is ensured, avoiding instability or non-physical behavior. Furthermore, the DAETM strategy establishes sufficient constraints on system parameters, effectively eliminating the risk of Zeno behavior and guaranteeing stable and predictable performance over time.
Theorem 3. 
Given the conditions specified in Theorem 1, the leader–follower FONMANS systems (6) do not exhibit Zeno behavior, and the time interval between consecutive triggering instants for any agent remains strictly positive, i.e., t r + 1 p t r p = T ^ p > 0 .
Proof. 
Based on the proof of Theorem 1, we establish that
lim t + | ε p ( t ) | 1 = 0 for agent p ,
the error between the agent p and its target trajectory converges to zero as time progresses. Furthermore, there exists a non-negative scalar χ σ p such that
| 0 C D t ζ ε p ( t ) | 1 χ σ p ;
this establishes an upper bound for the ζ -order derivative of the error function, ensuring that the error’s rate of change remains constrained. Based on Definition 2, we define a function f p q ( t ) that satisfies the relationship
I t 1 ζ t 0 ε p q ( t ) = χ σ p f p q ( t ) ,
where q { 1 , 2 , , m } indexes the other agents in the system. This function f p q ( t ) represents the time evolution of the error between agents p and q. To simplify the analysis, we denote
v p q ( t ) = ε p q ( t ) ,
which captures the rate of change of the error between the two agents. Finally, by applying the Laplace transform to the ζ -order integration, we obtain an expression in the frequency domain, which is crucial for analyzing the stability and behavior of the system:
s V p q ( s ) = χ σ p s 1 ζ s 2 ζ F p q ( s ) ,
where V p q ( s ) = L ( v p q ( t ) ) and F p q ( s ) = L ( f p q ( t ) ) . Hence, we obtain
lim s 1 0 s F p q ( s ) = 0 .
This leads to
lim t + ε p q ( t ) = 0 .
Therefore,
lim t + ε p ( t ) = 0 , which implies ε p ( t ) 1 δ ˜ t t 0 .
Consequently, the subsequent inequality is satisfied:
D t ζ t r p C ε p ( t ) 1 sign ( ε p T ( t ) ) D t ζ t r p C ε p ( t ) = sign ( ε p T ( t ) ) D t ζ 0 C ε p ( t ) 1 Γ ( 1 ζ ) t 0 t r p ( t s ) ζ ε p ( s ) d s 0 C D t ζ ε p ( t ) 1 + 1 Γ ( 1 ζ ) t p t 0 t ( t s ) ζ ε p ( s ) 1 d s A 1 ε p ( t ) 1 + B 1 ( μ + e ) + G ( t ) 1 + ( t t r p ) 1 ζ Γ ( 2 ζ ) δ ˜ ^ p ( Δ ) A 1 δ ˜ ,
where ^ p ( Δ ) = B 1 ( μ + e ) + G ( t ) 1 + ( t t r p ) 1 ζ Γ ( 2 ζ ) δ ˜ + 2 A 1 δ ˜ .
Then, we have
D t ζ t r p C e p ( t ) 1 sgn ( e p T ( t ) ) D t ζ t r p C e p ( t ) = sgn ( e p T ( t ) ) A e p ( t ) + A ε p ( t ) D t ζ t r p C ε p ( t ) A 1 e p ( t ) 1 + A 1 ε p ( t ) 1 + D t ζ t r p C ε p ( t ) 1 A 1 e p ( t ) 1 + ^ p ( Δ ) .
Thus, one obtains
e p ( t ) 1 E ζ A 1 ( t t r p ) ζ e p ( t r p ) 1 + ^ p ( Δ ) ( t t r p ) ζ E ζ , ζ + 1 A 1 ( t t r p ) ζ = ^ p ( Δ ) A 1 E ζ A 1 ( t t r p ) ζ 1 .
Based on the ET function (4), it follows that
e p ( t ) 2 = μ p ( t r p ) 2 + γ e θ t r p .
The interval between two triggering moments t r p and t r + 1 p can be made arbitrarily large if the evolution of e p ( t ) 1 2 is slow enough, which prevents the occurrence of Zeno behavior. By considering the monotonic properties of E ζ ( t ) and the constraints placed by the error dynamics, we can establish a lower bound for the time between consecutive triggers. This bound ensures that the system will not exhibit arbitrarily frequent triggering events, thus maintaining stability and avoiding Zeno behavior:
t r + 1 p t r p A 1 1 E ζ 1 1 + γ ^ p ( Δ ) e θ 2 t p r 1 ζ = T ^ p ( Δ ) > 0 .
Therefore, Zeno behavior is prevented for all agents, ensuring that the system’s triggering events remain sufficiently spaced apart, preventing any infinitely rapid sequences of updates.
Remark 2. 
The expression (33) provides an estimate for the minimum time interval T ^ p ( Δ ) between two consecutive triggering instants, t r p and t r + 1 p , which reflects the sensitivity of the ET mechanism. This interval T ^ p ( Δ ) is determined by several factors, including the system parameters A and B , the Caputo-type fractional derivative order ζ, and the ET threshold parameters d p and γ . Notably, for a given system described by Equation (4), increasing the threshold parameter d p results in a longer minimum interval T ^ p ( Δ ) . This indicates that the system becomes less sensitive to small state changes, potentially reducing communication and computational demand while maintaining stability.

5. Illustrative Examples

This section validates the effectiveness and applicability of the proposed theoretical observations by verifying the numerical simulations of the leader–following SG system using the experimental range of parameter values. Additionally, a comparative example is provided with the fractional-order Chua’s system to highlight the advantages of the proposed control method and the effectiveness of the derived sufficient conditions. This demonstrates the efficiency of the proposed control scheme, its validation process, and the details provided in Algorithm 1. All simulations were conducted using the LMI Toolbox in MATLAB 2017a.
Algorithm 1 Proposed DAETM-based FONMANS with input saturation
Step 1: System initialization
            Initialize system matrices A , B , network topology G ¯ , scalars β > 0 , ρ > 0 ,
            diagonal matrix T > 0 ,   Ψ > 0 and event-trigger thresholds d p and γ p .
            Set the saturation threshold u 0 and controller gain L .
Step 2: Control input calculation
            For each agent p, compute the control input μ p ( t ) :
             μ p ( t ) = q M p a p q ( ω p ( t ) ω q ( t ) ) + b p ( ω p ( t ) ω L ( t ) ) .
            Calculate the control input: u p ( t ) = L μ p ( t r p ) .
Step 3: Apply saturation
            Apply the saturation function: sat ( u p h ) = sign ( u p h ) min { u 0 , | u p h ( t ) | } .
            Approximate the saturated control input as a convex combination:
             sat ( u ( t ) ) co I M ( E r L + E r H ) ( μ + e )
Step 4: ET condition
            For each agent p, check the event-triggering condition: e p ( t ) 2 1 2 F ( t ) .
            If satisfied, update neighbor states and reset parameters.
            Otherwise, proceed without updates.
Step 5: Stability and consensus
            Check stability using LMIs.
            Achieve consensus by ensuring that ε p ( t ) 0 , i.e., agents align with
            the leader’s state ω L .
Step 6: Return results
            Return the final states of all agents, achieving consensus with the leader.
Step 7: Repeat
            Repeat the process for the next time interval [ t r , t r + 1 ) .
Example 1 
(Design Example). The modeling of practical power supply systems is very complex due to their nonlinear characteristics, strict operating criteria, and dynamic interactions between components. In this paper, an SG connected to an infinite bus via a transmission line is analyzed (Figure 2). In Figure 3, the agent with index L, and the agents indexed by 1 , 2 , and 3 are referred to as the followers. Using the SG model described in [29] for measuring the rotor angle, the field voltage, rotor angle, and electrical power are among the essential measurable variables. Mathematical equations capture the nonlinear dynamics of this system and form the basis for the analysis of the system’s behavior. These equations help to determine the stability, control mechanisms, and performance of the system under different operating conditions.
The following nonlinear equations define the model [29]:
δ ˙ = ϖ ϖ ˙ = 1 J T m T e D ϖ e ˙ q = 1 T d o E F D e q ( x d x d ) i d ,
where
i d = e q V cos δ x d T e = P e V x d e q sin δ + V 2 2 1 x q 1 x d sin 2 δ .
Here, δ represents the rotor angle relative to the machine terminals and ω represents the rotor speed, along with other parameters used in the model, as stated in Table 1 (similar to [29]).
Under this assumption, magnetic saturation has no effect. Furthermore, the constants representing the increased reactance are x d , x q and x d . Below is a detailed overview of the system states and inputs:
ω = ω 1 ω 2 ω 3 = δ ϖ e q , u = u 1 u 2 = E F D T m , Δ = δ 1 δ 2 δ 3
The three state variables of the SG system are ω 1 , ω 2 , and ω 3 . Furthermore, the system disturbances are represented by δ 1 , δ 2 , and δ 3 . Consider that the system inputs are u 1 and u 2 . The dynamics of the leader and follower agents are described by the following fractional-order differential equations with a Caputo derivative:
D t ζ 0 C ω p ( t ) = 0 1 0 0 D J 0 0 0 1 T d o ( x d x d ) ω 1 p ω 2 p ω 3 p + 0 0 0 1 J 1 T d o 0 u 1 p u 2 p + 0 1 J V x d ω 3 p sin ω 1 p + V 2 2 1 x q 1 x d sin 2 ω 1 p 1 T d o x d x d x d V cos ω 1 p + Δ p .
Thus, the behavior of follower agents in a distributed SG system is defined by the following equation:
D t ζ 0 C ω p ( t ) = A ω p ( t ) + B u p ( t ) + g ( ω p ( t ) ) + Δ p ( t )
where ω p ( p = 1 , 2 , 3 ) are the state variables, g ( ω p ( t ) ) is a defined nonlinear function, u p are the control inputs, and δ p ( t ) represents the external disturbances. Moreover A , B and g ( ω p ( t ) ) are defined as follows:
A = 0 1 0 0 D J 0 0 0 1 T d o ( x d x d ) , B = 0 0 0 1 J 1 T d o 0 ,
g ( ω p ( t ) ) = 0 1 J V x d x 3 i sin x 1 i + V 2 2 1 x q 1 x d sin 2 x 1 i 1 T d o x d x d x d V cos x 1 i .
Assume that Δ p ( t ) = 7 cos ( 2 π t ) . For the numerical simulations, the parameter values in (35) are chosen as presented in Table 2, and the other parameter values are ρ = 0.02 , η = 1 , β = 21 , u 0 = 0.5 , μ p ( 0 ) = 0.4 , d p = 1 , θ = 2.7 , and ϖ = 0.4 . Using the LMIs in (9) and (10), based on Theorem 1, we obtain the following:
P = 2.0912 1.1452 2.3012 4.8801 11.0090 0.0021 1.9012 0.9908 1.3009 L = 39.9032 21.9801 11.6031 16.0052 11.0450 9.0007 .
The simulation results are presented in Figure 4, Figure 5, Figure 6 and Figure 7, based on the initial conditions, ω L = [ 2 3 2 ] T , ω 1 = [ 4 3 0 ] T , ω 2 = [ 2 3.5 3 ] T , and ω 3 = [ 1 2 2 ] T , with the controller (3) and the DAETM (4) applied to each follower to control the trajectories of the state errors ε p q ( t ) ( p = L , 1 , 2 , 3 ; q = 1 , 2 , 3 ) of the SG system. The analysis in Figure 4 clearly shows that the system is unstable, emphasizing the need to improve the controller’s robustness. The following discussion addresses key challenges such as actuator saturation, external disturbances, and limited communication, which are vital factors influencing the consensus problem of the fractional-order SG system defined by (37). Another key challenge was to ensure asymptotic consensus among agents in the fractional-order SG system (37) using the DAETM (4). Figure 5 demonstrates the tracking error system responses ε p ( t ) = ω p ( t ) ω L ( t ) for the leader and three followers using the DAETM (4) based on the sector-bound condition approach. As illustrated in Figure 6, the proposed control inputs u p ( t ) for the fractional-order SG system (37) are shown. Figure 7 shows the event-triggered update sequences for the three agents, corresponding to the DAETM scheme (4) and the dynamic ET protocol parameters ξ p ( t ) for the three agents. These sequences illustrate how the control updates are triggered based on specific events rather than continuous monitoring, optimizing the efficiency of communication and computation. Additionally, the adaptive thresholds (see Figure 7) are observed to be bounded and dynamic, eventually converging from 0.50 to 0.60 . Instead of being a fixed constant, the threshold is controlled based on the state variance, allowing the rate of data release to meet the dynamic control performance requirements. This dynamic adjustment ensures that the system remains flexible and responsive to varying conditions, improving performance while reducing unnecessary computations and communication delays. The parameters ξ p ( t ) are essential for determining the timing of updates, ensuring that the agents’ responses stay synchronized while minimizing computational load. This approach enhances system stability and performance by triggering updates only when significant changes occur.
The single-variable technique is used to investigate the effects of the fractional-order ζ and the dynamic ET threshold parameter γ on the number of ET moments. The results, summarized in Table 3 and Table 4, reveal that the event-triggered method significantly reduces communication between agents. Table 3 shows that increasing the fractional-order ζ substantially decreases the number of ET impulsive instances, while Table 4 demonstrates that increasing γ leads to more frequent ET impulsive instances. Additionally, we present the voltage and current evolutions for γ = 0.3 using the ET function (4), shown in Figure 6. As observed, a smaller value of γ , which corresponds to a higher error threshold (as indicated in Figure 6), results in slower convergence. This reflects a trade-off between communication frequency and convergence speed: higher values γ lead to faster convergence due to increased communication, while lower values γ reduce communication but result in slower convergence.
This trade-off highlights the delicate balance between minimizing communication overhead and achieving the desired convergence speed. By adjusting it, γ , it is possible to fine-tune the system’s performance, optimizing both the speed of convergence and the efficiency of communication, depending on the specific requirements of the application. The dynamic nature of these parameters offers flexibility in handling various system constraints and performance goals.
Example 2 
(Comparative Example). This subsection presents our results on the proposed control method for fractional-order Chua circuits [30]. The single-circuit model, shown in Figure 8, satisfies the following differential equations [30]:
D t ζ 0 C v 1 ( t ) = 1 R C 1 ( v 1 + v 2 ) f ( v 1 ) D t ζ 0 C v 2 ( t ) = 1 R C 2 ( v 1 v 2 ) + i 3 D t ζ 0 C i 3 ( t ) = 1 L ( v 2 + R 0 i 3 ) ,
where the description of v 1 , v 2 , C 1 , C 2 , i 3 , L, R 0 , R, and f ( v 1 ) are provided in [30]. Figure 9 shows the topological structure of the communication network, where a leader and four agents operate for a single Chua circuit.
Let ω p 1 ( t ) = v p 1 ( t ) , ω p 2 ( t ) = v ω 2 ( t ) , and ω p 3 ( t ) = v p 13 ( t ) . The corresponding networked system can be expressed as
D t ζ 0 C ω p 1 D t ζ 0 C ω p 2 D t ζ 0 C ω p 3 = [ a a 0 b b c 0 d g ] ω p 1 ω p 2 ω p 3 + 1 0 0 u p ( t ) + h f ( ω p 1 ) 0 0 + Δ p ( t ) ,
where a = 1 / R C 1 ,   b = 1 / R C 2 ,   c = 1 / C 2 ,   d = 1 / L ,   g = R 0 / L ,   h = 1 / C 1 . In addition, A , B , and g ( ω p ( t ) ) are defined as follows: A = a a 0 b b c 0 d g ,   B = 1 0 0 ,   g ( ω p ( t ) ) = h f ( ω p 1 ) 0 0 . We then select the following model parameters: a = 9.1 ,   b = 1 ,   c = 1 ,   h = 9.1 ,   G b 1 = 0.7559 ,   G a 1 = 1.39386 ,   d = 16.5811 ,   g = 0.138083 ,   and f ( ω p 1 ) = G b 1 ω p 1 + ( 1 / 2 ) ( G a 1 G b 1 ) | ω p 1 + 1 | ( 1 / 2 ) ( G a 1 G b 1 ) | ω p 1 1 | , which follows a structure similar to that in [25]. It is established in [31] that g ( ω p 1 ) satisfies Assumption 2. We assume that Δ p ( t ) = 2.5 sin ( 2 π t ) . Chua’s circuit systems are applied with these model parameters to guarantee the stability of the FONMAS given in (40). The proposed values are ρ = 0.02 , η = 1 , β = 21 , u 0 = 0.5 ,   μ p ( 0 ) = 0.4 ,   d p = 1 ,   θ = 1.5 ,   and ϖ = 0.4 . Finally, using Theorem 1 and solving LMIs (9) and (10), it is observed that
P = 0.03459 3.2034 0.9023 0.0923 7.9245 0.8912 4.7912 1.8201 4.0912 L = 0.0124 7.0129 1.9023 .
The initial state values of the system are ω 0 = [ 2 3 2 ] T ,   and ω 1 = [ 4 3 0 ] T ,   ω 2 = [ 2 3.5 3 ] T ,   ω 3 = [ 1 2 2 ] T . Specifically, Figure 10 displays the state trajectories of fractional-order Chua’s system (40) without control input. The trajectories of the state errors ε p q ( t ) ( p = L , 1 , 2 , 3 ; q = 1 , 2 , 3 ) are shown in Figure 11, Figure 12 and Figure 13. We propose the DAETM scheme (4) for each follower in the fractional-order Chua’s system (40), which consists of one leader and three followers. Figure 11 shows the responses of the tracking variables for the leader and the three followers using the DAETM scheme (4). Figure 12 shows the evolution of the control input for the three followers. Figure 13 illustrates the time points of the event triggering and the adaptive parameters ξ p ( t ) . Based on the analysis in Figure 11, Figure 12 and Figure 13, the dynamic variables used in the DAETM scheme demonstrate that the number of events triggered by the DAETM (4) with actuator saturation is significantly lower compared to the fixed-variable ET mechanism proposed in our study. This reduction in triggered events highlights the efficiency of the DAETM scheme in minimizing communication while maintaining synchronization among the agents. Moreover, by comparing the proposed DAETC mechanism in (4) with those in [16,18,20], which exhibit similar consensus performance, we conclude from Figure 13 and Table 5 that adopting the mechanism in (4) significantly reduces the communication burden. This reduction highlights the critical importance of selecting appropriate ET mechanism parameters to enhance the use of communication network bandwidth. In contrast to existing studies [16,18,20], our analysis demonstrates that the proposed strategy not only reduces data transmission but also improves overall system performance by increasing resource utilization and minimizing unnecessary communication. These results suggest that careful design of ET mechanisms can substantially enhance the efficiency of distributed systems.

6. Conclusions

In this study, we have addressed the event-triggered controller design for the consensus problem of leader–follower fractional-order nonlinear multi-agent networked systems, subject to actuator saturation and external disturbances. A novel dynamic adaptive event-triggered mechanism has been designed to handle actuator saturation, external disturbances, and limited communication while saving more communication resources than some existing methods. Two analysis approaches are presented to address the saturation term in the event-triggered controller design. By constructing an auxiliary fractional-order differential equation, a DAETM has been designed to significantly reduce the control transmission frequency while retaining the desired consensus performance. The sector-bounded and convex hull methods are applied, and by utilizing the properties of fractional-order calculus and Lyapunov functions, sufficient conditions in the form of LMIs are obtained to guarantee the asymptotic stabilization of the systems. Moreover, a positive lower bound has been established for the intervals of triggering instants to prevent Zeno behavior. Finally, numerical simulations of the fractional-order SG system demonstrate the effectiveness and superiority of the proposed approach. In the comparison studies of the fractional-order Chua circuit system, we have confirmed the feasibility of the proposed control method, showing that the DAETM method can effectively reduce the communication load. In our future work, based on the proposed adaptive event-triggered learning control algorithm [20,29], our objective is to investigate the challenges of learning control algorithms and actuator saturation in nonlinear leader–follower fractional-order multi-agent networked systems.

Author Contributions

Conceptualization, G.N. and M.B.; Methodology, G.N. and M.B.; Validation, V.G., G.N. and S.A.; Investigation, G.N., M.B. and S.A.; Writing—original draft, G.N.; Writing—review and editing, M.B., V.G. and S.A.; Visualization, G.N.; Supervision, S.A.; Funding acquisition, S.A. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korean government (MSIT) (No. NRF-2022R1A4A1023248 and No. RS-2023-00209794).

Data Availability Statement

Data sharing does not apply to this article as no datasets were generated or analyzed during the current study.

Conflicts of Interest

The authors have no relevant financial or non-financial interests to disclose. The authors declare that they have no conflicts of interest.

Abbreviations

The following key notations and abbreviations are used in this manuscript:
NotationsDescription
N Non-negative integers
R Set of real numbers
C Set of complex numbers
R n n-dimensional Euclidean space
R n × m Set of all n × m real matrices
I [ 1 , M ] Set of positive integers { 1 , 2 , , M }
D t ζ t 0 C Fractional-order derivative operator
I t ζ t 0 Fractional-order integral operator
Γ ( · ) Gamma function
Kronecker product
diag { } Diagonal matrix
W > 0 Matrix W is symmetric and positive-definite
W T Transpose of a matrix W
*Non-diagonal symmetric entry
IIdentity matrix with compatible dimensions
Y > 0 ( 0 ) Positive (semi) definite matrix
Y < 0 ( 0 ) Negative (semi) definite matrix
Sym ( Y ) Y + Y T
sign ( α ) The sign operator, that is, sign ( α ) α / | α | , α 0
co ( · ) Convex hull
| | Y | | max λ ( Y T Y ) , where λ ( Y T Y ) is the eigenvalue of matrix Y T Y
AbbreviationsMeaning
MASMulti-agent system
SGSynchronous generator
ETEvent-triggered
LMILinear matrix inequality
FOMASFractional-order multi-agent system
DAETMDynamic adaptive event-triggered mechanism
FONMANSFractional-order nonlinear multi-agent networked system

References

  1. Narayanan, G.; Ahn, S.; Wang, Y.; Jeong, J.H.; Joo, Y.H. Adaptive event-triggered stochastic estimator-based sampled-data fuzzy control for fractional-order permanent magnet synchronous generator-based wind energy systems. Expert Syst. Appl. 2025, 261, 125536. [Google Scholar] [CrossRef]
  2. Anbalagan, P.; Joo, Y.H. Stabilization analysis of fractional-order nonlinear permanent magnet synchronous motor model via interval type-2 fuzzy memory-based fault-tolerant control scheme. ISA Trans. 2023, 142, 310–324. [Google Scholar] [CrossRef] [PubMed]
  3. Narayanan, G.; Ali, M.S.; Zhu, Q.; Priya, B.; Thakur, G.K. Fuzzy observer-based consensus tracking control for fractional-order multi-agent systems under cyber-attacks and its application to electronic circuits. IEEE Trans. Netw. Sci. Eng. 2022, 10, 698–708. [Google Scholar] [CrossRef]
  4. Yan, X.; Li, K.; Yang, C.; Zhuang, J.; Cao, J. Consensus of fractional-order multi-agent systems via observer-based boundary control. IEEE Trans. Netw. Sci. Eng. 2024, 11, 3370–3382. [Google Scholar] [CrossRef]
  5. Khan, A.; Niazi, A.U.K.; Abbasi, W.; Awan, F.; Khan, M.M.A.; Imtiaz, F. Cyber secure consensus of fractional order multi-agent systems with distributed delays: Defense strategy against denial-of-service attacks. Ain Shams Eng. J. 2024, 15, 102609. [Google Scholar] [CrossRef]
  6. Gong, P.; Lan, W.; Han, Q.L. Robust adaptive fault-tolerant consensus control for uncertain nonlinear fractional-order multi-agent systems with directed topologies. Automatica 2020, 117, 109011. [Google Scholar] [CrossRef]
  7. Shahamatkhah, E.; Tabatabaei, M. Containment control of linear discrete-time fractional-order multi-agent systems with time-delays. Neurocomputing 2020, 385, 42–47. [Google Scholar] [CrossRef]
  8. Yang, Z.; Zheng, S.; Liu, F.; Xie, Y. Adaptive output feedback control for fractional-order multi-agent systems. ISA Trans. 2020, 96, 195–209. [Google Scholar] [CrossRef]
  9. Li, X.; Wen, C.; Liu, X.K. Sampled-data control based consensus of fractional-order multi-agent systems. IEEE Control Syst. Lett. 2020, 5, 133–138. [Google Scholar] [CrossRef]
  10. Chen, J.; Chen, B.; Zeng, Z. Synchronization and consensus in networks of linear fractional-order multi-agent systems via sampled-data control. IEEE Trans. Neural Netw. Learn. Syst. 2019, 31, 2955–2964. [Google Scholar] [CrossRef]
  11. Yu, Z.; Jiang, H.; Hu, C.; Yu, J. Necessary and sufficient conditions for consensus of fractional-order multiagent systems via sampled-data control. IEEE Trans. Cybern. 2017, 47, 1892–1901. [Google Scholar] [CrossRef] [PubMed]
  12. Chen, Y.; Wen, G.; Peng, Z.; Rahmani, A. Consensus of fractional-order multiagent system via sampled-data event-triggered control. J. Frankl. Inst. 2019, 356, 10241–10259. [Google Scholar] [CrossRef]
  13. Ye, Y.; Su, H.; Sun, Y. Event-triggered consensus tracking for fractional-order multi-agent systems with general linear models. Neurocomputing 2018, 315, 292–298. [Google Scholar] [CrossRef]
  14. Wang, H.; Chen, F.; Wang, Y. Co-design of distributed dynamic event-triggered scheme and extended dissipative consensus control for singular Markov jumping multi-agent systems under periodic Denial-of-Service jamming attacks. Expert Syst. Appl. 2024, 251, 124091. [Google Scholar] [CrossRef]
  15. Ge, X.; Han, Q.L.; Ding, L.; Wang, Y.L.; Zhang, X.M. Dynamic event-triggered distributed coordination control and its applications: A survey of trends and techniques. IEEE Trans. Syst. Man Cybern. Syst. 2020, 50, 3112–3125. [Google Scholar] [CrossRef]
  16. Han, Z.; Tang, W.K.; Jia, Q. Event-triggered synchronization for nonlinear multi-agent systems with sampled data. IEEE Trans. Circuits Syst. I Regul. Pap. 2020, 67, 3553–3561. [Google Scholar] [CrossRef]
  17. Deng, C.; Che, W.W.; Wu, Z.G. A dynamic periodic event-triggered approach to consensus of heterogeneous linear multiagent systems with time-varying communication delays. IEEE Trans. Cybern. 2020, 51, 1812–1821. [Google Scholar] [CrossRef]
  18. Xie, X.; Wei, T.; Li, X. Hybrid event-triggered approach for quasi-consensus of uncertain multi-agent systems with impulsive protocols. IEEE Trans. Circuits Syst. I Regul. Pap. 2021, 69, 872–883. [Google Scholar] [CrossRef]
  19. He, W.; Xu, B.; Han, Q.L.; Qian, F. Adaptive consensus control of linear multiagent systems with dynamic event-triggered strategies. IEEE Trans. Cybern. 2019, 50, 2996–3008. [Google Scholar] [CrossRef]
  20. Wang, J.; Zheng, Y.; Ding, J.; Zhang, H.; Sun, J. Memory-based event-triggered fault-tolerant consensus control of nonlinear multi-agent systems and its applications. IEEE Trans. Autom. Sci. Eng. 2024. [Google Scholar] [CrossRef]
  21. Pan, L.; Shao, H.; Li, Y.; Li, D.; Xi, Y. Event-triggered consensus of matrix-weighted networks subject to actuator saturation. IEEE Trans. Netw. Sci. Eng. 2022, 10, 463–476. [Google Scholar] [CrossRef]
  22. Fei, Y.; Shi, P.; Lim, C.C. Neural-based formation control of uncertain multi-agent systems with actuator saturation. Nonlinear Dyn. 2022, 108, 3693–3709. [Google Scholar] [CrossRef]
  23. Zhou, Y.; Li, C.; Jiang, G.P.; Liu, J. Robust prescribed-time consensus of multi-agent systems with actuator saturation and actuator faults. Asian J. Control 2022, 24, 743–754. [Google Scholar] [CrossRef]
  24. Podlubny, I. Fractional Differential Equations: An Introduction to Fractional Derivatives, Fractional Differential Equations, to Methods of Their Solution and Some of Their Applications; Elsevier: Amsterdam, The Netherlands, 1998. [Google Scholar]
  25. Narayanan, G.; Ali, M.S.; Alsulami, H.; Stamov, G.; Stamova, I.; Ahmad, B. Impulsive security control for fractional-order delayed multi-agent systems with uncertain parameters and switching topology under DoS attack. Inf. Sci. 2022, 618, 169–190. [Google Scholar] [CrossRef]
  26. Xu, J.; Huang, J. An overview of recent advances in the event-triggered consensus of multi-agent systems with actuator saturations. Mathematics 2022, 10, 3879. [Google Scholar] [CrossRef]
  27. Hu, S.; Yue, D. Event-triggered control design of linear networked systems with quantizations. ISA Trans. 2012, 51, 153–162. [Google Scholar] [CrossRef]
  28. Açıkmeşe, B.; Corless, M. Observers for systems with nonlinearities satisfying incremental quadratic constraints. Automatica 2011, 47, 1339–1348. [Google Scholar] [CrossRef]
  29. Sharifi, A.; Sharafian, A.; Ai, Q. Adaptive MLP neural network controller for consensus tracking of multi-agent systems with application to synchronous generators. Expert Syst. Appl. 2021, 184, 115460. [Google Scholar] [CrossRef]
  30. Ding, L.; Zheng, W.X. Network-based practical consensus of heterogeneous nonlinear multiagent systems. IEEE Trans. Cybern. 2016, 47, 1841–1851. [Google Scholar] [CrossRef]
  31. Jiang, G.P.; Tang, W.K.S.; Chen, G. A simple global synchronization criterion for coupled chaotic systems. Chaos Solitons Fractals 2003, 15, 925–935. [Google Scholar] [CrossRef]
Figure 1. Flow chart of the DAETM scheme with input saturation for agent p.
Figure 1. Flow chart of the DAETM scheme with input saturation for agent p.
Mathematics 13 00524 g001
Figure 2. Structure of the SG connected to an infinite bus.
Figure 2. Structure of the SG connected to an infinite bus.
Mathematics 13 00524 g002
Figure 3. Communication graph.
Figure 3. Communication graph.
Mathematics 13 00524 g003
Figure 4. Tracking error trajectories (37) without control input.
Figure 4. Tracking error trajectories (37) without control input.
Mathematics 13 00524 g004
Figure 5. Tracking error trajectories (37) with the DAETM scheme.
Figure 5. Tracking error trajectories (37) with the DAETM scheme.
Mathematics 13 00524 g005
Figure 6. Curves of the control input u p ( t ) .
Figure 6. Curves of the control input u p ( t ) .
Mathematics 13 00524 g006
Figure 7. Event-triggered instants of communication and the trajectories of dynamic variables ξ p .
Figure 7. Event-triggered instants of communication and the trajectories of dynamic variables ξ p .
Mathematics 13 00524 g007
Figure 8. Structure of the Chua circuits.
Figure 8. Structure of the Chua circuits.
Mathematics 13 00524 g008
Figure 9. Communication graph.
Figure 9. Communication graph.
Mathematics 13 00524 g009
Figure 10. Trajectory of tracking errors in (40) without control input.
Figure 10. Trajectory of tracking errors in (40) without control input.
Mathematics 13 00524 g010
Figure 11. Trajectory of tracking errors in (40) using the DAETM scheme.
Figure 11. Trajectory of tracking errors in (40) using the DAETM scheme.
Mathematics 13 00524 g011
Figure 12. Curves of the control input u p for Chua’s system in (40).
Figure 12. Curves of the control input u p for Chua’s system in (40).
Mathematics 13 00524 g012
Figure 13. Event-triggered instants of communication and the trajectories of dynamic variable ξ p .
Figure 13. Event-triggered instants of communication and the trajectories of dynamic variable ξ p .
Mathematics 13 00524 g013
Table 1. Symbols and descriptions of the SG model (34).
Table 1. Symbols and descriptions of the SG model (34).
SymbolDescription
VInfinite bus voltage
x d Direct axis reactance
T e Output electric torque
T m Input mechanical torque
x q Quadrature axis reactance
v t Generator terminal voltage
x d Direct axis transient reactance
J , D Rotor inertia and damping factor
T d o Direct axis transient time constant
E F D Equivalent EMF in the excitation coil
e q Transient internal voltage of armature
i d Direct axis stator currents
Table 2. Parameters of the SG model (34).
Table 2. Parameters of the SG model (34).
ParameterJ (pu)D (pu) x d (pu) x d (pu) x q (pu) T do (pu) 1 x q 1 x q V
Value0.02520.050.5682.0721.5590.1310−1.11871.02
Table 3. Number of events M for different values of ζ with ζ = 0.8 .
Table 3. Number of events M for different values of ζ with ζ = 0.8 .
ζ p = 1     p = 2 p = 3 TotalPercentage
0.2525662360709563523.46%
0.3722092218697512421.33%
0.5019011789514420417.50%
0.6316891219456336414.01%
0.7110701088341249910.40%
0.8557281820915996.66%
0.9330258712910184.24%
1.02212471075752.39%
Table 4. Number of instants M for various γ with γ = 0.95 .
Table 4. Number of instants M for various γ with γ = 0.95 .
γ p = 1 p = 2 p = 3 TotalPercentage
0.252652111786545.40%
0.373903891859647.95%
0.5042948919411129.17%
0.63569599209137711.36%
0.71610691222152312.56%
0.85799790249183815.16%
0.93998985297228018.81%
1.010291040305237419.58%
Table 5. The number of triggered events is compared with the methods of DAETC in [16,18,20].
Table 5. The number of triggered events is compared with the methods of DAETC in [16,18,20].
AgentsOur Strategy[16][18][20]
Agent 182191327283
Agent 285197638661
Agent 392182576593
Agent 498248740773
Average Number89.25204.50570.25577.50
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

Narayanan, G.; Baskar, M.; Gokulakrishnan, V.; Ahn, S. Dynamic Adaptive Event-Triggered Mechanism for Fractional-Order Nonlinear Multi-Agent Systems with Actuator Saturation and External Disturbances: Application to Synchronous Generators. Mathematics 2025, 13, 524. https://doi.org/10.3390/math13030524

AMA Style

Narayanan G, Baskar M, Gokulakrishnan V, Ahn S. Dynamic Adaptive Event-Triggered Mechanism for Fractional-Order Nonlinear Multi-Agent Systems with Actuator Saturation and External Disturbances: Application to Synchronous Generators. Mathematics. 2025; 13(3):524. https://doi.org/10.3390/math13030524

Chicago/Turabian Style

Narayanan, G., M. Baskar, V. Gokulakrishnan, and Sangtae Ahn. 2025. "Dynamic Adaptive Event-Triggered Mechanism for Fractional-Order Nonlinear Multi-Agent Systems with Actuator Saturation and External Disturbances: Application to Synchronous Generators" Mathematics 13, no. 3: 524. https://doi.org/10.3390/math13030524

APA Style

Narayanan, G., Baskar, M., Gokulakrishnan, V., & Ahn, S. (2025). Dynamic Adaptive Event-Triggered Mechanism for Fractional-Order Nonlinear Multi-Agent Systems with Actuator Saturation and External Disturbances: Application to Synchronous Generators. Mathematics, 13(3), 524. https://doi.org/10.3390/math13030524

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop