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
Consensus conditions of continuous-time multi-agent systems with relative-state-dependent measurement noises and matrix-valued intensity functions
Tao Li,Fuke Wu,Ji-Feng Zhang +2 more
- 23 Jun 2013
TL;DR: By the tools of stochastic differential equations and algebraic graph theory, sufficient conditions are given to ensure mean square and almost sure consensus and the convergence rate and the steady-state error for average consensus are quantified.
12
•Posted Content
Efficient quantization for average consensus
TL;DR: An algorithm which solves exponentially fast the average consensus problem on strongly connected network of digital links based on an efficient zooming-in/zooming-out quantization scheme is presented.
11
Consensus of switched multi-agent systems under quantised measurements
TL;DR: It is shown that the switched multi-agent system can reach consensus exponentially with logarithmic quantiser under arbitrary switching and it is proved that the distance between the states of any pair of neighbouring agents just converges to a bounded set when uniform quantisers are utilised.
11
A note on the deployment of kinematic agents by binary information
Claudio De Persis,Ming Cao,Francesca Maria Ceragioli +2 more
- 01 Dec 2011
TL;DR: The problem of deploying continuous-time kinematic agents on a line is considered and a simple control law which achieves and maintains the formation despite the coarse information available is designed.
Adaptive motion coordination of passive systems under quantization effect
Junjie Fu,Jinzhi Wang +1 more
TL;DR: In this paper, the quantization effect on an adaptive motion coordination control law for passive multi-agent systems when the time-varying reference velocity is only available to the leader is investigated.
9
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.