Abstract
We study average consensus for directed graphs with quantized communication under fixed and switching topologies. In the presence of quantization errors, conventional consensus algorithms fail to converge and may suffer from an unbounded asymptotic mean square error. We develop robust consensus algorithms to reduce the effect of quantization. Specifically, we introduce a robust weighting matrix design and use the H∞performance index to measure the sensitivity from the quantization error to the consensus deviation. Linear matrix inequalities are used as design tools. The mean square deviation is proven to converge and its upper bound is explicitly given in the case of fixed topology with probabilistic quantization. Numerical results demonstrate the effectiveness of this method.
Original language | English |
---|---|
Pages (from-to) | 519-540 |
Number of pages | 22 |
Journal | International Journal of Adaptive Control and Signal Processing |
Volume | 27 |
Issue number | 6 |
DOIs | |
Publication status | Published - 1 Jun 2013 |
Externally published | Yes |
Keywords
- average consensus
- H norm ∞
- linear matrix inequalities
- quantization
- switching directed graph
ASJC Scopus subject areas
- Control and Systems Engineering
- Signal Processing
- Electrical and Electronic Engineering