ADMM for Consensus on Colored Networks

Provided by: ETH Zurich
Topic: Mobility
Format: PDF
The authors propose a novel distributed algorithm for one of the most fundamental problems in networks: the average consensus. They view the average consensus as an optimization problem, which allows one to use recent techniques and results from the optimization area. Based on the assumption that a coloring scheme of the network is available, they derive a decentralized, asynchronous, and communication-efficient algorithm that is based on the Alternating Direction Method of Multipliers (ADMM). Their simulations with other state-of-the-art consensus algorithms show that the proposed algorithm is the one exhibiting the most stable performance across several network models.

Find By Topic