Browse wiki

From MurrayWiki
Jump to: navigation, search
Real-valued average consensus over noisy quantized channels
Abstract This paper concerns the average consensus …
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 neighbors, 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.
entary techniques of LTI systems analysis.  +
Authors Andrea Censi, Richard M Murray  +
ID 2008p  +
Source American Control Conference (ACC)  +
Tag cm09-acc  +
Title Real-valued average consensus over noisy quantized channels +
Type Preprint  +
Categories Papers
Modification date
This property is a special property in this wiki.
15 May 2016 06:16:49  +
URL
This property is a special property in this wiki.
http://www.cds.caltech.edu/~murray/preprints/cm09-acc.pdf  +
hide properties that link here 
Real-valued average consensus over noisy quantized channels + Title
 

 

Enter the name of the page to start browsing from.