Memory Bounded Open-Loop Planning in Large POMDPs using Thompson Sampling
This work addresses memory constraints in partially observable planning for applications with limited computational resources, presenting an incremental improvement over existing tree-based methods.
The paper tackles the problem of memory-intensive search trees in partially observable planning by proposing POSTS, a memory-bounded open-loop approach using Thompson Sampling, which achieves competitive performance in large benchmark problems while offering a performance-memory tradeoff.
State-of-the-art approaches to partially observable planning like POMCP are based on stochastic tree search. While these approaches are computationally efficient, they may still construct search trees of considerable size, which could limit the performance due to restricted memory resources. In this paper, we propose Partially Observable Stacked Thompson Sampling (POSTS), a memory bounded approach to open-loop planning in large POMDPs, which optimizes a fixed size stack of Thompson Sampling bandits. We empirically evaluate POSTS in four large benchmark problems and compare its performance with different tree-based approaches. We show that POSTS achieves competitive performance compared to tree-based open-loop planning and offers a performance-memory tradeoff, making it suitable for partially observable planning with highly restricted computational and memory resources.