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

Asymptotic properties of consensus-type algorithms for networked systems with regime-switching topologies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
36
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 50 publications
(36 citation statements)
references
References 24 publications
0
36
0
Order By: Relevance
“…In the above, the noise W d n is additive. Much more general noise can be treated as demonstrated in [20]. The following assumption is imposed on the network.…”
Section: Preliminariesmentioning
confidence: 99%
See 3 more Smart Citations
“…In the above, the noise W d n is additive. Much more general noise can be treated as demonstrated in [20]. The following assumption is imposed on the network.…”
Section: Preliminariesmentioning
confidence: 99%
“…In addition to the switching topology, nonadditive noise was treated and convergence and rates of convergence for the corresponding recursive algorithms were provided. In this paper, we extend some of the useful features of [20]. One of the new significant developments is to treat weighted and constrained consensus.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Consensus control is an emerging field in networked control [13][14][15][16]. At present, most consensus controls are unconstrained.…”
Section: Introductionmentioning
confidence: 99%