STAMP: 微分可能な物理シミュレーションとStein変分勾配降下法によるタスク・モーション統合計画
STAMP: Differentiable Task and Motion Planning via Stein Variational Gradient Descent
タスク計画と運動計画を連続最適化問題に緩和し、微分可能物理シミュレーションの勾配とStein変分勾配降下法を用いて多様な解を一度の最適化で並列に求める手法を提案した。
著者: Yewon Lee, Andrew Z. Li, Philip Huang, Eric Heiden, Krishna Murthy Jatavallabhula, Fabian Damken, Kevin Smith, Derek Nowrouzezahrai, Fabio Ramos, Florian Shkurti
分類: cs.RO, cs.AI
原文アブストラクト
Planning for sequential robotics tasks often requires integrated symbolic and geometric reasoning. TAMP algorithms typically solve these problems by performing a tree search over high-level task sequences while checking for kinematic and dynamic feasibility. This can be inefficient because, typically, candidate task plans resulting from the tree search ignore geometric information. This often leads to motion planning failures that require expensive backtracking steps to find alternative task plans. We propose a novel approach to TAMP called Stein Task and Motion Planning (STAMP) that relaxes the hybrid optimization problem into a continuous domain. This allows us to leverage gradients from differentiable physics simulation to fully optimize discrete and continuous plan parameters for TAMP. In particular, we solve the optimization problem using a gradient-based variational inference algorithm called Stein Variational Gradient Descent. This allows us to find a distribution of solutions within a single optimization run. Furthermore, we use an off-the-shelf differentiable physics simulator that is parallelized on the GPU to run parallelized inference over diverse plan parameters. We demonstrate our method on a variety of problems and show that it can find multiple diverse plans in a single optimization run while also being significantly faster than existing approaches.
関連論文
- 実演1回で計画ドメインを自動生成:LLMによる長期ロボット計画の高信頼化タスク・モーション計画
- タスク・モーション計画のための計画ドメイン自動推論タスク・モーション計画
- 拡散モデルによる合成的連続制約ソルバタスク・モーション計画
- 記号計画と非線形制約求解を結ぶ競合駆動型インターフェースタスク・モーション計画
- 変化する環境におけるリcedingホライズン型タスク・モーション計画タスク・モーション計画
