Browse wiki
From MurrayWiki
On Quantized Consensus by Means of Gossip Algorithm  Part I: Convergence Proof 
Abstract 
This paper is concerned with the distribut … 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 steadystate (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. e bounded in the second part of the paper. +


Authors  Javad Lavaei, Richard M Murray + 
ID  2008q + 
Source  American Control Conference (ACC) + 
Tag  lm09aacc + 
Title  On Quantized Consensus by Means of Gossip Algorithm  Part I: Convergence Proof + 
Type  Preprint + 
Categories  Papers 
Modification date This property is a special property in this wiki.

15 May 2016 06:16:48 + 
URL This property is a special property in this wiki.

http://www.cds.caltech.edu/~murray/preprints/lm09aacc.pdf + 
hide properties that link here 
On Quantized Consensus by Means of Gossip Algorithm  Part I: Convergence Proof +  Title 
