Open AccessPosted 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.
read more
Abstract: This paper presents an algorithm which solves exponentially fast the average consensus problem on strongly connected network of digital links. The algorithm is based on an efficient zooming-in/zooming-out quantization scheme.
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
Continuous-time and sampled-data-based average consensus with logarithmic quantizers
TL;DR: It is proved that as long as the quantization levels are dense enough, the proposed protocol is robust to the logarithmic quantization, i.e. all the states of the agents are uniformly bounded and the gap between the state of each agent and the average value of the initial conditions converges to zero as the density ofquantization levels goes to infinity.
167
•Proceedings Article
Sampled-data based average consensus with logarithmic quantizers
Shuai Liu,Tao Li,Lihua Xie,Minyue Fu,Ji-Feng Zhang +4 more
- 25 Jul 2012
TL;DR: In this article, a distributed consensus protocol is proposed based on sampled measurements, which is robust to the logarithmic quantization, i.e. all the states of the agents are uniformly bounded and the gap between the state of each agent and the average value of the initial conditions converges to zero as the density of quantization levels goes to infinity.
118
Distributed consensus for multi-agent systems with communication delays and limited data rate
Shuai Liu,Lihua Xie,Tao Li +2 more
- 07 Jul 2010
TL;DR: A distributed consensus protocol is proposed based on dynamic encoding and decoding and it is shown that for a connected network, as long as the time delays are bounded, the average consensus can be achieved with a finite-level quantizer.
77
Leader-following consensus of nonlinear discrete-time multi-agent systems with limited communication channel capacity
Jia Wu,Huaqing Li,Xin Chen +2 more
TL;DR: It is proved that under the consensus algorithm designed, the leader-following consensus is achievable and the quantizers equipped for the multi-agent systems can never be saturated.
13
Quadratic stabilization for linear time-delay systems with a logarithmic quantizer
Yan He,Yue-E Wang,Xin-Mei Li +2 more
TL;DR: It is proposed that a LTI time-delay system via the linear state feedback and quantization is quadratic stabilization if and only if the corresponding uncertain auxiliary system is quadRatic stabilization under the case of the single control input or the multiple control inputs.
7
References
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.
Control under communication constraints
TL;DR: This paper forms a control problem with a communication channel connecting the sensor to the controller, and provides upper and lower bounds on the channel rate required to achieve different control objectives.
Quantized feedback stabilization of linear systems
TL;DR: A new control design methodology is proposed, which relies on the possibility of changing the sensitivity of the quantizer while the system evolves, which yields global asymptotic stability.
A scheme for robust distributed sensor fusion based on average consensus
Lin Xiao,Stephen Boyd,Sanjay Lall +2 more
- 24 Apr 2005
TL;DR: This work proposes a simple distributed iterative scheme, based on distributed average consensus in the network, to compute the maximum-likelihood estimate of the parameters, and shows that it works in a network with dynamically changing topology, provided that the infinitely occurring communication graphs are jointly connected.
Feedback Control Under Data Rate Constraints: An Overview
Girish N. Nair,Fabio Fagnani,Sandro Zampieri,Robin J. Evans +3 more
- 05 Mar 2007
TL;DR: In this article, the authors review the results available in the literature on data-rate-limited control for linear systems and show how fundamental tradeoffs between the data rate and control goals, such as stability, mean entry times, and asymptotic state norms, emerge naturally.
1.1K