Linear Regulator-Based Synchronization of Positive Multi-Agent Systems
Alba Gurpegui, Mark Jeeninga, Emma Tegling, Anders Rantzer
TL;DR
This paper addresses the problem of synchronizing homogeneous positive multi-agent systems on undirected graphs using relative-state measurements. It proposes a Linear Regulator (LR)–based static protocol, computable via a linear program, to guarantee synchronization under graph families with known Laplacian bounds, while enforcing positivity of trajectories. It provides necessary and sufficient conditions for positivity and establishes when the LR protocol achieves synchronization for all graphs in a family, supported by LP-based construction of the gain. Simulations on large regular graphs validate positive behavior and show faster convergence with increased connectivity, highlighting the method's scalability and applicability to positive networked systems.
Abstract
This paper addresses the positive synchronization of interconnected systems on undirected graphs. For homogeneous positive systems, a static feedback protocol design is proposed, based on the Linear Regulator problem. The solution to the algebraic equation associated to the stabilizing policy can be found using a linear program. Necessary and sufficient conditions on the positivity of each agent's trajectory for all nonnegative initial conditions are also provided. Simulations on large regular graphs with different nodal degree illustrate the proposed results.
