On the convergence time of asynchronous distributed quantized averaging algorithms

Minghui Zhu, Sonia Martinez

Research output: Contribution to journalArticlepeer-review

49 Scopus citations

Abstract

We introduce here a class of distributed quantized averaging algorithms for asynchronous communication networks with fixed and switching topologies. The focus of this technical note 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 the algorithms presented, as a function of the number of agents in the network.

Original languageEnglish (US)
Article number5638610
Pages (from-to)386-390
Number of pages5
JournalIEEE Transactions on Automatic Control
Volume56
Issue number2
DOIs
StatePublished - Feb 2011

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'On the convergence time of asynchronous distributed quantized averaging algorithms'. Together they form a unique fingerprint.

Cite this