Cluster Consensus on Discrete-Time Multi-Agent Networks
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2012/274735 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832564304608493568 |
|---|---|
| author | Li Xiao Xiaofeng Liao Huiwei Wang |
| author_facet | Li Xiao Xiaofeng Liao Huiwei Wang |
| author_sort | Li Xiao |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-fd55af141b1a43b79b8fbb2647e0cd11 |
| institution | Kabale University |
| issn | 1085-3375 1687-0409 |
| language | English |
| publishDate | 2012-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Abstract and Applied Analysis |
| spelling | doaj-art-fd55af141b1a43b79b8fbb2647e0cd112025-02-03T01:11:26ZengWileyAbstract and Applied Analysis1085-33751687-04092012-01-01201210.1155/2012/274735274735Cluster Consensus on Discrete-Time Multi-Agent NetworksLi Xiao0Xiaofeng Liao1Huiwei Wang2State Key Laboratory of Power Transmission Equipment & System Security and New Technology, College of Computer Science, Chongqing University, Chongqing 400044, ChinaState Key Laboratory of Power Transmission Equipment & System Security and New Technology, College of Computer Science, Chongqing University, Chongqing 400044, ChinaState Key Laboratory of Power Transmission Equipment & System Security and New Technology, College of Computer Science, Chongqing University, Chongqing 400044, ChinaNowadays, 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.http://dx.doi.org/10.1155/2012/274735 |
| spellingShingle | Li Xiao Xiaofeng Liao Huiwei Wang Cluster Consensus on Discrete-Time Multi-Agent Networks Abstract and Applied Analysis |
| title | Cluster Consensus on Discrete-Time Multi-Agent Networks |
| title_full | Cluster Consensus on Discrete-Time Multi-Agent Networks |
| title_fullStr | Cluster Consensus on Discrete-Time Multi-Agent Networks |
| title_full_unstemmed | Cluster Consensus on Discrete-Time Multi-Agent Networks |
| title_short | Cluster Consensus on Discrete-Time Multi-Agent Networks |
| title_sort | cluster consensus on discrete time multi agent networks |
| url | http://dx.doi.org/10.1155/2012/274735 |
| work_keys_str_mv | AT lixiao clusterconsensusondiscretetimemultiagentnetworks AT xiaofengliao clusterconsensusondiscretetimemultiagentnetworks AT huiweiwang clusterconsensusondiscretetimemultiagentnetworks |