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
Output feedback control for uncertain nonlinear systems with input quantization
TL;DR: A new adaptive output-feedback tracking control scheme for a class of uncertain nonlinear systems with input quantized by a newly-proposed quantizer, which has the advantages of both logarithmic and uniform quantizers in ensuring reducible communication expenses and acceptable quantization errors for better system performances.
244
•Posted Content
Gossip consensus algorithms via quantized communication
TL;DR: This paper considers the average consensus problem on a network of digital links, and proposes a set of algorithms based on pairwise ''gossip'' communications and updates, which study the convergence properties of such algorithms with the goal of answering two design questions.
187
Distributed Coordination of Multi-Agent Systems With Quantized-Observer Based Encoding-Decoding
TL;DR: This paper considers distributed coordination of discrete-time second-order multi-agent systems with partially measurable state and a limited communication data rate, and a quantized-observer based encoding-decoding scheme is designed, which integrates the state observation with encoding/decoding.
168
Distributed consensus over digital networks with limited bandwidth and time-varying topologies
TL;DR: It is proved that if the network is jointly connected, average-consensus can be asymptotically achieved, and the convergence rate is quantified, and if the duration of any link failure in thenetwork is bounded, then the control gain and the scaling function can be selected properly such that 5-level quantizers suffice for asymPTotic average- Consensus with an exponential convergence rate.
140
Distributed robust control of linear multi-agent systems with parameter uncertainties
TL;DR: It is shown for both the continuous- and discrete-time cases that the distributed robust control problems under such controllers in the sense of quadratic stability are equivalent to the H ∞ control problems of a set of decoupled linear systems having the same dimensions as a single agent.
127
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.