Consensus and Synchronization of Multi-agent Systems over Finite Fields - Graph Topologies

arXiv:2604.14205 · eess.SY, cs.SY · Submitted 2026-04-03 · Read on arXiv

eess.SY, cs.SY

Submitted: 2026-04-03

Updated: 2026-09-22

Code: https://github.com/simonlehky/generating_T_modulo_p

Terminology

• Multi-Agent System — 6× in this paper · explained in 6 episodes
• Adjacency Matrix — 4× in this paper · explained in 1 episode
• Decoupling — 2× in this paper · explained in 2 episodes
• Admissibility — 1× in this paper · explained in 2 episodes
• Closed-Loop System — 1× in this paper · explained in 4 episodes
• Graph Construction — 1× in this paper · explained in 3 episodes
• Robustness — 1× in this paper · explained in 5 episodes
• Trace — 1× in this paper · explained in 2 episodes
• Triangular Form — 1× in this paper
• Unified Framework — 1× in this paper · explained in 5 episodes

Sources

• Complex Laplacians and Applications in Multi-Agent Systems

Related papers

• One Request, Multiple Experts: LLM Orchestrates Domain Specific Models via Adaptive Task Routing
• A Geometric Decision Procedure for STL Feasibility and Repair
• Submodular Multi-Agent Policy Learning for Online Distributed Task Allocation in Open Multi-Agent Systems
• Policy-Level Recursive Self-Improvement for Embodied AI with a Criticality World Model
• Minimal Experiments for Robust Stabilization: Information, Spectral Geometry, and Duration
• Decentralized Power-Optimal Coordination for Spacecraft Swarms Using Time-Varying Magnetorquer Actuation