Gossip consensus algorithms via quantized communication

This paper considers the average consensus problem on a network of digital links, and proposes algorithms based on pairwise "gossip" communications and updates. Through both analytical results and simulations, we investigate two design questions, arising from the literature: whether the agents should use a deterministic or a probabilistic quantizer, and whether they should use, or not, exact information regarding their own states in the update. Key words: Average consensus; quantization; Markov chain.

• Type: Journal
• Year: 2010
• Where: AUTOMATICA
• Authors: Ruggero Carli, Fabio Fagnani, Paolo Frasca, Sandro Zampieri
• Keywords: AUTOMATICA 2010, Average Consensus, Average Consensus Problem, Probabilistic Quantizer