Proceedings

Approximating Optimal Policies for Partially Observable Stochastic Domains

Ronald Parr, Stuart J. Russell

Download BibTeX Cite

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Learning. Pages 1088-1094.

Abstract

The problem of making optimal decisions in uncertain conditions is central to Artificial Intelligence. If the state of the world is known at all times, the world can be modeled as a Markov Decision Process (MDP). MDPs have been studied extensively and many methods are known for determining optimal courses of action, or policies. The more realistic case where state information is only partially observable, Partially Observable Markov Decision Processes (POMDPs), have received much less attention. The best exact algorithms for these problems can be very inefficient in both space and time. We introduce Smooth Partially Observable Value Approximation (SPOVA), a new approximation method that can quickly yield good approximations which can improve over time. This method can be combined with reinforcement learning methods, a combination that was very effective in our test cases.

Ronald Parr, and Stuart J. Russell. 1995. Approximating Optimal Policies for Partially Observable Stochastic Domains. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95. IJCAI, 1088–1094. https://ijcai.org/proceedings/1995/141
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards