Enregistré dans:
| Auteurs principaux: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2310.01775 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929518874198016 |
|---|---|
| author | Lee, Yewon Li, Andrew Z. Huang, Philip Heiden, Eric Jatavallabhula, Krishna Murthy Damken, Fabian Smith, Kevin Nowrouzezahrai, Derek Ramos, Fabio Shkurti, Florian |
| author_facet | Lee, Yewon Li, Andrew Z. Huang, Philip Heiden, Eric Jatavallabhula, Krishna Murthy Damken, Fabian Smith, Kevin Nowrouzezahrai, Derek Ramos, Fabio Shkurti, Florian |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_01775 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | STAMP: Differentiable Task and Motion Planning via Stein Variational Gradient Descent Lee, Yewon Li, Andrew Z. Huang, Philip Heiden, Eric Jatavallabhula, Krishna Murthy Damken, Fabian Smith, Kevin Nowrouzezahrai, Derek Ramos, Fabio Shkurti, Florian Robotics Artificial Intelligence I.2.9 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. |
| title | STAMP: Differentiable Task and Motion Planning via Stein Variational Gradient Descent |
| topic | Robotics Artificial Intelligence I.2.9 |
| url | https://arxiv.org/abs/2310.01775 |