Next Article in Journal
The New G-Double-Laplace Transforms and One-Dimensional Coupled Sine-Gordon Equations
Previous Article in Journal
The Existence and Uniqueness of Radial Solutions for Biharmonic Elliptic Equations in an Annulus
Previous Article in Special Issue
An Interval Observer for a Class of Cyber–Physical Systems with Disturbance
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Proportional–Integral Observer-Based Dynamic Event-Triggered Consensus Protocol for Nonlinear Positive Multi-Agent Systems

School of Information and Communication Engineering, Hainan University, Haikou 570228, China
*
Author to whom correspondence should be addressed.
Axioms 2024, 13(6), 384; https://doi.org/10.3390/axioms13060384
Submission received: 15 April 2024 / Revised: 29 May 2024 / Accepted: 31 May 2024 / Published: 5 June 2024

Abstract

:
This paper investigates the state estimation and event-triggered control for positive nonlinear multi-agent systems. Firstly, a proportional–integral observer is established to estimate the states of the considered nonlinear positive multi-agent systems based on the matrix decomposition method. Then, a dynamic event-triggered mechanism is constructed, and a control protocol is proposed based on the proportional–integral observer and event-triggered mechanism. By combining linear programming with linear co-positive Lyapunov functions, the considered multi-agent systems are guaranteed to be positive and achieve consensus. Moreover, by introducing three new variables and a finite vector, the final convergence point can be changed based on the given vector. Finally, two illustrative examples demonstrate the validity of the proposed theoretical results.

1. Introduction

A massive amount of research has been conducted in recent decades on multi-agent systems (MASs) due to their enormous potential in a wide range of fields, such as energy management [1], manufacturing systems [2], robotics [3], and sensor networks [4]. As a special subclass of MASs, the so-called positive multi-agent systems (PMASs) are also widely applied in specific domains where the variables are typically non-negative, including greenhouse monitoring [5], multiple vehicle systems [6], epidemic transmission processes [7], etc. Like MASs, the consensus problem is also the fundamental task of PMASs, which involves all agents converging to a common state or reaching an agreement through local interactions. There are numerous studies on the consensus issue of general MASs from different research directions, including finite-time consensus [8], leaderless consensus [9], leader-following consensus [10], event-triggered consensus [11], cluster consensus [12], etc. However, when dealing with the consensus problem of PMASs, the existing results on general MASs cannot be applied directly since the positivity constraint must be taken into consideration.
It should be noted that the energy resources of each individual agent are often limited, which conflicts with the need for frequent communication between agents. In contrast with the traditional periodic (or time-triggered) control, which is widely used in most existing research on the consensus of MASs, the event-triggered strategy has attracted increasing attention due to its low communication burden [13]. A review of the development of event-triggered control can be found in the paper [14]. Comparisons between event-triggered and periodic strategies were conducted in [15,16], and the results have shown that the event-triggered mechanism offers some advantages over the time-triggered mechanism. The work in [17] addressed the problem of stabilizing embedded processor control tasks by introducing an event-triggered strategy, wherein control actuation is only triggered when the predefined error threshold is exceeded. The study [18] proposed a combined measurement approach named distributed event-triggered control such that the control only happens when each agent’s own threshold is triggered. Recently, the dynamic event-triggered mechanism has been adapted to handle the output consensus problem of heterogeneous linear multi-agent systems with a directed communication topology, as in [19]. As a result of the work [20], a gain-scheduled state observer and a switching threshold event-triggered strategy were developed to handle the output feedback consensus tracking control for nonlinear MASs with sensor failures. Despite significant advancements in event-triggered strategies for general and linear MASs, there is still a lack of research when it comes to nonlinear PMASs. The positivity constraints increase the difficulty, making it challenging to directly apply existing results. Additionally, nonlinearity is very common in practical situations. This paper explores dynamic event-triggered control strategies specifically designed for nonlinear PMASs to address these challenges.
On the other hand, research on PMASs is mostly predicated on the assumption that the state of the systems is measurable. However, state data sometimes may be challenging to measure due to technical limitations or high costs in practice. To handle this issue, observers have been introduced to estimate the states of agents. In the existing literature, the proportional observer (Luenberger observer) [21] has gained significant attention in the past few decades, with numerous research achievements. A distributed observer has been designed for a class of leader-following nonlinear multi-agent systems in [22]; the designed observer was cooperative with a distributed control law to solve the consensus problem of nonlinear autonomous systems. The work in [23] proposed an intermediate observer to estimate the system states, actuator faults, and sensor faults of nonlinear MASs with actuator faults and sensor faults. Consider the time-varying and non-uniform input delay: The literature [24] constructs a finite-time distributed observer to estimate the state information of each follower in high-order nonlinear MASs. Benefiting from the extra integral terms in its design structure, the proportional–integral observer (PIO) [25] strategy can utilize both historical and current information. This provides the PIO the capability to increase the degrees of freedom for parameter selection, reducing the sensitivity of parameters variations and improving the dynamic performance. The research conducted by [26] proposed a type of generalized PIO observer for descriptor linear systems; the designed observer possesses the separation property, which is an excellent attribute for observers. Taking the faults and unknown inputs into consideration for linear descriptor systems, a proportional–multi-integral observer was designed in [27]; the proposed observer has good robustness to the variations of the parameters. The authors in [28] proposed a state estimation method in the form of a PIO to handle the mask of online battery states’ estimation. The PIO can also be applied in machine learning to estimate the states of recurrent neural networks [29]. In [30], the PIO was utilized to make sure that the dynamics of Markov switching memristive neural networks has stochastic finite-time boundedness while meeting the desired H performance index. However, to the best of our knowledge, the design problem of the PIO for PMASs has not yet been studied. This constitutes the primary motivation for our research, as we aim to develop and investigate effective PIO design strategies specifically tailored to PMASs.
While significant advancements have been made in the field of event-triggered control strategies and observer design for general (non-positive) and linear MASs, the specific challenges and complexities associated with nonlinear PMASs remain largely unexplored. This issue is particularly important given the prevalence of nonlinearity in practical applications and the unique difficulties introduced by positivity constraints. Addressing these challenges requires novel approaches and innovative solutions, which this paper aims to provide.
Motivated by the above-mentioned considerations, this paper investigates the PIO-based dynamic event-triggered consensus protocol of certain types of nonlinear PMASs. First, a positive PIO is constructed to estimate the states of the considered nonlinear PMASs. Then, an event-triggered mechanism is established, and a control protocol is proposed based on the designed PIO and event-triggered mechanism. Using a linear programming approach and co-positive Lyapunov functions, the designed control protocol can guarantee the positivity and consensus of nonlinear PMASs. Moreover, by introducing three new variables, the final convergence point can be aligned depending on a given vector rather than converging to a zero point. The main contributions of this paper include the following: (i) the innovative construction of a positive PIO for nonlinear PMASs; (ii) the development of a new PIO-based dynamic event-triggered protocol framework, which effectively manages positivity constraints and nonlinearity; (iii) the increased flexibility of the convergence point achieved by introducing new variables, enhancing the practical relevance of our approach.
This paper is organized as follows: Section 2 introduces some preliminary thoughts about positive systems and graph theory. Section 3 presents the main results of positive proportional–integral observer design and observer-based dynamic event-triggered control synthesis. Two illustrative examples are given to verify the proposed theoretical results in Section 4. Section 5 concludes the paper with some discussion on potential future research directions.
Notation 1.
As stated in this paper, R refers to real numbers, R n indicates n-dimensional vectors, and R m × n designates the space of m × n matrices, respectively. The ith row and jth column entry of matrix A are denoted by A ( i j ) . Specify I n to denote an identity matrix of order n. An nth-order vector with all elements being 1 is denoted by 1 n , and 1 n ( i ) means the column vector with the ı-th element being 1 and other entries all being 0, i.e., 1 n = ( 1 , 1 , , 1 n ) and 1 n ( i ) = ( 0 , , 0 i 1 , 1 , 0 , , 0 n i ) . For a given vector v R n , the i-th element is represented by v i , and v 0 ( 0 ) means that v i > 0 ( 0 ) , i = 1 , 2 , , n . ν i ι represents the ı-th element of the i-th vector in the vector set ν = { ν 1 , ν 2 , , ν n } , where ı specifies the position within the vector ν i . Consider a matrix A R p × q , A 0 ( 0 ) meaning that a i j > 0 ( 0 ) . Given two same-order matrices A , B , A B 0 ( 0 ) means that a i j > b i j ( a i j b i j ) . The symbolstands for the Kronecker product.

2. Problem Formulation and Preliminaries

2.1. Positive System Theory

The discrete nonlinear multi-agent systems considered in the paper can be described as:
x i ( k + 1 ) = A f ( x i ( k ) ) + B u i ( k ) , y i ( k ) = C g ( x i ( k ) ) ,
where x i ( k ) R n , u i ( k ) R m , and y i ( k ) R s , i { 1 , 2 , , N } denote the state, control input, and the output of the ith agent, respectively. A R n × n , B R n × m , and C R s × n are the system matrices. f ( x i ( k ) ) = ( f 1 ( x i 1 ( k ) ) , f 2 ( x i 2 ( k ) ) , , f n ( x i n ( k ) ) ) , and g ( x i ( k ) ) = ( g 1 ( x i 1 ( k ) ) , g 2 ( x i 2 ( k ) ) , , g n ( x i n ( k ) ) ) are the nonlinear functions. Throughout this paper, there are some assumptions and definitions:
Assumption 1.
The system matrices satisfy that A 0 , B 0 , and C 0 .
Assumption 2.
The nonlinear functions f ( x i ( k ) ) and g ( x i ( k ) ) satisfy the following sector conditions:
ϱ 1 x i ι 2 ( k ) f i ( x i ι ( k ) ) x i ι ( k ) ϱ 2 x i ι 2 ( k ) , σ 1 x i ι 2 ( k ) g i ( x i ι ( k ) ) x i ι ( k ) σ 2 x i ι 2 ( k ) ,
where i = 1 , 2 , , N , ι = 1 , 2 , , n , 0 ϱ 1 ϱ 2 , 0 σ 1 σ 2 , and f i ( 0 ) = 0 .
Definition 1 
([31,32]). System (1) is considered positive if and only if, with any given non-negative initial state and non-negative input, x i ( k ) 0 and y i ( k ) 0 are satisfied for all k N .
Definition 2.
For a given PMAS (1), the following statements are equivalent:
(i)
The system achieves consensus;
(ii)
The system satisfies that lim k | | x i ( k ) x j ( k ) | | 1 = 0 , i , j { 1 , 2 , , N } .
Lemma 1
([31,32]). The positivity of the system x ( k + 1 ) = A x ( k ) is preserved if and only if A 0 .
Lemma 2
([31,32]). If system x ( k + 1 ) = A x ( k ) is positive, the following statements are equivalent:
(i)
A is a Schur matrix.
(ii)
The system exhibits stability.
(iii)
There exists a vector v R + n such that ( A I ) v 0 .
(iv)
There exists a constant c and a Lyapunov function V ( k ) such that lim k Δ V ( k ) < c .
Remark 1.
Lemma 2 presents a nuanced definition of bounded consensus within the framework of positive systems, offering a deviation from the traditional concept of asymptotic consensus. The bounded consensus is characterized by the system’s states evolving towards a fixed constant value, rather than diminishing to zero. By introducing this concept, the lemma broadens the horizon for understanding the system dynamics, providing a more flexible approach to achieving consensus in positive systems.

2.2. Graph Theory

In this paper, an undirected graph is utilized to depict the communication topology among the N agents in system (1), which is denoted by G = ( V , E ) , which consists of a node set V { V 1 , V 2 , , V N } and an edge set E = { ( V i , V j ) } , i , j { 1 , 2 , , N } . The adjacency matrix is denoted as A , where A ( i i ) = 0 and A ( i j ) = A ( j i ) = 1 if ( V i , V j ) E ; otherwise, A ( i j ) = 0 . Obviously, A is a symmetric matrix. The neighbor nodes of node V i are denoted by N i : = { V j : ( V i , V j ) E } . Diagonal matrix D denotes the degree matrix of G , where D ( i i ) = j N i A ( i j ) . The corresponding Laplacian matrix is defined as L = D A , where A ( i j ) = A ( i j ) and A ( i i ) = D ( i i ) .
Lemma 3
([33]). The real parts of all eigenvalues of L are all non-negative. Zero is one of the eigenvalues of L , with 1 as the associated right eigenvector.
Lemma 4
([34,35]). Zero is a simple eigenvalue of L if and only if graph G possesses a directed spanning tree.

2.3. Problem Formulation

The objectives of this paper consist of two parts:(i) design a PIO to effectively estimate the states of systems (1) and (ii), based on the designed PIO, construct an event-triggered control protocol such that system (1) can reach a consensus.

3. Main Results

This section is split into three segments. The first segment analyzes the positivity of the considered nonlinear PMASs under the assumption. The PIO design is proposed in the second segment. The third segment presents the event-triggered mechanism and corresponding control protocol based on the proposed observer and event-triggered mechanism.

3.1. Positivity Analysis

Lemma 5.
With Assumption 2 in place, system (1) is positive if and only if Assumption 1 is satisfied.
Proof. 
Sufficiency. Suppose that x i ( 0 ) 0 and the set of indices that satisfies x i ( ι ) ( 0 ) = 0 is denoted by Ω . It follows that
x i ( ι ) ( 1 ) = j Ω A ( ι j ) f j ( x i ( j ) ( 0 ) ) + j = 1 m B ( ι j ) u i ( j ) ( 0 ) .
From Assumption 2, it follows that f j ( x i ( j ) ( 0 ) ) 0 . By Assumption 1, one can obtain that A ( ι j ) 0 and B ( ι j ) 0 . Hence, it follows that x i ( 1 ) 0 for given u i ( 0 ) 0 . Similarly, it can be deduced that y i ( 1 ) 0 . Consequently, it is evident that x i ( 1 ) 0 , y i ( 1 ) 0 for given x i ( 0 ) 0 and u i ( 0 ) 0 . Furthermore, it can be obtained that x i ( k ) 0 , y i ( k ) 0 .
Necessity. Suppose that the system (1) is positive. Let x ( 0 ) = 0 , then x ( 1 ) = B u i ( 0 ) . Since x ( 1 ) 0 for any given u i ( 0 ) 0 , then B 0 according to Lemma 2. To prove that A 0 , let u i ( 0 ) = 0 . Suppose that there exists an element of matrix A satisfying that A ( ι j ) < 0 ; this results in
x i ( ι ) ( k + 1 ) = j = 1 , j j n A ( ι j ) f j ( x i ( j ) ( k ) ) + A ( ι j ) f j ( x i ( j ) ( k ) ) .
It can be seen that it is possible to make x i ( ι ) ( k + 1 ) < 0 if A ( ι j ) is kept as small as possible, which leads to a contradiction with the system’s positivity. Therefore, A 0 . By the same argument, it can be obtained that C 0 , E 0 .

3.2. Positive Proportional–Integral Observer

In this section, some conditions will be provided for the design of the PIO for PMASs. The designed PIO is described as follows:
x ^ i ( k + 1 ) = A f ^ ( x ^ i ( k ) ) + L P ( y ^ i ( k ) y i ( k ) ) + F v i ( k ) + B u i ( k ) , v i ( k + 1 ) = α v i ( k ) + ( 1 α ) L I ( y ^ i ( k ) y i ( k ) ) , y ^ i ( k ) = C g ^ ( x ^ i ( k ) ) ,
where ϑ 1 x ^ i ι 2 ( k ) f ^ ( x ^ i ι ( k ) ) x ^ i ι ( k ) ϑ 2 x ^ i ι 2 ( k ) , ς 1 x ^ i ι 2 ( k ) g ^ ( x ^ i ι ( k ) ) x ^ i ι ( k ) ς 2 x ^ i ι 2 ( k ) and α [ 0 , 1 ] .   x ^ i ( k ) R n , y ^ ( k ) R s , and v i ( k ) R n denote the state estimation value, the output of the observer, and the integral parts, respectively. L P , L I , and F are the gain matrices to be determined. The estimate error is defined as:
e i ( k ) = x ^ i ( k ) x i ( k ) ,
which yields
e i ( k + 1 ) = x ^ i ( k + 1 ) x i ( k + 1 ) = A f ^ ( x ^ i ( k ) ) + L P ( y ^ i ( k ) y i ( k ) ) + F v i ( k ) + B u i ( k ) A f ( x i ( k ) ) B u i ( k ) = A ( f ^ ( x ^ i ( k ) ) f ( x i ( k ) ) ) + L P C ( g ^ ( x ^ i ( k ) ) g ( x i ( k ) ) ) + F v i ( k ) .
Define x ˜ i ( k + 1 ) : = ( x i ( k + 1 ) e i ( k + 1 ) v i ( k + 1 ) ) ; based on the system (1), the designed observer (5), and the estimate error (6), the following augment systems can be obtained:
x ˜ i ( k + 1 ) = A f ( x i ( k ) ) + B u i ( k ) A ( f ^ ( x ^ i ( k ) ) f ( x i ( k ) ) ) + L P C ( g ^ ( x ^ i ( k ) ) g ( x i ( k ) ) ) + F v i ( k ) α v i ( k ) + ( 1 α ) L I C ( g ^ ( x ^ i ( k ) ) g ( x i ( k ) ) ) .
The task is to derive the estimation x ^ i ( k ) of the state x i ( k ) in such a way that the x ^ i ( k ) are non-negative and the error of the estimate remains stable.
Theorem 1.
If there exist constants 0 ϱ 1 ϱ 2 , 0 σ 1 σ 2 , 0 ϑ 1 ϑ 2 , 0 ς 1 ς 2 , σ 2 ς 1 , α [ 0 , 1 ] , R n vectors ν 1 0 , ν 2 0 , ν 3 0 , δ F ( ι ) 0 , and δ ¯ F 0 and R s vectors δ L I ( ι ) 0 , δ ¯ L I 0 , δ L P ( ι ) 0 , and δ ¯ L P 0 such that
( ϑ 1 ϱ 2 ) 1 n ν 2 A + ( ς 1 σ 2 ) ι = 1 n 1 n ( ι ) δ L P ( ι ) C 0 ,
ϑ 1 1 n ν 2 A + ς 1 ι = 1 n 1 n ( ι ) δ L P ( ι ) C 0 ,
δ L P ( ι ) δ ¯ L P , δ L I ( ι ) δ ¯ L I , δ F ( ι ) δ ¯ F , ι = 1 , 2 , , n ,
ϱ 2 A ν 1 + ( ϑ 2 ϱ 1 ) A ν 2 + ( ς 2 σ 1 ) C δ ¯ L P + ( 1 α ) ( ς 2 σ 1 ) C δ ¯ L I ν 1 0 ,
ϑ 2 A ν 2 + ς 2 C δ ¯ L P + ( 1 α ) ς 2 C δ ¯ L I ν 2 0 ,
δ ¯ F + ( α 1 ) ν 3 0 .
hold, then the designed PI observer (5) remains positive and the error system (6) stays stable, where the observer gain matrices are given by
L P = ι = 1 n 1 n ( ι ) δ L P ( ι ) 1 n ν 2 , L I = ι = 1 n 1 n ( ι ) δ L I ( ι ) 1 n ν 3 , F = ι = 1 n 1 n ( ι ) δ F ( ι ) 1 n ν 2 .
Proof. 
First, we consider the positivity. Based on Assumptions 1 and 2, for any x ˜ i ( k 0 ) 0 , this gives that
x ˜ i ( k 0 + 1 ) A ϱ 1 x i ( k 0 ) + B u i ( k 0 ) A ( ϑ 1 e i ( k 0 ) + ( ϑ 1 ϱ 2 ) x i ( k 0 ) ) + L P C ( ς 1 e i ( k 0 ) + ( ς 1 σ 2 ) x i ( k 0 ) ) + F v i ( k 0 ) α v i ( k 0 ) + ( 1 α ) L I C ( ς 1 e i ( k 0 ) + ( ς 1 σ 2 ) x i ( k 0 ) ) = ϱ 1 A 0 0 ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ϑ 1 A + ς 1 L P C F ( 1 α ) ( ς 1 σ 2 ) L I C ( 1 α ) ς 1 L I C α I x i ( k 0 ) e i ( k 0 ) v i ( k 0 ) + B 0 0 u i ( k 0 ) = A ˜ x ˜ i ( k 0 ) + B ˜ u i ( k 0 ) ,
where
A ˜ = ϱ 1 A 0 0 ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ϑ 1 A + ς 1 L P C F ( 1 α ) ( ς 1 σ 2 ) L I C ( 1 α ) ς 1 L I C α I , B ˜ = B 0 0 .
Since 0 ϱ 1 ϱ 2 , δ F 0 , σ 2 ς 1 , and α [ 0 , 1 ] , one has ϱ 1 A 0 , F 0 , ( 1 α ) ( ς 1 σ 2 ) L I C 0 , and ( 1 α ) ς 1 L I C 0 . Based on (9a) and (10), it can be obtained that ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C 0 . Similarly, it is easy to derive that ϑ 1 A + ς 1 L P C 0 from (9b) and (10). Consequently, it can be concluded that A ˜ 0 . Then, the positivity of x ˜ i ( k 0 + 1 ) can be guaranteed by Lemma 1 under Assumption 1. It is not difficult to verify that x ˜ i ( k ) 0 for any initial state x ˜ i ( k 0 ) 0 by recursive deduction. Therefore, the system (8) is positive by Definition 1. Thus, the designed PI observer (5) is positive.
Next, we will analyze the stability of the systems. Choose a co-positive Lyapunov function candidate V ( k ) = x ˜ i ( k ) ν , where ν = ( ν 1 ν 2 ν 3 ) . Since
x ˜ i ( k + 1 ) A ϱ 2 x i ( k ) + B u i ( k ) A ( ϑ 2 e i ( k ) + ( ϑ 2 ϱ 1 ) x i ( k ) ) + L P C ( ς 2 e i ( k ) + ( ς 2 σ 1 ) x i ( k ) ) + F v i ( k ) α v i ( k ) + ( 1 α ) L I C ( ς 2 e i ( k ) + ( ς 2 σ 1 ) x i ( k ) )
= ϱ 2 A 0 0 ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) L P C ϑ 2 A + ς 2 L P C F ( 1 α ) ( ς 2 σ 1 ) L I C ( 1 α ) ς 2 L I C α I x i ( k ) e i ( k ) v i ( k ) + B 0 0 u i ( k ) = A ˇ x ˜ i ( k ) + B ˜ u i ( k ) ,
where
A ˇ = ϱ 2 A 0 0 ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) L P C ϑ 2 A + ς 2 L P C F ( 1 α ) ( ς 2 σ 1 ) L I C ( 1 α ) ς 2 L I C α I .
As a consequence, it can be inferred that
Δ V ( k ) = V ( k + 1 ) V ( k ) = x ˜ i ( k + 1 ) ν x ˜ i ( k ) ν ( A ˇ x ˜ i ( k ) x ˜ i ( k ) ) ν = x ˜ i ( k ) ( A ˇ I ) ν ;
combined with (14), this gives
( A ˇ I ) ν = ϱ 2 A ν 1 + ( ϑ 2 ϱ 1 ) A ν 2 + ( ς 2 σ 1 ) C L P ν 2 + ( 1 α ) ( ς 2 σ 1 ) C L I ν 3 ν 1 ϑ 2 A ν 2 + ς 2 C L P ν 2 + ( 1 α ) ς 2 C L I ν 3 ν 2 F ν 2 + α ν 3 ν 3 .
By (9c) and (10), it follows that
L P ν 2 = ( ι = 1 n 1 n ( ι ) δ L P ( ι ) ) 1 n ν 2 ν 2 δ ¯ L P 1 n ( ι ) 1 n ν 2 ν 2 = δ ¯ L P , L I ν 2 = ( ι = 1 n 1 n ( ι ) δ L I ( ι ) ) 1 n ν 3 ν 3 δ ¯ L I 1 n ( ι ) 1 n ν 3 ν 3 = δ ¯ L I , F ν 2 = ( ι = 1 n 1 n ( ι ) δ F ( ι ) ) 1 n ν 2 ν 2 δ ¯ F 1 n ( ι ) 1 n ν 2 ν 2 = δ ¯ F .
Together with (9d)–(9f) and (16), it can be derived that
ϱ 2 A ν 1 + ( ϑ 2 ϱ 1 ) A ν 2 + ( ς 2 σ 1 ) C L P ν 2 + ( 1 α ) ( ς 2 σ 1 ) C L I ν 3 ν 1 ϱ 2 A ν 1 + ( ϑ 2 ϱ 1 ) A ν 2 + ( ς 2 σ 1 ) C δ ¯ L P + ( 1 α ) ( ς 2 σ 1 ) C δ ¯ L I ν 1 0 ,
ϑ 2 A ν 2 + ς 2 C L P ν 2 + ( 1 α ) ς 2 C L I ν 3 ν 2 ϑ 2 A ν 2 + ς 2 C δ ¯ L P + ( 1 α ) ς 2 C δ ¯ L I ν 2 0 ,
F ν 2 + α ν 3 ν 3 δ ¯ F + α ν 3 ν 3 0 .
From (15) and (17)–(19), it can be obtained that Δ V ( k ) 0 . The proof is complete. □
Remark 2.
Different from the widely used proportional observer, the designed observer (5) has two additional gain matrices F and L I . These matrices provide higher degrees of freedom for the design of the observer and allow for a more refined adjustment of the observer’s response to the considered system.
Remark 3.
Compared with the PIO designed for general systems (non-positive) in [30,36], an additional parameter α is introduced to the integral part of the designed PIO. The introduced parameter α can tune the integral part to guarantee the positivity of the observer. It should be noted that the selection of α and its impact on the system are still open issues. Furthermore, the co-positive Lyapunov function and linear programming are utilized in this paper, which have shown the effectiveness of handling the control synthesis of positive systems in [37].

3.3. Dynamic Event-Triggered Observer-Based Control Protocol

Define the observer measurement errors:
ϵ i ( k ) = x ^ i ( κ ι ) x ^ i ( k ) k [ κ ι , κ ι + 1 , , κ ι + 1 1 ) .
Consider the following dynamic event-triggered mechanism:
| | ϵ i ( k ) | | 1 β ( k ) | | x ^ i ( k ) | | 1 ,
where
β ( k + 1 ) = ε β ( k ) + ( β ( k ) Λ ) ( | | ϵ i ( k ) | | 1 β ¯ | | x ^ i ( k ) | | 1 ) ,
with 0 < Λ < β ( 0 ) < β ¯ , and ε , Λ , β ¯ are given constants. Thus, the triggering instants { κ 0 , κ 1 , } are generated by
κ 0 = 0 , κ i = inf k N { k > κ ι : | | ϵ i ( k ) | | 1 > β ( k ) | | x ^ i ( k ) | | 1 } .
Using the PI observer (5) and the dynamic event-triggered mechanism (21), the control protocol is constructed as follows:
u i ( k ) = K S x ^ i ( κ ι ) + K P j N i A ( i j ) ( x ^ i ( κ ι ) x ^ j ( κ ι ) ) + K C x c ,
where K S , K P , and K C are gain matrices to be designed and x c is a given vector.
Theorem 2.
If there exist constants 0 < μ < 1 , 0 ϱ 1 ϱ 2 , 0 σ 1 σ 2 , 0 ϑ 1 ϑ 2 , 0 ς 1 ς 2 , σ 2 ς 1 , 0 < Λ < β ¯ , μ > 0 , ρ > 0 , 0 < θ ̲ < θ ¯ , α [ 0 , 1 ] , and σ 2 ς 1 , R n vectors ν 1 0 , ν 2 0 , ν 3 0 , δ F ( ι ) 0 , δ ̲ F 0 , δ k c ( j ) 0 , δ k s + ( j ) 0 , δ ̲ k s + 0 , δ k p + ( j ) 0 , δ ̲ k p + 0 , δ k s ( j ) 0 , δ ¯ k s 0 , δ k p ( j ) 0 , and δ ¯ k p 0 , and R s vectors δ l i ( ι ) 0 , δ ¯ l i 0 , δ l p ( ι ) 0 , and δ ¯ l p 0 such that
B j = 1 m 1 m ( j ) δ k s + ( j ) Ψ + B j = 1 m 1 m ( j ) δ k s ( j ) Φ + d min B j = 1 m 1 m ( j ) δ k p + ( j ) Ψ + d max B j = 1 m 1 m ( j ) δ k p ( j ) Φ 0 ,
B j = 1 m 1 m ( j ) δ k p + ( j ) Φ + B j = 1 m 1 m ( j ) δ k p ( j ) Ψ 0 ,
( ϑ 1 ϱ 2 ) 1 n ν 2 A + ( ς 1 σ 2 ) ι = 1 n 1 n ( ι ) δ l p ( n ) C 0 ,
ϑ 1 1 n ν 2 A + ς 1 ι = 1 n 1 n ( ι ) δ l p ( ι ) C 0 ,
1 m B ν 1 ϱ 1 A + B j = 1 m 1 m ( j ) δ k s + ( j ) Ψ + B j = 1 m 1 m ( j ) δ k s ( j ) Φ + 2 β ¯ d max ( B j = 1 m 1 m ( j ) δ k p ( j ) 1 n × n B j = 1 m 1 m ( j ) δ k p + ( j ) 1 n × n ) + l max ( B j = 1 m 1 m ( j ) δ k p + ( j ) Φ + B j = 1 m 1 m ( j ) δ k p ( j ) Ψ ) + ( θ ̲ 1 ) ( B j = 1 m 1 m ( j ) δ k c ( j ) ) 1 m B ν 1 I n 0 ,
( ϱ 2 A I n ) ν 1 + Φ δ ¯ k s + + δ ¯ k s 1 n × n δ ̲ k s + 2 β ¯ d max ( 1 n × n δ ¯ k p + 1 n × n δ ̲ k p ) + ( ϑ 2 ϱ 1 ) A ν 2 + ( ς 2 σ 1 ) C δ ¯ l p + ( 1 α ) ( ς 2 σ 1 ) ( C δ ¯ l i ) + ( 1 μ ) ν 1 0 ,
Φ δ ¯ k s + + δ ¯ k s 1 n × n δ ̲ k s + 2 β ¯ d max ( 1 n × n δ ¯ k p + 1 n × n δ ̲ k p ) + ϑ 2 A ν 2 + ς 2 C δ ¯ l p ν 2 + ς 2 ( 1 α ) ( C δ ¯ l i ) + ( 1 μ ) ν 2 0 ,
δ ¯ f + ( α μ ) ν 3 0 ,
ϱ 2 A ν 1 + Φ δ ¯ k s + + δ ¯ k s 1 n × n δ ̲ k s + 2 β ¯ d max ( 1 n × n δ ¯ k p + 1 n × n δ ̲ k s ) + ( N θ ¯ 1 ) δ ¯ k c + ( ϑ 2 ϱ 1 ) A ν 2 + ( ς 2 σ 1 ) C δ ¯ l p + ( 1 α ) ( ς 2 σ 1 ) ( C δ ¯ l i ) ( ρ + 1 ) ν 1 0 ,
δ ̲ k s δ k s ( j ) δ ¯ k s , δ ̲ k s + δ k s + ( j ) δ ¯ k s + , δ ̲ k p δ k p ( j ) δ ¯ k p , δ ̲ k p + δ k p + ( j ) δ ¯ k p + , δ ̲ l p δ l p ( ι ) δ ¯ l p , δ ̲ l i δ l i ( ι ) δ ¯ l i , θ ̲ θ i θ ¯ ,
hold, where Φ = I n + β ¯ 1 n × n , Ψ = I n β ¯ 1 n × n , d max = max 1 i n D ( i i ) , d min = min 1 i n D ( i i ) , and l max = max 1 i , j n L ( i j ) , then under the observer-based dynamic event-triggered PID protocol (24) with
K S + = j = 1 m 1 m ( j ) δ k s + ( j ) 1 m B ν 1 , K S = j = 1 m 1 m ( j ) δ k s ( j ) 1 m B ν 1 , K P + = j = 1 m 1 m ( j ) δ k p + ( j ) 1 m B ν 1 , K P = j = 1 m 1 m ( j ) δ k p ( j ) 1 m B ν 1 , K C = j = 1 m 1 m ( j ) δ k c ( j ) 1 m B ν 1 , L I = ι = 1 n 1 n ( ι ) δ l i ( ι ) 1 n ν 3 , L P = ι = 1 n 1 n ( ι ) δ l p ( ι ) 1 n ν 2 , F = ι = 1 n 1 n ( ι ) δ f ( ι ) 1 n ν 2 ,
the system is positive and stable.
Proof. 
First, we consider the positivity. Using the dynamic event-triggered condition (21), it follows that
| | ϵ i ( k 0 ) | | 1 β ( k 0 ) | | x ^ i ( k 0 ) | | 1 ,
for any initial condition x i ( k 0 ) 0 . Noting the fact that 0 < β ( k ) < β ¯ , it can be inferred that
β ¯ 1 n × n x ^ i ( k 0 ) ϵ i ( k 0 ) β ¯ 1 n × n x ^ i ( k 0 ) .
By (20), (24), and (28), one can obtain that
x i ( k 0 + 1 ) ϱ 1 A x i ( k 0 ) + ( B K S + ( I n β ¯ 1 n × n ) + B K S ( I n + β ¯ 1 n × n ) ) x ^ i ( k 0 ) + B K P + ( I n β ¯ 1 n × n ) j N i A ( i j ) x ^ i ( k 0 ) B K P + ( I n + β ¯ 1 n × n ) j N i A ( i j ) x ^ j ( k 0 ) + B K P ( I n + β ¯ 1 n × n ) j N i A ( i j ) x ^ i ( k 0 ) B K P ( I n β ¯ 1 n × n ) j N i A ( i j ) x ^ j ( k 0 ) + B K C x i c = ( ϱ 1 A + B K S + Ψ + B K S Φ ) x i ( k 0 ) + ( B K S + Ψ + B K S Φ ) e i ( k 0 ) + B K P + Ψ j N i A ( i j ) x i ( k 0 ) B K P + Φ j N i A ( i j ) x j ( k 0 ) + B K P Φ j N i A ( i j ) x i ( k 0 ) B K P Ψ j N i A ( i j ) x j ( k 0 ) + B K P + Ψ j N i A ( i j ) e i ( k 0 ) B K P + Φ j N i A ( i j ) e j ( k 0 ) + B K P Φ j N i A ( i j ) e i ( k 0 ) B K P Ψ j N i A ( i j ) e j ( k 0 ) + B K C x i c ,
e i ( k 0 + 1 ) ( ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ) x i ( k 0 ) + ( ϑ 1 A + ς 1 L P C ) e i ( k 0 ) + F v i ( k 0 ) ,
and
v i ( k 0 + 1 ) ( 1 α ) ( ς 1 σ 2 ) L I C x i ( k 0 ) + ς 1 ( 1 α ) L I C e i ( k 0 ) + α v i ( k 0 ) .
Define x ˜ i ( k ) : = ( x i ( k ) e i ( k ) v i ( k ) ) and X ˜ ( k ) = ( x ˜ 1 ( k ) x ˜ 2 ( k ) x ˜ N ( k ) ) ; it can be derived from (29)–(31) that
X ( k 0 + 1 ) ϱ 1 A + B K S + Ψ + B K S Φ B K S + Ψ + B K S Φ 0 ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ϑ 1 A + ς 1 L P C F ( 1 α ) ( ς 1 σ 2 ) L I C ς 1 ( 1 α ) L I C α I n x 1 ( k 0 ) e 1 ( k 0 ) v 1 ( k 0 ) ϱ 1 A + B K S + Ψ + B K S Φ B K S + Ψ + B K S Φ 0 ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ϑ 1 A + ς 1 L P C F ( 1 α ) ( ς 1 σ 2 ) L I C ς 1 ( 1 α ) L I C α I n x N ( k 0 ) e N ( k 0 ) v N ( k 0 ) + B K C x 1 c 0 0 B K C x N c 0 0
+ ( B K P + Ψ + B K P Φ ) j N 1 A ( 1 j ) x 1 ( k 0 ) ( B K P + Φ + B K P Ψ ) j N 1 A ( 1 j ) x j ( k 0 ) + ( B K P + Ψ + B K P Φ ) j N 1 A ( 1 j ) e 1 ( k 0 ) ( B K P + Φ + B K P Ψ ) j N 1 A ( 1 j ) e j ( k 0 ) 0 0 ( B K P + Ψ + B K P Φ ) j N N A ( N j ) x N ( k 0 ) ( B K P + Φ + B K P Ψ ) j N N A ( N j ) x j ( k 0 ) + ( B K P + Ψ + B K P Φ ) j N N A ( N j ) e N ( k 0 ) ( B K P + Φ + B K P Ψ ) j N N A ( N j ) e j ( k 0 ) 0 0 = A 1 X ( k 0 ) + C 1 ( X C 1 3 ) ,
where
A 1 ( i i ) = ϱ 1 A + B K S + Ψ + B K S Φ + ( B K P + Ψ + B K P Φ ) j N i N A ( i j ) B K S + Ψ + B K S Φ + ( B K P + Ψ + B K P Φ ) j N i N A ( i j ) 0 ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ϑ 1 A + ς 1 L P C F ( 1 α ) ( ς 1 σ 2 ) L I C ς 1 ( 1 α ) L I C α I n ,
A 1 ( i j ) = A ( i j ) ( B K P + Φ + B K P Ψ ) A ( i j ) ( B K P + Φ + B K P Ψ ) 0 0 0 0 0 0 0 , C 1 ( i i ) = B K C 0 0 0 0 0 0 0 0 , C 1 ( i j ) = 0 .
Using (25a) and (25c)–(25g) gives that A 1 ( i i ) 0 . Similarly, A 1 ( i j ) 0 can be obtained by (25b). Consequently, it follows that A 1 0 . Since δ k c ( ι ) 0 , it is easy to concluded that C 1 0 . Therefore, the positivity of system X ( k ) can be guaranteed by Lemma 1 under Assumption 1.
Afterwards, the stability analysis is conducted by introducing the following variables:
ξ i ( k ) = ι = 1 N θ ι x ι ( k ) x i ( k ) x i c , ϖ i ( k ) = ι = 1 N θ ι e ι ( k ) e i ( k ) ,
and
ζ i ( k ) = ι = 1 N θ ι v ι ( k ) v i ( k ) .
where θ ι > 1 , θ = ( θ 1 θ 2 θ N ) = λ r , r = ( r 1 , r 2 , , r 3 ) is the left eigenvector of L associated with a zero eigenvalue. Let ξ ( k ) = ( ξ 1 ( k ) ξ 2 ( k ) ξ N ( k ) ) , ϖ ( k ) = ( ϖ 1 ( k ) ϖ 2 ( k ) ϖ N ( k ) ) , ζ ( k ) = ( ζ 1 ( k ) ζ 2 ( k ) ζ N ( k ) ) , X ( k ) = ( x 1 ( k ) x 2 ( k ) x N ( k ) ) , X ^ ( k ) = ( x ^ 1 ( k ) x ^ 2 ( k ) x ^ N ( k ) ) , E ( k ) = ( e 1 ( k ) e 2 ( k ) e N ( k ) ) , X C = ( x 1 c x 2 c x N c ) , V ( k ) = ( v 1 ( k ) v 2 ( k ) v N ( k ) ) , and W ( k ) = ( w 1 ( k ) w 2 ( k ) w N ( k ) ) ; it is easy to obtain that
ξ ( k ) = Θ X ( k ) X C , ϖ ( k ) = Θ E ( k ) , ζ ( k ) = Θ V ( k ) ,
where Θ = 1 N θ I n I N n . Construct the following augmented system:
X ˜ ( k + 1 ) = ξ ( k + 1 ) ϖ ( k + 1 ) ζ ( k + 1 ) = Θ X ( k + 1 ) X C Θ E ( k + 1 ) Θ V ( k + 1 ) .
Consider the positivity of the new augmented system (35); it is easy to obtain that
X ( k + 1 ) ( ϱ 1 A + B K S + Ψ + B K S Φ ) x 1 ( k 0 ) + ( B K S + Ψ + B K S Φ ) e 1 ( k 0 ) + ( B K P + Ψ + B K P Φ ) j N 1 A ( 1 j ) x 1 ( k 0 ) ( B K P + Φ + B K P Ψ ) j N 1 A ( 1 j ) x j ( k 0 ) + ( B K P + Ψ + B K P Φ ) j N 1 A ( 1 j ) e 1 ( k 0 ) ( B K P + Φ + B K P Ψ ) j N 1 A ( 1 j ) e j ( k 0 ) + B K C x i c ( ϱ 1 A + B K S + Ψ + B K S Φ ) x N ( k 0 ) + ( B K S + Ψ + B K S Φ ) e N ( k 0 ) + ( B K P + Ψ + B K P Φ ) j N N A ( N j ) x N ( k 0 ) ( B K P + Φ + B K P Ψ ) j N N A ( N j ) x j ( k 0 ) + ( B K P + Ψ + B K P Φ ) j N N A ( N j ) e N ( k 0 ) ( B K P + Φ + B K P Ψ ) j N N A ( N j ) e j ( k 0 ) + B K C x N c ,
E ( k + 1 ) ( ϑ 1 A + ς 1 L P C ) e 1 ( k ) + ( ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ) x 1 ( k ) + F ν 1 ( k ) ( ϑ 1 A + ς 1 L P C ) e N ( k ) + ( ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ) x N ( k ) + F v N ( k ) ,
and
V ( k + 1 ) α v 1 ( k ) + ( 1 α ) L I C ( ς 1 e 1 ( k ) + ( ς 1 σ 2 ) x 1 ( k ) ) α v N ( k ) + ( 1 α ) L I C ( ς 1 e N ( k ) + ( ς 1 σ 2 ) x N ( k ) ) .
Define D ¯ = : d i a g { d max , , d max } R N . Then, it can be shown that
X ( k + 1 ) ( I N ( ϱ 1 A + B K S + Ψ + B K S Φ ) + 2 β ¯ D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) ) X ( k ) + ( I N ( B K S + Ψ + B K S Φ ) + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) ) E ( k ) + ( I N ( B K C ) ) X C ,
E ( k + 1 ) ( I N ( ϑ 1 A + ς 1 L P C ) ) E ( k ) + ( I N ( ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ) ) X ( k ) + ( I N F ) V ( k ) ,
and
V ( k + 1 ) ς 1 ( 1 α ) ( I N ( L I C ) ) E ( k ) + ( 1 α ) ( ς 1 σ 2 ) ( I N ( L I C ) ) X ( k ) + α V ( k ) .
With the consideration of L 1 N θ = 0 and 1 N θ L = λ 1 N r L = 0 , it can be concluded that
( 1 N θ I n I N n ) ( I N ( ϱ 1 A + B K S + Ψ + B K S Φ ) + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) ) = 1 N θ ( ϱ 1 A + B K S + Ψ + B K S Φ ) + 2 β ¯ 1 N θ D ¯ ( B K P 1 n × n B K P + 1 n × n ) + 1 N θ L ( B K P + Φ + B K P Ψ ) ( I N ( ϱ 1 A + B K S + Ψ + B K S Φ ) + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) ) = 1 N θ ( ϱ 1 A + B K S + Ψ + B K S Φ ) + 2 β D ¯ 1 N θ ( B K P 1 n × n B K P + 1 n × n ) + L 1 N θ ( B K P + Φ + B K P Ψ ) ( I N ( ϱ 1 A + B K S + Ψ + B K S Φ ) + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) ) = ( I N ( ϱ 1 A + B K S + Ψ + B K S Φ ) + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) ) ( 1 N θ I n I N n ) ,
On this basis, it can be derived that
ξ ( k + 1 ) ( 1 N θ I n I N n ) ( I N ( ϱ 1 A + B K S + Ψ + B K S Φ ) + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) ) X ( k ) + ( I N ( B K S + Ψ + B K S Φ ) + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) ) E ( k ) + ( I N ( B K C ) ) X C X C = ( I N ( ϱ 1 A + B K S + Ψ + B K S Φ ) + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) ) + ξ ( k ) + ( I N ( B K S + Ψ + B K S Φ ) + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) ) ϖ ( k ) + ( I N ( ϱ 1 A + B K S + Ψ + B K S Φ ) + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) + ( 1 N θ I N ) ( B K C ) I N n ) X C ,
ϖ ( k + 1 ) ( I N ( ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ) ) ξ ( k ) + ( I N ( ϑ 1 A + ς 1 L P C ) ) ϖ ( k ) + ( I N F ) ζ ( k ) + ( I N ( ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ) ) X C ,
and
ζ ( k + 1 ) ς 1 ( 1 α ) ( I N ( L I C ) ) ϖ ( k ) + ( 1 α ) ( ς 1 σ 2 ) ( I N ( L I C ) ) ξ ( k ) + α ζ ( k ) + ( 1 α ) ( ς 1 σ 2 ) ( I N ( L I C ) ) X C .
By (36)–(41), one can obtain that
X ˜ ( k + 1 ) ( I N ( ϱ 1 A + B K S + Ψ + B K S Φ ) + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) ) ξ ( k ) + ( I N ( B K S + Ψ + B K S Φ ) + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) ) ϖ ( k ) + ( I N ( ϱ 1 A + B K S + Ψ + B K S Φ ) + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) + ( 1 N θ I N ) ( B K C ) I N n ) X C ( I N ( ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ) ) ξ ( k ) + ( I N ( ϑ 1 A + ς 1 L P C ) ) ϖ ( k ) + ( I N F ) ζ ( k ) + ( I N ( ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ) ) X C ς 1 ( 1 α ) ( I N ( L I C ) ) ϖ ( k ) + ( 1 α ) ( ς 1 σ 2 ) ( I N ( L I C ) ) ξ ( k ) + α ζ ( k ) + ( 1 α ) ( ς 1 σ 2 ) ( I N ( L I C ) ) X C
= I N ( ϱ 1 A + B K S + Ψ + B K S Φ + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) I N ( B K S + Ψ + B K S Φ + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) 0 I N ( ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ) I N ( ϑ 1 A + ς 1 L P C ) I N F ( 1 α ) ( ς 1 σ 2 ) ( I N ( L I C ) ) ς 1 ( 1 α ) ( I N ( L I C ) ) α I N n ξ ( k ) ϖ ( k ) ζ ( k ) + I N ( ϱ 1 A + B K S + Ψ + B K S Φ ) + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) + ( 1 N θ I N ) ( B K C ) I N n I N ( ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ) ( 1 α ) ( ς 1 σ 2 ) ( I N ( L I C ) ) X C = A 2 X ˜ ( k ) + C 2 X C .
where
A 2 = I N ( ϱ 1 A + B K S + Ψ + B K S Φ + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) I N ( B K S + Ψ + B K S Φ + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) 0 I N ( ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ) I N ( ϑ 1 A + ς 1 L P C ) I N F ( 1 α ) ( ς 1 σ 2 ) ( I N ( L I C ) ) ς 1 ( 1 α ) ( I N ( L I C ) ) α I N n ,
C 2 = I N ( ϱ 1 A + B K S + Ψ + B K S Φ ) + 2 β D ¯ ( B K P 1 n × n B K P + 1 n × n ) + L ( B K P + Φ + B K P Ψ ) + ( 1 N θ I N ) ( B K C ) I N n I N ( ( ϑ 1 ϱ 2 ) A + ( ς 1 σ 2 ) L P C ) ( 1 α ) ( ς 1 σ 2 ) ( I N ( L I C ) ) .
Using (25a)–(25d), it is derived that A 2 0 , while (25c) and (25e) give that C 2 0 . Then, the introduced variables ξ ( k ) , ϖ ( k ) , and ζ ( k ) can remain positive by Lemma 1. Next, we analyze the stability of system (35), since
x i ( k 0 + 1 ) ϱ 2 A x i ( k 0 ) + B K S + x ^ i ( k 0 ) + B K S x ^ i ( k 0 ) + β ¯ B K S + 1 n × n x ^ i ( k 0 ) β ¯ B K S 1 n × n x ^ i ( k 0 ) + B K P + j N i A ( i j ) x ^ i ( k 0 ) + B K P j N i A ( i j ) x ^ i ( k 0 ) B K P + j N i A ( i j ) x ^ j ( k 0 ) B K P j N i A ( i j ) x ^ j ( k 0 ) + β ¯ B K P + 1 n × n j N i A ( i j ) x ^ i ( k 0 ) β ¯ B K P 1 n × n j N i A ( i j ) x ^ i ( k 0 ) + β ¯ B K P + 1 n × n j N i A ( i j ) x ^ j ( k 0 ) β ¯ B K P 1 n × n j N i A ( i j ) x ^ j ( k 0 ) + B K C x i c = ( ϱ 2 A + B K S + Φ + B K S Ψ ) x i ( k 0 ) + ( B K S + Φ + B K S Ψ ) e i ( k 0 ) + B K C x i c + B K P + Φ j N i A ( i j ) x i ( k 0 ) B K P + Ψ j N i A ( i j ) x j ( k 0 ) + B K P Ψ j N i A ( i j ) x i ( k 0 ) B K P Φ j N i A ( i j ) x j ( k 0 ) + B K P + Φ j N i A ( i j ) e i ( k 0 ) B K P + Ψ j N i A ( i j ) e j ( k 0 ) + B K P Ψ j N i A ( i j ) e i ( k 0 ) B K P Φ j N i A ( i j ) e j ( k 0 ) .
It is evident that
X ( k + 1 ) ( ϱ 2 A + B K S + Φ + B K S Ψ ) x 1 ( k ) + ( B K S + Φ + B K S Ψ ) e 1 ( k ) + ( B K P + Φ + B K P Ψ ) j N 1 A ( 1 j ) x 1 ( k ) ( B K P + Ψ + B K P Φ ) j N 1 A ( 1 j ) x j ( k ) + ( B K P + Φ + B K P Ψ ) j N 1 A ( 1 j ) e 1 ( k ) ( B K P + Ψ + B K P Φ ) j N 1 A ( 1 j ) e j ( k ) + B K C x i c ( ϱ 2 A + B K S + Φ + B K S Ψ ) x 1 ( k ) + ( B K S + Φ + B K S Ψ ) e N ( k ) + ( B K P + Φ + B K P Ψ ) j N N A ( N j ) x N ( k ) ( B K P + Ψ + B K P Φ ) j N N A ( N j ) x j ( k ) + ( B K P + Φ + B K P Ψ ) j N N A ( N j ) e N ( k ) ( B K P + Ψ + B K P Φ ) j N N A ( N j ) e j ( k ) + B K C x N c ,
E ( k + 1 ) ( ϑ 2 A + ς 2 L P C ) e 1 ( k ) + ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) L P C ) x 1 ( k ) + F v 1 ( k ) ( ϑ 2 A + ς 2 L P C ) e N ( k ) + ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) L P C ) x N ( k ) + F v N ( k ) ,
and
V ( k + 1 ) α v 1 ( k ) + ( 1 α ) L I C ( ς 2 e 1 ( k ) + ( ς 2 σ 1 ) x 1 ( k ) ) α v N ( k ) + ( 1 α ) L I C ( ς 2 e N ( k ) + ( ς 2 σ 1 ) x N ( k ) ) .
This can be rewritten as
X ( k + 1 ) ( I N ( ϱ 2 A + B K S + Φ + B K S Ψ ) + 2 β D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) ) X ( k ) + ( I N ( B K S + Φ + B K S Ψ ) + 2 β D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) ) E ( k ) + ( I N ( B K C ) ) X C ,
E ( k + 1 ) ( I N ( ϑ 2 A + ς 2 L P C ) ) E ( k ) + ( I N ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) L P C ) ) X ( k ) + ( I N F ) V ( k ) ,
and
V ( k + 1 ) = ς 2 ( 1 α ) ( I N ( L I C ) ) E ( k ) + ( 1 α ) ( ς 2 σ 1 ) ( I N ( L I C ) ) X ( k ) + α I N n V ( k ) .
This results in
ξ ( k + 1 ) ( I N ( ϱ 2 A + B K S + Φ + B K S Ψ ) + 2 β D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) ) ξ ( k ) + ( I N ( B K S + Φ + B K S Ψ ) + 2 β D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) ) ϖ ( k ) + ( I N ( ϱ 2 A + B K S + Φ + B K S Ψ ) + 2 β D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) + ( 1 N θ I N ) ( B K C ) I N n ) X C ,
ϖ ( k + 1 ) ( I N ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) L P C ) ) ξ ( k ) + ( I N ( ϑ 2 A + ς 2 L P C ) ) ϖ ( k ) + ( I N F ) ζ ( k ) + ( I N ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) L P C ) ) X C ,
and
ζ ( k + 1 ) ς 2 ( 1 α ) ( I N ( L I C ) ) ϖ ( k ) + ( 1 α ) ( ς 2 σ 1 ) ( I N ( L I C ) ) ξ ( k ) + α ζ ( k ) + ( 1 α ) ( ς 2 σ 1 ) ( I N ( L I C ) ) X C .
By (46)–(48), it can be inferred that
X ˜ ( k + 1 ) ( I N ( ϱ 2 A + B K S + Φ + B K S Ψ ) + 2 β ¯ D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) ) ξ ( k ) + ( I N ( B K S + Φ + B K S Ψ ) + 2 β D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) ) ϖ ( k ) + ( I N ( ϱ 2 A + B K S + Φ + B K S Ψ ) + 2 β D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) + ( 1 N θ I N ) ( B K C ) I N n ) X C ( I N ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) L P C ) ) ξ ( k ) + ( I N ( ϑ 2 A + ς 2 L P C ) ) ϖ ( k ) + ( I N F ) ζ ( k ) + ( I N ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) L P C ) ) X C ς 2 ( 1 α ) ( I N ( L I C ) ) ϖ ( k ) + ( 1 α ) ( ς 2 σ 1 ) ( I N ( L I C ) ) ξ ( k ) + α ζ ( k ) + ( 1 α ) ( ς 2 σ 1 ) ( I N ( L I C ) ) X C = I N ( ϱ 2 A + B K S + Φ + B K S Ψ ) + 2 β D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) ) I N ( B K S + Φ + B K S Ψ ) + 2 β D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) ) 0 I N ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) L P C ) I N ( ϑ 2 A + ς 2 L P C ) I N F ( 1 α ) ( ς 2 σ 1 ) ( I N ( L I C ) ) ς 2 ( 1 α ) ( I N ( L I C ) ) α I N n ξ ( k ) ϖ ( k ) ζ ( k ) + I N ( ϱ 2 A + B K S + Φ + B K S Ψ ) + 2 β D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) + ( 1 N θ I N ) ( B K C ) I N n 0 0 0 I N ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) L P C ) 0 0 0 ( 1 α ) ( ς 2 σ 1 ) ( I N ( L I C ) ) X C X C X C = A 3 X ˜ ( k ) + C 3 ( 1 3 X C ) ,
where
A 3 = I N ( ϱ 2 A + B K S + Φ + B K S Ψ ) + 2 β D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) ) I N ( B K S + Φ + B K S Ψ ) + 2 β D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) ) 0 I N ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) L P C ) I N ( ϑ 2 A + ς 2 L P C ) I N F ( 1 α ) ( ς 2 σ 1 ) ( I N ( L I C ) ) ς 2 ( 1 α ) ( I N ( L I C ) ) α I N n ,
and
C 3 = I N ( ϱ 2 A + B K S + Φ + B K S Ψ ) + 2 β D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) + ( 1 N θ I N ) ( B K C ) I N n 0 0 0 I N ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) L P C ) 0 0 0 ( 1 α ) ( ς 2 σ 1 ) ( I N ( L I C ) ) .
Define ν = ( ν ˜ 1 , ν ˜ 2 , ν ˜ 3 ) , where ν ˜ 1 = 1 N ν 1 , ν ˜ 2 = 1 N ν 2 , and ν ˜ 3 = 1 N ν 3 . Choose a Lyapunov function candidate V ( k ) = X ˜ ( k ) ν = ξ ( k ) ν ˜ 1 + ϖ ( k ) ν ˜ 2 + ζ ( k ) ν ˜ 3 . Then, it can be deduced that
Δ V ( k ) = V ( k + 1 ) V ( k ) = X ˜ ( k + 1 ) ν X ˜ ( k ) ν = X ˜ ( k ) A 3 ν + ( 1 3 X C ) C 3 ν X ˜ ( k ) ν = X ˜ ( k ) ( A 3 I 3 N ) ν + ( 1 3 X C ) C 3 ν .
This results in
X ˜ ( k ) ( A 3 I ) ν = ξ ( k ) ( ( I N ( ϱ 2 A + Φ K S + B + Ψ K S B ) + 2 β D ¯ ( 1 n × n K P + B 1 n × n K P B ) + L ( Ψ K P + B + Φ K P B ) ) I N n ) ν ˜ 1 + ϖ ( k ) ( I N ( Φ K S + B + Ψ K S B + 2 β D ¯ ( 1 n × n K P + B 1 n × n K P B ) + L ( Ψ K P + B + Φ K P B ) ) ) ν ˜ 1 + ξ ( k ) ( I N ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) C L P ) ) ν ˜ 2 + ϖ ( k ) ( I N ( ϑ 2 A + ς 2 C L P ) I N n ) ν ˜ 2 + ζ ( k ) ( I N F ) ν ˜ 2 + ξ ( k ) ( ( 1 α ) ( ς 2 σ 1 ) ( I N ( C L I ) ) ) ν ˜ 3 + ϖ ( k ) ( ς 2 ( 1 α ) ( I N ( C L I ) ) ) ν ˜ 3 + ( α 1 ) ζ ( k ) ν ˜ 3 ,
and
( 1 3 X C ) C 3 ν = X C ( I N ( ϱ 2 A + Φ K S + B + Ψ K S B ) + 2 β D ¯ ( 1 n × n K P + B 1 n × n K P B ) + L ( Ψ K P + B + Φ K P B ) + ( θ 1 N I N ) ( K C B ) I N n ) ν ˜ 1 + X C ( I N ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) C L P ) ) ν ˜ 2 + X C ( ( 1 α ) ( ς 2 σ 1 ) ( I N ( C L I ) ) ) ν ˜ 3 .
From (26) and (25j), it can be obtained that
δ ̲ k s + K S + B ν 1 = ( j = 1 m 1 m ( j ) δ k s + ( ι ) ) 1 m B ν 1 B ν 1 δ ¯ k s + , δ ̲ k s K S B ν 1 = ( j = 1 m 1 m ( j ) δ k s ( ι ) ) 1 m B ν 1 B ν 1 δ ¯ k s , δ ̲ k p + K P + B ν 1 = ( j = 1 m 1 m ( j ) δ k p + ( ι ) ) 1 m B ν 1 B ν 1 δ ¯ k p + , δ ̲ k p K P B ν 1 = ( j = 1 m 1 m ( j ) δ k p ( ι ) ) 1 m B ν 1 B ν 1 δ ¯ k p , δ ̲ k c K C B ν 1 = ( j = 1 m 1 m ( j ) δ k c ( ι ) ) 1 m B ν 1 B ν 1 δ ¯ k c , δ ̲ l i L I ν 3 = ( ι = 1 n 1 n ( ι ) δ l i ( ι ) ) 1 n ν 3 ν 3 δ ¯ l i , δ ̲ l p L P ν 2 = ( ι = 1 n 1 n ( ι ) δ l p ( ι ) ) 1 n ν 2 ν 2 δ ¯ l p , δ ̲ f F ν 2 = ( ι = 1 n 1 n ( ι ) δ f ( ι ) ) 1 n ν 2 ν 2 δ ¯ f .
Combined with (50)–(52), one can obtain that
X ˜ ( k ) ( A 3 I ) ν ξ ( k ) ( 1 N ( ϱ 2 A ν 1 + Φ δ ¯ k s + + δ ¯ k s 1 n × n δ ̲ k s ) + 2 β ¯ d max 1 N ( 1 n × n δ ¯ k p + 1 n × n δ ̲ k p ) ν 1 ) ) + ϖ ( k ) ( 1 N ( Φ δ ¯ k s + + δ ¯ k s 1 n × n δ ̲ k s ) + 2 β ¯ d max 1 N ( 1 n × n δ ¯ k p + 1 n × n δ ̲ k p ) ) ) + ( α 1 ) ζ ( k ) ( 1 N ν 3 ) + ξ ( k ) ( 1 N ( ( ϑ 2 ϱ 1 ) A ν 2 + ( ς 2 σ 1 ) C δ ¯ l p ) ) + ϖ ( k ) ( 1 N ( ϑ 2 A ν 2 + ς 2 C δ ¯ l p ν 2 ) ) + ζ ( k ) ( 1 N δ ¯ f ) + ξ ( k ) ( 1 α ) ( ς 2 σ 1 ) ( 1 N ( C δ ¯ l i ) ) + ϖ ( k ) ( ς 2 ( 1 α ) ( 1 N ( C δ ¯ l i ) ) ) ,
and
( 1 3 X C ) C 3 ν X C ( 1 N ( ϱ 2 A ν 1 + Φ δ ¯ k s + + δ ¯ k s 1 n × n δ ̲ k s ) + 2 β ¯ d max 1 N ( 1 n × n δ ¯ k p + 1 n × n δ ̲ k s ) + ( N θ 1 N ) δ ¯ k c 1 N ν 1 + 1 N ( ( ϑ 2 ϱ 1 ) A ν 2 + ( ς 2 σ 1 ) C δ ¯ l p ) + ( 1 α ) ( ς 2 σ 1 ) ( 1 N ( C δ ¯ l i ) ) ) .
Using (49), (53), and (54) results in
Δ V ( k ) ξ ( k ) ( 1 N ( ( ϱ 2 A I n ) ν 1 + Φ δ ¯ k s + + δ ¯ k s 1 n × n δ ̲ k s ) + 2 β ¯ d max 1 N ( 1 n × n δ ¯ k p + 1 n × n δ ̲ k p ) ) + 1 N ( ( ϑ 2 ϱ 1 ) A ν 2 + ( ς 2 σ 1 ) C δ ¯ l p ) + ( 1 α ) ( ς 2 σ 1 ) ( 1 N ( C δ ¯ l i ) ) ) + ϖ ( k ) ( 1 N ( Φ δ ¯ k s + + δ ¯ k s 1 n × n δ ̲ k s ) + 2 β ¯ d max 1 N ( 1 n × n δ ¯ k p + 1 n × n δ ̲ k p ) + 1 N ( ϑ 2 A ν 2 + ς 2 C δ ¯ l p ν 2 ) + ς 2 ( 1 α ) ( 1 N ( C δ ¯ l i ) ) ) + ζ ( k ) ( 1 N δ ¯ f + ( α 1 ) ( 1 N ν 3 ) ) + X C ( 1 N ( ϱ 2 A ν 1 + Φ δ ¯ k s + + δ ¯ k s 1 n × n δ ̲ k s ) + 2 β ¯ d max 1 N ( 1 n × n δ ¯ k p + 1 n × n δ ̲ k s ) + ( N θ 1 N ) δ ¯ k c 1 N ν 1 + 1 N ( ( ϑ 2 ϱ 1 ) A ν 2 + ( ς 2 σ 1 ) C δ ¯ l p ) + ( 1 α ) ( ς 2 σ 1 ) ( 1 N ( C δ ¯ l i ) ) ) .
Using (25f)–(25i), it can be concluded that
Δ V ( k ) < ( 1 μ ) X ˜ ( k ) ν + ρ X C ν 1 .
It is easy to derive from (56) that V ( k + 1 ) < μ V ( k ) + ρ X C ν 1 < < μ k + 1 V ( 0 ) k + 1 μ k + 1 1 μ ρ X C ν 1 , and this leads to
lim k V ( k ) = 1 1 μ ρ X C ν 1 .
To maintain readability, some detailed steps and intermediate calculations of this proof are provided in Appendix A. These additional details include (29), (42), (50), and (51), which provide a more comprehensive understanding of the proof process.
Remark 4.
The designed control strategy (24) is based on the proposed dynamic event-triggered mechanism (21). This makes the controller dynamically adjust its actions based on real-time system states and events, rather than relying on periodic updates. As stated in the Introduction, the introduction of an event-triggered approach eliminates the need for controller operations when the system states change, leading to lower resource consumption and significantly extending the lifespan of agents.
Remark 5.
There are three controller gain matrices K s , K p , and K c in the designed controller (24), which play vital roles in fine-tuning the system’s operational dynamics. Specifically, K s is instrumental in adjusting the state estimation of the agent itself, enabling a precise self-assessment of its operational state. K p , on the other hand, facilitates the interaction of state estimation between agents, thereby enhancing collaborative performance and system-wide coherence. Lastly, K c is dedicated to adjusting the final convergence point of the system, ensuring that this value is contingent upon a given constant term, rather than converging to a null point.
Remark 6.
By introducing finite-value vectors x i c and variables (32) and (33), the final convergence point depends on the given vector, rather than converging to a zero point, which increases the practicability of the proposed control protocol. By assigning a unique x i c to each agent, the system facilitates the convergence of each agent to distinct values, rather than enforcing uniformity, where all agents converge to the same point. This capability is crucial in scenarios where varied states or outcomes are desirable among different agents.

4. Illustrative Examples

Two numerical examples are provided in this section to illustrate the theoretical conclusions.
Example 1.
The systems matrices of the system (1) are given as:
A = 0.5 0.1 0.1 0.2 0.3 0.2 0.2 0.2 0.4 , B = 0.04 0.04 0.03 0.05 0.02 0.06 , C = 0.04 0.03 0.07 0.02 0.01 0.05 .
According to the original and observer systems, the nonlinear functions are as follows: f ( x ) = 0.3 x + x 5 x 2 + 5 , f ^ ( x ) = 0.4 x + x 2 x 2 + 2 , g ( x ) = 0.1 x + x 5 x 2 + 5 , g ^ ( x ) = 0.3 x + 3 x 10 x 2 + 10 . Then, we set ϱ 1 = 0.30 , ϱ 2 = 0.40 , σ 1 = 0.1 , σ 2 = 0.2 , ϑ 1 = 0.4 , ϑ 2 = 0.5 , ς 1 = 0.3 , ς 2 = 0.35 , α = 0.3 . The initial states and initial estimated states of all agents are as follows: x 1 ( 0 ) = ( 30.0 , 40.0 , 50.0 ) , x 2 ( 0 ) = ( 50.0 , 61.0 , 62.0 ) , x 3 ( 0 ) = ( 70.0 , 54.0 , 65.0 ) , x ^ 1 ( 0 ) = ( 40.0 , 60.0 , 80.0 ) , x ^ 2 ( 0 ) = ( 85.0 , 83.0 , 88.0 ) , x ^ 3 ( 0 ) = ( 94.0 , 98.0 , 80.0 ) , v 1 ( 0 ) = v 2 ( 0 ) = v 3 ( 0 ) = 0 . By solving the conditions presented in Theorem 1, the vectors that satisfy the conditions and the gain matrices L p , L I , and F of observer (5) can be obtained.
ν 1 = 409.451 182.734 238.676 , ν 2 = 199.7807 129.5348 149.5892 , ν 2 = 257.4571 257.4571 257.4571 , δ ¯ F = 135.7607 135.7607 135.7607 ,
δ ¯ l i = 166.2572 172.3710 , δ ¯ l p = 166.2049 172.1265 , L P = 0.1716 0.1718 0.1693 0.1704 0.1679 0.1691 ,
L I = 0.0993 0.1023 0.0993 0.1023 0.0993 0.1023 , F = 0.1354 0.1354 0.1354 0.1354 0.1354 0.1354 0.1354 0.1354 0.1354 .
The simulations of the system states, observer states, and observer errors are shown in Figure 1, Figure 2 and Figure 3. From the figures, it is easily observed that the designed PI observer (5) offers accurate estimations of the states of the considered systems (1). The rapid convergence of observer errors towards zero highlights the efficiency of the PI observer in correcting discrepancies between actual and estimated states.
Example 2.
Suppose that there are three agents in the system and the communication typology is modeled by an undirected graph. The adjacency matrix degree matrix and corresponding Laplacian matrix are
A = 2 1 1 1 2 1 1 1 2 , D = 2 0 0 0 2 0 0 0 2 , L = 2 1 1 1 2 1 1 1 2 .
It can be demonstrated that N = 3 , d max = l max = 2 , d min = 1 . The system matrices of the PMASs are given as:
A = 0.4 0.3 0.4 0.4 0.5 0.3 0.2 0.5 0.6 , B = 0.2 0.04 0.03 0.5 0.02 0.06 , C = 0.8 0.2 0.6 0.1 0.3 1 .
The nonlinear functions and the corresponding sector conditions’ parameters of the original system and observer system are chosen same as in Example 1. Choose α = 0.2 , Λ = 0.1 , β ( 0 ) = 0.2 , β ¯ = 0.3 , μ = 2.6 , ρ = 481 , θ ̲ = 1.01 , θ ¯ = 1.2 , ε = 0.5 . The initial values required are given as x 1 ( 0 ) = ( 3.0 , 4.0 , 5.0 ) , x 2 ( 0 ) = ( 5.0 , 6.0 , 6.0 ) , x 3 ( 0 ) = ( 7.0 , 5.0 , 6.0 ) , x ^ 1 ( 0 ) = ( 4 , 6 , 8 ) , x ^ 2 ( 0 ) = ( 7 , 8 , 7 ) , x ^ i ( 0 ) = ( 8 , 6 , 8 ) , x 1 c = ( 0.002 , 0.003 , 0.004 ) , x 2 c = ( 0.001 , 0.002 , 0.001 ) , x 1 c = ( 0.001 , 0.001 , 0.003 ) , v 1 ( 0 ) = v 2 ( 0 ) = v 3 ( 0 ) = 0 . Based on the feasible solutions of the conditions in Theorem 2, the vectors that satisfy the conditions and the gain matrices L p , L I , and F of observer (5) can be obtained.
ν 1 = 6.6079 8.2832 45.0657 , ν 2 = 5.9825 5.4041 6.9702 , ν 3 = 234.6972 234.6972 234.6972 , δ ̲ F = 106.9258 106.9258 106.9258 ,
δ ̲ k s + = 0.1915 0.1878 0.1781 , δ ¯ k s = 0.0027 0.0029 0.0029 , δ ̲ k p + = 0.000061 0.000057 0.000056 , δ ¯ k p = 0.0033 0.0035 0.0036 ,
L P = 0.3175 0.2250 0.3175 0.2251 0.3188 0.2233 , L I = 0.0034 0.0034 0.0034 0.0034 0.0034 0.0034 ,
K s + = 0.0584 0.0569 0.0573 0.0561 0.0563 0.0563 , K s = 0.0008 0.0009 0.0008 0.0009 0.0010 0.0010 , K p + = 0.000022 0.000024 0.000023 0.000010 0.000013 0.000013 , K n = 0.0022 0.3667 0.0893 0.0009 0.0008 0.0008 ,
K C = 49.2410 69.7231 514.7106 46.7387 55.3958 516.3974 , F = 16.4427 16.4427 16.4427 16.4427 16.4427 16.4427 15.8696 15.8696 15.8696 .
Based on the given initial values and parameters, as well as the computed gain matrices, the simulation results of the nonlinear positive multi-agent system (1) with a PI observer-based control mechanism (24) are shown in Figure 4, Figure 5, Figure 6, Figure 7, Figure 8 and Figure 9. It can be seen that the designed observer (5) provides appropriate estimations of the considered system (1). Moreover, Figure 4, Figure 5 and Figure 6 also illustrate that, under the designed observer-based dynamic event-triggered control mechanism (24), by introducing the constant vectors x i c , the system states and observer states ultimately converge to a fixed value rather than zero. Such a design is both rational and essential in applications where it is necessary for the system to stabilize at specific operational points rather than at a zero state. Figure 7 illustrates the dynamic triggering times and intervals for each agent, highlighting that the intervals at which control actions are taken vary among agents and do not follow a fixed periodic pattern. This leads to a more responsive and resource-efficient system. The state components and trajectories of the three agents are depicted in Figure 8 and Figure 9. It can be seen that each agent converges to its own distinct value. This outcome illustrates the system’s ability to achieve consensus, enhancing robustness and adaptability in real-world scenarios. By converging to distinct values, the agents demonstrate a form of consensus that allows the system to remain stable and effective under diverse conditions.

5. Conclusions and Future Work

In this paper, we introduced a positive proportional–integral observer (PIO)-based dynamic event-triggered protocol to address the consensus problem in nonlinear positive multi-agent systems (PMASs). Our contributions include the following three parts: the development of a positive PIO for improved state estimation under positivity constraints; the integration of this PIO with a dynamic event-triggered mechanism to reduce communication overhead while ensuring consensus; the introduction of variables that enhance the flexibility of the convergence point. In the future, it will be interesting to improve the PIO for different kinds of PMASs with various conditions. Comparing the performance of the designed PIO with other forms of observers is meaningful. Moreover, some parameters need to be specified in the proposed results; it is vital to determine them in a more flexible way.

Author Contributions

Conceptualization, M.H.; methodology, X.Y.; software, X.Y.; validation, X.Y. and M.H.; formal analysis, X.Y.; investigation, X.Y.; resources, M.H.; data curation, X.Y.; writing—original draft preparation, X.Y.; writing—review and editing, M.H., Y.W. and X.T.; visualization, X.Y. and M.H.; supervision, M.H., Y.W. and X.T.; project administration, M.H., Y.W. and X.T.; funding acquisition, M.H., Y.W. and X.T. All authors have read and agreed to the published version of the manuscript.

Funding

This work has been founded by the National Natural Science Foundation of China (62363009), the Academician Innovation Platform Special Project of Hainan Province (YSPTZX202209), the Natural Science Foundation of Hainan Province (622RC618), and the Science Research Funding of Hainan University (KYQD(ZR)22180).

Data Availability Statement

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

Conflicts of Interest

The authors declare no conflicts of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of the data; in the writing of the manuscript; nor in the decision to publish the results.

Abbreviations

The following abbreviations are used in this manuscript:
PMASspositive multi-agent systems
MASsmulti-agent systems
PIOproportional–integral observer

Appendix A. Supplementary Steps for (29), (42), (50), and (51) in Theorem 2

Appendix A.1. Additional Details for Step (29)

x i ( k 0 + 1 ) = A f ( x i ( k 0 ) ) + B K S x ^ i ( κ ι ) + B K P j N i A ( i j ) ( x ^ i ( κ ι ) x ^ j ( κ ι ) ) + B K C x i c = A f ( x i ( k 0 ) ) + B K S ( ϵ i ( k 0 ) + x ^ i ( k 0 ) ) + B K P j N i A ( i j ) ( ϵ i ( k 0 ) + x ^ i ( k 0 ) ( ϵ j ( k 0 ) + x ^ j ( k 0 ) ) ) + B K C x i c = A f ( x i ( k 0 ) ) + B K S x ^ i ( k 0 ) + B K S ϵ i ( k 0 ) + B K P j N i A ( i j ) ( x ^ i ( k 0 ) x ^ j ( k 0 ) ) + B K P j N i A ( i j ) ( ϵ i ( k 0 ) ϵ j ( k 0 ) ) + B K C x i c = A f ( x i ( k 0 ) ) + B K S x ^ i ( k 0 ) + B K P j N i A ( i j ) x ^ i ( k 0 ) B K P j N i A ( i j ) x ^ j ( k 0 ) + B K S ϵ i ( k 0 ) + B K P j N i A ( i j ) ϵ i ( k 0 ) B K P j N i A ( i j ) ϵ j ( k 0 ) + B K C x i c = A f ( x i ( k 0 ) ) + B K S + x ^ i ( k 0 ) + B K S x ^ i ( k 0 ) + B K P + j N i A ( i j ) x ^ i ( k 0 ) + B K P j N i A ( i j ) x ^ i ( k 0 ) B K P + j N i A ( i j ) x ^ j ( k 0 ) B K P j N i A ( i j ) x ^ j ( k 0 ) + B K S + ϵ i ( k 0 ) + B K S ϵ i ( k 0 ) + B K P + j N i A ( i j ) ϵ i ( k 0 ) + B K P j N i A ( i j ) ϵ i ( k 0 ) B K P + j N i A ( i j ) ϵ j ( k 0 ) B K P j N i A ( i j ) ϵ j ( k 0 ) + B K C x i c ϱ 1 A x i ( k 0 ) + B K S + x ^ i ( k 0 ) + B K S x ^ i ( k 0 ) β ¯ B K S + 1 n × n x ^ i ( k 0 ) + β ¯ B K S 1 n × n x ^ i ( k 0 ) + B K P + j N i A ( i j ) x ^ i ( k 0 ) + B K P j N i A ( i j ) x ^ i ( k 0 ) B K P + j N i A ( i j ) x ^ j ( k 0 ) B K P j N i A ( i j ) x ^ j ( k 0 ) β ¯ B K P + 1 n × n j N i A ( i j ) x ^ i ( k 0 ) + β ¯ B K P 1 n × n j N i A ( i j ) x ^ i ( k 0 ) β ¯ B K P + 1 n × n j N i A ( i j ) x ^ j ( k 0 ) + β ¯ B K P 1 n × n j N i A ( i j ) x ^ j ( k 0 ) + B K C x i c = ϱ 1 A x i ( k 0 ) + ( B K S + ( I n β ¯ 1 n × n ) + B K S ( I n + β ¯ 1 n × n ) ) x ^ i ( k 0 ) + B K C x i c + B K P + ( I n β ¯ 1 n × n ) j N i A ( i j ) x ^ i ( k 0 ) B K P + ( I n + β ¯ 1 n × n ) j N i A ( i j ) x ^ j ( k 0 ) + B K P ( I n + β ¯ 1 n × n ) j N i A ( i j ) x ^ i ( k 0 ) B K P ( I n β ¯ 1 n × n ) j N i A ( i j ) x ^ j ( k 0 ) = ϱ 1 A x i ( k 0 ) + ( B K S + ( I n β ¯ 1 n × n ) + B K S ( I n + β ¯ 1 n × n ) ) ( x i ( k 0 ) + e i ( k 0 ) ) + B K P + ( I n β ¯ 1 n × n ) j N i A ( i j ) ( x i ( k 0 ) + e i ( k 0 ) ) B K P + ( I n + β ¯ 1 n × n ) j N i A ( i j ) ( x j ( k 0 ) + e j ( k 0 ) ) + B K P ( I n + β ¯ 1 n × n ) j N i A ( i j ) ( x i ( k 0 ) + e i ( k 0 ) ) B K P ( I n β ¯ 1 n × n ) j N i A ( i j ) ( x j ( k 0 ) + e j ( k 0 ) ) + B K C x i c = ( ϱ 1 A + B K S + ( I n β ¯ 1 n × n ) + B K S ( I n + β ¯ 1 n × n ) ) x i ( k 0 ) + ( B K S + ( I n β ¯ 1 n × n ) + B K S ( I n + β ¯ 1 n × n ) ) e i ( k 0 ) + B K P + ( I n β ¯ 1 n × n ) j N i A ( i j ) x i ( k 0 ) B K P + ( I n + β ¯ 1 n × n ) j N i A ( i j ) x j ( k 0 ) + B K P ( I n + β ¯ 1 n × n ) j N i A ( i j ) x i ( k 0 ) B K P ( I n β ¯ 1 n × n ) j N i A ( i j ) x j ( k 0 ) + B K P + ( I n β ¯ 1 n × n ) j N i A ( i j ) e i ( k 0 ) B K P + ( I n + β ¯ 1 n × n ) j N i A ( i j ) e j ( k 0 ) + B K P ( I n + β ¯ 1 n × n ) j N i A ( i j ) e i ( k 0 ) B K P ( I n β ¯ 1 n × n ) j N i A ( i j ) e j ( k 0 ) + B K C x i c = ( ϱ 1 A + B K S + Ψ + B K S Φ ) x i ( k 0 ) + ( B K S + Ψ + B K S Φ ) e i ( k 0 ) + B K P + Ψ j N i A ( i j ) x i ( k 0 ) B K P + Φ j N i A ( i j ) x j ( k 0 ) + B K P Φ j N i A ( i j ) x i ( k 0 ) B K P Ψ j N i A ( i j ) x j ( k 0 ) + B K P + Ψ j N i A ( i j ) e i ( k 0 ) B K P + Φ j N i A ( i j ) e j ( k 0 ) + B K P Φ j N i A ( i j ) e i ( k 0 ) B K P Ψ j N i A ( i j ) e j ( k 0 ) + B K C x i c .

Appendix A.2. Additional Details for Step (42)

x i ( k 0 + 1 ) = A f ( x i ( k 0 ) ) + B K S x ^ i ( κ ι ) + B K P j N i A ( i j ) ( x ^ i ( κ ι ) x ^ j ( κ ι ) ) + B K C x i c = A f ( x i ( k 0 ) ) + B K S ( ϵ i ( k 0 ) + x ^ i ( k 0 ) ) + B K P j N i A ( i j ) ( ϵ i ( k 0 ) + x ^ i ( k 0 ) ( ϵ j ( k 0 ) + x ^ j ( k 0 ) ) ) + B K C x i c = A f ( x i ( k 0 ) ) + B K S x ^ i ( k 0 ) + B K S ϵ i ( k 0 ) + B K P j N i A ( i j ) ( x ^ i ( k 0 ) x ^ j ( k 0 ) ) + B K P j N i A ( i j ) ( ϵ i ( k 0 ) ϵ j ( k 0 ) ) + B K C x i c = A f ( x i ( k 0 ) ) + B K S x ^ i ( k 0 ) + B K P j N i A ( i j ) x ^ i ( k 0 ) B K P j N i A ( i j ) x ^ j ( k 0 ) + B K S ϵ i ( k 0 ) + B K P j N i A ( i j ) ϵ i ( k 0 ) B K P j N i A ( i j ) ϵ j ( k 0 ) + B K C x i c = A f ( x i ( k 0 ) ) + B K S + x ^ i ( k 0 ) + B K S x ^ i ( k 0 ) + B K S + ϵ i ( k 0 ) + B K S ϵ i ( k 0 ) + B K C x i c + B K P + j N i A ( i j ) x ^ i ( k 0 ) + B K P j N i A ( i j ) x ^ i ( k 0 ) B K P + j N i A ( i j ) x ^ j ( k 0 ) B K P j N i A ( i j ) x ^ j ( k 0 ) + B K P + j N i A ( i j ) ϵ i ( k 0 ) + B K P j N i A ( i j ) ϵ i ( k 0 )
B K P + j N i A ( i j ) ϵ j ( k 0 ) B K P j N i A ( i j ) ϵ j ( k 0 ) ϱ 2 A x i ( k 0 ) + B K S + x ^ i ( k 0 ) + B K S x ^ i ( k 0 ) + β ¯ B K S + 1 n × n x ^ i ( k 0 ) β ¯ B K S 1 n × n x ^ i ( k 0 ) + B K P + j N i A ( i j ) x ^ i ( k 0 ) + B K P j N i A ( i j ) x ^ i ( k 0 ) B K P + j N i A ( i j ) x ^ j ( k 0 ) B K P j N i A ( i j ) x ^ j ( k 0 ) + β ¯ B K P + 1 n × n j N i A ( i j ) x ^ i ( k 0 ) β ¯ B K P 1 n × n j N i A ( i j ) x ^ i ( k 0 ) + β ¯ B K P + 1 n × n j N i A ( i j ) x ^ j ( k 0 ) β ¯ B K P 1 n × n j N i A ( i j ) x ^ j ( k 0 ) + B K C x i c = ϱ 2 A x i ( k 0 ) + ( B K S + ( I n + β ¯ 1 n × n ) + B K S ( I n β ¯ 1 n × n ) ) x ^ i ( k 0 ) + B K P + ( I n + β ¯ 1 n × n ) j N i A ( i j ) x ^ i ( k 0 ) B K P + ( I n β ¯ 1 n × n ) j N i A ( i j ) x ^ j ( k 0 ) + B K P ( I n β ¯ 1 n × n ) j N i A ( i j ) x ^ i ( k 0 ) B K P ( I n + β ¯ 1 n × n ) j N i A ( i j ) x ^ j ( k 0 ) + B K C x i c = ϱ 2 A x i ( k 0 ) + ( B K S + ( I n + β ¯ 1 n × n ) + B K S ( I n β ¯ 1 n × n ) ) ( x i ( k 0 ) + e i ( k 0 ) ) + B K P + ( I n + β ¯ 1 n × n ) j N i A ( i j ) ( x i ( k 0 ) + e i ( k 0 ) ) B K P + ( I n β ¯ 1 n × n ) j N i A ( i j ) ( x j ( k 0 ) + e j ( k 0 ) ) + B K P ( I n β ¯ 1 n × n ) j N i A ( i j ) ( x i ( k 0 ) + e i ( k 0 ) ) B K P ( I n + β ¯ 1 n × n ) j N i A ( i j ) ( x j ( k 0 ) + e j ( k 0 ) ) + B K C x i c = ( ϱ 2 A + B K S + ( I n + β ¯ 1 n × n ) + B K S ( I n β ¯ 1 n × n ) ) x i ( k 0 ) + ( B K S + ( I n + β ¯ 1 n × n ) + B K S ( I n β ¯ 1 n × n ) ) e i ( k 0 ) + B K P + ( I n + β ¯ 1 n × n ) j N i A ( i j ) x i ( k 0 ) B K P + ( I n β ¯ 1 n × n ) j N i A ( i j ) x j ( k 0 ) + B K P ( I n β ¯ 1 n × n ) j N i A ( i j ) x i ( k 0 ) B K P ( I n + β ¯ 1 n × n ) j N i A ( i j ) x j ( k 0 ) + B K P + ( I n + β ¯ 1 n × n ) j N i A ( i j ) e i ( k 0 ) B K P + ( I n β ¯ 1 n × n ) j N i A ( i j ) e j ( k 0 ) + B K P ( I n β ¯ 1 n × n ) j N i A ( i j ) e i ( k 0 ) B K P ( I n + β ¯ 1 n × n ) j N i A ( i j ) e j ( k 0 ) + B K C x i c = ( ϱ 2 A + B K S + Φ + B K S Ψ ) x i ( k 0 ) + ( B K S + Φ + B K S Ψ ) e i ( k 0 ) + B K C x i c + B K P + Φ j N i A ( i j ) x i ( k 0 ) B K P + Ψ j N i A ( i j ) x j ( k 0 ) + B K P Ψ j N i A ( i j ) x i ( k 0 ) B K P Φ j N i A ( i j ) x j ( k 0 ) + B K P + Φ j N i A ( i j ) e i ( k 0 ) B K P + Ψ j N i A ( i j ) e j ( k 0 ) + B K P Ψ j N i A ( i j ) e i ( k 0 ) B K P Φ j N i A ( i j ) e j ( k 0 ) .

Appendix A.3. Additional Details for Step (50)

X ˜ ( k ) ( A 3 I ) ν = ξ ( k ) ϖ ( k ) ζ ( k ) I N ( ϱ 2 A + B K S + Φ + B K S Ψ + 2 β D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) ) I N n I N ( B K S + Φ + B K S Ψ + 2 β ¯ D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) ) 0 I N ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) L P C ) I N ( ϑ 2 A + ς 2 L P C ) I N n I N F ( 1 α ) ( ς 2 σ 1 ) ( I N ( L I C ) ) ς 2 ( 1 α ) ( I N ( L I C ) ) ( α 1 ) I N n ν ˜ 1 ν ˜ 2 ν ˜ 3 = ξ ( k ) ( ( I N ( ϱ 2 A + Φ K S + B + Ψ K S B ) + 2 β D ¯ ( 1 n × n K P + B 1 n × n K P B ) + L ( Ψ K P + B + Φ K P B ) ) I N n ) ν ˜ 1 + ϖ ( k ) ( I N ( Φ K S + B + Ψ K S B + 2 β D ¯ ( 1 n × n K P + B 1 n × n K P B ) + L ( Ψ K P + B + Φ K P B ) ) ) ν ˜ 1 + ξ ( k ) ( I N ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) C L P ) ) ν ˜ 2 + ϖ ( k ) ( I N ( ϑ 2 A + ς 2 C L P ) I N n ) ν ˜ 2 + ζ ( k ) ( I N F ) ν ˜ 2 + ξ ( k ) ( ( 1 α ) ( ς 2 σ 1 ) ( I N ( C L I ) ) ) ν ˜ 3 + ϖ ( k ) ( ς 2 ( 1 α ) ( I N ( C L I ) ) ) ν ˜ 3 + ( α 1 ) ζ ( k ) ν ˜ 3 .

Appendix A.4. Additional Details for Step (51)

( 1 3 X C ) C 3 ν = X C X C X C I N ( ϱ 2 A + B K S + Φ + B K S Ψ ) + 2 β D ¯ ( B K P + 1 n × n B K P 1 n × n ) + L ( B K P + Ψ + B K P Φ ) + ( 1 N θ I N ) ( B K C ) I N n 0 0 0 I N ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) L P C ) 0 0 0 ( 1 α ) ( ς 2 σ 1 ) ( I N ( L I C ) ) ν ˜ 1 ν ˜ 2 ν ˜ 3
= X C ( I N ( ϱ 2 A + Φ K S + B + Ψ K S B ) + 2 β D ¯ ( 1 n × n K P + B 1 n × n K P B ) + L ( Ψ K P + B + Φ K P B ) + ( θ 1 N I N ) ( K C B ) I N n ) ν ˜ 1 + X C ( I N ( ( ϑ 2 ϱ 1 ) A + ( ς 2 σ 1 ) C L P ) ) ν ˜ 2 + X C ( ( 1 α ) ( ς 2 σ 1 ) ( I N ( C L I ) ) ) ν ˜ 3 .

References

  1. Cai, J.; Kim, D.; Jaramillo, R.; Braun, J.E.; Hu, J. A General Multi-Agent Control Approach for Building Energy System Optimization. Energy Build. 2016, 127, 337–351. [Google Scholar] [CrossRef]
  2. Lee, J.H.; Kim, C.O. Multi-Agent Systems Applications in Manufacturing Systems and Supply Chain Management: A Review Paper. Int. J. Prod. Res. 2008, 46, 233–265. [Google Scholar] [CrossRef]
  3. Afrin, M.; Jin, J.; Rahman, A.; Rahman, A.; Wan, J.; Hossain, E. Resource Allocation and Service Provisioning in Multi-Agent Cloud Robotics: A Comprehensive Survey. IEEE Commun. Surv. Tutor. 2021, 23, 842–870. [Google Scholar] [CrossRef]
  4. Wu, J.; Yuan, S.; Ji, S.; Zhou, G.; Wang, Y.; Wang, Z. Multi-Agent System Design and Evaluation for Collaborative Wireless Sensor Network in Large Structure Health Monitoring. Expert Syst. Appl. 2010, 37, 2028–2036. [Google Scholar] [CrossRef]
  5. Chaudhary, D.; Nayse, S.; Waghmare, L. Application of Wireless Sensor Networks for Greenhouse Parameter Control in Precision Agriculture. Int. J. Wirel. Mob. Netw. 2011, 3, 140–149. [Google Scholar] [CrossRef]
  6. Ren, W.; Atkins, E. Distributed Multi-vehicle Coordinated Control via Local Information Exchange. Int. J. Robust Nonlinear Control 2007, 17, 1002–1033. [Google Scholar] [CrossRef]
  7. Ogura, M.; Kishida, M.; Lam, J. Geometric Programming for Optimal Positive Linear Systems. IEEE Trans. Autom. Control 2020, 65, 4648–4663. [Google Scholar] [CrossRef]
  8. Dong, G.; Li, H.; Ma, H.; Lu, R. Finite-Time Consensus Tracking Neural Network FTC of Multi-Agent Systems. IEEE Trans. Neural Netw. Learn. Syst. 2020, 32, 653–662. [Google Scholar] [CrossRef] [PubMed]
  9. Gao, R.; Huang, J.; Wang, L. Leaderless Consensus Control of Uncertain Multi-Agents Systems with Sensor and Actuator Attacks. Inf. Sci. 2019, 505, 144–156. [Google Scholar] [CrossRef]
  10. He, W.; Zhang, B.; Han, Q.L.; Qian, F.; Kurths, J.; Cao, J. Leader-Following Consensus of Nonlinear Multiagent Systems With Stochastic Sampling. IEEE Trans. Cybern. 2016, 47, 1–12. [Google Scholar] [CrossRef]
  11. Wu, Y.; Zhang, H.; Wang, Z.; Huang, C. Distributed Event-Triggered Consensus of General Linear Multiagent Systems Under Directed Graphs. IEEE Trans. Cybern. 2022, 52, 608–619. [Google Scholar] [CrossRef] [PubMed]
  12. Ma, Z.; Wang, Y.; Li, X. Cluster-Delay Consensus in First-Order Multi-Agent Systems with Nonlinear Dynamics. Nonlinear Dyn. 2016, 83, 1303–1310. [Google Scholar] [CrossRef]
  13. Zhang, J.; Zheng, G.; Feng, Y.; Chen, Y. Event-Triggered State-Feedback and Dynamic Output-Feedback Control of Positive Markovian Jump Systems with Intermittent Faults. IEEE Trans. Autom. Control 2022, 68, 1039–1046. [Google Scholar] [CrossRef]
  14. Heemels, W.; Johansson, K.; Tabuada, P. An Introduction to Event-Triggered and Self-Triggered Control. In Proceedings of the 2012 IEEE 51st IEEE Conference on Decision and Control (CDC), Maui, HI, USA, 10–13 December 2012; pp. 3270–3285. [Google Scholar] [CrossRef]
  15. Johan Åström, K.; Bernhardsson, B. Comparison of Periodic and Event Based Sampling for First-Order Stochastic Systems. IFAC Proc. Vol. 1999, 32, 5006–5011. [Google Scholar] [CrossRef]
  16. Albert, A.; Bosch, R. Comparison of Event-Triggered and Time-Triggered Concepts with Regard to Distributed Control Systems. Embed. World 2004, 235–252. [Google Scholar]
  17. Tabuada, P. Event-Triggered Real-Time Scheduling of Stabilizing Control Tasks. IEEE Trans. Autom. Control 2007, 52, 1680–1685. [Google Scholar] [CrossRef]
  18. Fan, Y.; Feng, G.; Wang, Y.; Song, C. Distributed Event-Triggered Control of Multi-Agent Systems with Combinational Measurements. Automatica 2013, 49, 671–675. [Google Scholar] [CrossRef]
  19. Wu, Y.; Zhang, H.; Wang, Z.; Zhang, C.; Huang, C. Output Consensus of Heterogeneous Linear Multiagent Systems With Directed Graphs via Adaptive Dynamic Event-Triggered Mechanism. IEEE Trans. Cybern. 2023, 53, 4606–4618. [Google Scholar] [CrossRef]
  20. Zheng, Y.; Li, Y.X. Event-Triggered Output Feedback Consensus Tracking Control for Nonlinear Multiagent Systems with Sensor Failures. Automatica 2023, 148, 110787. [Google Scholar] [CrossRef]
  21. Luenberger, D. An Introduction to Observers. IEEE Trans. Autom. Control 1971, 16, 596–602. [Google Scholar] [CrossRef]
  22. Liu, T.; Huang, J. A Distributed Observer for a Class of Nonlinear Systems and Its Application to a Leader-Following Consensus Problem. IEEE Trans. Autom. Control 2019, 64, 1221–1227. [Google Scholar] [CrossRef]
  23. Han, J.; Liu, X.; Gao, X.; Wei, X. Intermediate Observer-Based Robust Distributed Fault Estimation for Nonlinear Multiagent Systems with Directed Graphs. IEEE Trans. Ind. Inform. 2020, 16, 7426–7436. [Google Scholar] [CrossRef]
  24. Li, K.; Hua, C.; You, X.; Guan, X. Finite-Time Observer-Based Leader-Following Consensus for Nonlinear Multiagent Systems with Input Delays. IEEE Trans. Cybern. 2021, 51, 5850–5858. [Google Scholar] [CrossRef] [PubMed]
  25. Shafai, B.; Carroll, R. Design of Proportional-Integral Observer for Linear Time-Varying Multivariable Systems. In Proceedings of the 1985 24th IEEE Conference on Decision and Control, Fort Lauderdale, FL, USA, 11–13 December 1985; pp. 597–599. [Google Scholar] [CrossRef]
  26. Wu, A.G.; Duan, G.R. Design of Generalized PI Observers for Descriptor Linear Systems. IEEE Trans. Circuits Syst. Regul. Pap. 2006, 53, 2828–2837. [Google Scholar] [CrossRef]
  27. Koenig, D. Unknown Input Proportional Multiple-Integral Observer Design for Linear Descriptor Systems: Application to State and Fault Estimation. IEEE Trans. Autom. Control 2005, 50, 212–217. [Google Scholar] [CrossRef]
  28. Yang, X.; Chen, Y.; Li, B.; Luo, D. Battery States Online Estimation Based on Exponential Decay Particle Swarm Optimization and Proportional-Integral Observer with a Hybrid Battery Model. Energy 2020, 191, 116509. [Google Scholar] [CrossRef]
  29. Zhao, D.; Wang, Z.; Chen, Y.; Wei, G. Proportional–Integral Observer Design for Multidelayed Sensor-Saturated Recurrent Neural Networks: A Dynamic Event-Triggered Protocol. IEEE Trans. Cybern. 2020, 50, 4619–4632. [Google Scholar] [CrossRef] [PubMed]
  30. Cheng, J.; Liang, L.; Yan, H.; Cao, J.; Tang, S.; Shi, K. Proportional-Integral Observer-Based State Estimation for Markov Memristive Neural Networks With Sensor Saturations. IEEE Trans. Neural Netw. Learn. Syst. 2024, 35, 405–416. [Google Scholar] [CrossRef] [PubMed]
  31. Kaczorek, T. Positive 1D and 2D Systems; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2002. [Google Scholar]
  32. Farina, L.; Rinaldi, S. Positive Linear Systems: Theory and Applications; John Wiley & Sons: Hoboken, NJ, USA, 2000; Volume 50. [Google Scholar]
  33. Godsil, C.; Royle, G. Algebraic Graph Theory; Graduate Texts in Mathematics; Springer: New York, NY, USA, 2001; Volume 207. [Google Scholar] [CrossRef]
  34. Ren, W.; Beard, R. Consensus Seeking in Multiagent Systems under Dynamically Changing Interaction Topologies. IEEE Trans. Autom. Control 2005, 50, 655–661. [Google Scholar] [CrossRef]
  35. Lin, Z.; Francis, B.; Maggiore, M. Necessary and Sufficient Graphical Conditions for Formation Control of Unicycles. IEEE Trans. Autom. Control 2005, 50, 121–127. [Google Scholar] [CrossRef]
  36. Liang, L.; Cheng, J.; Cao, J.; Wu, Z.G.; Chen, W.H. Proportional–Integral Observer-Based State Estimation for Singularly Perturbed Complex Networks With Cyberattacks. IEEE Trans. Neural Netw. Learn. Syst. 2023, 34, 9795–9805. [Google Scholar] [CrossRef] [PubMed]
  37. Shu, Z.; Lam, J.; Gao, H.; Du, B.; Wu, L. Positive Observers and Dynamic Output-Feedback Controllers for Interval Positive Linear Systems. IEEE Trans. Circuits Syst. Regul. Pap. 2008, 55, 3209–3222. [Google Scholar] [CrossRef]
Figure 1. The simulations of x , x ^ , and e of the 1st agent.
Figure 1. The simulations of x , x ^ , and e of the 1st agent.
Axioms 13 00384 g001
Figure 2. The simulations of x ( k ) , x ^ ( k ) , and e ( k ) of the 2nd agent.
Figure 2. The simulations of x ( k ) , x ^ ( k ) , and e ( k ) of the 2nd agent.
Axioms 13 00384 g002
Figure 3. The simulations of x ( k ) , x ^ ( k ) , and e ( k ) of the 3rd agent.
Figure 3. The simulations of x ( k ) , x ^ ( k ) , and e ( k ) of the 3rd agent.
Axioms 13 00384 g003
Figure 4. The simulations of x ( k ) , x ^ ( k ) , and e ( k ) of the 1st agent.
Figure 4. The simulations of x ( k ) , x ^ ( k ) , and e ( k ) of the 1st agent.
Axioms 13 00384 g004
Figure 5. The simulations of x ( k ) , x ^ ( k ) , and e ( k ) of the 2nd agent.
Figure 5. The simulations of x ( k ) , x ^ ( k ) , and e ( k ) of the 2nd agent.
Axioms 13 00384 g005
Figure 6. The simulations of x ( k ) , x ^ ( k ) , and e ( k ) of the 3rd agent.
Figure 6. The simulations of x ( k ) , x ^ ( k ) , and e ( k ) of the 3rd agent.
Axioms 13 00384 g006
Figure 7. The trigger signal of each agent.
Figure 7. The trigger signal of each agent.
Axioms 13 00384 g007
Figure 8. The the state components of the three agents.
Figure 8. The the state components of the three agents.
Axioms 13 00384 g008
Figure 9. The state trajectories of the three agents.
Figure 9. The state trajectories of the three agents.
Axioms 13 00384 g009
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

Yang, X.; Huang, M.; Wu, Y.; Tan, X. A Proportional–Integral Observer-Based Dynamic Event-Triggered Consensus Protocol for Nonlinear Positive Multi-Agent Systems. Axioms 2024, 13, 384. https://doi.org/10.3390/axioms13060384

AMA Style

Yang X, Huang M, Wu Y, Tan X. A Proportional–Integral Observer-Based Dynamic Event-Triggered Consensus Protocol for Nonlinear Positive Multi-Agent Systems. Axioms. 2024; 13(6):384. https://doi.org/10.3390/axioms13060384

Chicago/Turabian Style

Yang, Xiaogang, Mengxing Huang, Yuanyuan Wu, and Xuegang Tan. 2024. "A Proportional–Integral Observer-Based Dynamic Event-Triggered Consensus Protocol for Nonlinear Positive Multi-Agent Systems" Axioms 13, no. 6: 384. https://doi.org/10.3390/axioms13060384

APA Style

Yang, X., Huang, M., Wu, Y., & Tan, X. (2024). A Proportional–Integral Observer-Based Dynamic Event-Triggered Consensus Protocol for Nonlinear Positive Multi-Agent Systems. Axioms, 13(6), 384. https://doi.org/10.3390/axioms13060384

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