Cascaded Diffusion Models for Neural Motion Planning

• URL: http://arxiv.org/abs/2505.15157v1
• Date: Wed, 21 May 2025 06:21:50 GMT
• Title: Cascaded Diffusion Models for Neural Motion Planning
• Authors: Mohit Sharma, Adam Fishman, Vikash Kumar, Chris Paxton, Oliver Kroemer,
• Abstract summary: We propose an approach for learning global motion planning using diffusion policies.<n>Our approach uses cascaded hierarchical models which unify global prediction and local refinement.<n>Our method outperforms (by 5%) on challenging tasks in multiple domains including navigation and manipulation.
• Score: 36.53334347874921
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Robots in the real world need to perceive and move to goals in complex environments without collisions. Avoiding collisions is especially difficult when relying on sensor perception and when goals are among clutter. Diffusion policies and other generative models have shown strong performance in solving local planning problems, but often struggle at avoiding all of the subtle constraint violations that characterize truly challenging global motion planning problems. In this work, we propose an approach for learning global motion planning using diffusion policies, allowing the robot to generate full trajectories through complex scenes and reasoning about multiple obstacles along the path. Our approach uses cascaded hierarchical models which unify global prediction and local refinement together with online plan repair to ensure the trajectories are collision free. Our method outperforms (by ~5%) a wide variety of baselines on challenging tasks in multiple domains including navigation and manipulation.

Related papers

• Curiosity-Driven Imagination: Discovering Plan Operators and Learning Associated Policies for Open-World Adaptation [7.406934849952094]
  Adapting quickly to dynamic, uncertain environments is a major challenge in robotics.<n>Traditional Task and Motion Planning approaches struggle to cope with unforeseen changes, are data-inefficient when adapting, and do not leverage world models during learning.<n>We address this issue with a hybrid planning and learning system that integrates two models: a low level neural network based model that learns transitions and drives exploration via an Intrinsic Curiosity Module (ICM)<n>Our evaluation in a robotic manipulation domain with sequential novelty injections demonstrates that our approach converges faster and outperforms state-of-the-art hybrid methods.
  arXiv  Detail & Related papers  (2025-03-06T20:02:26Z)
• Towards Learning Scalable Agile Dynamic Motion Planning for Robosoccer Teams with Policy Optimization [0.0]
  Dynamic Motion Planning for Multi-Agent Systems in the presence of obstacles is a universal and unsolved problem.<n>We present a learning-based dynamic navigation model and show our model working on a simple environment in the concept of a simple Robosoccer Game.
  arXiv  Detail & Related papers  (2025-02-08T11:13:07Z)
• Simultaneous Multi-Robot Motion Planning with Projected Diffusion Models [57.45019514036948]
  Simultaneous MRMP Diffusion (SMD) is a novel approach integrating constrained optimization into the diffusion sampling process to produce kinematically feasible trajectories.<n>The paper introduces a comprehensive MRMP benchmark to evaluate trajectory planning algorithms across scenarios with varying robot densities, obstacle complexities, and motion constraints.
  arXiv  Detail & Related papers  (2025-02-05T20:51:28Z)
• Robotic World Model: A Neural Network Simulator for Robust Policy Optimization in Robotics [50.191655141020505]
  This work advances model-based reinforcement learning by addressing the challenges of long-horizon prediction, error accumulation, and sim-to-real transfer.<n>By providing a scalable and robust framework, the introduced methods pave the way for adaptive and efficient robotic systems in real-world applications.
  arXiv  Detail & Related papers  (2025-01-17T10:39:09Z)
• Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models [57.45019514036948]
  Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics.<n>This work proposes a novel approach that integrates constrained optimization with diffusion models for MAPF in continuous spaces.
  arXiv  Detail & Related papers  (2024-12-23T21:27:19Z)
• A Meta-Engine Framework for Interleaved Task and Motion Planning using Topological Refinements [51.54559117314768]
  Task And Motion Planning (TAMP) is the problem of finding a solution to an automated planning problem. We propose a general and open-source framework for modeling and benchmarking TAMP problems. We introduce an innovative meta-technique to solve TAMP problems involving moving agents and multiple task-state-dependent obstacles.
  arXiv  Detail & Related papers  (2024-08-11T14:57:57Z)
• LDP: A Local Diffusion Planner for Efficient Robot Navigation and Collision Avoidance [16.81917489473445]
  The conditional diffusion model has been demonstrated as an efficient tool for learning robot policies. The intricate nature of real-world scenarios, characterized by dynamic obstacles and maze-like structures, underscores the complexity of robot local navigation decision-making.
  arXiv  Detail & Related papers  (2024-07-02T04:53:35Z)
• Diffusion-Reinforcement Learning Hierarchical Motion Planning in Multi-agent Adversarial Games [6.532258098619471]
  We propose a hierarchical architecture that integrates a high-level diffusion model to plan global paths responsive to environment data.<n>We show that our approach outperforms baselines by 77.18% and 47.38% on detection and goal reaching rate.
  arXiv  Detail & Related papers  (2024-03-16T03:53:55Z)
• Sequential Neural Barriers for Scalable Dynamic Obstacle Avoidance [7.375976854181687]
  We propose a novel method for compositional learning of Sequential Neural Control Barrier models (SNCBFs) Our approach exploits an important observation: the spatial interaction patterns of multiple dynamic obstacles can be decomposed and predicted through temporal sequences of states for each obstacle. We demonstrate the benefits of the proposed methods in improving dynamic collision avoidance in comparison with existing methods.
  arXiv  Detail & Related papers  (2023-07-06T14:24:17Z)
• SABER: Data-Driven Motion Planner for Autonomously Navigating Heterogeneous Robots [112.2491765424719]
  We present an end-to-end online motion planning framework that uses a data-driven approach to navigate a heterogeneous robot team towards a global goal. We use model predictive control (SMPC) to calculate control inputs that satisfy robot dynamics, and consider uncertainty during obstacle avoidance with chance constraints. recurrent neural networks are used to provide a quick estimate of future state uncertainty considered in the SMPC finite-time horizon solution. A Deep Q-learning agent is employed to serve as a high-level path planner, providing the SMPC with target positions that move the robots towards a desired global goal.
  arXiv  Detail & Related papers  (2021-08-03T02:56:21Z)
• Mobile Robot Path Planning in Dynamic Environments through Globally Guided Reinforcement Learning [12.813442161633116]
  We introduce a globally guided learning reinforcement approach (G2RL) to solve the multi-robot planning problem. G2RL incorporates a novel path reward structure that generalizes to arbitrary environments. We evaluate our method across different map types, obstacle densities and the number of robots.
  arXiv  Detail & Related papers  (2020-05-11T20:42:29Z)

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.