ボロノイ漸進拡張:連続状態・行動・観測POMDPのための効率的オンライン解法
Voronoi Progressive Widening: Efficient Online Solvers for Continuous State, Action, and Observation POMDPs
連続的な状態・行動・観測を持つPOMDPに対し、ボロノイ楽観最適化と行動漸進拡張を統合したVPWを提案し、大域収束保証付きのVOWSSと高性能なVOMCPOWの2アルゴリズムを導出・検証した論文。
著者: Michael H. Lim, Claire J. Tomlin, Zachary N. Sunberg
分類: cs.LG, cs.AI, cs.RO, cs.SY, eess.SY
原文アブストラクト
This paper introduces Voronoi Progressive Widening (VPW), a generalization of Voronoi optimistic optimization (VOO) and action progressive widening to partially observable Markov decision processes (POMDPs). Tree search algorithms can use VPW to effectively handle continuous or hybrid action spaces by efficiently balancing local and global action searching. This paper proposes two VPW-based algorithms and analyzes them from theoretical and simulation perspectives. Voronoi Optimistic Weighted Sparse Sampling (VOWSS) is a theoretical tool that justifies VPW-based online solvers, and it is the first algorithm with global convergence guarantees for continuous state, action, and observation POMDPs. Voronoi Optimistic Monte Carlo Planning with Observation Weighting (VOMCPOW) is a versatile and efficient algorithm that consistently outperforms state-of-the-art POMDP algorithms in several simulation experiments.
