2013 American Control Conference 2013
DOI: 10.1109/acc.2013.6580006
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive estimation using multiagent network identifiers with undirected and directed graph topologies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(5 citation statements)
references
References 13 publications
0
5
0
Order By: Relevance
“…This proves that g ∈ W, and hence W is norm closed. The analysis above in Equations ( 10) and (11) has been carried out under the assumption that the number agents N = 1. But modifications for N > 1 simply replaces the operator E *…”
Section: Lemmamentioning
confidence: 99%
See 4 more Smart Citations
“…This proves that g ∈ W, and hence W is norm closed. The analysis above in Equations ( 10) and (11) has been carried out under the assumption that the number agents N = 1. But modifications for N > 1 simply replaces the operator E *…”
Section: Lemmamentioning
confidence: 99%
“…Problems of this type are studied in the family of papers. [9][10][11] These formulations are quite general and are formulated for systems where the evolution laws for the agents are defined in terms of Gelfand triples, with the constituent operators satisfying some standard boundedness and coercivity properties for common DPS. In these papers the agent states evolve in an infinite dimensional state space, in contrast to the situation here.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations