Next Article in Journal
Effect of Solidification on Microstructure and Properties of FeCoNi(AlSi)0.2 High-Entropy Alloy Under Strong Static Magnetic Field
Previous Article in Journal
Polynomial-Time Algorithm for Learning Optimal BFS-Consistent Dynamic Bayesian Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Admissible Consensus for Descriptor Multi-Agent Systems with Exogenous Disturbances

College of Science, Harbin Engineering University, Harbin 150001, China
*
Author to whom correspondence should be addressed.
Entropy 2018, 20(4), 276; https://doi.org/10.3390/e20040276
Submission received: 23 March 2018 / Revised: 10 April 2018 / Accepted: 10 April 2018 / Published: 12 April 2018
(This article belongs to the Section Complexity)

Abstract

:
In this paper, we study the admissible consensus for descriptor multi-agent systems (MASs) with exogenous disturbances that are generated by some linear systems. The topology among agents is represented by a directed graph. For solving the admissible consensus problem, the exogenous disturbance observer and distributed control protocol are proposed. With the help of the graph theory and the generalized Riccati equation, some conditions for admissible consensus of descriptor MASs with exogenous disturbances are obtained. Finally, we provide a numerical simulation to effectively illustrate the results we have reached before.

1. Introduction

The descriptor multi-agent systems (MASs) is a combination of the descriptor system and the MASs. The descriptor system was first mentioned in [1], and is also referred to as generalized system, singular system, or implicit system. Since its introduction, it has been widely used [2,3]. For MASs, its definition is given in [4], and its application has also become more and more widespread in real life [5], industry [6] and technology [7,8] with the rapid development of science and technology. Moreover, the three-link manipulators has been taken as an example of the descriptor MASs in [9].
As is well known, the consensus problem is one of the hot topics of coordinated control theory [10,11,12,13,14]. The main task of the consensus problem is to design distributed protocol according to the information obtained from neighbors, so that the states of a group of agents can reach an agreement. Until now, there exist many studies of the consensus problem of MASs. For example, the first-order system consensus problem [15,16], second-order system consensus problem [17], general system consensus problem [18,19,20]. For instance, in [16], the average consensus problem was explored for the first order multi-agent systems with uncertain topologies as well as multiple time-varying delays; in [18], the consensus problem was addressed for general linear multi-agent systems with a time-invariant communication topology. In addition, the admissible consensus problem of the descriptor MASs was further studied in [21]. The conditions of consensus-ability with respect to a set of admissible consensus protocols were investigated in [9]. It is worth mentioning that the observer-based design approach of [19] that can solve the consensus problem of general system was generalized to resolve the admissible consensus problem in [22]. In [23], a distributed observer is used to solve the admissible consensus problem of descriptor MAS, and a new framework is proposed.
However, in the real life, the exogenous disturbances exist and cannot be neglected, for example, the wind, and the electromagnetic interference. Therefore, in this paper, we study the admissible consensus problem of the descriptor MASs with exogenous disturbances. Many researchers have studied the consensus problem of MASs with exogenous disturbance [24,25,26,27,28,29]. For example, in [28], group consensus problems of first order dynamic agents in the presence of random noises and communication delays were investigated, while L 1 group consensus problem of discrete-time multi-agent systems with external stochastic inputs was studied in [29]. In addition, [30] also studied the consensus problem of linear MASs with exogenous disturbances generated from heterogeneous exosystems. However, there is little research on the admissible consensus problem for descriptor MASs with exogenous disturbances. For example, [31] only studied cooperative output regulation of singular heterogeneous MASs. This situation also appears in other literature, and there are few relevant results on this issue. Therefore, in this paper, we further study the admissible consensus problem of descriptor MASs with exogenous disturbances. The main contributions of this paper are (1) Consider a descriptor MASs with exogenous disturbances, the consensus problem of general linear system is extended to the descriptor MASs; (2) The disturbance observer for descriptor MASs is designed by state feedback; (3) The disturbance observer is used for disturbance attenuation.
The rest of the paper is organized as follows: In Section 2, we introduce some basic concepts and related theorems to describe descriptor MASs. Then, the formulation of the considered problem is introduced. In Section 3, the disturbance observer is proposed, the corresponding distributed control protocol is designed and sufficient conditions that ensure the states of a group of agents can reach an agreement are obtained. Section 4 gives a numerical example. Finally, conclusions are given in Section 5.

2. Preliminaries and Problem Formulation

2.1. Preliminaries

In this subsection, some notations and preliminaries involved in this paper are introduced. I n denotes the n × n identity matrix. For a matrix A (or a vector x), A T (or x T ) represents the transpose of A (or x). Let σ ( A ) be the set of all eigenvalues of the square matrix A, and let σ ( E , A ) be { λ | λ C , det ( λ E - A ) = 0 } . C - represents the open left-half complex plane. Let ⊗ denotes the Kronecker product of matrix A R m × n and B R p × q , which is defined as
A B = a 11 B a 1 n B a m 1 B a m n B
and satisfies the following properties
( A B ) ( C D ) = ( A C ) ( B D )
A B + A C = A ( B + C )
In this paper, the information interaction topology is modeled by a weighted digraph G = { V , ε , A } , where V = { v 1 , v 2 , , v n } is the set of vertices, ε V × V is the set of edges, A = [ a i j ] R n × n is a weighted adjacency matrix. An edge of G that is from node v i to node v j is denoted by ( v i , v j ) , which represents node v j can get information from node v i , but not necessarily vice versa. The set of neighbors of node v i is N i = { v j | ( v j , v i ) ε } . a i j denotes the weight of the edge ( v j , v i ) and a i i = 0 , a i j > 0 ( v j , v i ) ε . The degree matrix D = d i a g { d 1 , , d n } R n × n of digraph G is a diagonal matrix with d i = j = 1 n a i j . Then, the Laplacian matrix of G is defined as L = D - A , which has at least one zero eigenvalue with 1 = [ 1 , 1 , , 1 ] T as its corresponding right eigenvector. In addition, L has exactly one zero eigenvalue if and only if the directed graph G contains a directed spanning tree.
Definition 1.
[21] Let E, A R n × n . (i) The pair ( E , A ) is said to be regular if d e t ( s E - A ) is not identically zero for some s C ; (ii) The pair ( E , A ) is said to be impulse free if ( E , A ) is regular and d e g ( d e t ( s E - A ) ) = r a n k E for s C ; (iii) The pair ( E , A ) is said to be stable if σ ( E , A ) C - ; (iv) The pair ( E , A ) is said to be admissible if ( E , A ) is impulse free and stable.
Definition 2. 
( E , A , B ) is stable, if there is a matrix K that satisfies σ ( E , A + B K ) C - .
Definition 3. 
( E , A , C ) is detectable, if there is a matrix L that satisfies σ ( E , A + L C ) C - .

2.2. Problem Formulation

In this subsection, we will establish the model of the descriptor MASs with exogenous disturbances and propose the corresponding consensus problem for this system. In addition, the corresponding model of the exogenous disturbances system is also given.
Consider a descriptor MASs composing of n identical agents. The dynamic of agent i is modeled by the following descriptor linear system
E x ˙ i ( t ) = A x i ( t ) + B ( u i ( t ) + ω i ( t ) ) , y i ( t ) = C x i ( t ) + D ω i ( t ) , i = 1 , 2 , , n ,
where x i ( t ) R m is the state variable, y i ( t ) R q is the measured output, u i ( t ) R p is the control input, ω i ( t ) R p is exogenous disturbance. E, A, B, C, D are real constant matrices with appropriate dimensions, and r a n k E = r < m .
Since E is a singular matrix, the initial state cannot be arbitrarily chosen, which needs to satisfy some algebraic conditions.
The descriptor MASs (1) is said to achieve consensus, if the states of all agents satisfy
lim t ( x j - x i ) = 0 , i , j = 1 , 2 , , n ,
for any initial states x i ( 0 ) , i = 0 , 1 , , n .
If the closed-loop system is admissible and achieves consensus, we say the protocol u i ( i = 1 , 2 , , n ) can solve the admissible consensus problem.
In this paper, we suppose that the disturbance ω i ( t ) is generated by the following linear exogenous system
ξ ˙ i ( t ) = G ξ i ( t ) ,
ω i ( t ) = F ξ i ( t ) ,
where ξ i ( t ) R l is the state of the exogenous system, G R l × l and F R p × l are the matrices of the disturbance system.
Lemma 1.
[21] Assume that ( E , A ) is impulse free and ( E , A , B ) is stable. Then, the generalized Riccati equation
A T P + P T A - P T B B T P + I n = 0
E T P = P T E 0
has at least one admissible solution P, that is, ( E , A - B B T P ) is admissible. Furthermore, the admissible solution P is unique in the sense of E T P .
Lemma 2.
[9] Assume ( E , A , C ) is detectable, and the matrix P is the admissible solution of the following Riccati equation
A T P + P T A - P T B B T P + C C T = 0
E T P = P T E 0 .
Then, σ ( E , A - ( a + b i ) B B T P ) C - , when a 1 2 , b R , where i is imaginary units.

3. Main Results

In this section, we will design a disturbance observer to solve the problem caused by exogenous disturbances. Moreover, in order to resolve admissible consensus problem, we propose the distributed consensus protocol.
The disturbance observer is designed as follows
η ˙ i = ( G + H B F ) ( η i - H E x i ) + H ( A x i + B u i ) , ξ ^ i = η i - H E x i , ω ^ i = F ξ ^ i ,
where η i R l is the internal state variable of the observer, ξ ^ i and ω ^ i are the estimated values of ξ i and ω i , respectively. H R l × m is the gain matrix of the observer.
Let e i = ξ i - ξ ^ i , we can get
e ˙ i = ξ ˙ i - ξ ^ ˙ i = G ξ i - ( η i ˙ - H E x i ˙ ) = G ξ i - [ ( G + H B F ) ( η i - H E x i ) + H ( A x i + B u i ) - H ( A x i + B u i + B F ξ i ) ] = G ξ i - G η i + G H E x i - H B F η i + H B F H E x i + H B F ξ i = G ( ξ i - η i + H E x i ) + H B F ( ξ i - η i + H E x i ) = ( G + H B F ) ( ξ i - ξ ^ i ) = ( G + H B F ) e i .
That is
e ˙ i = ( G + H B F ) e i .
Denoting e = ( e 1 T , e 2 T , , e n T ) T , then, one has
( I n I l ) e ˙ = [ I n ( G + H B F ) ] e .
We can get that the tracking errors e i , i = 1 , 2 , , n , converge to 0, when the matrix G + H B F is Hurwitz.
In order to resolve admissible consensus problem, we consider the following distributed consensus protocol
u i = K j N i a i j ( x j - x i ) - F ξ ^ i , i = 1 , 2 , , n
where K is the gain matrix to be designed.
Theorem 1.
For the descriptor MASs (1) whose interaction topology G contains a directed spanning tree, suppose that the pair ( E , A ) is regular and impulse free, ( E , A , B ) is stable, and ( E , A , C ) is detectable. Then, the protocol (10) can solve the consensus problem if
(i) 
The matrix G + H B F is Hurwitz;
(ii) 
K = α B T P , where matrix P is the unique admissible solution of (5) and α 1 2 m i n λ i ( L ) 0 { R e ( λ i ) } , i = 1 , 2 , , n .
Proof. 
By substituting the control protocol (10) into the system (1), one has
E x ˙ i = A x i + B u i + B F ξ i = A x i + B K j N i a i j ( x j - x i ) + B F e i .
Next, we write formula (11) in the following form
E x ˙ 1 E x ˙ 2 E x ˙ n = A x 1 + B K j N 1 a 1 j ( x j - x 1 ) + B F e 1 A x 2 + B K j N 2 a 2 j ( x j - x 2 ) + B F e 2 A x n + B K j N n a n j ( x j - x n ) + B F e n = A x 1 A x 2 A x n + - j N 1 a 1 j a 12 a 1 n a 21 - j N 2 a 2 j a 2 n a n 1 a n 2 - j N n a n j B K x 1 x 2 x n + B F e 1 B F e 2 B F e n
Denote x = ( x 1 T , x 2 T , , x n T ) T , e = ( e 1 T , e 2 T , , e n T ) T . Then, it follows that
( I n E ) x ˙ = ( I n A - L B K ) x + ( I n B F ) e
Then, after manipulations with combining (9) and (13), the closed-loop system can be expressed as
I n E 0 0 I n I l x ˙ e ˙ = I n A - L B K I n B F 0 I n ( G + H B F ) x e .
Since the topology G contains a directed spanning tree, L has exactly one zero eigenvalue. Let r T = ( r 1 , r 2 , , r n ) be the left zero eigenvector of L with r T 1 = 1 . With the help of the Jordan decomposition theory, there exists a transformation matrix S with form S = [ 1 , S 1 ] and S - 1 = r T Q 1 such that S - 1 L S = 0 0 0 Λ , where Λ is the Jordan block diagonal matrix. The diagonal entries of the upper triangular matrix Λ are non-zero eigenvalue of L.
Furthermore, define the following state transformation:
x ¯ = ( S - 1 I m ) x , e ¯ = ( S - 1 I l ) e .
Then, (14) can be divided into the following two subsystems
E x ¯ ˙ 0 = A x ¯ 0 + B F e ¯ 0 e ¯ ˙ 0 = ( G + H B F ) e ¯ 0
and
I n - 1 E 0 0 I n - 1 I l x ¯ ˙ 1 e ¯ ˙ 1 = I n - 1 A - Λ B K I n - 1 B F 0 I n - 1 ( G + H B F ) x ¯ 1 e ¯ 1 ,
where x ¯ = [ x ¯ 0 T , x ¯ 1 T ] T , e ¯ = [ e ¯ 0 T , e ¯ 1 T ] T , and x ¯ 0 T is the first m components of x ¯ , e ¯ 0 T is the first l components of e ¯ .
At the same time, we have
x ( t ) - 1 x ¯ 0 ( t ) = ( S I m ) x ¯ ( t ) - 1 x ¯ 0 ( t ) = [ 1 I m S 1 I m ] x ¯ 0 ( t ) x ¯ 1 ( t ) - 1 x ¯ 0 ( t ) = ( S 1 I m ) x ¯ 1 ( t ) .
Obviously, if the system (16) is admissible, we can get x ¯ 1 ( t ) 0 , as t . Thus, x ( t ) - 1 x ¯ 0 ( t ) 0 , as t , which means that lim t ( x j - x i ) = 0 , i , j = 1 , 2 , , n .
Next, we will prove that the descriptor system (16) is admissible. Due to the matrix G + H B F is Hurwitz, the admissibility of the system (16) is equivalent to the admissibility of all pairs ( E , A - λ i B K ) . According to Lemma 1, P is the unique admissible solution of (5), therefore, ( E , A - B B T P ) is admissible. Due to A - λ i B K = A - α λ i B B T P , where R e ( α λ i ) 1 2 , i = { 2 , 3 , , n } , according to Lemma 2, ( E , A - λ i B K ) ( i = { 2 , 3 , , n } ) is admissible. So far, the proof is finished. ☐

4. Simulations

In this section, a simulation result is presented to illustrate the previous theoretical results. The network includes five agents. The topology can be described in Figure 1. The following matrix is the weighted adjacency matrix A of the topology:
A = 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 2 0 .
Choosing matrices
E = 1 0 0 0 1 0 0 0 0 ,   A = 0 . 7 3 . 3 - 1 . 3 3 . 3 4 . 3 - 3 . 1 - 1 . 3 - 2 . 2 0 . 8 ,   B = 1 2 - 1
G = - 1 0 0 0 - 0 . 6 0 0 0 0 ,   H = 2 0 2 0 1 0 0 0 1 ,   F = [ 0 0 1 ] .
Solving the Equation (5), we obtain that
P = 1 1 0 1 2 0 0 0 2 .
Then, we have
α = 1
and
K = 3 5 - 2 .
For the simulation, let initial states of the agents be the following:
x 1 = 1 0 . 5 279 / 468 ,   x 2 = 0 . 5 2 711 / 156 ,   x 3 = - 2 2 . 5 861 / 312 ,   x 4 = - 0 . 5 - 1 - 353 / 104 ,   x 5 = - 1 1 328 / 416 .
Figure 2, Figure 3 and Figure 4 show the states trajectory for all agents, indicating that the states trajectory of agents reach an agreement by the distributed control protocol (10). If we take the x 13 of Figure 4 as an example, although its initial state and direction of movement are very different from those of other agents, they can eventually reach the consensus agreement by the distributed control protocol (10).
The time evolutions of tracking errors are depicted in Figure 5, Figure 6 and Figure 7, we can get that the tracking errors converge to zero asymptotically.

5. Conclusions

In this paper, we study the admissible consensus for descriptor MASs with exogenous disturbances. A design method of disturbance observer is proposed, so that the states of all agents reach an agreement. Through the use of graph theory and the generalized Riccati equation, some conditions were obtained for admissible consensus of descriptor MASs with exogenous disturbances. The future work is to consider the admissible consensus of the descriptor MASs with leaders. In addition, since this paper does not consider the time delay, the perspective of considering the time delay will also be an interesting topic.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (No. 61503089), the Natural Science Foundation of Heilongjiang Province (No. QC2015077), Postdoctoral research startup foundation of Heilongjiang (No. LBH-Q16068), and the Fundamental Research Funds for the Central Universities.

Author Contributions

The work presented in this paper was accomplished in a concerted effort by all authors. Xuxi Zhang conceived and designed the experiments; Siqi Wang performed the experiments and analyzed the data.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Rosenbrock, H.H. Structural properties of linear dynamical systems. Int. J. Control 1974, 20, 191–202. [Google Scholar] [CrossRef]
  2. Stevens, B.L.; Lewis, F.L. Aircraft Control and Simulation; Wiley: New York, NY, USA, 2003. [Google Scholar]
  3. Hill, D.J.; Mareels, I.M.Y. Stability theory for differential/algebraic systems with application to power systems. IEEE Trans. Circuits Syst. 1990, 37, 1416–1423. [Google Scholar] [CrossRef]
  4. Durfee, E.H.; Lesser, V.R.; Corkill, D.D. Trends in cooperative distributed problem solving. IEEE Trans. Knowl. Data Eng. 1989, 1, 63–83. [Google Scholar] [CrossRef]
  5. Sastry, S.S.; Desoer, C.A. Jump behavior of circuits and systems. IEEE Conf. Decis. Control Incl. Symp. Adapt. Process. 1981, 28, 109–1124. [Google Scholar]
  6. Lin, Z.; Franeis, B.; Maggiore, M. Necessary and suffcient graphical condition for formation control of unicycles. IEEE Trans. Autom. Control 2005, 50, 121–127. [Google Scholar]
  7. Chamoso, P.; Prieta, F.D.L.; Perez, J.B.; Rodriguez, J.M.C. Conflict resolution with agents in smart cities. Interdiscip. Perspect. Contemp. Confl. Resolut. 2016, 14, 244–262. [Google Scholar]
  8. Heras, S.; Prieta, F.D.L.; Julian, V.; Rodriguez, S.; Botti, V.; Bajo, J.; Rodriguez, J.M.C. Agreement technologies and their use in cloud computing environments. Prog. Artif. Intell. 2012, 1, 277–290. [Google Scholar] [CrossRef]
  9. Yang, X.; Liu, G. Necessary and sufficient consensus conditions of linear descriptor multi-agent system. IEEE Trans. Circuits Syst. I Regul. Pap. 2012, 59, 2669–2676. [Google Scholar] [CrossRef]
  10. Wang, B.; Sun, Y. Consensus analysis of heterogeneous multi-agent systems with time-varying delay. Entropy 2015, 17, 3631–3644. [Google Scholar] [CrossRef]
  11. Sedziwy, A.; Kotulski, L. Multi-agent system supporting automated large-scale photometric computations. Entropy 2016, 18, 76. [Google Scholar] [CrossRef]
  12. Mustafa, A.; Islam, M.N.U.; Ahmed, S.; Tufail, M.A. A novel approach for fast average consensus under unreliable communication in distributed multi-agent networks. Wirel. Pers. Commun. 2018, 99, 1423–1441. [Google Scholar] [CrossRef]
  13. Zhang, H.; Jiang, H.; Luo, Y.; Xiao, G. Data-driven optimal consensus control for discrete-time multi-agent systems with unknown dynamics using reinforcement learning method. IEEE Trans. Ind. Electron. 2017, 64, 4091–4100. [Google Scholar] [CrossRef]
  14. Feng, Y.; Duan, Z.; Ren, W.; Chen, G. Consensus of multi-agent systems with fixed inner connections. Int. J. Robust Nonlinear Control 2018, 28, 154–173. [Google Scholar] [CrossRef]
  15. Sun, Y.; Wang, L. Average consensus in networks of dynamic agents with switching topologies and multiple time-varying delays. Syst. Control Lett. 2008, 57, 175–183. [Google Scholar] [CrossRef]
  16. Shang, Y. Average consensus in multi-agent systems with uncertain topologies and multiple time-varying delays. Linear Algebra Appl. 2014, 459, 411–429. [Google Scholar] [CrossRef]
  17. Zhang, X.; Zhu, Q.; Liu, X. Consensus of second order multi-agent systems with exogenous disturbance generated by unknown exosystems. Entropy 2016, 18, 423. [Google Scholar] [CrossRef]
  18. Li, Z.; Duan, Z.; Chen, G.; Huang, L. Consensus of multi-agent systems and synchronization of complex networks: A unified viewpoint. IEEE Trans. Circuits Syst. I Regul. Pap. 2010, 57, 213–224. [Google Scholar]
  19. Zhang, H.; Lewis, F.L.; Das, A. Optimal design for synchronization of cooperative systems: State feedback, observer and output feedback. IEEE Trans. Autom. Control 2011, 56, 1948–1952. [Google Scholar] [CrossRef]
  20. Chen, K.; Wang, J.; Zhang, Y. Distributed consensus of nonlinear multi-agent systems on state-controlled switching topologies. Entropy 2016, 18, 29. [Google Scholar] [CrossRef]
  21. Yang, X.; Liu, G. Consensus of descriptor multi-agent systems via dynamic compensators. IET Control Theory Appl. 2014, 8, 389–398. [Google Scholar] [CrossRef]
  22. Chen, W.; Gao, L.; Xu, X.; Cui, J. Distributed observer-based consensus protocol for descriptor multi-agent systems. Proc. Instiyution Mech. Eng. Part I J. Syst. Control Eng. 2015, 229, 927–938. [Google Scholar] [CrossRef]
  23. Gao, L.; Cui, Y.; Chen, W. Admissible consensus for descriptor multi-agent systems via distributed observer-based protocols. J. Frankl. Inst. 2017, 354, 257–276. [Google Scholar] [CrossRef]
  24. Liu, Y.; Jia, Y. Adaptive leader-following consensus control of multi-agent systems using model reference adaptive control approach. IET Control Theory Appl. 2012, 6, 2002–2008. [Google Scholar] [CrossRef]
  25. Liu, Y.; Jia, Y. Consensus problem of high-order multi-agent systems with external disturbances: An H analysis approach. Int. J. Robust Nonlinear Control 2010, 20, 1579–1593. [Google Scholar] [CrossRef]
  26. Yang, H.; Zhang, Z.; Zhang, S. Consensus of second-order multi-agent systems with exogenous disturbances. Int. J. Robust Nonlinear Control 2011, 21, 945–956. [Google Scholar] [CrossRef]
  27. Xu, C.; Zheng, Y.; Su, H.; Zeng, H. Containment for linear multi-agent systems with exogenous disturbances. Neurocomputing 2015, 160, 206–212. [Google Scholar] [CrossRef]
  28. Shang, Y. L1 group consensus of multi-agent systems with switching topologies and stochastic inputs. Phys. Lett. A 2013, 377, 1582–1586. [Google Scholar] [CrossRef]
  29. Shang, Y. Group consensus of multi-agent systems in directed networks with noises and time delays. Int. J. Syst. Sci. 2015, 46, 2481–2492. [Google Scholar] [CrossRef]
  30. Zhang, X.; Liu, X. Consensus of linear multi-agent systems with exogenous disturbance generated from heterogeneous exosystems. Int. J. Syst. Sci. 2017, 48, 3147–3159. [Google Scholar] [CrossRef]
  31. Ma, Q.; Xu, S.; Lewis, F.L. Cooperative output regulation of singular heterogeneous multi-agent systems. IEEE Trans. Cybern. 2017, 46, 1471–1475. [Google Scholar] [CrossRef] [PubMed]
Figure 1. Communication topology.
Figure 1. Communication topology.
Entropy 20 00276 g001
Figure 2. The first component of the states.
Figure 2. The first component of the states.
Entropy 20 00276 g002
Figure 3. The second component of the states.
Figure 3. The second component of the states.
Entropy 20 00276 g003
Figure 4. The third component of the states.
Figure 4. The third component of the states.
Entropy 20 00276 g004
Figure 5. The first component of tracking errors.
Figure 5. The first component of tracking errors.
Entropy 20 00276 g005
Figure 6. The second component of tracking errors.
Figure 6. The second component of tracking errors.
Entropy 20 00276 g006
Figure 7. The third component of tracking errors.
Figure 7. The third component of tracking errors.
Entropy 20 00276 g007

Share and Cite

MDPI and ACS Style

Zhang, X.; Wang, S. Admissible Consensus for Descriptor Multi-Agent Systems with Exogenous Disturbances. Entropy 2018, 20, 276. https://doi.org/10.3390/e20040276

AMA Style

Zhang X, Wang S. Admissible Consensus for Descriptor Multi-Agent Systems with Exogenous Disturbances. Entropy. 2018; 20(4):276. https://doi.org/10.3390/e20040276

Chicago/Turabian Style

Zhang, Xuxi, and Siqi Wang. 2018. "Admissible Consensus for Descriptor Multi-Agent Systems with Exogenous Disturbances" Entropy 20, no. 4: 276. https://doi.org/10.3390/e20040276

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