Consensus and Synchronization of Multi-agent Systems over Finite Fields -- Graph Topologies
This work provides algorithmic solutions for a known NP-hard problem in the control of multi-agent systems with finite state-space, which are resilient to communication noise.
The paper addresses the problem of constructing admissible communication topologies for multi-agent systems with finite state-space, which is NP-hard. It proposes two new algorithms to efficiently generate these topologies, validated through simulations.
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.