Non-differentiable Reward Optimization for Diffusion-based Autonomous Motion Planning
Giwon Lee, Daehee Park, Jaewoo Jeong, Kuk-Jin Yoon

TL;DR
This paper introduces a reinforcement learning approach to train diffusion models for autonomous motion planning, enabling explicit optimization of safety and effectiveness objectives that are non-differentiable, resulting in improved performance on pedestrian datasets.
Contribution
It proposes a reward-weighted dynamic thresholding algorithm for training diffusion models with non-differentiable objectives in motion planning.
Findings
Outperforms baselines on pedestrian datasets
Effectively optimizes safety and goal-reaching objectives
Demonstrates versatility in dynamic environments
Abstract
Safe and effective motion planning is crucial for autonomous robots. Diffusion models excel at capturing complex agent interactions, a fundamental aspect of decision-making in dynamic environments. Recent studies have successfully applied diffusion models to motion planning, demonstrating their competence in handling complex scenarios and accurately predicting multi-modal future trajectories. Despite their effectiveness, diffusion models have limitations in training objectives, as they approximate data distributions rather than explicitly capturing the underlying decision-making dynamics. However, the crux of motion planning lies in non-differentiable downstream objectives, such as safety (collision avoidance) and effectiveness (goal-reaching), which conventional learning algorithms cannot directly optimize. In this paper, we propose a reinforcement learning-based training scheme for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Robotic Mechanisms and Dynamics
