分布学習による高速で計算効率の良いサンプリングベース局所探索計画
Fast and Compute-efficient Sampling-based Local Exploration Planning via Distribution Learning
ロボットの地図の空間的文脈から情報価値の高い視点の分布を直接学習し、探索計画を高速化・低分散化する手法を提案。計算制約下でも従来法より最大28%性能向上を実現。
著者: Lukas Schmid, Chao Ni, Yuliang Zhong, Roland Siegwart, Olov Andersson
分類: cs.RO
原文アブストラクト
Exploration is a fundamental problem in robotics. While sampling-based planners have shown high performance, they are oftentimes compute intensive and can exhibit high variance. To this end, we propose to directly learn the underlying distribution of informative views based on the spatial context in the robot's map. We further explore a variety of methods to also learn the information gain. We show in thorough experimental evaluation that our proposed system improves exploration performance by up to 28% over classical methods, and find that learning the gains in addition to the sampling distribution can provide favorable performance vs. compute trade-offs for compute-constrained systems. We demonstrate in simulation and on a low-cost mobile robot that our system generalizes well to varying environments.
