Cluster Consensus on Discrete-Time Multi-Agent Networks. (22nd October 2012)

• Record Type: Journal Article
• Authors: Xiao, Li; Liao, Xiaofeng; Wang, Huiwei
• Other Names: Li Chuandong Academic Editor.
• Is Part Of: Abstract and applied analysis. Volume 2012(2012)
• Publication Date: 2012-10-22
• Subjects: Mathematical analysis -- Periodicals; Mathematical analysis; Applied Mathematics; Mathematical Analysis; Periodicals; 515.05
• DOI: 10.1155/2012/274735
• Languages: English
• ISSNs: 1085-3375

Abstract

Abstract : 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.