560 citations · 2k across the 22 of their papers we have counts for
Showing 2013 · cs.AIShow all
2 papers · 2 filters
cs.AI2013★ 66 cited
Approximate Planning for Factored POMDPs using Belief State Simplification
David A. McAllester, Satinder Singh
We are interested in the problem of planning for factored POMDPs. Building on the recent results of Kearns, Mansour and Ng, we provide a planning algorithm for factored POMDPs that…
cs.AI2013★ 75 cited
On the Complexity of Policy Iteration
Yishay Mansour, Satinder Singh
Decision-making problems in uncertain or stochastic domains are often formulated as Markov decision processes (MDPs). Policy iteration (PI) is a popular algorithm for searching ove…