On Quantized Consensus by Means of Gossip Algorithm -- Part I: Convergence Proof

From Murray Wiki
Revision as of 06:16, 15 May 2016 by Murray (talk | contribs) (htdb2wiki: creating page for 2008q_lm09a-acc.html)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

Javad Lavaei, Richard M Murray
American Control Conference (ACC)

This paper is concerned with the distributed averaging problem subject to a quantization constraint. Given a group of agents associated with scalar numbers, it is assumed that each pair of agents can communicate with each other with a prescribed probability, and that the data being exchanged between them is quantized. In this part of the paper, it is proved that the stochastic gossip algorithm proposed in a recent paper leads to reaching the quantized consensus. Some important properties of the system in the steady-state (after reaching the consensus) are also derived. The results developed here hold true for any arbitrary quantization, provided the tuning parameter of the gossip algorithm is chosen properly. The expected value of the convergence time bounded in the second part of the paper.