2021
DOI: 10.48550/arxiv.2103.16653
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

New Algorithms for Discrete-Time Parameter Estimation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(11 citation statements)
references
References 0 publications
0
11
0
Order By: Relevance
“…where Γ is a gain matrix, and N k is a suitable normalization, an example of which is 1+φ T k φ k . In order to realize the learning goal, of convergence of θ k to θ * , the following property of excitation of the regressor φ k is needed [19,42,63]. We denote N + as the set of positive integers, and • as the Euclidean norm.…”
Section: Adaptive Approaches To Performance and Learningmentioning
confidence: 99%
See 4 more Smart Citations
“…where Γ is a gain matrix, and N k is a suitable normalization, an example of which is 1+φ T k φ k . In order to realize the learning goal, of convergence of θ k to θ * , the following property of excitation of the regressor φ k is needed [19,42,63]. We denote N + as the set of positive integers, and • as the Euclidean norm.…”
Section: Adaptive Approaches To Performance and Learningmentioning
confidence: 99%
“…When the regressors in ( 25) satisfy the PE condition, it can be shown using the methods in [19,42,63] that θ k converges to θ * uniformly in k. We note that if the gain matrix in ( 30) is time-varying and updated as…”
Section: Definition 1 ([72]) a Bounded Function φmentioning
confidence: 99%
See 3 more Smart Citations