English

Non-differentiable Reward Optimization for Diffusion-based Autonomous Motion Planning

Robotics 2025-07-18 v1

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 diffusion motion planning models, enabling them to effectively learn non-differentiable objectives that explicitly measure safety and effectiveness. Specifically, we introduce a reward-weighted dynamic thresholding algorithm to shape a dense reward signal, facilitating more effective training and outperforming models trained with differentiable objectives. State-of-the-art performance on pedestrian datasets (CrowdNav, ETH-UCY) compared to various baselines demonstrates the versatility of our approach for safe and effective motion planning.

Keywords

Cite

@article{arxiv.2507.12977,
  title  = {Non-differentiable Reward Optimization for Diffusion-based Autonomous Motion Planning},
  author = {Giwon Lee and Daehee Park and Jaewoo Jeong and Kuk-Jin Yoon},
  journal= {arXiv preprint arXiv:2507.12977},
  year   = {2025}
}

Comments

Accepted at IROS 2025

R2 v1 2026-07-01T04:05:49.471Z