Open Access
2012 Cluster Consensus on Discrete-Time Multi-Agent Networks
Li Xiao, Xiaofeng Liao, Huiwei Wang
Abstr. Appl. Anal. 2012(SI10): 1-11 (2012). DOI: 10.1155/2012/274735


Nowadays, multi-agent networks are ubiquitous in the real world. Over the last decade, consensus has received an increasing attention from various disciplines. This paper investigates cluster consensus for discrete-time multi-agent networks. By utilizing a special coupling matrix and the Kronecker product, a criterion based on linear matrix inequality (LMI) is obtained. It is shown that the addressed discrete-time multi-agent networks achieve cluster consensus if a certain LMI is feasible. Finally, an example is given to demonstrate the effectiveness of the proposed criterion.


Download Citation

Li Xiao. Xiaofeng Liao. Huiwei Wang. "Cluster Consensus on Discrete-Time Multi-Agent Networks." Abstr. Appl. Anal. 2012 (SI10) 1 - 11, 2012.


Published: 2012
First available in Project Euclid: 5 April 2013

zbMATH: 1253.93100
MathSciNet: MR2991011
Digital Object Identifier: 10.1155/2012/274735

Rights: Copyright © 2012 Hindawi

Vol.2012 • No. SI10 • 2012
Back to Top