Cluster Assignment in Multi-Agent Systems
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2022
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916587071602688 |
|---|---|
| author | Sharf, Miel Zelazo, Daniel |
| author_facet | Sharf, Miel Zelazo, Daniel |
| contents | We study cluster assignment in multi-agent networks. We consider homogeneous diffusive networks, and focus on design of the graph that ensures the system will converge to a prescribed cluster configuration, i.e., specifying the number of clusters and agents within each cluster. Leveraging recent results from cluster synthesis, we show that it is possible to design an oriented graph such that the action of the automorphism group of the graph has orbits of predetermined sizes, guaranteeing that the network will converge to the prescribed cluster configuration. We provide upper and lower bounds on the number of edges that are needed to construct these graphs along with a constructive approach for generating these graphs. We support our analysis with some numerical examples. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2203_06642 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Cluster Assignment in Multi-Agent Systems Sharf, Miel Zelazo, Daniel Systems and Control Discrete Mathematics Multiagent Systems Combinatorics Optimization and Control We study cluster assignment in multi-agent networks. We consider homogeneous diffusive networks, and focus on design of the graph that ensures the system will converge to a prescribed cluster configuration, i.e., specifying the number of clusters and agents within each cluster. Leveraging recent results from cluster synthesis, we show that it is possible to design an oriented graph such that the action of the automorphism group of the graph has orbits of predetermined sizes, guaranteeing that the network will converge to the prescribed cluster configuration. We provide upper and lower bounds on the number of edges that are needed to construct these graphs along with a constructive approach for generating these graphs. We support our analysis with some numerical examples. |
| title | Cluster Assignment in Multi-Agent Systems |
| topic | Systems and Control Discrete Mathematics Multiagent Systems Combinatorics Optimization and Control |
| url | https://arxiv.org/abs/2203.06642 |