Gossip consensus algorithms via quantized communication
Optimization and Control
2011-07-25 v2 Systems and Control
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.
Keywords
Cite
@article{arxiv.0907.0748,
title = {Gossip consensus algorithms via quantized communication},
author = {Ruggero Carli and Fabio Fagnani and Paolo Frasca and Sandro Zampieri},
journal= {arXiv preprint arXiv:0907.0748},
year = {2011}
}
Comments
Accepted for publication