2014
DOI: 10.1016/j.automatica.2013.12.026
|View full text |Cite|
|
Sign up to set email alerts
|

A distributed algorithm for average consensus on strongly connected weighted digraphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
39
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 44 publications
(40 citation statements)
references
References 13 publications
0
39
0
Order By: Relevance
“…It can still be satisfied even if the communication graph among the followers does not contain any directed spanning tree. Moreover, different from the existing results based on an assumption that the communication topology of the multiple agents always meets some connection conditions [32,33], our assumption is weak and practical because the connected condition is not required to be satisfied in the whole execution cycle.…”
Section: Remarkmentioning
confidence: 94%
“…It can still be satisfied even if the communication graph among the followers does not contain any directed spanning tree. Moreover, different from the existing results based on an assumption that the communication topology of the multiple agents always meets some connection conditions [32,33], our assumption is weak and practical because the connected condition is not required to be satisfied in the whole execution cycle.…”
Section: Remarkmentioning
confidence: 94%
“…
a b s t r a c tThis 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.
…”
mentioning
confidence: 99%
“…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.…”
mentioning
confidence: 99%
“…Its size is controlled by exploiting a design parameter. In [31], a distributed algorithm for average consensus that solves the discrete-time average consensus problem on strongly connected weighted digraphs is presented. Its principle lays in the computation of the average value using the estimation of the left eigenvector associated with the zero eigenvalue of the Laplacian matrix.…”
Section: Related Workmentioning
confidence: 99%