Next Article in Journal
Impulsive Control of Some Types of Nonlinear Systems Using a Set of Uncertain Control Matrices
Previous Article in Journal
Multiple UAVs Path Planning Based on Deep Reinforcement Learning in Communication Denial Environment
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Observer-Based PID Control Protocol of Positive Multi-Agent Systems

School of Information and Communication Engineering, Hainan University, Haikou 570228, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(2), 419; https://doi.org/10.3390/math11020419
Submission received: 13 December 2022 / Revised: 9 January 2023 / Accepted: 10 January 2023 / Published: 12 January 2023
(This article belongs to the Topic Dynamical Systems: Theory and Applications)

Abstract

:
This paper proposes the observer-based proportional-integral-derivative control of positive multi-agent systems. First, a positive observer is constructed for the considered multi-agent systems in terms of a matrix decomposition approach. Then, a novel proportional-integral-derivative protocol framework is proposed based on an improved observer. By using copositive Lyapunov function, the positivity and consensus of the multi-agent systems are achieved. The corresponding observer and control protocol gain matrices are designed in terms of linear programming. Moreover, the proposed design is developed for heterogeneous positive multi-agent systems. The main contributions of this paper include the following: (i) A positive observer is constructed to estimate the states of positive multi-agent systems; (ii) A novel observer-based proportional-integral-derivative protocol is designed to handle the consensus problem of positive multi-agent systems; and (iii) The presented conditions are solvable in terms of linear programming and the gain matrices can be constructed based on a matrix decomposition technology. Finally, two illustrative examples are provided to verify the effectiveness of the design.

1. Introduction

Multi-agent systems (MASs) have drawn much attention due to their wide application in power engineering [1,2], manufacturing systems [3], robotics [4,5,6], energy systems [7,8], and so on. One of the crucial challenges of MASs is the consensus problem, which means that all agents reach an agreement or cooperate to accomplish a task. Many efforts have been devoted to the consensus issues of MASs, including finite-time consensus [9], event-triggered consensus [10], cluster consensus [11], etc. In real world, there exists a class of MASs with nonnegative variables. Such a class of MASs is called positive MASs (PMASs) [12,13]. They have extensive applications in multiple vehicle systems [14], wireless sensor network [15], COVID-19 transmission process [16], and so on. It is worth noting that the research of PMASs is more complicated than general MASs (non-positive). Few efforts are devoted to PMASs though there have been some significant results on positive systems [17,18,19,20,21]. When dealing with the consensus of PMASs, the designed protocol must take the positivity constraint into consideration in addition to maintaining the convergence of the consensus errors. Therefore, existing approaches to MASs cannot be directly applied to PMASs.
There are many significant control approaches in literature such as fuzzy controller [22], adaptive controller [23], proportional controller [24], proportional-integral controller [25], proportional-derivative controller [26], and proportional-integral-derivative controller [27]. Proportional-integral-derivative (PID) controller is extensively used in various industry processes due to its straightforward and easy-to-understand structure compared to sophisticated controllers [28]. There have been a great amount of interesting findings about PID controllers. In [29], the classical PID control was investigated for high-order affine-nonlinear uncertain systems. Such kind of approach can govern the nonlinear uncertain systems semi-globally without the need for system structures with particular properties like normal or triangular forms. A PID controller for the stabilization of time-delay systems was constructed in [30] by considering all the controller gain matrices and delays as free parameters. The literature [31] proposed a PID controller design strategy based on the adaptive updating rules and data-driven techniques. In addition to the aforementioned systems, PID controllers are frequently employed in MASs. To handle the containment control of heterogeneous high-order MASs, a fully-distributed PID control was investigated in [32]. In [33], an l 2 robust PID-like output-feedback control was proposed. By transforming the consensus problem of MASs into the stabilization problem, the consensus of MASs with time-delay was achieved by virtue of the distributed PID controller [34]. In [35], distributed adaptive protocols were designed for nonlinear MASs to handle the distributed consensus problem. The literature [36] investigated the consensus of homogeneous MASs. Multiple fractional-order positive systems were taken into consideration in [37] and the consensus of systems was addressed by means of spectral graph theory. It has been shown that the PID controller has a positive impact on the system performances compared with other control technologies [38]. However, most of existing works on PMASs are devoted to the proportional control or proportional-integral control. Few results focus on the PID control of PMASs. Hence, it is significant to investigate the appropriate PID control of PMASs.
The state of the systems are assumed to be measurable in all the aforementioned literature. In practice, it is difficult to measure all states due to the high cost and technical constraint. As a result, an observer is introduced for the state and the corresponding observer-based control has been extensively considered. To cope with the consensus issue of MASs with directed communication topology, an observer-type protocol was constructed in [39] based on the relative outputs of neighboring agents. In [40], the cooperative output regulation problem of MASs was investigated based on the adaptive distributed observer approach. A proportional integral observer control protocol was constructed in [41] for nonlinear MASs with unknown inputs. For PMASs with undirected communication topology, the literature [42] provided an observer-type dynamic output-feedback protocol. An observer-based consensus protocol was presented in [43] for PMASs with nonlinear control input. In [44], the robust and non-fragile consensus problem of PMASs was investigated by using an observer-based dynamic output-feedback protocol. Fractional-order PMASs were also considered in [45].
This paper investigates the observer-based consensus protocol of PMASs. First, a positive observer is constructed to estimate the states of PMASs. The observer can be used to give the lower and upper boundaries of the real states. Second, a PID control protocol is proposed based on an improved observer. By using copositive Lyapunov functions, the positivity and consensus of PMASs can be guaranteed under the designed observer-based PID protocol. The designed protocol can be generalized for heterogeneous PMASs. The main contributions of this paper include the following: (i) A positive observer for PMASs is constructed; (ii) A novel observer-based PID protocol framework is designed; and (iii) Matrix decomposition technology is used to construct the gain matrices and linear programming is employed to handle the proposed conditions. The remainder of this paper is structured as follows: Preliminaries on positive systems and graph theory are introduced in Section 2. Section 3 shows the main results of positive observer problem and observer-based PID control synthesis. In Section 4, two numerical examples are given to illustrative correctness of the design. The article is concluded in Section 5, which also discusses some potential future research directions.
Notations. In this paper, we denote R , R n and R m × n as the sets of real numbers, n-dimensional vectors and the space of m × n matrices, respectively. Denote a i j as the ith row and jth column entry of matrix A. Matrix I n denotes the identity matrix with order n. 1 n is the R n column vector with all elements being 1, and 1 n ( ı ) means the column vector with ıth entry is 1 and other elements are all 0, i.e., 1 n = ( 1 , 1 , , 1 n ) and 1 n ( ı ) = ( 0 , , 0 ı 1 , 1 , 0 , , 0 n ı ) . For a given vector v R n , v 0 ( 0 ) means that v i > 0 ( 0 ) , i = 1 , 2 , , n . Similarly, for a matrix A R m × n , A 0 ( 0 ) means that a i j > 0 ( 0 ) . Given matrices A , B R m × n , A B ( A B ) means that a i j > b i j ( a i j b i j ) . The notation ⊗ denotes the Kronecker product.

2. Preliminaries

2.1. Positive Theory

Consider the discrete-time system:
x ( k + 1 ) = A x ( k ) + B u ( k ) , y ( k ) = C x ( k ) ,
where x ( k ) R s , y ( k ) R q , and u ( k ) R m denote the system state, output, control input, respectively. Assume that the system matrices satisfy A 0 , B 0 , C 0 .
Definition 1
([46,47]). System (1) is said to be positive if and only if for any non-negative initial state and non-negative input, x ( k ) 0 and y ( k ) 0 hold for all k N .
Lemma 1
([46,47]). System (1) is positive if and only if A , B , C are non-negative.
Lemma 2
([46,47]). If system (1) is positive, then the following statements are equivalent:
(i) 
A is a Schur matrix.
(ii) 
System (1) is asymptotically stable.
(iii) 
There exists a vector v R n with v 0 such that ( A I ) v 0 .

2.2. Graph Theory

In this paper, the communication topology among agents is described as an undirected graph, which is represented by G = ( V , E ) , where V = { 1 , 2 , , n } and E V × V denote the sets of nodes and edges, respectively. Two nodes i and j are adjacent if there is an edge between them, i.e., ( i , j ) E . The adjacency matrix of graph G is defined as a nonnegative symmetry matrix A , where a i i = 0 and a i j = a j i = 1 if nodes i and j are adjacent, otherwise, a i j = 0 . N i : = { j : ( i , j ) E } denotes the set of all the neighbor nodes of node i. The degree matrix is denoted by a diagonal matrix D , where d i i = i N i a i j . The corresponding Laplacian matrix is an n × n symmetry matrix and is defined as L = D A .

2.3. Problem Formulation

Consider a multi-agent system consists of n agents with discrete-time positive dynamics and each of them is described as:
x i ( k + 1 ) = A x i ( k ) + B u i ( k ) y i ( k ) = C x i ( k ) , i V ,
where x i ( k ) R s , y i ( k ) R q and u i ( k ) R m denote the state, measured output and control input of the ith agent, respectively. A R s × s , B R s × m , C R q × s are non-negative matrices. It is assumed that ( A , B ) is stabilizable and ( A , C ) is detectable.
For the purpose of clarity, the block diagram of agent i with observer-based control is illustrated in Figure 1. The objectives of this paper are to: (i) Design an observer to estimate the states of the multi-agent system, and (ii) Construct an observer-based PID control protocol such that the consensus of system (2) is achievable, i.e., lim k | | x i ( k ) x j ( k ) | | = 0 , i , j V .

3. Main Results

This section is divided into three parts. The first subsection considers the positive observer design of PMASs. Observer-based PID control protocol is proposed in the second subsection. The third subsection extends the results for heterogeneous PMASs.

3.1. Positive Observer for General PMASs

An observer is constructed to estimate the states of system (2) in the following form:
x ^ i ( k + 1 ) = A x ^ i ( k ) + B u i ( k ) + L ( y i ( k ) y ^ i ( k ) ) , y ^ i ( k ) = C x ^ i ( k ) ,
where x ^ i ( k ) R s is the state estimate of system (2), y ^ i ( k ) R q is the output of the observer, and L R s × q is the gain matrix to be determined.
For the ith agent, define the estimate error as e i ( k ) = x ^ i ( k ) x i ( k ) . Then,
e i ( k + 1 ) = x ^ i ( k + 1 ) x i ( k + 1 ) = ( A L C ) e i ( k ) .
The objective is to determine the estimation x ^ i ( k ) of the state x i ( k ) such that x ^ i ( k ) are nonnegative and the estimate error e i ( k ) converges to zero.
Theorem 1.
If there exist R s vector ν 0 and R q vectors ϵ ( 𝒥 ) 0 , ϵ 0 such that
1 s ν A 𝒥 = 1 s 1 s 𝒥 ϵ ( 𝒥 ) C 0 ,
A ν C ϵ ν 0 ,
ϵ ( 𝒥 ) ϵ , 𝒥 = 1 , 2 , , s ,
hold, then the observer (3) is positive and the error system (4) is stable, where the observer gain matrix is:
L = 𝒥 = 1 s 1 s 𝒥 ϵ ( 𝒥 ) 1 s ν .
Proof of Theorem 1.
Firstly, we prove the positivity of the designed observer. Consider the following augmented systems:
x i ( k + 1 ) x ^ i ( k + 1 ) = A 0 L C A L C x i ( k ) x ^ i ( k ) + B B u i ( k ) u i ( k ) .
Using (5a) gives A L C 0 . By Lemma 1, the augmented system (7) is positive. The positivity of observer (3) can be guaranteed.
Next, we prove that the error system (4) is stable. Choosing a copositive Lyapunov function V ( k ) = e i ( k ) ν , it can be obtained that:
Δ V ( k ) = V ( k + 1 ) V ( k ) = e i ( k ) ( A ν C L ν ν ) .
By (6) and (5c), it holds that L ν = 𝒥 = 1 s 1 s 𝒥 ϵ ( 𝒥 ) 1 s ν ν ϵ 1 s 1 s ν ν = ϵ . By (5b) and e i ( k ) 0 , it follows that
Δ V ( e i ( k ) ) e i ( k ) ( A ν C ϵ ν ) < 0 .
This completes the proof. □
Remark 1.
The gain matrix of positive observer (3) is constructed based on the matrix decomposition approach. From (5a)(5c), it can be seen that all the conditions presented in Theorem 1 are solvable in terms of linear programming. It is easy to derived that for any e i ( 0 ) 0 ( 0 ) , e i ( k ) 0 ( 0 ) , k = 1 , 2 , holds. Thus, the lower and upper bounds of the state estimation of system (2) can be obtained by setting 0 x ^ ̲ i ( 0 ) x i ( 0 ) x ^ ¯ i ( 0 ) , where x ^ ̲ i ( 0 ) and x ^ ¯ i ( 0 ) are the initial state of the observer.

3.2. Observer-Based PID Protocol of Homogeneous PMASs

In this subsection, we construct an observer-based PID control protocol for the system (2). In [48], it has been verified that a positive system is not stabilized by using a Luenberger observer-based controller. Thus, it is not hard to derive that the system (2) is not stabilized by virtue of a dynamic control protocol with the observer (3). Following the design in [49], an improved observer is designed as:
x ^ i ( k + 1 ) = E x ^ i ( k ) + L y i ( k ) ,
where x ^ ( k ) R s is the state of observer, y i ( k ) R q is the output of system (2), and E R s × s and L R s × q are the observer gain matrices to be determined. Based on the observer (8), a PID control protocol is constructed as:
u i ( k ) = K S x ^ i ( k ) + K P j N i a i j ( x ^ i ( k ) x ^ j ( k ) ) + K I h = k d k 1 x ^ i ( h ) + K D Δ x ^ i ( k ) ,
where K S , K P , K I , and K D are PID controller gain matrices to be designed, d is the time delay, and Δ x ^ i ( k ) = x ^ i ( k ) x ^ i ( k 1 ) . The estimate error is defined as: e ˜ i ( k ) = x i ( k ) x ^ i ( k ) .
Choose x ˜ i ( k ) : = ( x ^ i ( k ) , e ˜ i ( k ) ) and y ˜ i ( k ) : = x ^ i ( k ) as the state variable and output, respectively. Then the augmented system of agent i with the observer-based PID control input (9) is:
x ˜ i ( k + 1 ) = A ˜ x ˜ i ( k ) + B ˜ u i ( k ) , y ˜ i ( k ) = C ˜ x ˜ i ( k ) ,
where
A ˜ = E + L C L C A L C E A L C , B ˜ = 0 B , C ˜ = I 0 .
Let X ( k ) = ( x ˜ 1 ( k ) , x ˜ 2 ( k ) , , x ˜ n ( k ) ) . The overall closed-loop system can be written in a compact form as:
X ( k + 1 ) = A X ( k ) + B 1 X ( k 1 ) + h = k d k 2 B 2 X ( h ) ,
where
A = I n A ˇ + L B ˜ K P C ˜ , B = I n ( B ˜ ( K I K D ) C ˜ ) , A ˇ = E + L C L C A + B K S + B K D L C E A L C , B ˜ = 0 B , C ˜ = I 0 .
Thus, the entries of matrices A , B 1 , and B 2 can be shown as:
A i i = E + L C L C A L C E + j N 1 a i j B K P + B K S + B K D A L C , A i j = 0 0 a i j B K P 0 , B 1 i i = 0 0 B K I B K D 0 , B 2 i i = 0 0 B K I 0 .
Remark 2.
The observer (8) is different from the Luenberger observer in [50]. It can be observed from (10)(13) that the observer gain matrices E , and L and the controller gain matrices K S , K P , K I , and K D are independent. Therefore, the observer-based PID control in this paper cannot be designed separately. The consensus problem of positive discrete-time multi-agent system (2) with the observer-based PID control protocol (8) can be transformed into the consensus problem of the augmented system (11).
Theorem 2.
If there exist constants λ 1 > 0 , λ 2 > 1 , R s vectors ς 1 0 , ς 2 0 , ζ 1 0 , ζ 2 0 , ξ 1 0 , ξ 2 0 , δ ̲ e c 0 , δ e c ( ı ) 0 , δ ¯ e c 0 , δ k s ( 𝒥 ) , δ k s , δ k p ( 𝒥 ) 0 , δ k p 0 , δ k i ( 𝒥 ) 0 , δ k i 0 , δ ̲ k d , δ k d ( 𝒥 ) , δ k d , and R q vectors δ ̲ l c 0 , δ l c ( ı ) 0 , δ ¯ l c 0 such that
λ 1 1 m B ς 2 A ı = 1 s 1 s ( ı ) δ e c ( ı ) ı = 1 s 1 s ( ı ) δ l c ( ı ) C + λ 1 B 𝒥 = 1 m 1 m ( 𝒥 ) δ k s ( 𝒥 ) + λ 1 B 𝒥 = 1 m 1 m ( 𝒥 ) δ k d ( 𝒥 ) + λ 1 j N 1 a 1 j B 𝒥 = 1 m 1 m ( 𝒥 ) δ k p ( 𝒥 ) 0 ,
1 s ς 1 A ı = 1 s 1 s ( ı ) δ l c ( ı ) C 0 ,
𝒥 = 1 m 1 m ( 𝒥 ) δ k i ( 𝒥 ) 𝒥 = 1 m 1 m ( 𝒥 ) δ k d ( 𝒥 ) 0 ,
λ 1 1 m B ς 2 1 s ς 1 ,
λ 2 ς 1 ς 2 ,
δ ̲ e c δ e c ( ı ) δ ¯ e c , δ ̲ l c δ l c ( ı ) δ ¯ l c , ı = 1 , 2 , , s ,
δ k s ( 𝒥 ) δ k s , δ k p ( 𝒥 ) δ k p , δ k i ( 𝒥 ) δ k i , δ ̲ k d δ k d ( 𝒥 ) δ ¯ k d , 𝒥 = 1 , 2 , , m ,
A ς 2 + ( 1 λ 2 ) C δ ̲ l c + ( 1 λ 2 ) δ ̲ e c + δ ¯ k s + δ ¯ k d + ζ 1 ς 1 0 ,
( A I ) ς 2 + ( 1 λ 2 ) C δ ̲ l c + ζ 2 0 ,
δ k i δ ̲ k d ζ 1 + ( d 1 ) ξ 1 0 ,
( d 1 ) ξ 2 ζ 2 0 ,
δ ¯ k i ξ 1 0 ,
hold, then under the observer-based PID control protocol (9) with
E = ı = 1 s 1 s ( ı ) δ e c ( ı ) 1 s ς 1 , L = ı = 1 s 1 s ( ı ) δ l c ( ı ) 1 s ς 1 , K S = 𝒥 = 1 m 1 m ( 𝒥 ) δ k s ( 𝒥 ) 1 m B ς 2 , K P = 𝒥 = 1 m 1 m ( 𝒥 ) δ k p ( 𝒥 ) 1 m B ς 2 , K I = 𝒥 = 1 m 1 m ( 𝒥 ) δ k i ( 𝒥 ) 1 m B ς 2 , K D = 𝒥 = 1 m 1 m ( 𝒥 ) δ k d ( 𝒥 ) 1 m B ς 2 ,
the closed-loop system (11) is positive and stable, which means that the observer (8) is positive and the consensus of system (2) is reached.
Proof of Theorem 2.
First, we prove the positivity of the closed-loop system (11). From (14a) and (14d), it can be obtained that
A ı = 1 s 1 s ( ı ) δ e c ( ı ) 1 s ς 1 ı = 1 s 1 s ( ı ) δ l c ( ı ) 1 s ς 1 C + B 𝒥 = 1 m 1 m ( 𝒥 ) δ k s ( 𝒥 ) 1 m B ς 2 + B 𝒥 = 1 m 1 m ( 𝒥 ) δ k d ( 𝒥 ) 1 m B ς 2 + j N 1 a 1 j B 𝒥 = 1 m 1 m ( 𝒥 ) δ k p ( 𝒥 ) 1 m B ς 2 A ı = 1 s 1 s ( ı ) δ e c ( ı ) λ 1 1 m B ς 2 ı = 1 s 1 s ( ı ) δ l c ( ı ) λ 1 1 m B ς 2 C + B 𝒥 = 1 m 1 m ( 𝒥 ) δ k s ( 𝒥 ) 1 m B ς 2 + B 𝒥 = 1 m 1 m ( 𝒥 ) δ k d ( 𝒥 ) 1 m B ς 2 + j N 1 a 1 j B 𝒥 = 1 m 1 m ( 𝒥 ) δ k p ( 𝒥 ) 1 m B ς 2 0 .
Together with (15), it is easy to derived that A L C E + j N 1 a i j B K P + B K S + B K D 0 . Similarly, A L C 0 can be obtained by (14b) and (15). Since δ e c 0 and δ l c 0 , one has E + L C 0 and L C 0 . Consequently, it follows that A i i 0 . By a i j 0 and δ k p ( ı ) 0 , we have a i j B K P 0 . It means that A i j 0 . Then it can be obtained that A 0 . Using (14c) and (15) gives B K I B K D 0 and B K I 0 . Thus, B 1 0 and B 2 0 . Therefore, the positivity of the overall closed-loop system (11) can be guaranteed by Lemma 1.
Next, we analyze the stability of the closed-loop system (11). Select the following copositive Lyapunov–Krasovskii function:
V ( k ) = X ( k ) v + X ( k 1 ) μ + l = 2 d h = k l k 2 X ( h ) ϑ ,
where v = ( ς , ς , , ς n ) , μ = ( ζ , ζ , , ζ n ) , ϑ = ( ξ , ξ , , ξ n ) , with ς = ( ς 1 , ς 2 ) , ζ = ( ζ 1 , ζ 2 ) , ξ = ( ξ 1 , ξ 2 ) , respectively. The derivative of V ( k ) can be obtained as:
Δ V ( k ) = V ( k + 1 ) V ( k ) = X ( k + 1 ) v + X ( k ) μ + l = 2 d h = k l + 1 k 1 X ( h ) ϑ X ( k ) v X ( k 1 ) μ l = 2 d h = k l k 2 X ( h ) ϑ = X ( k ) A v + X ( k 1 ) B 1 v + h = k d k 2 X ( h ) B 2 v + X ( k ) μ + l = 2 d h = k l + 1 k 1 X ( h ) ϑ X ( k ) v X ( k 1 ) μ l = 2 d h = k l k 2 X ( h ) ϑ X ( k ) = X ( k ) ( A v + μ v ) + X ( k 1 ) ( B 1 v μ + ( d 1 ) ϑ ) + h = k d k 2 X ( h ) ( B 2 v ϑ ) ,
combined with (13), we have
A v + μ v = E + L C L C 0 0 0 0 Ψ A L C a 12 B K P 0 a 1 n B K P 0 0 0 E + L C L C 0 0 a 21 B K P 0 Ψ A L C a 2 n B K P 0 0 0 0 0 E + L C L C a n 1 B K P 0 a n 2 B K P 0 Ψ A L C ς 1 ς 2 ς 1 ς 2 ς 1 ς 2 + ζ 1 ζ 2 ζ 1 ζ 2 ζ 1 ζ 2 ς 1 ς 2 ς 1 ς 2 ς 1 ς 2 = E ς 1 + C L ς 1 + A ς 2 C L ς 2 E ς 2 + K S B ς 2 + K D B ς 2 + Θ + ζ 1 ς 1 C L ς 1 + A ς 2 C L ς 2 + ζ 2 ς 2 E ς 1 + C L ς 1 + A ς 2 C L ς 2 E ς 2 + K S B ς 2 + K D B ς 2 + Θ + ζ 1 ς 1 C L ς 1 + A ς 2 C L ς 2 + ζ 2 ς 2 E ς 1 + C L ς 1 + A ς 2 C L ς 2 E ς 2 + K S B ς 2 + K D B ς 2 + Θ + ζ 1 ς 1 C L ς 1 + A ς 2 C L ς 2 + ζ 2 ς 2 ,
B v μ + ( d 1 ) ϑ = 0 0 B K I B K D 0 ς 1 ς 2 ζ 1 ζ 2 + ( d 1 ) ξ 1 ξ 2 0 0 B K I B K D 0 ς 1 ς 2 ζ 1 ζ 2 + ( d 1 ) ξ 1 ξ 2 0 0 B K I B K D 0 ς 1 ς 2 ζ 1 ζ 2 + ( d 1 ) ξ 1 ξ 2 = K I B ς 2 K D B ς 2 ζ 1 + ( d 1 ) ξ 1 ( d 1 ) ξ 2 ζ 2 K I B ς 2 K D B ς 2 ζ 1 + ( d 1 ) ξ 1 ( d 1 ) ξ 2 ζ 2 K I B ς 2 K D B ς 2 ζ 1 + ( d 1 ) ξ 1 ( d 1 ) ξ 2 ζ 2 ,
and
B 2 v ϑ = 0 0 0 0 0 0 B K I 0 0 0 0 0 0 0 0 0 0 0 0 0 B K I 0 0 0 0 0 0 0 0 0 0 0 0 0 B K I 0 ς 1 ς 2 ς 1 ς 2 ς 1 ς 2 ξ 1 ξ 2 ξ 1 ξ 2 ξ 1 ξ 2 = K I B ς 2 ξ 1 ξ 2 K I B ς 2 ξ 1 ξ 2 K I B ς 2 ξ 1 ξ 2 ,
where Ψ = A L C E + j N 1 a 1 j B K P + B K D , Θ = j N 1 a 1 j K P B ς 2 j N 1 a j 1 K P B ς 2 . Owing to the symmetry of undirected topological graph, it can be obtained that Θ = j N 1 a 1 j K P B ς 2 j N 1 a j 1 K P B ς 2 = 0 . By (14d)–(14g) and (15), it follows that
E ( ς 1 ς 2 ) = ı = 1 s 1 s ( ı ) δ e c ( ı ) 1 s ς 1 ( ς 1 ς 2 ) δ ̲ e c 1 s 1 s ς 1 ( ς 1 λ 2 ς 1 ) = ( 1 λ 2 ) δ ̲ e c , L ( ς 1 ς 2 ) = ı = 1 s 1 s ( ı ) δ l c ( ı ) 1 s ς 1 ( ς 1 ς 2 ) δ ̲ l c 1 s 1 s ς 1 ( ς 1 λ 2 ς 1 ) = ( 1 λ 2 ) δ ̲ l c , δ ̲ k d = δ ̲ k d 1 m 1 m B ς 2 B ς 2 K D B ς 2 = ( 𝒥 = 1 m 1 m ( 𝒥 ) δ k d ( 𝒥 ) ) 1 m B ς 2 B ς 2 δ ¯ k d 1 m 1 m B ς 2 B ς 2 = δ ¯ k d , K I B ς 2 = ( 𝒥 = 1 m 1 m ( 𝒥 ) δ k i ( 𝒥 ) ) 1 m B ς 2 B ς 2 δ k i , K S B ς 2 = ( 𝒥 = 1 m 1 m ( 𝒥 ) δ k s ( 𝒥 ) ) 1 m B ς 2 B ς 2 δ k s .
Together (14h) with (18), and (21), it can be derived that
E ς 1 + C L ς 1 + A ς 2 E ς 2 C L ς 2 + K S B ς 2 + K D B ς 2 + ζ 1 ς 1 = E ( ς 1 ς 2 ) + C L ( ς 1 ς 2 ) + A ς 2 + K S B ς 2 + K D B ς 2 + ζ 1 ς 1 A ς 2 + ( 1 λ 2 ) C δ ̲ l c + ( 1 λ 2 ) δ ̲ e c + δ ¯ k s + δ ¯ k d + ζ 1 ς 1 0 .
Combining (14i), (18), and (21), we have
C L ς 1 + A ς 2 C L ς 2 + ζ 2 ς 2 ( A I ) ς 2 + ( 1 λ 2 ) C δ ̲ l c + ζ 2 0 .
Using (14j), (14l), and(19)–(21), it gives that
K I B ς 2 K D B ς 2 ζ 1 + ( d 1 ) ξ 1 δ k i δ ̲ k d ζ 1 + ( d 1 ) ξ 1 0 ,
K I B ς 2 ξ 1 δ ¯ k i ξ 1 0 .
From (14k) and (22)–(25), it is easy to obtain that
A v + μ v 0 , B 1 v μ + ( d 1 ) ϑ 0 , B 2 v ϑ 0 .
which means that Δ V ( k ) < 0 . □
Remark 3.
In the literature [39,41,42,43,44,45], the Luenberger-type observer-based protocols were employed for MASs. The designed observer (3) in our work is different from existing observers. Two gain matrices E and L are introduced in this paper. A matrix decomposition approach is employed to design the two matrices. This new observer can handle the consensus protocol issues of PMASs and thus the problem addressed in [48] can be solved. Moreover, the introduction of two gain matrices increases the degree of freedom of the observer design.
Remark 4.
The consensus problem of PMASs has been investigated from different perspectives. Existing works on the consensus of PMASs were developed in the form of proportional controllers [43,44,45,51,52,53,54,55]. As is well known, PID control offers higher stability performance in comparison to the proportional control. Theorem 2 designs a PID control protocol for PMASs. It can be seen that the PID controller (9) is completely different from these forms in [43,44,45,51,52,53,54,55]. Four control gain matrices K S , K P , K I , K D need to be determined. The designed controller (9) takes four types of information: the estimated states of the agent itself, neighboring agents, time-delay information of the agent with length of d, and the differential information of the agent. It is clear that the existing protocol designs are special cases of (9) and the PID protocol in this paper has more degree of freedom in designing control gains.
Remark 5.
There is a significant difference between the designed observer-based PID control protocol of PMASs in this paper and the PID control protocol of general MASs in [56,57]. A quadratic approach is employed for general MASs while a linear approach is utilized for PMASs in this paper. Considering the positivity of PMASs, it is a natural choice to build a copositive Lyapunov–Krasovskii function and apply a linear computation method. Meanwhile, the designed Lyapunov–Krasovskii function has a simple form and linear programming is more effective in handling complex computations. It can be seen that all the conditions given in Theorem 2 are solvable in terms of linear programming. The conditions (14a)(14d) guarantee the positivity of the overall closed-loop system (11). The difference (17) of the Lyapunov–Krasovskii function (16) is kept negative under the conditions of (14e)(14l). Once the conditions in Theorem 2 have feasible solutions, the positivity and stability of the closed-loop system (11) can be guaranteed, which indicates that the consensus of system (2) is reached.
As mentioned in Remark 4, many existing protocol designs are special cases of (9) by using part of its components. It is similar to the hierarchical control designed in [52]. An observer-based hierarchical control protocol can be given as:
u i ( k ) = K S x ^ i ( k ) + K P j N i a i j ( x ^ i ( k ) x ^ j ( k ) ) ,
where K S x ^ i ( k ) and K P j N i a i j ( x ^ i ( k ) x ^ j ( k ) ) can be viewed as lower level and higher level contro protocol, respectively. K S and K P are the gain matrices need to determined. Similar to (11), the overall closed-loop system under the hierarchical protocol (26) is:
X ( k + 1 ) = A X ( k ) ,
where
A = I n E + L C L C A + B K S L C E A L C + L 0 0 B K P 0 .
Corollary 1.
If there exist constants λ 1 > 0 , λ 2 > 1 , R s vectors ς 1 0 , ς 2 0 , δ ̲ e c 0 , δ e c ( ı ) 0 , δ ¯ e c 0 , δ k s ( 𝒥 ) , δ k s , δ k p ( 𝒥 ) 0 , δ k p 0 , and R q vectors δ ̲ l c 0 , δ l c ( ı ) 0 , δ ¯ l c 0 such that
λ 1 1 m B ς 2 A ı = 1 s 1 s ( ı ) δ e c ( ı ) ı = 1 s 1 s ( ı ) δ l c ( ı ) C + λ 1 B 𝒥 = 1 m 1 m ( 𝒥 ) δ k s ( 𝒥 ) + λ 1 j N 1 a 1 j B 𝒥 = 1 m 1 m ( 𝒥 ) δ k p ( 𝒥 ) 0 ,
1 s ς 1 A ı = 1 s 1 s ( ı ) δ l c ( ı ) C 0 ,
λ 1 1 m B ς 2 1 s ς 1 ,
λ 2 ς 1 ς 2 ,
δ ̲ e c δ e c ( ı ) δ ¯ e c , δ ̲ l c δ l c ( ı ) δ ¯ l c , ı = 1 , 2 , , s ,
δ k s ( 𝒥 ) δ k s , δ k p ( 𝒥 ) δ k p , 𝒥 = 1 , 2 , , m ,
A ς 2 + ( 1 λ 2 ) C δ ̲ l c + ( 1 λ 2 ) δ ̲ e c + δ ¯ k s ς 1 0 ,
( A I ) ς 2 + ( 1 λ 2 ) C δ ̲ l c 0 ,
hold, then under the observer-based hierarchical control protocol (26) with
E = ı = 1 s 1 s ( ı ) δ e c ( ı ) 1 s ς 1 , L = ı = 1 s 1 s ( ı ) δ l c ( ı ) 1 s ς 1 , K S = 𝒥 = 1 m 1 m ( 𝒥 ) δ k s ( 𝒥 ) 1 m B ς 2 , K P = 𝒥 = 1 m 1 m ( 𝒥 ) δ k p ( 𝒥 ) 1 m B ς 2 ,
the closed-loop system (27) is positive and stable, which means that the observer (8) is positive and the consensus of system (2) is reached.
Proof of Corollary 1.
The proof of Corollary 1 is similar to Theorem 2 and thus omitted. □

3.3. Observer-Based PID Control for Heterogeneous PMASs

Theorems 1 and 2 assume that each agent is homogeneous, that is, each agent has the same system dynamics. However, in practice systems, each agent may have different system dynamics. This kind of PMASs can be described as follows:
x ι ( k + 1 ) = A ι x ι ( k ) + B ι u ι ( k ) , y ι ( k ) = C ι x ι ( k ) , ι V ,
where A ι R s × s , B ι R s × m , C ι R s × q are the system matrices of the ι th agent. Furthermore, the observer of ι th agent can be constructed as:
x ^ ι ( k + 1 ) = E ι x ^ ι ( k ) + L ι y ι ( k ) ,
where E ι R s × s and L ι R s × q are gain matrices to be determined. The estimate error is described as: e ˜ ι ( k ) = x ι ( k ) x ^ ι ( k ) . The corresponding observer-based PID control protocol for the ι th agent is given by:
u ι ( k ) = K S ι x ^ ι ( k ) + K P ι j N ι a ι j ( x ^ ι ( k ) x ^ j ( k ) ) + K I ι h = k d k 1 x ^ ι ( h ) + K D ι Δ x ^ ι ( k ) ,
where K S ι , K P ι , K I ι , and K D ι are control gain matrices to be determined.
Define x ˜ ι ( k + 1 ) = ( x ^ ι ( k + 1 ) , e ˜ ι ( k + 1 ) ) , the augmented system of the ι th agent can be described as:
x ˜ ι ( k + 1 ) = A ˜ ι x ˜ ι ( k ) + B ˜ ι u ι ( k ) , y ˜ ι ( k ) = C ˜ x ˜ ι ( k ) ,
where
A ˜ ι = E ι + L ι C ι L ι C ι A ι L ι C ι E ι A ι L ι C ι , B ˜ ι = 0 B ι , C ˜ = I 0 .
The overall closed-loop system under the controller (30) is expressed as:
X ( k + 1 ) = A X ( k ) + B 1 X ( k 1 ) + h = k d k 2 B 2 X ( h ) ,
where
A ι ι = E ι + L ι C ι L ι C ι A ι L ι C ι E ι + j N ι a ι j B ι K P ι + B ι K S ι + B ι K D ι A ι L ι C ι , A ı j = 0 0 a ı j B K P ι 0 , B 1 ι ι = 0 0 B ι K I ι B ι K D ι 0 , B 2 ι ι = 0 0 B ι K I ι 0 .
Theorem 3.
If there exist constants λ ι 1 > 0 , λ ι 2 > 1 , R s vectors ς ι 1 0 , ς ι 2 0 , ζ ι 1 0 , ζ ι 2 0 , ξ ι 1 0 , ξ ι 2 0 , δ ̲ e c ι 0 , δ e c ι ( ı ) 0 , δ ¯ e c ι 0 , δ k p ι ( 𝒥 ) 0 , δ k p ι 0 , δ k i ι ( 𝒥 ) 0 , δ k i ι 0 , δ ̲ k d ι , δ k s ι ( 𝒥 ) , δ ¯ k s ι , δ k d ι ( 𝒥 ) , δ ¯ k d ι , and R q vectors δ ̲ l c ι 0 , δ l c ι ( ı ) 0 , δ ¯ l c ι 0 such that
λ ι 1 1 m B ς ι 2 A ı = 1 s 1 s ( ı ) δ e c ι ( ı ) ı = 1 s 1 s ( ı ) δ l c ι ( ı ) C + λ ι 1 B 𝒥 = 1 m 1 m ( 𝒥 ) δ k s ι ( 𝒥 ) + λ ι 1 B 𝒥 = 1 m 1 m ( 𝒥 ) δ k d ι ( 𝒥 ) + λ ι 1 j N ι a ι j B 𝒥 = 1 m 1 m ( 𝒥 ) δ k p ι ( 𝒥 ) 0 ,
1 s ς ι 1 A ı = 1 s 1 s ( ı ) δ l c ι ( ı ) C 0 ,
𝒥 = 1 m 1 m ( 𝒥 ) δ k i ι ( 𝒥 ) 𝒥 = 1 m 1 m ( 𝒥 ) δ k d ι ( 𝒥 ) 0 ,
λ ι 1 1 m B ς ι 2 1 s ς ι 1 ,
λ ι 2 ς ι 1 ς ι 2 ,
δ ̲ e c ι δ e c ι ( ı ) δ ¯ e c ι , δ ̲ l c ι δ l c ι ( ı ) δ ¯ l c ι , ı = 1 , 2 , , s ,
δ k p ι ( 𝒥 ) δ k s ι , δ k p ι ( 𝒥 ) δ k p ι , δ k i ι ( 𝒥 ) δ k i ι , δ ̲ k d ι δ k d ι ( 𝒥 ) δ ¯ k d ι , 𝒥 = 1 , 2 , , m ,
A ς ι 2 + ( 1 λ ι 2 ) C δ ̲ l c ι + ( 1 λ ι 2 ) δ ̲ e c ι + δ ¯ k s ι + δ ¯ k d ι + ζ ι 1 ς ι 1 0 ,
( A I ) ς ι 2 + ( 1 λ ι 2 ) C δ ̲ l c ι + ζ ι 2 0 ,
δ k i ι δ ̲ k d ι ζ ι 1 + ( d 1 ) ξ ι 1 0 ,
( d 1 ) ξ ι 2 ζ ι 2 0 ,
δ ¯ k i ι ξ ι 1 0 .
hold, then under the observer-based PID control protocol (30) with the gain matrices given as
E = ı = 1 s 1 s ( ı ) δ e c ι ( ı ) 1 s ς ι 1 , L = ı = 1 n 1 s ( ı ) δ l c ι ( ı ) 1 s ς ι 1 , K S ι = 𝒥 = 1 m 1 m ( 𝒥 ) δ k s ι ( 𝒥 ) 1 m B ι ς ι 2 , K P ι = 𝒥 = 1 m 1 m ( 𝒥 ) δ k p ι ( 𝒥 ) 1 m B ι ς ι 2 , K I ι = 𝒥 = 1 m 1 m ( 𝒥 ) δ k i ι ( 𝒥 ) 1 m B ι ς ι 2 , K D ι = 𝒥 = 1 m 1 m ( 𝒥 ) δ k d ι ( 𝒥 ) 1 m B ι ς ι 2 .
the closed-loop system (32) is positive and stable, implies that the observer (29) is positive and the consensus of system (28) is reached.
Proof of Theorem 3.
First, we prove the positivity of the closed-loop system (32). By (34a), (34b), (34d) and (35), it gives that E ι + L ι C ι 0 , L ι C ι 0 , A ι L ι C ι E ι + j N 1 a ι j B ι K P ι + B ι K S ι + B ι K D ι 0 and A ι L ι C ι 0 , then we have A i i 0 . Notice the fact that a i j 0 and δ k p ι ( ı ) 0 , one has a ι j B K P 0 , which implies that A i j 0 . Therefore, A 0 . Using (34c) and (35) gives that B ι K I ι B ι K D ι 0 . Thus, B 1 0 . Since δ k i ι 0 , it can be derived that B 2 0 . Therefore, the positivity of the overall closed-loop system (32) can be guaranteed by Lemma 1.
Next, we consider the stability of the closed-loop system (32). Select the following copositive Lyapunov–Krasovskii function:
V ( k ) = X ( k ) v + X ( k 1 ) μ + l = 2 d h = k l k 2 X ( h ) ϑ ,
where v = ( ς 1 , ς 2 , , ς n ) , μ = ( ζ 1 , ζ 2 , , ζ n ) , ϑ = ( ξ 1 , ξ 2 , , ξ n ) with ς ι = ( ς ι 1 , ς ι 2 ) , ζ ι = ( ζ ι 1 , ζ ι 2 ) , ξ ι = ( ξ ι 1 , ξ ι 2 ) , ι = 1 , 2 , , n , respectively. Similar to (17), one can get the difference of (36) as:
Δ V ( k ) = V ( k + 1 ) V ( k ) = X ( k ) ( A v + μ v ) + X ( k 1 ) ( B 1 v μ + ( d 1 ) ϑ ) + h = k d k 2 X ( h ) ( B 2 v ϑ ) .
By (33), it can be obtained that
A v + μ v = E 1 + L 1 C 1 L 1 C 1 Ψ 1 A 1 L 1 C 1 + j N 1 0 0 a 1 j B 1 K P 1 ς 11 ς 12 + ζ 11 ζ 12 ς 11 ς 12 E 2 + L 2 C 2 L 2 C 2 Ψ 2 A 2 L 2 C 2 + j N 2 0 0 a 2 j B 2 K P 2 ς 21 ς 22 + ζ 21 ζ 22 ς 21 ς 22 E n + L n C n L n C n Ψ n A n L n C n + j N n 0 0 a n j B n K P n ς n 1 ς n 2 + ζ n 1 ζ n 2 ς n 1 ς n 2
= E 1 ς 11 + C 1 L 1 ς 11 + A 1 ς 12 C 1 L 2 ς 12 E 1 ς 12 + K S 1 B 1 ς 12 + K D 1 B 1 ς 12 + ζ 11 ς 11 + Φ 1 C 1 L 1 ς 11 + A 1 ς 12 C 1 L 1 ς 12 + ζ 12 ς 12 E 2 ς 21 + C 2 L 2 ς 21 + A 2 ς 22 C 2 L 2 ς 22 E 2 ς 22 + K S 2 B 2 ς 22 + K D 2 B 2 ς 22 + ζ 21 ς 21 + Φ 2 C 2 L 2 ς 21 + A 2 ς 22 C 2 L 2 ς 22 + ζ 22 ς 22 E n ς n 1 + C n L n ς n 1 + A n ς n 2 C n L n ς n 2 E n ς n 2 + K S n B n ς n 2 + K D n B n ς n 2 + ζ n 1 ς n 1 + Φ n C n L n ς n 1 + A n ς n 2 C n L n ς n 2 + ζ n 2 ς n 2 ,
B 1 v μ + ( d 1 ) ϑ = 0 0 B 1 K I 1 B 1 K D 1 0 ς 11 ς 12 ζ 11 ζ 12 + ( d 1 ) ξ 11 ξ 12 0 0 B 2 K I 2 B 2 K D 2 0 ς 21 ς 22 ζ 21 ζ 22 + ( d 1 ) ξ 21 ξ 22 0 0 B n K I n B n K D n 0 ς n 1 ς n 2 ζ n 1 ζ n 2 + ( d 1 ) ξ n 1 ξ n 2 = K I 1 B 1 ς 12 K D 1 B 1 ς 12 ζ 11 + ( d 1 ) ξ 11 ( d 1 ) ξ 12 ζ 12 K I 2 B 2 ς 22 K D 2 B 2 ς 22 ζ 21 + ( d 1 ) ξ 21 ( d 1 ) ξ 22 ζ 22 K I n B n ς n 2 K D n B n ς n 2 ζ n 1 + ( d 1 ) ξ n 1 ( d 1 ) ξ n 2 ζ n 2 ,
and
B 2 v ϑ = 0 0 0 0 0 0 B 1 K I 1 0 0 0 0 0 0 0 0 0 0 0 0 0 B 2 K I 2 0 0 0 0 0 0 0 0 0 0 0 0 0 B n K I n 0 ς 11 ς 12 ς 21 ς 22 ς n 1 ς n 2 ξ 11 ξ 12 ξ 21 ξ 22 ξ n 1 ξ n 2 = ξ 11 K I 1 B 1 ς 12 ξ 12 ξ 21 K I 2 B 2 ς 22 ξ 22 ξ n 1 K I n B n ς n 2 ξ n 2 .
where Ψ ι = A ι L ι C ι E ι + j N ι a ι j B ι K P ι + B ι K S ι + B ι K D ι , Φ ι = j N ι a ι j K P ι B ι ς ι 2 j N ι a j ι K P ι B ι ς ι 2 . Since the communication topological is undirected, i.e., a ι j = a j ι , it can be derived that Φ ι = j N ι a ι j K P ι B ι ς ι 2 j N ι a j ι K P ι B ι ς ι 2 = 0 . Then for ι V , from (34f), (34g), and (35), it can be obtained that
E ι ( ς ι 1 λ ι 2 ς ι 1 ) = ı = 1 s 1 s ( ı ) δ e c ι ( ı ) 1 s ς ι 1 ( ς ι 1 ς ι 2 ) δ e c 1 s 1 s ς ι 1 ( ς ι 1 λ ι 2 ς ι 1 ) = δ e c ι , L ι ( ς ι 1 λ ι 2 ς ι 1 ) = ı = 1 s 1 s ( ı ) δ l c ι ( ı ) 1 s ς ι 1 ( ς ι 1 ς ι 2 ) δ l c ι 1 s 1 s ς ι 1 ( ς ι 1 λ ι 2 ς ι 1 ) = δ l c ι , δ ̲ k d ι = ( δ ¯ k d ι 1 m ) 1 m B ς ι 2 B ι ς ι 2 K D ι B ι ς ι 2 = ( 𝒥 = 1 m 1 m ( 𝒥 ) δ k d ι ( 𝒥 ) ) 1 m B ι ς ι 2 B ι ς ι 2 ( δ ¯ k d ι 1 m ) 1 m B ι ς ι 2 B ι ς ι 2 = δ ¯ k d ι , K I ι B ι ς ι 2 = ( 𝒥 = 1 m 1 m ( 𝒥 ) δ k i ι ( 𝒥 ) ) 1 m B ι ς ι 2 B ι ς ι 2 δ k i ι , K S ι B ι ς ι 2 = ( 𝒥 = 1 m 1 m ( 𝒥 ) δ k s ι ( 𝒥 ) ) 1 m B ι ς ι 2 B ι ς ι 2 δ k s ι .
Together with (34h)–(34l) and (38)–(41), we have
E ι ς ι 1 + C ι L ι ς ι 1 + A ι ς ι 2 C ι L ι ς ι 2 E ι ς ι 2 + K S ι B ι ς ι 2 + K D ι B ι ς ι 2 + ζ ι 1 ς ι 1 A ι ς ι 2 + ( 1 λ ι 2 ) C ι δ ̲ l c ι + δ ̲ e c ι + δ ¯ k s ι + δ ¯ k d ι + ζ ι 1 0 .
C ι L ι ς ι 1 + A ι ς ι 2 C ι L ι ς ι 2 + ζ ι 2 ς ι 2 ( A ι I s ) ς ι 2 + ( 1 λ ι 2 ) C δ l c ι + ζ ι 2 0 .
K I ι B ι ς ι 2 K D ι B ι ς ι 2 ζ ι 1 + ( d 1 ) ξ ι 1 δ k i ι δ ̲ k d ι ζ ι 1 + ( d 1 ) ξ ι 1 0 .
K I ι B ι ς ι 2 ξ ι 1 δ k i ι ξ ι 1 0 .
By (34k) and (42)–(45), it is easy to obtain that
A v + μ v 0 , B v μ + ( d 1 ) ϑ 0 , B 2 v ϑ 0 ,
which implies that Δ V ( k ) < 0 . □
Remark 6.
Theorem 3 considers a more complicated heterogeneous PMASs, in which each agent has its own system dynamics. As mentioned in Remark 3, the proportional control protocol is the most widely used in existing works on heterogeneous MAS [58,59,60,61]. In this paper, a general PID framework is offered for heterogeneous PMASs by (30) based on the designed observer (29). The corresponding controllers and observers gain matrices (35) can be obtained by solving the linear programming conditions (34a)(34l). Additionally, the copositive Lyapunov–Krasovskii function is more efficient for dealing the consensus problem of heterogeneous PMASs. It is important to note that Theorem 3 is a straightforward extension of the Theorem 2.

4. Illustrative Examples

With the fast development of information technology, the traditional industries have evolved rapidly by combining with modern smart equipment. For example, the wireless sensor networks are widely used in precise agriculture. Smart greenhouse can provide adaptive environmental conditions for plants at different growth stages. For different plants or plants of different stages, the requirements for climate environments, fertilizer environments, and irrigation environments are distinctive. Therefore, the climate control, fertilization control, and irrigation control are vital for the growth of plants. To obtain suitable growth environments, an efficient control protocol is key to solve the control problems. Since the data about climate states, fertilization states, and irrigation states of greenhouse are always nonnegative, it is suitable to model the wireless sensor network as PMASs. A simple structure of the wireless sensor network for greenhouse is shown in Figure 2. System (2) with observer (8) can be employed to describe the comprehensive environments dynamic of a greenhouse, where x i ( k ) represents the real states of the greenhouse environments around of the ith sensors at time k, x ^ i ( k ) is the monitoring data of time k captured by the ith sensor unit, and u i ( k ) indicates the control input for the surrounding environments of ith node. The sensor units capture the microclimate states at time k to estimate the microclimate states of the whole greenhouse. Based on the estimated states, different kinds of control units execute corresponding operations. Under the designed observer-based PID protocol, the greenhouse environment states will converge to a preset value.
Example 1.
To estimate the microclimate states of a smart greenhouse, the wireless sensor network is modeled as PMASs. If the estimate errors converge to zero, then the designed observer gives effective estimates. Consider the modeled system described in the form of (2) with the system matrices:
A = 0.5182 0.1452 0.1034 0.2421 0.5878 0.1492 0.2145 0.2492 0.6888 , B = 0.04532 0.04213 0.03645 0.05127 0.02654 0.06313 , C = 0.067 0.076 0.077 0.046 0.064 0.095 .
Suppose there are three agents in the PMASs, and the initial states, initial upper state estimates, and initial lower state estimates of each agent are given as: x 1 ( 0 ) = ( 56.0 , 75.0 , 65.0 ) , x 2 ( 0 ) = ( 45.0 , 60.0 , 78.0 ) , x 3 ( 0 ) = ( 64.0 , 52.0 , 80.0 ) , x ^ ¯ 1 ( 0 ) = ( 75.0 , 83.0 , 70.0 ) , x ^ ¯ 2 ( 0 ) = ( 48.0 , 64.0 , 80.0 ) , x ^ ¯ 3 ( 0 ) = ( 66.0 , 58.0 , 81.0 ) , x ^ ̲ 1 ( 0 ) = ( 45.0 , 63.0 , 60.0 ) , x ^ ̲ 2 ( 0 ) = ( 38.0 , 54.0 , 70.0 ) , x ^ ̲ 3 ( 0 ) = ( 56.0 , 48.0 , 71.0 ) , respectively. The estimate errors with regard to the lower and upper initial estimates are denoted by e ̲ i ( k ) and e ¯ i ( k ) , respectively. Based the feasible solutions of the conditions in Theorem 1, the gain matrix of the positive state observer can be obtained as L = 0.19022 0.17811 0.20732 0.19628 0.21367 0.20755 .
Figure 3, Figure 4 and Figure 5 show the simulations and state estimations of three agents, respectively. It can be seen that the designed observer (3) provides precise estimations of the states of system (2). On the other hand, all the evolution of the real states are kept nonnegative and always between the estimated states x ̲ i ( k ) and x ¯ i ( k ) . The simulation results of the estimate errors e ̲ i ( k ) and e ¯ i ( k ) of the ith agent are shown in Figure 6, Figure 7 and Figure 8, respectively. It is obvious that all the estimate errors converge asymptotically to zero, which means that the observer (3) gives effective estimates.
Example 2.
Consider a smart greenhouse wireless sensor network with six agents and the communication typology between them is undirected. It is shown in Figure 9. The adjacency matrix and the corresponding Laplacian matrix are described as:
A = 0 1 1 1 0 0 1 0 0 1 1 0 1 0 0 0 0 1 1 1 0 0 0 1 0 1 0 0 0 1 0 0 1 1 1 0 , L = 3 1 1 1 0 0 1 3 0 1 1 0 1 0 2 0 0 1 1 1 0 3 0 1 0 1 0 0 2 1 0 0 1 1 1 3 .
The systems matrices of the PMASs are given as:
A = 0.47 0.24 0.15 0.34 0.52 0.21 0.21 0.3 0.57 , B = 0.01 0.02 0.02 0.04 0.02 0.01 , C = 0.47 0.9 0.66 0.81 0.57 0.95 .
The eigenvalues of matrix A are 1.0002, 0.20459, 0.35524, which means that matrix A is not Schur, i.e., the consensus of the PMASs (2) cannot be reached without a suitable control protocol. Then the essential objective to be achieved is that the consensus of the PMASs can be reached under the constructed PID protocol (9) with the designed observer (8).
Give the initial states and initial estimated states of all the agents as: x 1 ( 0 ) = ( 45.0 , 70.0 , 60.0 ) , x 2 ( 0 ) = ( 50.0 , 75.0 , 63.0 ) , x 3 ( 0 ) = ( 54.0 , 80.0 , 70.0 ) , x 4 ( 0 ) = ( 50.0 , 48.0 , 57.0 ) , x 5 ( 0 ) = ( 55.0 , 59.0 , 60.0 ) , x 6 ( 0 ) = ( 62.0 , 67.0 , 68.0 ) , x ^ 1 ( 0 ) = ( 42.0 , 68.0 , 57.0 ) , x ^ 2 ( 0 ) = ( 46.0 , 65.5 , 61.5 ) , x ^ 3 ( 0 ) = ( 52.0 , 78.5 , 67.0 ) , x ^ 4 ( 0 ) = ( 46.5 , 47.0 , 55.5 ) , x ^ 5 ( 0 ) = ( 54.5 , 53.0 , 52.5 ) , x ^ 6 ( 0 ) = ( 61.0 , 62.5 , 62.0 ) . Choose λ 1 = 20 , λ 2 = 1.1 , d = 3 . By solving the conditions presented in Theorem 2, the gain matrices E and L of observer (8) are
E = 0.082367 0.022521 0.017457 0.041526 0.077002 0.019743 0.024487 0.056101 0.083519 , L = 0.024837 0.021941 0.039995 0.027281 0.049581 0.038219 .
Similarly, the gain matrices K S , K P , K I , and K D of the designed PID protocol (9) can be calculated as:
K S = 3.0821 3.3926 1.871 3.094 3.4333 1.7997 , K P = 0.26226 0.29183 0.1506 0.26728 0.33059 0.06566 , K I = 0.17265 0.18773 0.10017 0.17224 0.18687 0.10153 , K D = 0.18887 0.20327 0.062235 0.19402 0.21623 0.041476 .
The simulation results of the PMASs (2) under the observer-based PID control mechanism (9) and the observer-based hierarchical protocol (26) are depicted in Figure 10. The solid line represents the simulations of the state trajectory under the observer-based PID protocol, and the dotted line represents the hierarchical protocol. It can be seen from Figure 10 that all the states converge to zero under both protocols. Consequently, it is not hard to get that the consensus of PMASs (2) can be reached. However, it is easy to see that the state trajectory under the PID protocol converges faster than under the hierarchical protocol, which proves the superiority of the designed observer-based PID protocol. The estimate errors of all agents are shown in Figure 11, Figure 12 and Figure 13. We can see that all the estimate errors keep nonnegative and converge to zero, which implies that the designed observer (3) performs an accurate observation.
It is well known that the potential noise may be amplified by the derivative component on PID controllers. To survey the sensibility of the designed PID protocol on the derivative component, a gain disturbance has been added, which is denoted by Δ K D . Thus, the gain matrix of the derivative component can be given as K D + Δ K D . For clarity, we define that all entries of Δ K D are ϖ. Figure 14 illustrates the state trajectory of all the agents with different disturbances of component D. It can be seen that after the disturbance is added, the system fluctuates and takes more time to reach an agreement. Figure 15 shows the simulation of the estimation error of the second component of each agent state. It reveals that when the disturbance exceeds a certain bound, negative estimation error occurs. It means that the positivity of the closed-loop system (11) cannot be guaranteed.

5. Conclusions

In this paper, the observer-based PID control protocol for the consensus problem of PMASs is investigated. First, a kind of observer is developed by extending the observer of general positive systems into the PMASs. The introduced observer can be used to design the lower and upper state boundaries of the PMASs. Second, an improved observer with less conservatism is constructed and then the observer-based PID control protocol is proposed. The consensus issue of PMASs has been resolved under the designed PID protocol. Third, the proposed observer-based PID control protocol is expanded to deal with the consensus of heterogeneous PMASs. Moreover, all the conditions presented in this paper can be solved in terms of linear programming. Finally, the simulation results have validated the correctness of proposed design.
The future research will mainly be carried out from the following aspects. First, some performances on the observer-based PID protocols will be considered, such as robustness, stabilization time, stabilization region, etc. Second, more advanced controllers should be taken into consideration for PMASs. Third, the observer design may be improved to guarantee the separate design principle of the observer and controller gain matrices.

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. and Y.W.; visualization, X.Y. and M.H.; supervision, M.H., Y.W. and S.F.; project administration, M.H., Y.W. and S.F.; funding acquisition, M.H. and S.F. All authors have read and agreed to the published version of the manuscript.

Funding

This work has been founded by Scientific and Technological Innovation 2030-“New Generation Artificial Intelligence” Major Project Subject (2021ZD0111000), Hainan Province Major Science and Technology Special Project (ZDKJ202010), Natural Science Foundation of Hainan Province, China (622RC618), and Science Research Funding of Hainan University (KYQD(ZR)22180).

Data Availability Statement

Not applicable.

Conflicts of Interest

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

Abbreviations

The following abbreviations are used in this manuscript:
PMASsPositive Multi-Agent Systems
MASsMulti-Agent Systems
PIDProportional-Integral-Derivative

References

  1. McArthur, S.D.; Davidson, E.M.; Catterson, V.M.; Dimeas, A.L.; Hatziargyriou, N.D.; Ponci, F.; Funabashi, T. Multi-Agent Systems for Power Engineering Applications—Part II: Technologies, Standards, and Tools for Building Multi-Agent Systems. IEEE Trans. Power Syst. 2007, 22, 1753–1759. [Google Scholar] [CrossRef] [Green Version]
  2. Sujil, A.; Verma, J.; Kumar, R. Multi Agent System: Concepts, Platforms and Applications in Power Systems. Artif. Intell. Rev. 2018, 49, 153–182. [Google Scholar] [CrossRef]
  3. 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]
  4. Dudek, G.; Jenkin, M.R.; Milios, E.; Wilkes, D. A Taxonomy for Multi-Agent Robotics. Auton. Robots 1996, 3, 375–397. [Google Scholar] [CrossRef]
  5. Ota, J. Multi-Agent Robot Systems as Distributed Autonomous Systems. Adv. Eng. Inform. 2006, 20, 59–70. [Google Scholar] [CrossRef]
  6. 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]
  7. 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] [Green Version]
  8. González-Briones, A.; De La Prieta, F.; Mohamad, M.S.; Omatu, S.; Corchado, J.M. Multi-Agent Systems Applications in Energy Optimization Problems: A State-of-the-Art Review. Energies 2018, 11, 1928. [Google Scholar] [CrossRef] [Green Version]
  9. 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]
  10. Li, X.M.; Zhou, Q.; Li, P.; Li, H.; Lu, R. Event-Triggered Consensus Control for Multi-Agent Systems against False Data-Injection Attacks. IEEE Trans. Cybern. 2019, 50, 1856–1866. [Google Scholar] [CrossRef]
  11. 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]
  12. Valcher, M.E.; Misra, P. On the Stabilizability and Consensus of Positive Homogeneous Multi-Agent Dynamical Systems. IEEE Trans. Autom. Control 2014, 59, 1936–1941. [Google Scholar] [CrossRef]
  13. Su, H.; Wu, H.; Chen, X.; Chen, M.Z.Q. Positive Edge Consensus of Complex Networks. IEEE Trans. Syst. Man Cybern. Syst. 2018, 48, 2242–2250. [Google Scholar] [CrossRef]
  14. Ren, W.; Atkins, E. Distributed Multi-Vehicle Coordinated Controlvia Local Information Exchange. Int. J. Robust Nonlinear Control 2007, 17, 1002–1033. [Google Scholar] [CrossRef] [Green Version]
  15. Pahuja, R.; Verma, H.; Uddin, M. A Wireless Sensor Network for Greenhouse Climate Control. IEEE Pervasive Comput. 2013, 12, 49–58. [Google Scholar] [CrossRef]
  16. Silva, P.C.; Batista, P.V.; Lima, H.S.; Alves, M.A.; Guimarães, F.G.; Silva, R.C. COVID-ABS: An Agent-Based Model of COVID-19 Epidemic to Simulate Health and Economic Effects of Social Distancing Interventions. Chaos Solitons Fractals 2020, 139, 110088. [Google Scholar] [CrossRef]
  17. Rami, M.A.; Tadeo, F. Controller Synthesis for Positive Linear Systems With Bounded Controls. IEEE Trans. Circuits Syst. II Express Briefs 2007, 54, 151–155. [Google Scholar] [CrossRef]
  18. Xiang, M.; Xiang, Z. Stability, L1-gain and Control Synthesis for Positive Switched Systems with Time-Varying Delay. Nonlinear Anal. Hybrid Syst. 2013, 9, 9–17. [Google Scholar] [CrossRef]
  19. Shen, J.; Lam, J. L -Gain Analysis for Positive Systems with Distributed Delays. Automatica 2014, 50, 175–179. [Google Scholar] [CrossRef]
  20. 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. [Google Scholar] [CrossRef]
  21. Zhang, J.; Zhang, S.; Deng, X.; Huang, Z. Adaptive Event-Triggered Dynamic Distributed Control of Switched Positive Systems with Switching Faults. Nonlinear Anal. Hybrid Syst. 2023, 48, 101328. [Google Scholar] [CrossRef]
  22. Nguyen, A.T.; Taniguchi, T.; Eciolaza, L.; Campos, V.; Palhares, R.; Sugeno, M. Fuzzy Control Systems: Past, Present and Future. IEEE Comput. Intell. Mag. 2019, 14, 56–68. [Google Scholar] [CrossRef]
  23. Liu, L.; Liu, Y.J.; Chen, A.; Tong, S.; Chen, C.L.P. Integral Barrier Lyapunov Function-Based Adaptive Control for Switched Nonlinear Systems. Sci. China Inf. Sci. 2020, 63, 132203. [Google Scholar] [CrossRef] [Green Version]
  24. Zhang, M.; Shi, P.; Shen, C.; Wu, Z.G. Static Output Feedback Control of Switched Nonlinear Systems With Actuator Faults. IEEE Trans. Fuzzy Syst. 2020, 28, 1600–1609. [Google Scholar] [CrossRef]
  25. Zhang, D.; Han, Q.L.; Zhang, X.M. Network-Based Modeling and Proportional–Integral Control for Direct-Drive-Wheel Systems in Wireless Network Environments. IEEE Trans. Cybern. 2020, 50, 2462–2474. [Google Scholar] [CrossRef]
  26. Humaidi, A.J.; Abdulkareem, A.I. Design of Augmented Nonlinear PD Controller of Delta/Par4-Like Robot. J. Control Sci. Eng. 2019, 2019, 1–11. [Google Scholar] [CrossRef]
  27. Zhao, C.; Guo, L. PID Controller Design for Second Order Nonlinear Uncertain Systems. Sci. China Inf. Sci. 2017, 60, 022201. [Google Scholar] [CrossRef] [Green Version]
  28. Ang, K.H.; Chong, G.; Li, Y. PID Control System Analysis, Design, and Technology. IEEE Trans. Control Syst. Technol. 2005, 13, 559–576. [Google Scholar] [CrossRef] [Green Version]
  29. Zhao, C.; Guo, L. Control of Nonlinear Uncertain Systems by Extended PID. IEEE Trans. Autom. Control 2021, 66, 3840–3847. [Google Scholar] [CrossRef]
  30. Li, X.G.; Niculescu, S.I.; Chen, J.X.; Chai, T. Characterizing PID Controllers for Linear Time-Delay Systems: A Parameter-Space Approach. IEEE Trans. Autom. Control 2021, 66, 4499–4513. [Google Scholar] [CrossRef]
  31. Yu, H.; Guan, Z.; Chen, T.; Yamamoto, T. Design of Data-Driven PID Controllers with Adaptive Updating Rules. Automatica 2020, 121, 109185. [Google Scholar] [CrossRef]
  32. Lui, D.G.; Petrillo, A.; Santini, S. An Optimal Distributed PID-like Control for the Output Containment and Leader-Following of Heterogeneous High-Order Multi-Agent Systems. Inf. Sci. 2020, 541, 166–184. [Google Scholar] [CrossRef]
  33. De Tommasi, G.; Lui, D.G.; Petrillo, A.; Santini, S. A L2-gain Robust PID-like Protocol for Time-varying Output Formation-containment of Multi-agent Systems with External Disturbance and Communication Delays. IET Control Theory Appl. 2021, 15, 1169–1184. [Google Scholar] [CrossRef]
  34. Yu, X.; Yang, F.; Zou, C.; Ou, L. Stabilization Parametric Region of Distributed PID Controllers for General First-Order Multi-Agent Systems With Time Delay. IEEE-CAA J. Autom. Sin. 2020, 7, 1555–1564. [Google Scholar] [CrossRef]
  35. Li, Z.; Ren, W.; Liu, X.; Fu, M. Consensus of Multi-Agent Systems with General Linear and Lipschitz Nonlinear Dynamics Using Distributed Adaptive Protocols. IEEE Trans. Autom. Control 2013, 58, 1786–1791. [Google Scholar] [CrossRef] [Green Version]
  36. Valcher, M.E.; Zorzan, I. On the Consensus of Homogeneous Multiagent Systems With Positivity Constraints. IEEE Trans. Autom. Control 2017, 62, 5096–5110. [Google Scholar] [CrossRef]
  37. Liu, J.J.R.; Lam, J.; Kwok, K.W. Positive Consensus of Fractional-Order Multiagent Systems Over Directed Graphs. IEEE Trans. Neural Netw. Learn. Syst. 2022, 1–7. [Google Scholar] [CrossRef]
  38. Samad, T. A Survey on Industry Impact and Challenges Thereof. IEEE Control Syst. Mag. 2017, 37, 17–18. [Google Scholar] [CrossRef]
  39. Li, Z.; Duan, Z.; Chen, G. Consensus of Discrete-Time Linear Multi-Agent Systems with Observer-Type Protocols. Discrete Contin. Dyn. Syst. 2011, 16, 489–505. [Google Scholar] [CrossRef] [Green Version]
  40. Cai, H.; Lewis, F.L.; Hu, G.; Huang, J. The Adaptive Distributed Observer Approach to the Cooperative Output Regulation of Linear Multi-Agent Systems. Automatica 2017, 75, 299–305. [Google Scholar] [CrossRef]
  41. You, R.; Tang, M.; Guo, S.; Cui, G. Proportional Integral Observer-based Consensus Control of Discrete-time Multi-agent Systems. Int. J. Control Autom. Syst. 2022, 20, 1461–1472. [Google Scholar] [CrossRef]
  42. Gong, X.; Liu, J.; Wang, Y.; Lam, J. Consensus of Discrete-time Positive Multi-agent Systems with Observer-type Protocols. In Proceedings of the 2019 IEEE 15th International Conference on Control and Automation (ICCA), Edinburgh, UK, 16–19 July 2019; IEEE: Edinburgh, UK, 2019; pp. 846–850. [Google Scholar] [CrossRef]
  43. Wu, H.; Su, H. Observer-Based Consensus for Positive Multiagent Systems With Directed Topology and Nonlinear Control Input. IEEE Trans. Syst. Man Cybern. Syst. 2019, 49, 1459–1469. [Google Scholar] [CrossRef]
  44. Liu, J.J.R.; Lam, J.; Wang, Y.; Cui, Y.; Shu, Z. Robust and Nonfragile Consensus of Positive Multiagent Systems via Observer-based Output-feedback Protocols. Int. J. Robust Nonlinear Control 2020, 30, 5386–5403. [Google Scholar] [CrossRef]
  45. Chen, S.; An, Q.; Zhou, H.; Su, H. Observer-Based Consensus for Fractional-Order Multi-Agent Systems with Positive Constraint. Neurocomputing 2022, 501, 489–498. [Google Scholar] [CrossRef]
  46. Farina, L.; Rinaldi, S. Positive Linear Systems: Theory and Applications; John Wiley & Sons: Hoboken, NJ, USA, 2000; Volume 50. [Google Scholar]
  47. Kaczorek, T. Positive 1D and 2D Systems; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2002. [Google Scholar]
  48. Rami, M.A.; Tadeo, F. Positive Observation Problem for Linear Discrete Positive Systems. In Proceedings of the 45th IEEE Conference on Decision and Control, San Diego, CA, USA, 13–15 December 2006; pp. 4729–4733. [Google Scholar] [CrossRef]
  49. Zhang, J.; Zhang, R.; Chen, Y.; Fu, S. Linear Programming Based Dynamic Output-Feedback Controller for Positive Systems. In Proceedings of the 2017 American Control Conference (ACC), Seattle, WA, USA, 24–26 May 2017; pp. 1709–1714. [Google Scholar] [CrossRef]
  50. Luenberger, D. An Introduction to Observers. IEEE Trans. Autom. Control 1971, 16, 596–602. [Google Scholar] [CrossRef]
  51. Liu, J.J.R.; Yang, N.; Kwok, K.W.; Lam, J. Positive Consensus of Directed Multiagent Systems. IEEE Trans. Autom. Control 2022, 67, 3641–3646. [Google Scholar] [CrossRef]
  52. Bhattacharyya, S.; Patra, S. Positive Consensus of Multi-Agent Systems with Hierarchical Control Protocol. Automatica 2022, 139, 110191. [Google Scholar] [CrossRef]
  53. Cao, X.; Li, Y. Positive Consensus for Multi-Agent Systems with Average Dwell Time Switching. J. Frankl. Inst. 2021, 358, 8308–8329. [Google Scholar] [CrossRef]
  54. Yang, N.; Yin, Y.; Liu, J. Positive Consensus of Directed Multi-agent Systems Using Dynamic Output-feedback Control. In Proceedings of the 2019 IEEE 58th Conference on Decision and Control (CDC), Nice, France, 11–13 December 2019; pp. 897–902. [Google Scholar] [CrossRef]
  55. Sun, Y.; Su, H.; Wang, X.; Chen, S. Semi-global Edge-consensus of Linear Discrete-time Multi-agent Systems with Positive Constraint and Input Saturation. IET Control Theory Appl. 2019, 13, 979–987. [Google Scholar] [CrossRef]
  56. Gionfra, N.; Sandou, G.; Siguerdidjane, H.; Faille, D. A Distributed PID-like Consensus Control for Discrete-time Multi-agent Systems. In Proceedings of the 14th International Conference on Informatics in Control, Automation and Robotics, Madrid, Spain, 26–28 July 2017; pp. 72–81. [Google Scholar] [CrossRef]
  57. Li, J.; Wang, J. Reinforcement Learning Based Proportional–Integral–Derivative Controllers Design for Consensus of Multi-Agent Systems. ISA Trans. 2022, in press. [Google Scholar] [CrossRef]
  58. Zheng, Y.; Wang, L.; Zhu, Y. Consensus of Heterogeneous Multi-Agent Systems. IET Control Theory Appl. 2011, 5, 1881–1888. [Google Scholar] [CrossRef]
  59. Zheng, Y.; Wang, L. Containment Control of Heterogeneous Multi-Agent Systems. Int. J. Control 2014, 87, 1–8. [Google Scholar] [CrossRef]
  60. Ma, Q.; Miao, G. Output Consensus for Heterogeneous Multi-Agent Systems with Linear Dynamics. Appl. Math. Comput. 2015, 271, 548–555. [Google Scholar] [CrossRef]
  61. Zuo, S.; Song, Y.; Lewis, F.L.; Davoudi, A. Output Containment Control of Linear Heterogeneous Multi-Agent Systems Using Internal Model Principle. IEEE Trans. Cybern. 2017, 47, 2099–2109. [Google Scholar] [CrossRef]
Figure 1. Block diagram of agent i with observer-based control.
Figure 1. Block diagram of agent i with observer-based control.
Mathematics 11 00419 g001
Figure 2. The structure of smart greenhouse.
Figure 2. The structure of smart greenhouse.
Mathematics 11 00419 g002
Figure 3. The simulations of all states and their estimations of the first agent.
Figure 3. The simulations of all states and their estimations of the first agent.
Mathematics 11 00419 g003
Figure 4. The simulations of all states and their estimations of the 2nd agent.
Figure 4. The simulations of all states and their estimations of the 2nd agent.
Mathematics 11 00419 g004
Figure 5. The simulations of all states and their estimations of the 3rd agent.
Figure 5. The simulations of all states and their estimations of the 3rd agent.
Mathematics 11 00419 g005
Figure 6. The simulations of state estimate errors e 1 ( k ) of the 1st agent.
Figure 6. The simulations of state estimate errors e 1 ( k ) of the 1st agent.
Mathematics 11 00419 g006
Figure 7. The simulations of state estimate errors e 2 ( k ) of the 2nd agent.
Figure 7. The simulations of state estimate errors e 2 ( k ) of the 2nd agent.
Mathematics 11 00419 g007
Figure 8. The simulations of state estimate errors e 3 ( k ) of the 3th agent.
Figure 8. The simulations of state estimate errors e 3 ( k ) of the 3th agent.
Mathematics 11 00419 g008
Figure 9. Communication typology.
Figure 9. Communication typology.
Mathematics 11 00419 g009
Figure 10. The simulations of states of all the agents.
Figure 10. The simulations of states of all the agents.
Mathematics 11 00419 g010
Figure 11. The simulations of e ˜ i 1 ( k ) of all the agents.
Figure 11. The simulations of e ˜ i 1 ( k ) of all the agents.
Mathematics 11 00419 g011
Figure 12. The simulation of e ˜ i 2 ( k ) of all the agents.
Figure 12. The simulation of e ˜ i 2 ( k ) of all the agents.
Mathematics 11 00419 g012
Figure 13. The simulations of e ˜ i 3 ( k ) of all the agents.
Figure 13. The simulations of e ˜ i 3 ( k ) of all the agents.
Mathematics 11 00419 g013
Figure 14. The state trajectory of all the agents with different disturbances of component D.
Figure 14. The state trajectory of all the agents with different disturbances of component D.
Mathematics 11 00419 g014
Figure 15. The simulation of e ˜ i 2 ( k ) with different disturbances of component D.
Figure 15. The simulation of e ˜ i 2 ( k ) with different disturbances of component D.
Mathematics 11 00419 g015
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.; Feng, S. Observer-Based PID Control Protocol of Positive Multi-Agent Systems. Mathematics 2023, 11, 419. https://doi.org/10.3390/math11020419

AMA Style

Yang X, Huang M, Wu Y, Feng S. Observer-Based PID Control Protocol of Positive Multi-Agent Systems. Mathematics. 2023; 11(2):419. https://doi.org/10.3390/math11020419

Chicago/Turabian Style

Yang, Xiaogang, Mengxing Huang, Yuanyuan Wu, and Siling Feng. 2023. "Observer-Based PID Control Protocol of Positive Multi-Agent Systems" Mathematics 11, no. 2: 419. https://doi.org/10.3390/math11020419

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