Browse wiki
From MurrayWiki
Quantized Consensus via Adaptive Stochastic Gossip Algorithm 
Abstract 
This paper is concerned with the distribut … This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitting on the vertices of the graph, the policy is to pick an edge at random and update the values on its ending vertices based on some rules, but only in terms of the quantized data being exchanged between them. Our recent paper showed that the quantized consensus is reached under a simple updating protocol which deploys a fixed tuning factor. The current paper allows the tuning factor to be timedependent in order to achieve two goals. First, this makes it possible to study the numerical stability of the protocol with a fixed tuning factor under a small perturbation of this parameter. Furthermore, exploiting a timevarying tuning factor facilitates the implementation of the consensus protocol and pushes the steady state of the system towards an equilibrium point, as opposed to making it oscillatory. The current paper is an important extension of our recent work, which generalizes a finitedimensional problem toan infinitedimensional one that is more challenging in nature. al one that is more challenging in nature. +


Authors  Javad Lavaei, Richard M Murray + 
ID  2009f + 
Source  Conference on Decision and Control (CDC) + 
Tag  lm09cdc + 
Title  Quantized Consensus via Adaptive Stochastic Gossip Algorithm + 
Type  Preprint + 
Categories  Papers 
Modification date This property is a special property in this wiki.

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

http://www.cds.caltech.edu/~murray/preprints/lm09cdc.pdf + 
hide properties that link here 
Quantized Consensus via Adaptive Stochastic Gossip Algorithm +  Title 
