Cluster Assignment in Multi-Agent Systems : Sparsity Bounds and Fault Tolerance
Abstract
We study cluster assignment in homogeneous diffusive multi-agent networks. Given the number of clusters and agents within each cluster, we design the network graph ensuring the system will converge to the prescribed cluster configuration. Using recent results linking clustering and symmetries, we show that it is possible to design an oriented graph for which the action of the automorphism group of the graph has orbits of predetermined sizes, guaranteeing the network will converge to the prescribed cluster configuration. We provide bounds on the number of edges needed to construct these graphs along with a constructive approach for their generation. We also consider the robustness of the clustering process under agent malfunction.
Cite
@article{arxiv.2211.01316,
title = {Cluster Assignment in Multi-Agent Systems : Sparsity Bounds and Fault Tolerance},
author = {Miel Sharf and Daniel Zelazo},
journal= {arXiv preprint arXiv:2211.01316},
year = {2022}
}
Comments
12 pages, 6 figures. arXiv admin note: text overlap with arXiv:2203.06642