A resistance–based approach to consensus algorithm performance analysis

Federica Garin, Enrico Lovisari, Sandro Zampieri

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

3 Citations (SciVal)
93 Downloads (Pure)

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.
Original languageEnglish
Title of host publication49th IEEE Conference on Decision and Control (CDC), 2010
PublisherIEEE - Institute of Electrical and Electronics Engineers Inc.
Pages5714-5719
ISBN (Print)78-1-4244-7745-6
DOIs
Publication statusPublished - 2010
Event49th IEEE Conference on Decision and Control - Atlanta, Georgia, United States
Duration: 2010 Dec 15 → …

Conference

Conference49th IEEE Conference on Decision and Control
Country/TerritoryUnited States
CityAtlanta, Georgia
Period2010/12/15 → …

Subject classification (UKÄ)

  • Control Engineering

Fingerprint

Dive into the research topics of 'A resistance–based approach to consensus algorithm performance analysis'. Together they form a unique fingerprint.

Cite this