The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Resistance-Based Performance Analysis of the Consensus Algorithm over Geometric Graphs

På svenska

Author

  • Enrico Lovisari
  • Federica Garin
  • Sandro Zampieri

Summary, in English

The performance of the linear consensus algorithm is studied by using a linear quadratic (LQ) cost. The objective is to understand how the communication topology influences this algorithm. This is achieved by exploiting the analogy between Markov chains and electrical resistive networks. Indeed, this allows us to uncover the relation between the LQ performance cost and the average effective resistance of a suitable electrical network and, moreover, to show that if the communication graph fulfills some local properties, then its behavior can be approximated by that of a grid, which is a graph whose associated LQ cost is well known.

Publishing year

2013

Language

English

Pages

3918-3945

Publication/Series

SIAM Journal of Control and Optimization

Volume

51

Issue

5

Document type

Journal article

Publisher

Society for Industrial and Applied Mathematics

Topic

  • Control Engineering

Keywords

  • multiagent systems
  • consensus algorithm
  • distributed averaging
  • large-scale graphs

Status

Published

Research group

  • LCCC

ISBN/ISSN/Other

  • ISSN: 1095-7138