Reinforcement Learning in Non-Markov Environments (1992)
| Venue: | Artificial Intelligence. Submitted |
| Citations: | 4 - 0 self |
BibTeX
@ARTICLE{Whitehead92reinforcementlearning,
author = {Steven D. Whitehead and Long Ji Lin},
title = {Reinforcement Learning in Non-Markov Environments},
journal = {Artificial Intelligence. Submitted},
year = {1992},
volume = {8},
pages = {3--4}
}
OpenURL
Abstract
Recently, techniques based on reinforcement learning (RL) have been used to build systems that learn to perform non-trivial sequential decision tasks. To date, most of this work has focussed on learning tasks that can be described as Markov decision processes (MDPs). While MDPs are useful for modeling a wide range of control problems, there are important problems that are inherently non-Markov. We refer to these as hidden state tasks since they arise when information relevant to identifying the state of the environment is hidden (or missing) from the agent's internal representation. Two important types of control problems that resist Markov modeling are those in which 1) the system has a high degree of control over the information collected by its sensors (e.g., as in active-vision), or 2) the system has a limited set of sensors that do not always provide adequate information about the current state of the environment. Not surprisingly, traditional RL algorithms, which are based primar...







