Gossip consensus algorithms via quantized communication

From MaRDI portal
Publication:985266

DOI10.1016/J.AUTOMATICA.2009.10.032zbMATH Open1214.93122arXiv0907.0748OpenAlexW2028201344MaRDI QIDQ985266FDOQ985266

Ruggero Carli, Sandro Zampieri, Paolo Frasca, Fabio Fagnani

Publication date: 20 July 2010

Published in: Automatica (Search for Journal in Brave)

Abstract: This paper considers the average consensus problem on a network of digital links, and proposes a set of algorithms based on pairwise gossip communications and updates. We study the convergence properties of such algorithms with the goal of answering two design questions, arising from the literature: whether the agents should encode their communication by a deterministic or a randomized quantizer, and whether they should use, and how, exact information regarding their own states in the update.


Full work available at URL: https://arxiv.org/abs/0907.0748




Recommendations




Cites Work


Cited In (50)





This page was built for publication: Gossip consensus algorithms via quantized communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985266)