移動可能障害物環境における経路と押し動作の統合計画
Joint Path and Push Planning Among Movable Obstacles
移動可能な障害物がある環境で、RRTベースの探索と物理シミュレーションを用いた押し動作計画を組み合わせ、障害物を押し退けながら経路を選ぶ手法を提案した。従来手法より混雑率の高い環境でも解を見つけられることを示した。
著者: Victor Emeli, Akansel Cosgun
分類: cs.RO
原文アブストラクト
This paper explores the Navigation Among Movable Obstacles (NAMO) problem and proposes joint path and push planning: which path to take and in what direction the obstacles should be pushed at, given a start and goal position. We present a planning algorithm for selecting a path and the obstacles to be pushed, where a Rapidly-exploring Random Tree (RRT)-based heuristic is employed to calculate a minimal collision path. When it is necessary to apply a pushing force to slide an obstacle out of the way, the planners leverage means-end analysis through a dynamic physics simulation to determine the sequence of linear pushes to clear the necessary space. Simulation experiments show that our approach finds solutions in higher clutter percentages (up to 49%) compared to the straight-line push planner (37%) and RRT without pushing (18%).
