A resistance-based approach to consensus algorithm performance analysis

Enrico Lovisari 1, * Federica Garin 2 Sandro Zampieri 1
* Auteur correspondant
2 NECS - Networked Controlled Systems
Inria Grenoble - Rhône-Alpes, GIPSA-DA - Département Automatique
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.
Type de document :
Communication dans un congrès
49th IEEE Conference on Decision and Control, CDC 2010, Dec 2010, Atlanta (Georgia), United States. pp.5714-5719, 2010, 〈10.1109/CDC.2010.5717838〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00534493
Contributeur : Federica Garin <>
Soumis le : mardi 9 novembre 2010 - 18:29:23
Dernière modification le : jeudi 14 juin 2018 - 10:54:02

Lien texte intégral

Identifiants

Collections

Citation

Enrico Lovisari, Federica Garin, Sandro Zampieri. A resistance-based approach to consensus algorithm performance analysis. 49th IEEE Conference on Decision and Control, CDC 2010, Dec 2010, Atlanta (Georgia), United States. pp.5714-5719, 2010, 〈10.1109/CDC.2010.5717838〉. 〈inria-00534493〉

Partager

Métriques

Consultations de la notice

333