Rao-Blackwell化POMDPプランニング
Rao-Blackwellized POMDP Planning
POMDPの信念更新とオンラインプランニングにRao-Blackwell化を適用し、粒子フィルタの効率と計画品質を改善する手法を提案。
著者: Jiho Lee, Nisar R. Ahmed, Kyle H. Wray, Zachary N. Sunberg
分類: cs.AI, cs.LG, cs.RO
原文アブストラクト
Partially Observable Markov Decision Processes (POMDPs) provide a structured framework for decision-making under uncertainty, but their application requires efficient belief updates. Sequential Importance Resampling Particle Filters (SIRPF), also known as Bootstrap Particle Filters, are commonly used as belief updaters in large approximate POMDP solvers, but they face challenges such as particle deprivation and high computational costs as the system's state dimension grows. To address these issues, this study introduces Rao-Blackwellized POMDP (RB-POMDP) approximate solvers and outlines generic methods to apply Rao-Blackwellization in both belief updates and online planning. We compare the performance of SIRPF and Rao-Blackwellized Particle Filters (RBPF) in a simulated localization problem where an agent navigates toward a target in a GPS-denied environment using POMCPOW and RB-POMCPOW planners. Our results not only confirm that RBPFs maintain accurate belief approximations over time with fewer particles, but, more surprisingly, RBPFs combined with quadrature-based integration improve planning quality significantly compared to SIRPF-based planning under the same computational limits.
関連論文
- 代替観測空間と性能保証を備えた簡略化POMDPプランニングPOMDPプランニング
