Sciweavers

Share
CDC
2008
IEEE

On the convergence time of distributed quantized averaging algorithms

9 years 1 months ago
On the convergence time of distributed quantized averaging algorithms
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of these algorithms is subject to the realistic constraint that the communication rate, the memory capacities of agents and the computation precision are finite. The focus of this paper is on the study of the convergence time of the proposed quantized averaging algorithms. By appealing to random walks on graphs, we derive polynomial bounds on the expected convergence time of all the algorithms presented.
Minghui Zhu, Sonia Martínez
Added 29 May 2010
Updated 29 May 2010
Type Conference
Year 2008
Where CDC
Authors Minghui Zhu, Sonia Martínez
Comments (0)
books