A Novel Clustering Approach Based on Group Quasi-Consensus of Unstable Dynamic Linear High-Order Multi-Agent Systems
This work offers a novel perspective on clustering by linking it to multi-agent consensus, but it is incremental as it only provides theoretical conditions and simple examples without empirical validation on standard benchmarks.
The paper proposes a clustering method based on group consensus in dynamic linear high-order multi-agent systems, providing a necessary and sufficient condition for group consensus and demonstrating the approach with two numerical examples.
This paper introduces a novel approach of clustering, which is 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 given to check the group consensus. Two numerical instances are shown to illustrate the process of approach.