TY - JOUR
T1 - Distributed higher order consensus protocols in multiagent dynamical systems
AU - Yu, Wenwu
AU - Chen, Guanrong
AU - Ren, Wei
AU - Kurths, Jürgen
AU - Zheng, Wei Xing
PY - 2011
Y1 - 2011
N2 - This paper studies general higher order distributed consensus protocols in multiagent dynamical systems. First, network synchronization is investigated, with some necessary and sufficient conditions derived for higher order consensus. It is found that consensus can be reached if and only if all subsystems are asymptotically stable. Based on this result, consensus regions are characterized. It is proved that for the m th-order consensus, there are at most ⌊(m+1)/2⌋ disconnected stable and unstable consensus regions. It is shown that consensus can be achieved if and only if all the nonzero eigenvalues of the Laplacian matrix lie in the stable consensus regions. Moreover, the ratio of the largest to the smallest nonzero eigenvalues of the Laplacian matrix plays a key role in reaching consensus and a scheme for choosing the coupling strength is derived. Furthermore, a leader-follower control problem in multiagent dynamical systems is considered, which reveals that to reach consensus the agents with very small degrees must be informed. Finally, simulation examples are given to illustrate the theoretical analysis. © 2011 IEEE.
AB - This paper studies general higher order distributed consensus protocols in multiagent dynamical systems. First, network synchronization is investigated, with some necessary and sufficient conditions derived for higher order consensus. It is found that consensus can be reached if and only if all subsystems are asymptotically stable. Based on this result, consensus regions are characterized. It is proved that for the m th-order consensus, there are at most ⌊(m+1)/2⌋ disconnected stable and unstable consensus regions. It is shown that consensus can be achieved if and only if all the nonzero eigenvalues of the Laplacian matrix lie in the stable consensus regions. Moreover, the ratio of the largest to the smallest nonzero eigenvalues of the Laplacian matrix plays a key role in reaching consensus and a scheme for choosing the coupling strength is derived. Furthermore, a leader-follower control problem in multiagent dynamical systems is considered, which reveals that to reach consensus the agents with very small degrees must be informed. Finally, simulation examples are given to illustrate the theoretical analysis. © 2011 IEEE.
KW - Algebraic graph theory
KW - consensus region
KW - higher order consensus
KW - leader-follower control
KW - multiagent system
UR - http://www.scopus.com/inward/record.url?scp=79957505847&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-79957505847&origin=recordpage
U2 - 10.1109/TCSI.2011.2106032
DO - 10.1109/TCSI.2011.2106032
M3 - RGC 21 - Publication in refereed journal
SN - 1549-8328
VL - 58
SP - 1924
EP - 1932
JO - IEEE Transactions on Circuits and Systems I: Regular Papers
JF - IEEE Transactions on Circuits and Systems I: Regular Papers
IS - 8
M1 - 5711689
ER -