Recursive algorithms for identification in closed loop: A unified approach and evaluation (Q1372747)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Recursive algorithms for identification in closed loop: A unified approach and evaluation |
scientific article; zbMATH DE number 1081891
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recursive algorithms for identification in closed loop: A unified approach and evaluation |
scientific article; zbMATH DE number 1081891 |
Statements
Recursive algorithms for identification in closed loop: A unified approach and evaluation (English)
0 references
30 October 1997
0 references
The authors provide a unified framework for plant model identification. After stating the basic equations associated with the identification system, they present two families of algorithms: one is the family of the closed-loop output-error recursive identification algorithms, and the other one is the family of filtering open-loop recursive identification algorithms. Moreover, for the validation of a plant model in closed loop they state the statistical validation tests that include the uncorrelation test and the whiteness test, the pole closeness validation test, and the time-domain validation test. Finally, they present the comparative evaluation of the various algorithms that include the closed-loop output-error (CLOE) algorithm, the filtered CLOE algorithm, the adaptive filtered CLOE algorithm, the extended CLOE algorithm, the generalized CLOE algorithm, and the filtered open-loop identification algorithm via three simulated examples and on a real system which is a very flexible transmission system.
0 references
robustness
0 references
stability
0 references
convergence
0 references
closed-loop output-error recursive identification
0 references
validation test
0 references
0 references
0.93632853
0 references
0.9107127
0 references
0.90225565
0 references
0.9001087
0 references
0.8959678
0 references
0.89401686
0 references