Reinforcement Learning with Time

This paper steps back from the standard infinite horizon formulation of reinforcement learning problems to consider the simpler case of finite horizon problems. Although finite horizon problems may be solved using infinite horizon learning algorithms by recasting the problem as an infinite horizon problem over a state space extended to include time, we show that such an application of infinite horizon learning algorithms does not make use of what is known about the environment structure, and is therefore inefficient. Preserving a notion of time within the environment allows us to consider extending the environment model to include, for example, random action duration. Such extentions allow us to model non-Markov environments which can be learned using reinforcement learning algorithms.

• Type: Conference
• Year: 1997
• Where: AAAI
• Authors: Daishi Harada
• Keywords: AAAI 1997, Finite Horizon Problems, Horizon Learning Algorithms, Infinite Horizon, Intelligent Agents