経路計画における不確実性推論は本当に有効か?
Is it Worth to Reason about Uncertainty in Occupancy Grid Maps during Path Planning?
確率的占有グリッドマップの不確実性を考慮した経路計画手法を提案し、従来の閾値ベース手法と比較して、行き止まりや障害物近傍のゴールで移動距離短縮と到達率向上を示した。実機Jackalでも検証した。
著者: Jacopo Banfi, Lindsey Woo, Mark Campbell
分類: cs.RO
原文アブストラクト
This paper investigates the usefulness of reasoning about the uncertain presence of obstacles during path planning, which typically stems from the usage of probabilistic occupancy grid maps for representing the environment when mapping via a noisy sensor like a stereo camera. The traditional planning paradigm prescribes using a hard threshold on the occupancy probability to declare that a cell is an obstacle, and to plan a single path accordingly while treating unknown space as free. We compare this approach against a new uncertainty-aware planner, which plans two different path hypotheses and then merges their initial trajectory segments into a single one ending in a "next-best view" pose. After this informative view is taken, the planner commits to one of the hypotheses, or to a completely new one if a collision is imminent. Simulations were conducted comparing the proposed and traditional planner. Results show the existence of planning scenarios -- like when the environment contains a dead-end, or when the goal is placed close to an obstacle -- in which reasoning about uncertainty can significantly decrease the robot's traveled distance and increase the chances of reaching the goal. The new planner was also validated on a real Clearpath Jackal robot equipped with a ZED 2 stereo camera.
