On the convergence time of distributed quantized averaging

Minghui Zhu and Sonia Martínez
Proceedings of 47th IEEE Conference on Decision and Control, submitted

Abstract:

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 capacity 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.

File: main.pdf

Bib-tex entry:

@InProceedings{MZ-SM:08-cdc,
author = {M. Zhu and S. Mart{\'\i}nez},
booktitle = {Proceedings of the 47th Conference on Decision and Control},
title = {On the convergence time of distributed quantized averaging},
year = {2008},
address = {Cancún, Mexico},
note = {To appear}
}