Stability of Open Multi-agent Systems over Dynamic Signed Graphs
By: Pelin Sekercioglu, Angela Fontan, Dimos V. Dimarogonas
Potential Business Impact:
Helps groups of robots agree on tasks.
This paper addresses the bipartite consensus-control problem in open multi-agent systems containing both cooperative and antagonistic interactions. In these systems, new agents can join and new interactions can be formed over time. Moreover, the types of interactions, cooperative or antagonistic, may change. To model these structural changes, we represent the system as a switched system interconnected over a dynamic signed graph. Using the signed edge-based agreement protocol and constructing strict Lyapunov functions for signed edge-Laplacian matrices with multiple zero eigenvalues, we establish global asymptotic stability of the bipartite consensus control. Numerical simulations validate our theoretical results.
Similar Papers
Linear Regulator-Based Synchronization of Positive Multi-Agent Systems
Systems and Control
Makes connected things work together perfectly.
Multi-Agent Trustworthy Consensus under Random Dynamic Attacks
Systems and Control
Keeps computer groups working even with bad actors.
On Robustness of Consensus over Pseudo-Undirected Path Graphs
Systems and Control
Helps groups agree on a value, even with different opinions.