Approximate Planning for Factored POMDPs using Belief State Simplification

2013/01/23 by McAllester, David A., Singh, Satinder
#Artificial Intelligence (cs.AI) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1301.6719

Abstract

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.

Related

• Online POMDP Planning via Simplification
• No Compromise in Solution Quality: Speeding Up Belief-dependent Continuous POMDPs via Adaptive Multilevel Simplification
• Distribution over Beliefs for Memory Bounded Dec-POMDP Planning
• Vector-space Analysis of Belief-state Approximation for POMDPs
• Adaptive Belief Discretization for POMDP Planning