Papers › Diffusion-ES: Gradient-free Planning with Diffusion for Autonomous Driving and...

Diffusion-ES: Gradient-free Planning with Diffusion for Autonomous Driving and Zero-Shot Instruction Following

9 Feb 2024arXiv:2402.06559archive 2025-07-28

Brian Yang, Huangyuan Su, Nikolaos Gkanatsios, Tsung-Wei Ke, Ayush Jain, Jeff Schneider, Katerina Fragkiadaki

Diffusion models excel at modeling complex and multimodal trajectory distributions for decision-making and control. Reward-gradient guided denoising has been recently proposed to generate trajectories that maximize both a differentiable reward function and the likelihood under the data distribution captured by a diffusion model. Reward-gradient guided denoising requires a differentiable reward function fitted to both clean and noised samples, limiting its applicability as a general trajectory optimizer. In this paper, we propose DiffusionES, a method that combines gradient-free optimization with trajectory denoising to optimize black-box non-differentiable objectives while staying in the data manifold. Diffusion-ES samples trajectories during evolutionary search from a diffusion model and scores them using a black-box reward function. It mutates high-scoring trajectories using a truncated diffusion process that applies a small number of noising and denoising steps, allowing for much more efficient exploration of the solution space. We show that DiffusionES achieves state-of-the-art performance on nuPlan, an established closed-loop planning benchmark for autonomous driving. Diffusion-ES outperforms existing sampling-based planners, reactive deterministic or diffusion-based policies, and reward-gradient guidance. Additionally, we show that unlike prior guidance methods, our method can optimize non-differentiable language-shaped reward functions generated by few-shot LLM prompting. When guided by a human teacher that issues instructions to follow, our method can generate novel, highly complex behaviors, such as aggressive lane weaving, which are not present in the training data. This allows us to solve the hardest nuPlan scenarios which are beyond the capabilities of existing trajectory optimization methods and driving policies.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2402.06559")

Code

Syntology Ran 10 of 12 code samples harvested from 1 repository linked to this paper; 2 have no recorded run. Of those that ran: 10 ran with no contract checked.

By repository: official repository: 12 samples from 1 repository, 10 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested; 10 ran; 0 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

10ran
2unverified

Licence: 12 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from bhyang/diffusion-es. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

compute_constraint_residual bhyang/diffusion-es/nuplan-devkit/nuplan/planning/training/modeling/models/kinematic_diffusion_model.py official repository ran no licence file found · pointer only · 1190d67ec9dd7df4 · report
compute_constraint_scores bhyang/diffusion-es/nuplan-devkit/nuplan/planning/training/modeling/models/conditional_diffusion_model.py official repository ran no licence file found · pointer only · abae6e04abbb67ad · report
connected_components bhyang/diffusion-es/nuplan-devkit/nuplan/planning/simulation/planner/ml_planner/diffusion_planner.py official repository ran no licence file found · pointer only · 6e4baf74bd5bc123 · report
filter_points bhyang/diffusion-es/nuplan-devkit/nuplan/planning/simulation/planner/ml_planner/diffusion_planner.py official repository ran no licence file found · pointer only · 36ea5db4788bb120 · report
get_shape bhyang/diffusion-es/nuplan-devkit/nuplan/database/maps_db/layer_dataset_ops.py official repository ran no licence file found · pointer only · ba204edcf64da86e · report
linear_beta_schedule bhyang/diffusion-es/nuplan-devkit/nuplan/planning/training/modeling/models/diffusion_utils.py official repository ran fingerprinted no licence file found · pointer only · 8e8ee6936e1f689c · report
load_layer_as_numpy bhyang/diffusion-es/nuplan-devkit/nuplan/database/maps_db/layer_dataset_ops.py official repository ran no licence file found · pointer only · fa9df2db2cb46b59 · report
prune_obs_features bhyang/diffusion-es/nuplan-devkit/nuplan/planning/simulation/planner/ml_planner/diffusion_planner.py official repository ran no licence file found · pointer only · 497bd38fc6eda1d6 · report
rand_log_logistic bhyang/diffusion-es/nuplan-devkit/nuplan/planning/training/modeling/models/diffusion_utils.py official repository ran no licence file found · pointer only · a46ba2ab47eb7f4c · report
vp_beta_schedule bhyang/diffusion-es/nuplan-devkit/nuplan/planning/training/modeling/models/diffusion_utils.py official repository ran fingerprinted no licence file found · pointer only · 76f83814a33af5eb · report
compute_constraint_residual bhyang/diffusion-es/nuplan-devkit/nuplan/planning/training/modeling/models/conditional_diffusion_model.py official repository unverified no licence file found · pointer only · 9c5002da16b6bc7a · report
get_transform_matrix bhyang/diffusion-es/nuplan-devkit/nuplan/database/maps_db/layer_dataset_ops.py official repository unverified no licence file found · pointer only · ec9417e69344a9ac · report

Tasks

Autonomous DrivingDenoisingEfficient ExplorationInstruction Following

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Diffusion

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections