Continuous-time and sampled-data-based average consensus with logarithmic quantizers

164Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper considers the average consensus problem for multi-agent systems with continuous-time first-order dynamics. Logarithmic quantization is considered in the communication channels, and continuous-time and sampled-data-based protocols are proposed. For the continuous-time protocol, we give an explicit upper bound of the consensus error in terms of the initial states, the quantization density and the parameters of the network graph. It is shown that in contrast with the case with uniform quantization, the consensus error in the logarithmic quantization case is always uniformly bounded, independent of the quantization density, and the β-asymptotic average consensus is ensured under the proposed protocol, i.e. the asymptotic consensus error converges to zero as the sector bound β of the logarithmic quantizer approaches zero. For the sampled-data-based protocol, we give sufficient conditions on the sampling interval to ensure the β-asymptotic average consensus. Numerical examples are given to demonstrate the effectiveness of the protocols. © 2013 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Liu, S., Li, T., Xie, L., Fu, M., & Zhang, J. F. (2013). Continuous-time and sampled-data-based average consensus with logarithmic quantizers. Automatica, 49(11), 3329–3336. https://doi.org/10.1016/j.automatica.2013.07.016

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free