離散対称性を持つ構成空間におけるサンプリングベース運動計画
Sampling-Based Motion Planning with Discrete Configuration-Space Symmetries
対称な物体を扱う際の構成空間の対称性を利用し、サンプリングベース運動計画アルゴリズムを効率化する手法を提案。理論解析と実験で経路長と実行時間の改善を示した。
著者: Thomas Cohn, Russ Tedrake
分類: cs.RO
原文アブストラクト
When planning motions in a configuration space that has underlying symmetries (e.g. when manipulating one or multiple symmetric objects), the ideal planning algorithm should take advantage of those symmetries to produce shorter trajectories. However, finite symmetries lead to complicated changes to the underlying topology of configuration space, preventing the use of standard algorithms. We demonstrate how the key primitives used for sampling-based planning can be efficiently implemented in spaces with finite symmetries. A rigorous theoretical analysis, building upon a study of the geometry of the configuration space, shows improvements in the sample complexity of several standard algorithms. Furthermore, a comprehensive slate of experiments demonstrates the practical improvements in both path length and runtime.
