Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

In English

Författare

  • 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.

Publiceringsår

2013

Språk

Engelska

Sidor

3918-3945

Publikation/Tidskrift/Serie

SIAM Journal of Control and Optimization

Volym

51

Issue

5

Dokumenttyp

Artikel i tidskrift

Förlag

Society for Industrial and Applied Mathematics

Ämne

  • Control Engineering

Nyckelord

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

Status

Published

Forskningsgrupp

  • LCCC

ISBN/ISSN/Övrigt

  • ISSN: 1095-7138