Approximate Dynamic Programming via Linear Programming
暂无分享,去创建一个
The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of large-scale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach "fits" a linear combination of pre-selected basis functions to the dynamic programming cost-to-go function. We develop bounds on the approximation error and present experimental results in the domain of queueing network control, providing empirical support for the methodology.
[1] A. S. Manne. Linear Programming and Sequential Decisions , 1960 .
[2] P. Schweitzer,et al. Generalized polynomial approximations in Markovian decision processes , 1985 .
[3] J. Tsitsiklis,et al. Performance of Multiclass Markovian Queueing Networks Via Piecewise Linear Lyapunov Functions , 2001 .
[4] Benjamin Van Roy,et al. The Linear Programming Approach to Approximate Dynamic Programming , 2003, Oper. Res..