Dynamic Obstacle Avoidance through Uncertainty-Based Adaptive Planning with Diffusion

• URL: http://arxiv.org/abs/2409.16950v1
• Date: Wed, 25 Sep 2024 14:03:58 GMT
• Title: Dynamic Obstacle Avoidance through Uncertainty-Based Adaptive Planning with Diffusion
• Authors: Vineet Punyamoorty, Pascal Jutras-Dubé, Ruqi Zhang, Vaneet Aggarwal, Damon Conover, Aniket Bera,
• Abstract summary: We propose an adaptive generative planning approach that adjusts replanning frequency based on the uncertainty of action predictions. Our method minimizes the need for frequent, computationally expensive, and redundant replanning while maintaining robust collision avoidance performance.
• Score: 40.76697924496143
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: By framing reinforcement learning as a sequence modeling problem, recent work has enabled the use of generative models, such as diffusion models, for planning. While these models are effective in predicting long-horizon state trajectories in deterministic environments, they face challenges in dynamic settings with moving obstacles. Effective collision avoidance demands continuous monitoring and adaptive decision-making. While replanning at every timestep could ensure safety, it introduces substantial computational overhead due to the repetitive prediction of overlapping state sequences -- a process that is particularly costly with diffusion models, known for their intensive iterative sampling procedure. We propose an adaptive generative planning approach that dynamically adjusts replanning frequency based on the uncertainty of action predictions. Our method minimizes the need for frequent, computationally expensive, and redundant replanning while maintaining robust collision avoidance performance. In experiments, we obtain a 13.5% increase in the mean trajectory length and a 12.7% increase in mean reward over long-horizon planning, indicating a reduction in collision rates and an improved ability to navigate the environment safely.

Related papers

• Improved deep learning of chaotic dynamical systems with multistep penalty losses [0.0]
  Predicting the long-term behavior of chaotic systems remains a formidable challenge. This paper introduces a novel framework that addresses these challenges by leveraging the recently proposed multi-step penalty operators.
  arXiv  Detail & Related papers  (2024-10-08T00:13:57Z)
• Adaptive Planning with Generative Models under Uncertainty [20.922248169620783]
  Planning with generative models has emerged as an effective decision-making paradigm across a wide range of domains. While continuous replanning at each timestep might seem intuitive because it allows decisions to be made based on the most recent environmental observations, it results in substantial computational challenges. Our work addresses this challenge by introducing a simple adaptive planning policy that leverages the generative model's ability to predict long-horizon state trajectories.
  arXiv  Detail & Related papers  (2024-08-02T18:07:53Z)
• Learning Long-Horizon Predictions for Quadrotor Dynamics [48.08477275522024]
  We study the key design choices for efficiently learning long-horizon prediction dynamics for quadrotors. We show that sequential modeling techniques showcase their advantage in minimizing compounding errors compared to other types of solutions. We propose a novel decoupled dynamics learning approach, which further simplifies the learning process while also enhancing the approach modularity.
  arXiv  Detail & Related papers  (2024-07-17T19:06:47Z)
• ADM: Accelerated Diffusion Model via Estimated Priors for Robust Motion Prediction under Uncertainties [6.865435680843742]
  We propose a novel diffusion-based, acceleratable framework that adeptly predicts future trajectories of agents with enhanced resistance to noise. Our method meets the rigorous real-time operational standards essential for autonomous vehicles. It achieves significant improvement in multi-agent motion prediction on the Argoverse 1 motion forecasting dataset.
  arXiv  Detail & Related papers  (2024-05-01T18:16:55Z)
• Residual Chain Prediction for Autonomous Driving Path Planning [5.139918355140954]
  Residual Chain Loss dynamically adjusts the loss calculation process to enhance the temporal dependency and accuracy of predicted path points. Our findings highlight the potential of Residual Chain Loss to revolutionize planning component of autonomous driving systems.
  arXiv  Detail & Related papers  (2024-04-08T11:43:40Z)
• Tractable Joint Prediction and Planning over Discrete Behavior Modes for Urban Driving [15.671811785579118]
  We show that we can parameterize autoregressive closed-loop models without retraining. We propose fully reactive closed-loop planning over discrete latent modes. Our approach also outperforms the previous state-of-the-art in CARLA on challenging dense traffic scenarios.
  arXiv  Detail & Related papers  (2024-03-12T01:00:52Z)
• Layout Sequence Prediction From Noisy Mobile Modality [53.49649231056857]
  Trajectory prediction plays a vital role in understanding pedestrian movement for applications such as autonomous driving and robotics. Current trajectory prediction models depend on long, complete, and accurately observed sequences from visual modalities. We propose LTrajDiff, a novel approach that treats objects obstructed or out of sight as equally important as those with fully visible trajectories.
  arXiv  Detail & Related papers  (2023-10-09T20:32:49Z)
• SafeDiffuser: Safe Planning with Diffusion Probabilistic Models [97.80042457099718]
  Diffusion model-based approaches have shown promise in data-driven planning, but there are no safety guarantees. We propose a new method, called SafeDiffuser, to ensure diffusion probabilistic models satisfy specifications. We test our method on a series of safe planning tasks, including maze path generation, legged robot locomotion, and 3D space manipulation.
  arXiv  Detail & Related papers  (2023-05-31T19:38:12Z)
• Conditional Denoising Diffusion for Sequential Recommendation [62.127862728308045]
  Two prominent generative models, Generative Adversarial Networks (GANs) and Variational AutoEncoders (VAEs) GANs suffer from unstable optimization, while VAEs are prone to posterior collapse and over-smoothed generations. We present a conditional denoising diffusion model, which includes a sequence encoder, a cross-attentive denoising decoder, and a step-wise diffuser.
  arXiv  Detail & Related papers  (2023-04-22T15:32:59Z)
• Generative Time Series Forecasting with Diffusion, Denoise, and Disentanglement [51.55157852647306]
  Time series forecasting has been a widely explored task of great importance in many applications. It is common that real-world time series data are recorded in a short time period, which results in a big gap between the deep model and the limited and noisy time series. We propose to address the time series forecasting problem with generative modeling and propose a bidirectional variational auto-encoder equipped with diffusion, denoise, and disentanglement.
  arXiv  Detail & Related papers  (2023-01-08T12:20:46Z)

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.