Clustering by group consensus of unstable dynamic linear high-order multi-agent systems

This paper introduces an approach of clustering, based on group consensus of dynamic linear high-order multi-agent systems. The graph topology is associated with a selected multi-agent system, with each agent corresponding to one vertex. In order to reveal the cluster structure, the agents belonging to a similar cluster are expected to aggregate together. As theoretical foundation, a necessary and sufficient condition is proposed to check the group consensus. A numerical instance is shown to illustrate the computation process.