部分地図ナビゲーションのためのサブゴール抽象化によるデータ効率的な方策選択
Data-Efficient Policy Selection for Navigation in Partial Maps via Subgoal-Based Abstraction
部分地図環境でのナビゲーションにおいて、サブゴールベースの抽象化とオフライン代替方策リプレイを活用し、限られたデータで効率的に方策を選択する手法を提案した。
著者: Abhishek Paudel, Gregory J. Stein
分類: cs.RO
原文アブストラクト
We present a novel approach for fast and reliable policy selection for navigation in partial maps. Leveraging the recent learning-augmented model-based Learning over Subgoals Planning (LSP) abstraction to plan, our robot reuses data collected during navigation to evaluate how well other alternative policies could have performed via a procedure we call offline alt-policy replay. Costs from offline alt-policy replay constrain policy selection among the LSP-based policies during deployment, allowing for improvements in convergence speed, cumulative regret and average navigation cost. With only limited prior knowledge about the nature of unseen environments, we achieve at least 67% and as much as 96% improvements on cumulative regret over the baseline bandit approach in our experiments in simulated maze and office-like environments.
