.png){kind=icon}
返回
Performance metrics in the average consensus problem: A tutorial
.png){kind=icon}
OA
AI
DOI：10.1016/j.arcontrol.2012.03.003.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Linear consensus
Graph theory
Sensor networks
Cayley graphs
Geometric graphs
Distributed estimation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
830
被引数:
5.9K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容