Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

4
662
1
2

Year Published

2012
2012
2016
2016

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 1,204 publications
(669 citation statements)
references
References 31 publications
4
662
1
2
Order By: Relevance
“…We assume that there exists a constant number τ > 0, often called dwell time, such that t l+1 (Ni and Cheng, 2010). Define C (p) = {k|λ k p ̸ = 0, k = 1, 2, · · · , N }, we have the following Lemma (Ni and Cheng, 2010):…”
Section: Decentralized Adaptive Consensus Algorithm Designmentioning
confidence: 99%
See 2 more Smart Citations
“…We assume that there exists a constant number τ > 0, often called dwell time, such that t l+1 (Ni and Cheng, 2010). Define C (p) = {k|λ k p ̸ = 0, k = 1, 2, · · · , N }, we have the following Lemma (Ni and Cheng, 2010):…”
Section: Decentralized Adaptive Consensus Algorithm Designmentioning
confidence: 99%
“…The matrix H σ(t) corresponding to a graphḠ σ(t) , has the following well-known properties (Ni and Cheng, 2010):…”
Section: Stability Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…Consensus problem with fixed and switching topologies with linear dynamics are addressed in [3]. In [4], Mahmoud address the consensus problem of fixed and switching topologies with disturbances by designing the output feedback controller.…”
Section: Introductionmentioning
confidence: 99%
“…In [2], consensus problem for fixed and switching topologies leader-following higher order MAS having linear dynamics is considered using local information. Algebraic graph theory, Riccati and Lyapunov inequalities are used for system design.…”
Section: Introductionmentioning
confidence: 99%