Fundamental Performance Limitations for Average Consensus in Open Multi-Agent Systems

Abstract

We derive <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">fundamental performance limitations</i> for intrinsic average consensus problems in open multi-agent systems, which are systems subject to frequent arrivals and departures of agents. Each agent holds a value, and the objective of the agents is to collaboratively estimate the average of the values of the agents presently in the system. Algorithms solving such problems in open systems are poised to never converge because of the permanent variations in the composition, size, and objective pursued by the agents of the system. We provide lower bounds on the expected mean squared error achievable by any averaging algorithms in open systems of fixed size. Our derivation is based on the analysis of a conceptual algorithm that would achieve optimal performance for a given model of replacements. We obtain a general bound that depends on the properties of the model defining the interactions between the agents, and instantiate that result for all-to-one and one-to-one interaction models. A comparison between those bounds and algorithms implementable with those models is then provided to highlight their validity.