DiMSam: Diffusion Models as Samplers for Task and Motion Planning under Partial Observability

• URL: http://arxiv.org/abs/2306.13196v3
• Date: Fri, 11 Oct 2024 22:31:42 GMT
• Title: DiMSam: Diffusion Models as Samplers for Task and Motion Planning under Partial Observability
• Authors: Xiaolin Fang, Caelan Reed Garrett, Clemens Eppner, Tomás Lozano-Pérez, Leslie Pack Kaelbling, Dieter Fox,
• Abstract summary: Task and Motion Planning (TAMP) approaches are suited for planning multi-step autonomous robot manipulation. We propose to overcome these limitations by composing diffusion models using a TAMP system. We show how the combination of classical TAMP, generative modeling, and latent embedding enables multi-step constraint-based reasoning.
• Score: 58.75803543245372
• License:
• Abstract: Generative models such as diffusion models, excel at capturing high-dimensional distributions with diverse input modalities, e.g. robot trajectories, but are less effective at multi-step constraint reasoning. Task and Motion Planning (TAMP) approaches are suited for planning multi-step autonomous robot manipulation. However, it can be difficult to apply them to domains where the environment and its dynamics are not fully known. We propose to overcome these limitations by composing diffusion models using a TAMP system. We use the learned components for constraints and samplers that are difficult to engineer in the planning model, and use a TAMP solver to search for the task plan with constraint-satisfying action parameter values. To tractably make predictions for unseen objects in the environment, we define the learned samplers and TAMP operators on learned latent embedding of changing object states. We evaluate our approach in a simulated articulated object manipulation domain and show how the combination of classical TAMP, generative modeling, and latent embedding enables multi-step constraint-based reasoning. We also apply the learned sampler in the real world. Website: https://sites.google.com/view/dimsam-tamp

Related papers

• Multi-Robot Motion Planning with Diffusion Models [22.08293753545732]
  We propose a method for generating collision-free multi-robot trajectories. Our algorithm combines learned diffusion models with classical search-based techniques. We show how to compose multiple diffusion models to plan in large environments.
  arXiv  Detail & Related papers  (2024-10-04T01:31:13Z)
• Interactive Planning Using Large Language Models for Partially Observable Robotics Tasks [54.60571399091711]
  Large Language Models (LLMs) have achieved impressive results in creating robotic agents for performing open vocabulary tasks. We present an interactive planning technique for partially observable tasks using LLMs.
  arXiv  Detail & Related papers  (2023-12-11T22:54:44Z)
• Imitating Task and Motion Planning with Visuomotor Transformers [71.41938181838124]
  Task and Motion Planning (TAMP) can autonomously generate large-scale datasets of diverse demonstrations. In this work, we show that the combination of large-scale datasets generated by TAMP supervisors and flexible Transformer models to fit them is a powerful paradigm for robot manipulation. We present a novel imitation learning system called OPTIMUS that trains large-scale visuomotor Transformer policies by imitating a TAMP agent.
  arXiv  Detail & Related papers  (2023-05-25T17:58:14Z)
• Approximating Constraint Manifolds Using Generative Models for Sampling-Based Constrained Motion Planning [8.924344714683814]
  This paper presents a learning-based sampling strategy for constrained motion planning problems. We use Conditional Variversaational Autoencoder (CVAE) and Conditional Generative Adrial Net (CGAN) to generate constraint-satisfying sample configurations. We evaluate the efficiency of these two generative models in terms of their sampling accuracy and coverage of sampling distribution.
  arXiv  Detail & Related papers  (2022-04-14T07:08:30Z)
• SAGE: Generating Symbolic Goals for Myopic Models in Deep Reinforcement Learning [18.37286885057802]
  We propose an algorithm combining learning and planning to exploit a previously unusable class of incomplete models. This combines the strengths of symbolic planning and neural learning approaches in a novel way that outperforms competing methods on variations of taxi world and Minecraft.
  arXiv  Detail & Related papers  (2022-03-09T22:55:53Z)
• Evaluating model-based planning and planner amortization for continuous control [79.49319308600228]
  We take a hybrid approach, combining model predictive control (MPC) with a learned model and model-free policy learning. We find that well-tuned model-free agents are strong baselines even for high DoF control problems. We show that it is possible to distil a model-based planner into a policy that amortizes the planning without any loss of performance.
  arXiv  Detail & Related papers  (2021-10-07T12:00:40Z)
• Learning Models as Functionals of Signed-Distance Fields for Manipulation Planning [51.74463056899926]
  This work proposes an optimization-based manipulation planning framework where the objectives are learned functionals of signed-distance fields that represent objects in the scene. We show that representing objects as signed-distance fields not only enables to learn and represent a variety of models with higher accuracy compared to point-cloud and occupancy measure representations.
  arXiv  Detail & Related papers  (2021-10-02T12:36:58Z)
• Learning Symbolic Operators for Task and Motion Planning [29.639902380586253]
  integrated task and motion planners (TAMP) handle the complex interaction between motion-level decisions and task-level plan feasibility. TAMP approaches rely on domain-specific symbolic operators to guide the task-level search, making planning efficient. We propose a bottom-up relational learning method for operator learning and show how the learned operators can be used for planning in a TAMP system.
  arXiv  Detail & Related papers  (2021-02-28T19:08:56Z)
• Conditional Generative Modeling via Learning the Latent Space [54.620761775441046]
  We propose a novel framework for conditional generation in multimodal spaces. It uses latent variables to model generalizable learning patterns. At inference, the latent variables are optimized to find optimal solutions corresponding to multiple output modes.
  arXiv  Detail & Related papers  (2020-10-07T03:11:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.