Stability of Open Multi-Agent Systems and Applications to Dynamic Consensus
Not on the map. Why?
Abstract (arXiv)
In this technical note we consider a class of multi-agent network systems that we refer to as Open Multi-Agent Systems (OMAS): in these multi-agent systems, an indefinite number of agents may join or leave the network at any time. Focusing on discrete-time evolutions of scalar agents, we provide a novel theoretical framework to study the dynamical properties of OMAS: specifically, we propose a suitable notion of stability and derive sufficient conditions to ensure stability in this sense. These sufficient conditions regard the arrival/departure of an agent as a disturbance: consistently, they require the effect of arrivals/departures to be bounded (in a precise sense) and the OMAS to be contractive in the absence of arrivals/departures. In order to provide an example of application for this theory, we re-formulate the well-known Proportional Dynamic Consensus for Open Multi-Agent Systems and we characterize the stability properties of the resulting Open Proportional Dynamic Consensus algorithm.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Jun 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 0; 2025: 1.
2 papers.
- 2021Optimization in Open Networks via Dual Averagingcited by 2
- 2025Optimization and Learning in Open Multi-Agent Systemscited by 2
- 2025Optimization and Learning in Open Multi-Agent Systems28 Jan 2025
- 2021Optimization in Open Networks via Dual Averaging27 May 2021