.png){kind=icon}
Return
Quantized consensus
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2007.01.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study the distributed averaging problem on arbitrary connected graphs, with the additional constraint that the value at each node is an integer. This discretized distributed averaging problem models several problems of interest, such as averaging in a network with finite capacity channels and load balancing in a processor network. We describe simple randomized distributed algorithms which achieve consensus to the extent that the discrete nature of the problem permits. We give bounds on the convergence time of these algorithms for fully connected networks and linear networks. (c) 2007 Elsevier Ltd. All rights reserved.
Keywords:
sensor fusion
quantization
distributed detection
estimation algorithms
stochastic systems
random processes
clock synchronization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveStructure of the epithelial-mesenchymal interface during early morphogenesis of the chick duodenum
PREAI
ShareSaveShareSaveComposite model predictive control for the boost converter and two-phase interleaved boost converter
OAAI
OAAIShareSaveShareSave
View more