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
Self-Triggered Network Coordination over Noisy Communication Channels.
TL;DR: A novel coordination scheme is proposed, which ensures practical consensus in the noiseless case, while preserving boundedness and coordination properties in the noisy case, and is suitable for practical implementation in distributed sensor networks.
5
Reaching consensus in unbalanced networks with coarse information communication
Dequan Li,Zongli Lin +1 more
TL;DR: In this article, the authors considered the problem of seeking consensus for a network of agents under a fixed or switching directed communication topology, where each agent is modeled as discrete-time first-order dynamics and interacts with its neighbors via logarithmically quantized information.
4
Channel Model Identification in Wireless Sensor Networks Using a Fully Distributed Quantized Consensus Algorithm
Angelo Cenedese,Filippo Zanella +1 more
TL;DR: A distributed least-square algorithm is presented that complies with the constraint of transmitting only integer data through the wireless communication, which often characterizes WSAN embedded architectures and mitigates the effects of the rounding operations applied to the wireless exchanged floating data.
4
Distributed consensus over directed networks with limited information communication
Dequan Li,Qipeng Liu,Xiaofan Wang,Zongli Lin +3 more
- 01 Dec 2011
TL;DR: It is established that, by designing a protocol with a finite-level uniform quantized scheme, merely one bit quantized information transmitting along each connected directed channel suffices for achieving weighted average consensus with an exponential convergence rate, as long as the directed network is strongly connected.
4
Quantized consensus of first-order multi-agent systems under directed communication topologies
Jianzhen Li,Shuxia Ye +1 more
- 12 Jun 2013
TL;DR: It is proved that for any network topology that has a directed spanning tree, consensus is achieved if the quantization accuracy parameter and the sampling period are small enough.
3
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.