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
Self-Triggered Network Coordination Over Noisy Communication Channels
TL;DR: A novel coordination scheme is introduced which ensures boundedness of the state trajectories and a linear map from the noise to the nodes disagreement value and does not require any global information on the network parameters and/or the operating environment (the noise characteristics).
Quantized consensus with finite data rate under directed topologies
Yao Wang,Qinghe Wu,Yinqiu Wang +2 more
- 01 Dec 2011
TL;DR: A distributed algorithm is proposed to achieve quantized consensus asymptotically with as few as only one bit information exchange at each time step to solve the consensus problems in directed networks under communication constraints.
Adaptive Tracking Control for a Class of Uncertain Nonlinear Multi-Agent Systems With Input Quantization Based on Neural Approach
TL;DR: Based on an important property of nonlinear decomposition for quantizer, a distributed quantized feedback tracking control scheme is successfully proposed to ensure the stability of the whole systems and the implementation of synchronous tracking.
Finite-Level Quantized Synchronization of Discrete-Time Linear Multiagent Systems with Switching Topologies
Yang Meng,Tao Li,Ji-Feng Zhang +2 more
TL;DR: This paper studies the synchronization of discrete-time linear multiagent systems with finite communication data rate and switching topology flows, and shows that if the pairs of agents' state matrices and control matrices multiplied by Laplacian eigenvalues of the weakly connected components are simultaneously stabilizable, then there exist protocols leading to synchronization exponentially fast.
7
Finite-time convergence policies in state-dependent social networks
Daniel Silvestre,Paulo Rosa,Joao P. Hespanha,Carlos Silvestre +3 more
- 01 Jul 2015
TL;DR: Two novel strategies are presented that enable finite-time convergence in a social network for a political party or an association, modeled as a distributed iterative system with a graph dynamics chosen to mimic how people interact.
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.