Original title: Approximate Dynamic Programming based on High Dimensional Model Representation
Authors: Pištěk, Miroslav
Document type: Research reports
Year: 2011
Language: eng
Series: Research Report, volume: 2310
Abstract: 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.
Keywords: Bellman equation; HDMR approximation; minimization of HDMR functions
Project no.: CEZ:AV0Z10750506 (CEP), GAP102/11/0437 (CEP)
Funding provider: GA ČR

Institution: Institute of Information Theory and Automation AS ČR (web)
Document availability information: Fulltext is available at external website.
External URL: http://library.utia.cas.cz/separaty/2012/AS/pistek-approximate dynamic programming based on high dimensional model representation.pdf
Original record: http://hdl.handle.net/11104/0203627

Permalink: http://www.nusl.cz/ntk/nusl-80968


The record appears in these collections:
Research > Institutes ASCR > Institute of Information Theory and Automation
Reports > Research reports