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
Quantized consensus for multi-agent networks with directed switching topologies
Li Dequan,Liu Qipeng,Wang Xiao-fan,Yin Zhi-xiang +3 more
- 26 Jul 2013
TL;DR: An effective distributed protocol with an adaptive finite-level uniform quantized strategy, under which consensus among agents can be guaranteed without utilizing existing symmetry error-compensation method is proposed.
•Posted Content
Generalized Geometric Programming for Rate Allocation in Consensus
TL;DR: This work shows for Gaussian-distributed initial states with entropy-coded scalar quantization and vector quantization that the coding rates for distributed averaging can be optimized through generalized geometric programming, and motivates the incorporation of side-information through differential or predictive coding to improve rate-distortion performance.
The model reduction of multi-agent system depended on the spanning tree of directed graph
Zhiwen Zeng,Xiangke Wang,Zhiqiang Zheng +2 more
- 01 Oct 2015
TL;DR: In this paper, the authors explore the model reduction problem based on the edge agreement dynamics of multi-agent system and derive a model reduction representation of the closed-loop MAB system based on a spanning tree subgraph.
Control of single and multiple agent systems with input and communication delays
Shuai Liu
- 01 Jan 2011
TL;DR: In this article, the authors present analytical solutions by some algebraic approaches, which can provide an insightful understanding of the control problem of time-delay systems, and present explicit optimal controllers for both finite time and infinite time horizon cases.
Average consensus and gossip algorithms in networks with stochastic asymmetric communications
Duarte Antunes,Daniel Silvestre,Carlos Silvestre +2 more
- 01 Dec 2011
TL;DR: This work considers that a set of distributed agents desire to reach consensus on the average of their initial state values, while communicating with neighboring agents through a shared medium, and proposes a linear distributed algorithm based on a state augmentation technique that achieves average consensus in a stochastic sense.
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.