STAMP: Differentiable Task and Motion Planning via Stein Variational Gradient Descent
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Bayesian InferenceGPUImitation LearningMotion PlanningTask and Motion PlanningVariational InferenceMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Learning from Sparse Demonstrations
This paper develops the method of Continuous Pontryagin Differentiable Programming (Continuous PDP), which enables a robot to learn an objective function from a few sparsely demonstrated keyframes. The keyframes, labeled…
Motion PlanningGlobalized Constrained Stein Variational Inference for Diverse Feasible Robot Motion Planning
Robot motion planning is inherently multimodal, yet classical planners typically return only a single solution. Probabilistic formulations address this limitation by maintaining a distribution over motions, allowing the …
Collision AvoidanceMotion PlanningSTL-SVPIO: Signal Temporal Logic guided Stein Variational Path Integral Optimization
Signal Temporal Logic (STL) enables formal specification of complex spatiotemporal constraints for robotic task planning. However, synthesizing long-horizon continuous control trajectories from complex STL specifications…
Continuous ControlMotion PlanningLearning Differentiable Reachability Maps for Optimization-based Humanoid Motion Generation
To reduce the computational cost of humanoid motion generation, we introduce a new approach to representing robot kinematic reachability: the differentiable reachability map. This map is a scalar-valued function defined …
Motion PlanningConstrained Gaussian Process Motion Planning via Stein Variational Newton Inference
Gaussian Process Motion Planning (GPMP) is a widely used framework for generating smooth trajectories within a limited compute time--an essential requirement in many robotic applications. However, traditional GPMP approa…
Bayesian InferenceComputational EfficiencyMotion Planning