Consensus and Synchronization of Multi-agent Systems over Finite Fields -- Graph Topologies
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910132730855424 |
|---|---|
| author | Hengster-Movrić, Kristian Lehký, Šimon Yaghmaie, Farnaz Adib |
| author_facet | Hengster-Movrić, Kristian Lehký, Šimon Yaghmaie, Farnaz Adib |
| contents | This paper brings cooperative protocols for multi-agent systems with agents having a finite state-space. Both scalar single-integrator consensus and general LTI systems synchronization are considered. Systems having a finite state-space describe agents with minimal memory capacity processing only a finite alphabet. Such systems are remarkably resilient to communication noise. The crucial problem, however, is to construct the admissible communication topology, which is NP-hard. We address this by efficiently exploring the subsets of admissible matrices and propose two new algorithms to generate the topologies. Simulations validate the proposed approach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_14205 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Consensus and Synchronization of Multi-agent Systems over Finite Fields -- Graph Topologies Hengster-Movrić, Kristian Lehký, Šimon Yaghmaie, Farnaz Adib Systems and Control F.2.1; I.2.11; I.6; D.4.1 This paper brings cooperative protocols for multi-agent systems with agents having a finite state-space. Both scalar single-integrator consensus and general LTI systems synchronization are considered. Systems having a finite state-space describe agents with minimal memory capacity processing only a finite alphabet. Such systems are remarkably resilient to communication noise. The crucial problem, however, is to construct the admissible communication topology, which is NP-hard. We address this by efficiently exploring the subsets of admissible matrices and propose two new algorithms to generate the topologies. Simulations validate the proposed approach. |
| title | Consensus and Synchronization of Multi-agent Systems over Finite Fields -- Graph Topologies |
| topic | Systems and Control F.2.1; I.2.11; I.6; D.4.1 |
| url | https://arxiv.org/abs/2604.14205 |