Average consensus with weighting matrix design for quantized communication on directed switching graphs

Shuai Li, Yi Guo, Jun Fang, Hongbin Li

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

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 languageEnglish
Pages (from-to)519-540
Number of pages22
JournalInternational Journal of Adaptive Control and Signal Processing
Volume27
Issue number6
DOIs
StatePublished - Jun 2013

Keywords

  • H norm
  • average consensus
  • linear matrix inequalities
  • quantization
  • switching directed graph

Fingerprint

Dive into the research topics of 'Average consensus with weighting matrix design for quantized communication on directed switching graphs'. Together they form a unique fingerprint.

Cite this