Cluster Consensus on Discrete-Time Multi-Agent Networks
Keyword(s):
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.
2010 ◽
Vol 2010
◽
pp. 1-19
◽
2014 ◽
Vol 2014
◽
pp. 1-12
◽
2013 ◽
Vol 7
(12)
◽
pp. 1665-1674
◽
2010 ◽
Vol 4
(7)
◽
pp. 1277-1281
◽
Keyword(s):
2010 ◽
Vol 4
(10)
◽
pp. 1922-1932
◽
2015 ◽
Vol 137
(8)
◽
2010 ◽
Vol 4
(7)
◽
pp. 1211-1221
◽