Get our free extension to see links to code for papers anywhere online!Free add-on: code for papers everywhere!Free add-on: See code for papers anywhere!
Add to Chrome
Add to Firefox
Add to EdgeApproximate Planning for Factored POMDPs using Belief State Simplification
Paper and Code
Jan 23, 2013
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 exploits the accuracy-efficiency tradeoff in the belief state simplification introduced by Boyen and Koller.
* Appears in Proceedings of the Fifteenth Conference on Uncertainty in
Artificial Intelligence (UAI1999)
View paper on