MPC-based approximation of dual control by information maximization
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00182343" target="_blank" >RIV/68407700:21230/11:00182343 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
MPC-based approximation of dual control by information maximization
Original language description
This paper proposes multiple-step active control algorithms based on MPC approach that approximate persistent system excitation in terms of the increase of the lowest eigenvalue of the parameter estimate information matrix. It is shown how the persistentexcitation condition is connected with a proposed concept of stability of a system with uncertain parameters. Unlike similar methods, the proposed algorithms predict the information matrix for more than one step of control. The problem is formulated asan MPC problem with an additional constraint on the information matrix. This constraint makes the problem non-convex, thus only locally optima solutions are guaranteed.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BC - Theory and management systems
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA102%2F08%2F0442" target="_blank" >GA102/08/0442: Feasible approximations of dual control strategies</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 18th International Conference on Process Control
ISBN
978-80-227-3517-9
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
247-252
Publisher name
Slovenská technická univerzita
Place of publication
Bratislava
Event location
Tatranská Lomnica
Event date
Jun 14, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—