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
•Posted Content
The Impact of Mobility on Gossip Algorithms
TL;DR: The influence of node mobility on the convergence time of averaging gossip algorithms in networks is studied in this article, where it is shown that a small number of fully mobile nodes can yield a significant decrease in convergence time.
66
Consensus Protocol for Multiagent Systems With Undirected Topologies and Binary-Valued Communications
TL;DR: By the two-time-scale protocol, the system is shown to achieve weak consensus and mean square consensus by using a stochastic Lyapunov analysis and the consensus speed is given.
63
•Posted Content
On the convergence time of asynchronous distributed quantized averaging algorithms
Minghui Zhu,Sonia Martinez +1 more
TL;DR: A class of distributed quantized averaging algorithms for asynchronous communication networks with fixed and switching topologies is introduced, and polynomial bounds on the expected convergence time of the algorithms presented are derived, as a function of the number of agents in the network.
63
Attainability of the minimum data rate for stabilization of linear systems via logarithmic quantization
TL;DR: It is shown that a finite-level logarithmic quantizer suffices to approach the well-known minimum average data rate for stabilizing an unstable linear discrete-time system under two basic network configurations.
62
Consensus of Multi-Agent Systems Under Binary-Valued Measurements and Recursive Projection Algorithm
TL;DR: It is proved that the estimates of the states can converge to the true states with a faster convergence rate than that in the parameter estimation.
60
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.