TY  - CONF
N2  - Efforts to cope with the curse of dimensionality in Dynamic Programming (DP) follow two main directions: i) problem simplification by simpler models and ii) use of smart approximators for the cost-to-go and/or policy functions. Here we focus on ii). We consider: a) structural properties of the cost-to-go and/or policy functions (to restrict approximation to certain function classes and to chose the approximators); b) suitable norms of the approximation error (to estimate how it propagates through stages). These ingredients can be combined to develop efficient approximate
DP algorithms.
M2  - Prague, Czech Republic
A1  - Gnecco, Giorgio
A1  - Sanguineti, Marcello
A1  - Zoppoli, Riccardo
UR  - http://eprints.imtlucca.it/1763/
Y1  - 2007///
AV  - none
TI  - Exploiting Structural Results in Approximate Dynamic Programming
T2  - EURO XXII
N1  - 22nd European Conference on operational research
ID  - eprints1763
ER  -