Cluster Consensus on Discrete-Time Multi-Agent Networks

Li Xiao, Xiaofeng Liao and Huiwei Wang

Abstract and Applied Analysis, 2012, vol. 2012, 1-11

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.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2012/274735.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2012/274735.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlaaa:274735

DOI: 10.1155/2012/274735

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().