Shrinking-horizon dynamic programming

doi:10.1002/rnc.1566

Shrinking-horizon dynamic programming

2010-02-01

31

OA

AI

DOI：10.1002/rnc.1566

原文求助

摘要

En 中文

We describe a heuristic control policy for a general finite-horizon stochastic control problem, which can be used when the current process disturbance is not conditionally independent of the previous disturbances, given the current state. At each time step, we approximate the distribution of future disturbances (conditioned on what has been observed) by a product distribution with the same marginals. We then carry out dynamic programming (DP), using this modified future disturbance distribution, to find an optimal policy, and in particular, the optimal current action. We then execute only the optimal current action. At the next step, we update the conditional distribution, and repeat the process, this time with a horizon reduced by one step. (This explains the name 'shrinking-horizon dynamic programming'). We explain how the method can be thought of as an extension of model predictive control, and illustrate our method on two variations on a revenue management problem. Copyright (C) 2010 John Wiley & Sons, Ltd.

Keyword:

dynamic programming

model predictive control

revenue management

Shrinking-horizon dynamic programming

摘要

期刊

机构