Design and Analysis of Distributed Averaging With Quantized Communication

DOI10.1109/TAC.2016.2530939MaRDI QIDQ2979336zbMATH OpenOpenAlexFDO

Authors Mahmoud El Chamie, Ji Liu, Tamer Başar

Publication date 3 May 2017

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

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

Mathematics Subject Classification ID

Distributed systems (68M14) Decentralized systems (93A14) Digital control/observation systems (93C62) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Communication theory (94A05)

Abstract: Consider a network whose nodes have some initial values, and it is desired to design an algorithm that builds on neighbor to neighbor interactions with the ultimate goal of convergence to the average of all initial node values or to some value close to that average. Such an algorithm is called generically "distributed averaging," and our goal in this paper is to study the performance of a subclass of deterministic distributed averaging algorithms where the information exchange between neighboring nodes (agents) is subject to uniform quantization. With such quantization, convergence to the precise average cannot be achieved in general, but the convergence would be to some value close to it, called quantized consensus. Using Lyapunov stability analysis, we characterize the convergence properties of the resulting nonlinear quantized system. We show that in finite time and depending on initial conditions, the algorithm will either cause all agents to reach a quantized consensus where the consensus value is the largest quantized value not greater than the average of their initial values, or will lead all variables to cycle in a small neighborhood around the average. In the latter case, we identify tight bounds for the size of the neighborhood and we further show that the error can be made arbitrarily small by adjusting the algorithm's parameters in a distributed manner.

Cited in

(15)

• An approach to quantized consensus of continuous-time linear multi-agent systems
• Synchronization of coupled harmonic oscillators using quantized sampled position data
• Multi-agent control: a graph-theoretic perspective
• Non-oscillating quantized average consensus over dynamic directed topologies
• High-threshold AVSS with optimal communication complexity
• Distributed learning of average belief over networks using sequential observations
• \( L_2\)-gain analysis for dynamic event-triggered networked control systems with packet losses and quantization
• Distributed average computation for multiple time-varying signals with output measurements
• Performance Limit for Distributed Estimation Systems With Identical One-Bit Quantizers
• Distributed Consensus With Quantized Data via Sequence Averaging
• Optimal Identical Binary Quantizer Design for Distributed Estimation
• Distributed Average Consensus With Quantization Refinement
• Reaching a consensus with limited information
• Finite time quantized average consensus with transmission stopping guarantees and no quantization error
• A composite filter-based approach to adaptive prescribed-time output-feedback control of strict-feedback nonlinear systems with output and input quantization

This page was built for publication: Design and Analysis of Distributed Averaging With Quantized Communication

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