Average Consensus with Dynamic Compression in Bandwidth-Limited Directed Networks
By: Evagoras Makridis , Gabriele Oliva , Apostolos I. Rikos and more
Potential Business Impact:
Helps computers agree on a number without talking much.
In this paper, the average consensus problem has been considered for directed unbalanced networks under finite bit-rate communication. We propose the Push-Pull Average Consensus algorithm with Dynamic Compression (PP-ACDC) algorithm, a distributed consensus algorithm that deploys an adaptive quantization scheme and achieves convergence to the exact average without the need of global information. A preliminary numerical convergence analysis and simulation results corroborate the performance of PP-ACDC.
Similar Papers
A Linear Push-Pull Average Consensus Algorithm for Delay-Prone Networks
Systems and Control
Helps robots agree on tasks even with slow communication.
Distributed Quantized Average Consensus in Open Multi-Agent Systems with Dynamic Communication Links
Systems and Control
Lets robots agree on a shared number quickly.
HARQ-based Quantized Average Consensus over Unreliable Directed Network Topologies
Systems and Control
Helps computers agree on a number, even with lost messages.