cluster consensus on discrete-time multi-agent networks集群共识离散时间多代理网络.pdfVIP

Hindawi Publishing Corporation Abstract and Applied Analysis Volume 2012, Article ID 274735, 11 pages doi:10.1155/2012/274735 Research Article Cluster Consensus on Discrete-Time Multi-Agent Networks Li Xiao,1, 2 Xiaofeng Liao,1 and Huiwei Wang1 1 State Key Laboratory of Power Transmission Equipment System Security and New Technology, College of Computer Science, Chongqing University, Chongqing 400044, China 2 Department of Mathematics and Information Engineering, Chongqing University of Education, Chongqing 400067, China Correspondence should be addressed to Li Xiao, xsxiaoli@163.com Received 6 August 2012; Accepted 24 September 2012 Academic Editor: Chuandong Li Copyright q 2012 Li Xiao et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 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. 1. Introduction In recent years, the consensus problem of coordinating the motion of multi-agent networks has attracted great attention. Research on multi-agent consensus not only helps in better understanding the general mechanisms and interconnection rules o