Skip to Main Content
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 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 steady-state properties of the system (after reaching the consensus) are also derived. The results developed here hold true for any arbitrary quantization, provided that the tuning parameter of the gossip algorithm is chosen properly. The expected value of the convergence time is lower and upper bounded in the second part of the paper.
American Control Conference, 2009. ACC '09.
Date of Conference: 10-12 June 2009