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
Signal complexity in cyclic consensus systems
Koji Tsumura
- 29 Jul 2010
TL;DR: This paper gives the transfer functions between state variables in the former case and shows the entropy of each signal, and illustrates the locations of zeros in such cyclic systems from the view point of the structure of the networks.
6
Quantized consensus for agents on digraphs
Dequan Li,Qipeng Liu,Xiaofan Wang +2 more
- 26 Jul 2011
TL;DR: Under mild assumptions on network topology, an upper bound for the quantization precision is derived to guarantee the weighted average preservation of the whole network.
6
Quantized set-membership filtering with communication constraints
Fuwen Yang,Qing-Long Han +1 more
- 28 May 2013
TL;DR: A recursive convex optimization algorithm is provided to determine a state estimation ellipsoid that is a set of states compatible with quantized measurement and unknown-but-bounded process and measurement noises.
6
Cooperative stabilization of linear multi-agent systems with limited communication data rate
Yang Meng,Tao Li +1 more
- 18 Jun 2014
TL;DR: It is shown that under mild conditions on the dynamics of agents and network topology graph, if the communication data rate is sufficiently large, then the dynamic network will achieve cooperative stabilization exponentially by properly choosing the control and observer gains.
5
•Proceedings Article
Coordinated control of second-order multi-agent systems with quantized-observer
TL;DR: It is proved that, by selecting the number of quantization levels properly, the asymptotic synchronization of the positions and velocities can be achieved, and it is shown that these conditions are also necessary in some sense.
5
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.