Approximate Dynamic Programming based on High Dimensional Model Representation

0369603 - ÚTIA 2012 CZ eng V - Výzkumná zpráva
Pištěk, Miroslav
Approximate Dynamic Programming based on High Dimensional Model Representation.
2310. - Praha: ÚTIA AV ČR, v.v.i, 2011. 14 s. Research Report, 2310.
Grant CEP: GA ČR(CZ) GAP102/11/0437
Výzkumný záměr: CEZ:AV0Z10750506
Klíčová slova: HDMR approximation * Bellman equation * minimization of HDMR functions
Kód oboru RIV: BC - Teorie a systémy řízení
http://library.utia.cas.cz/separaty/2012/AS/pistek-approximate dynamic programming based on high dimensional model representation.pdf

In this article, an efficient algorithm for an optimal decision strategy approximation is introduced. The proposed approximation of the Bellman equation is based on HDMR technique. This non-parametric function approximation is used not only to reduce memory demands necessary to store Bellman function, but also to allow its fast approximate minimization. On that account, a clear connection between HDMR minimization and discrete optimization is newly established. In each time step of the backward evaluation of the Bellman function, we relax the parameterized discrete minimization subproblem to obtain parameterized trust region problem. We observe that the involved matrix is the same for all parameters owning to the structure of HDMR approximation. We find eigenvalue decomposition of this matrix to solve all trust region problems effectively.
Trvalý link: http://hdl.handle.net/11104/0203627