Approximation of Dynamic Programming Algorithm for Dual Control Strategies

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F10%3A00166036" target="_blank" >RIV/68407700:21230/10:00166036 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Approximation of Dynamic Programming Algorithm for Dual Control Strategies
Original language description
The goal of all control strategies is to achieve a specified performance of the controlled system. Usually, this performance is expressed in a form of a criterion, which is to be minimized. Stochastic adaptive control gives a possibility to deal with uncertainties in system descriptions. Such approach can be further improved by gathering information about the system and thus better specify the model. The control strategy that optimally solves the problem of finding a tradeoff between control performanceand system identification is referred to as dual control strategy. Unfortunately, the complete dual problem is computationally intractable even for simple systems. In our work we propose a control strategy that is based on a one-step approximate solution of the original problem. It is based on the cautious controller, but takes into account the fact, that identification takes place in the first step of control.
Czech name
—
Czech description
—

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)