Approximate Planning for Factored POMDPs using Belief State Simplification

We are interested in the problem of planning for factored POMOPs. Building on the recent results of Kearns, Mansour and Ng, we provide a planning algorithm for factored POMOPs that exploits the accuracyefficiency tradeoff in the belief state sim plification introduced by Boyen and Koller.