Proceedings Article10.1109/CDC.2008.4738886
Quantized average consensus via dynamic coding/decoding schemes
Ruggero Carli,Francesco Bullo,Sandro Zampieri +2 more
- 01 Dec 2008
- pp 4916-4921
TL;DR: A consensus strategy in which the systems can exchange information among themselves according to a fixed connected digital communication network and two different encoding/decoding strategies are presented with theoretical and simulation results on their performance.
read more
Abstract: In the average consensus a set of linear systems has to be driven to the same final state which corresponds to the average of their initial states. This contribution presents a consensus strategy in which the systems can exchange information among themselves according to a fixed connected digital communication network. Beside the decentralized computational aspects induced by the choice of the communication network, we here have also to face the quantization effects due to the digital links. We here present and discuss two different encoding/decoding strategies with theoretical and simulation results on their performance.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Proceedings Article
Sampled-data based average consensus with logarithmic quantizers
Shuai Liu,Tao Li,Lihua Xie,Minyue Fu,Ji-Feng Zhang +4 more
- 25 Jul 2012
TL;DR: In this article, a distributed consensus protocol is proposed based on sampled measurements, which is robust to the logarithmic quantization, i.e. all the states of the agents are uniformly bounded and the gap between the state of each agent and the average value of the initial conditions converges to zero as the density of quantization levels goes to infinity.
118
•Posted Content
Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication
TL;DR: This work presents a novel gossip-based stochastic gradient descent algorithm, CHOCO-SGD, that converges at rate $\mathcal{O}\left(1/(nT) + 1/(T \delta^2 \omega)^2\right)$ for strongly convex objectives, where $T$ denotes the number of iterations and $\delta$ the eigengap of the connectivity matrix.
117
Robust self-triggered coordination with ternary controllers
Claudio De Persis,Paolo Frasca +1 more
- 26 Mar 2013
TL;DR: In this paper, a self-triggered communication policy is proposed to ensure finite-time convergence to a neighborhood of a consensus state, which does not require the agents to share a global clock, but relies on local clocks.
102
Distributed consensus for multi-agent systems with communication delays and limited data rate
Shuai Liu,Lihua Xie,Tao Li +2 more
- 07 Jul 2010
TL;DR: A distributed consensus protocol is proposed based on dynamic encoding and decoding and it is shown that for a connected network, as long as the time delays are bounded, the average consensus can be achieved with a finite-level quantizer.
77
Optimal strategies in the average consensus problem
TL;DR: It is proved that the optimal topology of communication is given by a de Bruijn graph, and it is shown that quantized communication between the agents still allows finite convergence, to a consensus, which is not in general the average of the initial positions.
76
References
Matrix analysis: Frontmatter
Roger A. Horn,Charles R. Johnson +1 more
- 01 Jan 1985
TL;DR: This book presents results of both classic and recent matrix analyses using canonical forms as a unifying theme, and demonstrates their importance in a variety of applications.
21.4K
Consensus problems in networks of agents with switching topology and time-delays
TL;DR: A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol.
•Book
Linear Matrix Inequalities in System and Control Theory
Edwin E. Yaz
- 01 Jan 1994
TL;DR: In this paper, the authors present a brief history of LMIs in control theory and discuss some of the standard problems involved in LMIs, such as linear matrix inequalities, linear differential inequalities, and matrix problems with analytic solutions.
Consensus and Cooperation in Networked Multi-Agent Systems
Reza Olfati-Saber,J.A. Fax,Richard M. Murray +2 more
- 05 Mar 2007
TL;DR: A theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees is provided.