Average consensus on networks with quantized communication | Zendy

Frasca Paolo | Zendy; Carli Ruggero | Zendy; Fagnani Fabio | Zendy; Zampieri Sandro | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Average consensus on networks with quantized communication

Author(s) -

Frasca Paolo,

Carli Ruggero,

Fagnani Fabio,

Zampieri Sandro

Publication year - 2008

Publication title -

international journal of robust and nonlinear control

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.361

H-Index - 106

eISSN - 1099-1239

pISSN - 1049-8923

DOI - 10.1002/rnc.1396

Subject(s) - probabilistic logic , quantization (signal processing) , computer science , simple (philosophy) , mathematical optimization , matrix (chemical analysis) , algorithm , mathematics , artificial intelligence , philosophy , materials science , epistemology , composite material

This work presents a contribution to the solution of the average agreement problem on a network with quantized links. Starting from the well‐known linear diffusion algorithm, we propose a simple and effective adaptation that is able to preserve the average of states and to drive the system near to the consensus value, when a uniform quantization is applied to communication between agents. The properties of this algorithm are investigated both by a worst‐case analysis and by a probabilistic analysis, and are shown to depend on the spectral properties of the evolution matrix. A special attention is devoted to the issue of the dependence of the performance on the number of agents, and several examples are given. Copyright © 2008 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research