Sciweavers

332 search results - page 1 / 67
» Ranking policies in discrete Markov decision processes
Sort
View
ICML
2006
IEEE
14 years 11 months ago
Probabilistic inference for solving discrete and continuous state Markov Decision Processes
Inference in Markov Decision Processes has recently received interest as a means to infer goals of an observed action, policy recognition, and also as a tool to compute policies. ...
Marc Toussaint, Amos J. Storkey
ML
2002
ACM
146views Machine Learning» more  ML 2002»
13 years 10 months ago
Variable Resolution Discretization in Optimal Control
Abstract. The problemof state abstractionis of centralimportancein optimalcontrol,reinforcement learning and Markov decision processes. This paper studies the case of variable reso...
Rémi Munos, Andrew W. Moore
UAI
2000
14 years 7 days ago
PEGASUS: A policy search method for large MDPs and POMDPs
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
Andrew Y. Ng, Michael I. Jordan
NIPS
2004
14 years 8 days ago
VDCBPI: an Approximate Scalable Algorithm for Large POMDPs
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
Pascal Poupart, Craig Boutilier