Performance metrics in the average consensus problem: a tutorial
(2012) In Annual Reviews in Control 36(1). p.26-41- Abstract
- The average consensus algorithm is a distributed procedure which allows a network of agents to agree on the average of a set of initial values. The computation occurs through local exchange of information only, namely the information exchange takes place only between agents which are neighbors with respect to a graph representing the system communication architecture. Several performance metrics have been proposed for the evaluation of this algorithm. Particularly interesting and challenging is to relate them to the communication topology. Different performance metrics may yield different answers in comparing alternative communication topologies. In this paper, we present a few performance metrics and we show how these metrics are related... (More)
- The average consensus algorithm is a distributed procedure which allows a network of agents to agree on the average of a set of initial values. The computation occurs through local exchange of information only, namely the information exchange takes place only between agents which are neighbors with respect to a graph representing the system communication architecture. Several performance metrics have been proposed for the evaluation of this algorithm. Particularly interesting and challenging is to relate them to the communication topology. Different performance metrics may yield different answers in comparing alternative communication topologies. In this paper, we present a few performance metrics and we show how these metrics are related to the communication topology. In particular, when available, we present bounds which permit to relate performance and topology for general graphs, for graphs with symmetries, called d-dimensional tori, and for geometric graphs. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3410392
- author
- Lovisari, Enrico LU and Zampieri, Sandro
- organization
- publishing date
- 2012
- type
- Contribution to journal
- publication status
- published
- subject
- in
- Annual Reviews in Control
- volume
- 36
- issue
- 1
- pages
- 26 - 41
- publisher
- Elsevier
- external identifiers
-
- scopus:84860535104
- ISSN
- 1872-9088
- DOI
- 10.1016/j.arcontrol.2012.03.003
- language
- English
- LU publication?
- no
- id
- ebd4b888-9220-46cc-b551-db31a6968d2e (old id 3410392)
- date added to LUP
- 2016-04-01 10:49:17
- date last changed
- 2022-01-26 02:49:38
@article{ebd4b888-9220-46cc-b551-db31a6968d2e,
abstract = {{The average consensus algorithm is a distributed procedure which allows a network of agents to agree on the average of a set of initial values. The computation occurs through local exchange of information only, namely the information exchange takes place only between agents which are neighbors with respect to a graph representing the system communication architecture. Several performance metrics have been proposed for the evaluation of this algorithm. Particularly interesting and challenging is to relate them to the communication topology. Different performance metrics may yield different answers in comparing alternative communication topologies. In this paper, we present a few performance metrics and we show how these metrics are related to the communication topology. In particular, when available, we present bounds which permit to relate performance and topology for general graphs, for graphs with symmetries, called d-dimensional tori, and for geometric graphs.}},
author = {{Lovisari, Enrico and Zampieri, Sandro}},
issn = {{1872-9088}},
language = {{eng}},
number = {{1}},
pages = {{26--41}},
publisher = {{Elsevier}},
series = {{Annual Reviews in Control}},
title = {{Performance metrics in the average consensus problem: a tutorial}},
url = {{https://lup.lub.lu.se/search/files/2159200/8168800.pdf}},
doi = {{10.1016/j.arcontrol.2012.03.003}},
volume = {{36}},
year = {{2012}},
}