2022 American Control Conference (ACC) 2022
DOI: 10.23919/acc53348.2022.9867849
|View full text |Cite
|
Sign up to set email alerts
|

Recursive Least Squares with Variable-Rate Forgetting Based on the F-Test

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…The PCAC algorithm is presented in this section. Subsection III-A describes the technique used for online identification, namely, RLS with variable-rate forgetting based on the F-test [25]. Subsection III-B presents the block observable canonical form (BOCF), which is used to represent the inputoutput dynamics model as a state space model whose state is given explicitly in terms of inputs, outputs, and modelcoefficient estimates.…”
Section: Predictive Cost Adaptive Controlmentioning
confidence: 99%
See 2 more Smart Citations
“…The PCAC algorithm is presented in this section. Subsection III-A describes the technique used for online identification, namely, RLS with variable-rate forgetting based on the F-test [25]. Subsection III-B presents the block observable canonical form (BOCF), which is used to represent the inputoutput dynamics model as a state space model whose state is given explicitly in terms of inputs, outputs, and modelcoefficient estimates.…”
Section: Predictive Cost Adaptive Controlmentioning
confidence: 99%
“…and Ψ 0 is the performance-regularization weighting in (16). Additional details concerning RLS with forgetting based on the F-distribution are given in [25].…”
Section: A Online Identification Using Recursive Least Squares Withmentioning
confidence: 99%
See 1 more Smart Citation