Cluster Consensus on Discrete-Time Multi-Agent Networks

Abstract EN

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.