1999
DOI: 10.1016/s1474-6670(17)56996-7
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive decentralized control of interconnected nonlinear systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2009
2009
2012
2012

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 3 publications
0
5
0
Order By: Relevance
“…To prove this theorem we need an auxiliary lemma. This lemma is a modification of the theorem 2.19 from [2]. Lemma 2: Consider system that consists of N interconnected subsystems, where each one is described as:…”
Section: B Lipschitz-type Nonlinearitiesmentioning
confidence: 99%
“…To prove this theorem we need an auxiliary lemma. This lemma is a modification of the theorem 2.19 from [2]. Lemma 2: Consider system that consists of N interconnected subsystems, where each one is described as:…”
Section: B Lipschitz-type Nonlinearitiesmentioning
confidence: 99%
“…In order to present the main synchronization result of this paper, we need to formulate problem statement of decentralized control and Theorem 2.18 of that differs insignificantly from Theorem 7.6 of or Theorem of .…”
Section: Auxiliary Resultsmentioning
confidence: 99%
“…Adaptation algorithm is designed by the speed‐gradient method extended to decentralized control problems in . The results of are employed both for adaptation algorithm design and for the derivation of synchronization conditions. The bounds for the interconnection strengths ensuring achievement of the control goal (synchronization) are found.…”
Section: Introductionmentioning
confidence: 99%
“…In order to present the main synchronization result of this paper, we need to formulate problem statement of decentralized control and Theorem 2.18 of [11] that differs insignificantly from Theorem 7.6 of [12] or Theorem 1 of [21]. Consider ‡ a system S consisting of d interconnected subsystems (agents) S i , dynamics of each being described by the following equation:…”
Section: Speed Gradient Algorithm In Decentralized Controlmentioning
confidence: 99%
“…Adaptation algorithm is designed by the speed-gradient method extended to decentralized control problems in [11,12,21]. The results of [11,12,21] are employed both for adaptation algorithm design and for the derivation of synchronization conditions. The bounds for the interconnection strengths ensuring achievement of the control goal (synchronization) are found.…”
Section: Introductionmentioning
confidence: 99%