A Linear Push-Pull Average Consensus Algorithm for Delay-Prone Networks
By: Evagoras Makridis, Themistoklis Charalambous
Potential Business Impact:
Helps robots agree on tasks even with slow communication.
In this paper, we address the average consensus problem of multi-agent systems for possibly unbalanced and delay-prone networks with directional information flow. We propose a linear distributed algorithm (referred to as RPPAC) that handles asynchronous updates and time-varying heterogeneous information delays. Our proposed distributed algorithm utilizes a surplus-consensus mechanism and information regarding the number of incoming and outgoing links to guarantee state averaging, despite the imbalanced and delayed information flow in directional networks. The convergence of the RPPAC algorithm is examined using key properties of the backward product of time-varying matrices that correspond to different snapshots of the directional augmented network.
Similar Papers
Average Consensus with Dynamic Compression in Bandwidth-Limited Directed Networks
Systems and Control
Helps computers agree on a number without talking much.
HARQ-based Quantized Average Consensus over Unreliable Directed Network Topologies
Systems and Control
Helps computers agree on a number, even with lost messages.
Asynchronous Push-sum Dual Gradient Algorithm in Distributed Model Predictive Control
Optimization and Control
Helps many computers work together to control things.