Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

A resistance–based approach to consensus algorithm performance analysis

Garin, Federica ; Lovisari, Enrico LU and Zampieri, Sandro (2010) 49th IEEE Conference on Decision and Control p.5714-5719
Abstract
We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. In order to do this, we recall the analogy between Markov Chains and electrical resistive networks. By exploiting this analogy, we are able to rewrite the performance cost as the average effective resistance on a suitable network. We use this result to show that if the communication graph fulfills some local properties, then its behavior can be approximated with that of a suitable grid, over which the behavior of the cost is known.
Please use this url to cite or link to this publication:
author
; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
host publication
49th IEEE Conference on Decision and Control (CDC), 2010
pages
5714 - 5719
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
conference name
49th IEEE Conference on Decision and Control
conference location
Atlanta, Georgia, United States
conference dates
2010-12-15
external identifiers
  • scopus:79953150196
ISBN
78-1-4244-7745-6
DOI
10.1109/CDC.2010.5717838
language
English
LU publication?
no
id
c4f1d0ce-ccc6-44a3-90a6-0d86b5433a78 (old id 3409930)
date added to LUP
2016-04-04 11:02:48
date last changed
2022-01-29 21:14:47
@inproceedings{c4f1d0ce-ccc6-44a3-90a6-0d86b5433a78,
  abstract     = {{We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. In order to do this, we recall the analogy between Markov Chains and electrical resistive networks. By exploiting this analogy, we are able to rewrite the performance cost as the average effective resistance on a suitable network. We use this result to show that if the communication graph fulfills some local properties, then its behavior can be approximated with that of a suitable grid, over which the behavior of the cost is known.}},
  author       = {{Garin, Federica and Lovisari, Enrico and Zampieri, Sandro}},
  booktitle    = {{49th IEEE Conference on Decision and Control (CDC), 2010}},
  isbn         = {{78-1-4244-7745-6}},
  language     = {{eng}},
  pages        = {{5714--5719}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  title        = {{A resistance–based approach to consensus algorithm performance analysis}},
  url          = {{https://lup.lub.lu.se/search/files/5681928/3409939.pdf}},
  doi          = {{10.1109/CDC.2010.5717838}},
  year         = {{2010}},
}