On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms

DOI10.1109/TAC.2010.2093276MaRDI QIDQ5347612zbMATH OpenOpenAlexFDO

Authors Minghui Zhu, Sonia Martínez

Publication date 25 August 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1002.2246

Mathematics Subject Classification ID

Random walks on graphs (05C81) Sums of independent random variables; random walks (60G50) Network design and communication in computer systems (68M10)

Abstract: We come up with a class of distributed quantized averaging algorithms on 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 the algorithms presented.

Cited in

(15)

• Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks
• Distributed parameter estimation in unreliable WSNs: quantized communication and asynchronous intermittent observation
• Distributed filtering for uncertain systems under switching sensor networks and quantized communications
• Consensus in time-delayed multi-agent systems with quantized dwell times
• Adaptive output feedback consensus tracking for linear multi-agent systems with unknown dynamics
• Average consensus of continuous-time multi-agent systems with quantized communication
• Distributed subgradient method for multi-agent optimization with quantized communication
• Convergence Time for Unbiased Quantized Consensus Over Static and Dynamic Networks
• Distributed Consensus With Quantized Data via Sequence Averaging
• Distributed Average Consensus With Quantization Refinement
• Duality and Stability in Complex Multiagent State-Dependent Network Dynamics
• A simple framework for stability analysis of state-dependent networks of heterogeneous agents
• Localization and approximations for distributed non-convex optimization
• Fast discrete consensus based on gossip for makespan minimization in networked systems
• Adaptive output feedback consensus tracking for heterogeneous multi-agent systems with unknown dynamics under directed graphs

This page was built for publication: On the Convergence Time of Asynchronous Distributed Quantized Averaging Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347612)