UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

ADMM for consensus on colored networks

(2012) ADMM for consensus on colored networks. In: (pp. pp. 5116-5121).

Full text not available from this repository.

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. © 2012 IEEE.

Type: Proceedings paper
Title: ADMM for consensus on colored networks
DOI: 10.1109/CDC.2012.6426225
UCL classification: UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Electronic and Electrical Eng
URI: http://discovery.ucl.ac.uk/id/eprint/1533925
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item