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

Output synchronization for heterogeneous networks of non-introspective agents

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
208
0
1

Year Published

2014
2014
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 236 publications
(210 citation statements)
references
References 27 publications
(30 reference statements)
1
208
0
1
Order By: Relevance
“…In either case, the agents are assumed to be introspective, meaning that they have access to information about their own state or output in addition to the information received from the network. The authors have recently considered the more challenging case of heterogeneous non-introspective agents, and developed a methodology based on a distributed high-gain observer (Grip, Yang, Saberi, & Stoorvogel, 2012). However, like several other designs for heterogeneous networks (Wieland et al, 2011;, it was assumed that the agents can exchange internal controller states with neighboring agents in the network, in the same manner as in Li et al (2010).…”
Section: Introductionmentioning
confidence: 98%
“…In either case, the agents are assumed to be introspective, meaning that they have access to information about their own state or output in addition to the information received from the network. The authors have recently considered the more challenging case of heterogeneous non-introspective agents, and developed a methodology based on a distributed high-gain observer (Grip, Yang, Saberi, & Stoorvogel, 2012). However, like several other designs for heterogeneous networks (Wieland et al, 2011;, it was assumed that the agents can exchange internal controller states with neighboring agents in the network, in the same manner as in Li et al (2010).…”
Section: Introductionmentioning
confidence: 98%
“…In addition, the results in [28] make use of those in [20] and [26] to prove asymptotic synchronization over time-varying directed graphs that satisfy a uniform connectivity condition. The authors of [3] study the same consensus control problem over a fixed or timeinvariant graph topology. However it differs from [9,28] in that it considers heterogeneous nonintrospective agents.…”
Section: Introductionmentioning
confidence: 99%
“…Some recent results include [3,9,16,27,28] and references therein. The authors of [3,9,28] smartly bypass the difficulty posed by heterogeneity by embedding a homogeneous reference model into each agent's local controller. The state vectors of the local reference models are synchronized prior to achieving output consensus of the heterogeneous MAS.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations