Open-loop worst-case identification of non-Schur plants. (Q1810571)
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: Open-loop worst-case identification of non-Schur plants. |
scientific article; zbMATH DE number 1924706
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Open-loop worst-case identification of non-Schur plants. |
scientific article; zbMATH DE number 1924706 |
Statements
Open-loop worst-case identification of non-Schur plants. (English)
0 references
9 June 2003
0 references
The authors develop an LMI based algorithm for deterministic worst case identification of nonSchur plants in an open-loop setting. The proposed technique does not require prior knowledge of a stabilizing controller. It is proved that the identified model converges, in the \(l_2\)-induced topology, to the actual plant. Results are given about upper bounds on the worst-case identification error on the finite horizon. A practical example arising in the context of robust virtual tracking illustrates this approach.
0 references
robust identification
0 references
open-loop identification
0 references
visual tracking
0 references
linear matrix inequality
0 references
worst case identification
0 references
0 references
0.8017846941947937
0 references
0.7983946800231934
0 references
0.7961082458496094
0 references
