Local Approximation of Discounted Markov Decision Problems by Mathematical Programming Methods

Titelangaben

Heinz, Stefan ; Rambau, Jörg ; Tuchscherer, Andreas:
Local Approximation of Discounted Markov Decision Problems by Mathematical Programming Methods.
Bayreuth , 2011

Volltext

	Format: PDF Name: Policy_LocalEvaluation_Foundations.pdf Version: Veröffentlichte Version Verfügbar mit der Lizenz Creative Commons BY 3.0: Namensnennung
	Download (338kB)

Abstract

We develop a method to approximate the value vector of discounted Markov decision problems (MDP) with guaranteed error bounds. It is based on the linear programming characterization of the optimal expected cost. The new idea is to use column generation to dynamically generate only such states that are most relevant for the bounds by incorporating the reduced cost information. The number of states that is sufficient in general and necessary in the worst case to prove such bounds is independent of the cardinality of the state space. Still, in many instances, the column generation algorithm can prove bounds using much fewer states. In this paper, we explain the foundations of the method. Moreover, the method is used to improve the well-known nearest-neighbor policy for the elevator control problem.