Distributed Quantized Average Consensus in Open Multi-Agent Systems with Dynamic Communication Links
By: Jiaqi Hu, Karl H. Johansson, Apostolos I. Rikos
Potential Business Impact:
Lets robots agree on a shared number quickly.
In this paper, we focus on the distributed quantized average consensus problem in open multi-agent systems consisting of communication links that change dynamically over time. Open multi-agent systems exhibiting the aforementioned characteristic are referred to as \textit{open dynamic multi-agent systems} in this work. We present a distributed algorithm that enables active nodes in the open dynamic multi-agent system to calculate the quantized average of their initial states. Our algorithm consists of the following advantages: (i) ensures efficient communication by enabling nodes to exchange quantized valued messages, and (ii) exhibits finite time convergence to the desired solution. We establish the correctness of our algorithm and we present necessary and sufficient topological conditions for it to successfully solve the quantized average consensus problem in an open dynamic multi-agent system. Finally, we illustrate the performance of our algorithm with numerical simulations.
Similar Papers
HARQ-based Quantized Average Consensus over Unreliable Directed Network Topologies
Systems and Control
Helps computers agree on a number, even with lost messages.
Average Consensus with Dynamic Compression in Bandwidth-Limited Directed Networks
Systems and Control
Helps computers agree on a number without talking much.
Multi-cluster distributed optimization in open multi-agent systems over directed graphs with acknowledgement messages
Systems and Control
Helps robots work together even when they join/leave.