ADMM for consensus on colored networks

João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar, Markus Püschel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

We propose a novel distributed algorithm for one of the most fundamental problems in networks: the average consensus. We view the average consensus as an optimization problem, which allows us to use recent techniques and results from the optimization area. Based on the assumption that a coloring scheme of the network is available, we derive a decentralized, asynchronous, and communication-efficient algorithm that is based on the Alternating Direction Method of Multipliers (ADMM). Our 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.

Original languageEnglish
Title of host publication2012 IEEE 51st Annual Conference on Decision and Control
Pages5116-5121
Number of pages6
ISBN (Electronic)978-1-4673-2066-5
DOIs
Publication statusPublished - 2012

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modelling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'ADMM for consensus on colored networks'. Together they form a unique fingerprint.

  • Cite this

    Mota, J. F. C., Xavier, J. M. F., Aguiar, P. M. Q., & Püschel, M. (2012). ADMM for consensus on colored networks. In 2012 IEEE 51st Annual Conference on Decision and Control (pp. 5116-5121) https://doi.org/10.1109/CDC.2012.6426225