.png){kind=icon}
.png){kind=icon}
Return
Average consensus on strongly connected weighted digraphs: A generalized error bound
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2015.04.025.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This technical communique represents a generalization of the convergence analysis for the consensus algorithm proposed in Priolo et al. (2014). Although the consensus was reached for any strongly connected weighted digraphs (SCWD), the convergence analysis provided in Priolo et al. (2014) was only valid for diagonalizable matrices encoding a SCWD. The result we present here generalizes the previous one to all possible matrices encoding a SCWD that can be used in the algorithm. (C) 2015 Elsevier Ltd. All rights reserved.
Keywords:
Average consensus
Digraphs
Broadcast communication
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