反応的計画の限界を押し広げる：局所解からの脱出を学習する
Pushing the Limits of Reactive Planning: Learning to Escape Local Minima
センサ情報のみを使う反応的プランナにフィードフォワード・リカレントネットワークを組み合わせ、局所解を脱出する幾何学的直感を学習させた。実環境へのゼロショット転移と30%のセンサノイズ耐性を実証した。
著者: Isar Meijer, Michael Pantic, Helen Oleynikova, Roland Siegwart
分類: cs.RO
原文アブストラクト
When does a robot planner need a map? Reactive methods that use only the robot's current sensor data and local information are fast and flexible, but prone to getting stuck in local minima. Is there a middle-ground between fully reactive methods and map-based path planners? In this paper, we investigate feed forward and recurrent networks to augment a purely reactive sensor-based planner, which should give the robot geometric intuition about how to escape local minima. We train on a large number of extremely cluttered worlds auto-generated from primitive shapes, and show that our system zero-shot transfers to real 3D man-made environments, and can handle up to 30% sensor noise without degeneration of performance. We also offer a discussion of what role network memory plays in our final system, and what insights can be drawn about the nature of reactive vs. map-based navigation.
