.png){kind=icon}
返回
Distributed average consensus with least-mean-square deviation
.png){kind=icon}
OA
AI
DOI：10.1016/j.jpdc.2006.08.010.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a stochastic model for distributed average consensus, which arises in applications such as load balancing for parallel processors, distributed coordination of mobile autonomous agents, and network synchronization. In this model, each node updates its local variable with a weighted average of its neighbors' values, and each new value is corrupted by an additive noise with zero mean. The quality of consensus can be measured by the total mean-square deviation of the individual variables from their average, which converges to a steady-state value. We consider the problem of finding the (symmetric) edge weights that result in the least mean-square deviation in steady state. We show that this problem can be cast as a convex optimization problem, so the global solution can be found efficiently. We describe some computational methods for solving this problem, and compare the weights and the mean-square deviations obtained by this method and several other weight design methods. (C) 2006 Elsevier Inc. All rights reserved.
Keyword:
distributed average consensus
least-mean-square
convex optimization
edge-transitive graphs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
分享收藏分享收藏DISCOVER-EEG: an open, fully automated EEG pipeline for biomarker discovery in clinical neuroscience.png)
OAAI
IF0
OAAI分享收藏
查看更多内容