Efficient quantization in the average consensus problem

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

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 mathematical problem can be seen as the simplest example of coordination task and in fact it can be used to model both the control of multiple autonomous vehicles which all have to be driven to the centroid of the initial positions, and to model the decentralized estimation of a quantity from multiple measure coming from distributed sensors. In general we can expect that the performance of a consensus strategy will be strongly related to the amount of information the agents exchange each other. This contribution presents a consensus strategy in which the exchanged data are symbols and not real numbers. This is based on a logarithmic quantizer based state estimator. The stability of this technique is then analyzed. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Carli, R., & Zampieri, S. (2007). Efficient quantization in the average consensus problem. Lecture Notes in Control and Information Sciences, 353, 31–49. https://doi.org/10.1007/978-3-540-70701-1_2

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