Censi, Andrea and Murray, Richard M. (2009) Real-valued average consensus over noisy quantized channels. In: American Control Conference, 2009. IEEE , pp. 4361-4366. ISBN 978-1-4244-4523-3 http://resolver.caltech.edu/CaltechAUTHORS:20100507-133036019
- Published Version
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20100507-133036019
This paper concerns the average consensus problem with the constraint of quantized communication between nodes. A broad class of algorithms is analyzed, in which the transmission strategy, which decides what value to communicate to the neighbours, can include various kinds of rounding, probabilistic quantization, and bounded noise. The arbitrariness of the transmission strategy is compensated by a feedback mechanism which can be interpreted as a self-inhibitory action. The result is that the average of the nodes state is not conserved across iterations, and the nodes do not converge to a consensus; however, we show that both errors can be made as small as desired. Bounds on these quantities involve the spectral properties of the graph and can be proved by employing elementary techniques of LTI systems analysis.
|Item Type:||Book Section|
|Additional Information:||© 2009 AACC. Thanks to Li Na for disproving a conjecture of ours, and to the anonymous reviewers for the thorough remarks.|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Tony Diaz|
|Deposited On:||16 May 2010 21:51|
|Last Modified:||26 Dec 2012 12:01|
Repository Staff Only: item control page