Sciweavers

60 search results - page 3 / 12
» Region-based value iteration for partially observable Markov...
Sort
View
AAAI
2010
13 years 7 months ago
Relational Partially Observable MDPs
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
Chenggang Wang, Roni Khardon

Publication
273views
13 years 1 months ago
Monte Carlo Value Iteration for Continuous-State POMDPs
Partially observable Markov decision processes (POMDPs) have been successfully applied to various robot motion planning tasks under uncertainty. However, most existing POMDP algo...
Haoyu Bai, David Hsu, Wee Sun Lee, and Vien A. Ngo
UAI
2004
13 years 7 months ago
Region-Based Incremental Pruning for POMDPs
We present a major improvement to the incremental pruning algorithm for solving partially observable Markov decision processes. Our technique targets the cross-sum step of the dyn...
Zhengzhu Feng, Shlomo Zilberstein
NIPS
2004
13 years 7 months 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
AAAI
2004
13 years 7 months ago
Dynamic Programming for Partially Observable Stochastic Games
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilber...