Referenced Items are not available for this document.
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.
Published in:
Automatic Control, IEEE Transactions on
(Volume:56
,
Issue:
2
)
Date of Publication: Feb. 2011
- Page(s):
- 386 - 390
- ISSN :
- 0018-9286
- INSPEC Accession Number:
- 11794063
- Digital Object Identifier :
- 10.1109/TAC.2010.2093276
- Product Type:
- Journals & Magazines
- Date of Publication :
- 18 November 2010
- Date of Current Version :
- 07 February 2011
- Issue Date :
- Feb. 2011
- Sponsored by :
- IEEE Control Systems Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
