CLOVER: Closed-Loop Value Estimation and Ranking for End-to-End Autonomous Driving Planning
- URL: http://arxiv.org/abs/2605.15120v2
- Date: Fri, 15 May 2026 11:07:11 GMT
- Title: CLOVER: Closed-Loop Value Estimation and Ranking for End-to-End Autonomous Driving Planning
- Abstract summary: CLOVER is a framework for end-to-end autonomous driving planning.<n>A generator produces diverse candidate trajectories, and a scorer predicts planning-metric sub-scores.<n>The generator is refined toward teacher-selected top-$k$ and vector-Pareto targets.
- Score: 11.2767413780552
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: End-to-end autonomous driving planners are commonly trained by imitating a single logged trajectory, yet evaluated by rule-based planning metrics that measure safety, feasibility, progress, and comfort. This creates a training--evaluation mismatch: trajectories close to the logged path may violate planning rules, while alternatives farther from the demonstration can remain valid and high-scoring. The mismatch is especially limiting for proposal-selection planners, whose performance depends on candidate-set coverage and scorer ranking quality. We propose CLOVER, a Closed-LOop Value Estimation and Ranking framework for end-to-end autonomous driving planning. CLOVER follows a lightweight generator--scorer formulation: a generator produces diverse candidate trajectories, and a scorer predicts planning-metric sub-scores to rank them at inference time. To expand proposal support beyond single-trajectory imitation, CLOVER constructs evaluator-filtered pseudo-expert trajectories and trains the generator with set-level coverage supervision. It then performs conservative closed-loop self-distillation: the scorer is fitted to true evaluator sub-scores on generated proposals, while the generator is refined toward teacher-selected top-$k$ and vector-Pareto targets with stability regularization. We analyze when an imperfect scorer can improve the generator, showing that scorer-mediated refinement is reliable when scorer-selected targets are enriched under the true evaluator and updates remain conservative. On NAVSIM, CLOVER achieves 94.5 PDMS and 90.4 EPDMS, establishing a new state of the art. On the more challenging NavHard split, it obtains 48.3 EPDMS, matching the strongest reported result. On supplementary nuScenes open-loop evaluation, CLOVER achieves the lowest L2 error and collision rate among compared methods. Code data will be released at https://github.com/WilliamXuanYu/CLOVER.
Related papers
- Future-Aware Flow Planning for Safe UAV Target Following [4.950533201061028]
Current-state followers can lag behind turns, choose blocked corridors, or trade tracking for unsafe near-horizon motion.<n>We propose a future-aware flow planning framework for state-informed UAV target following.
arXiv Detail & Related papers (2026-09-09T13:40:09Z) - Shift & Drift: A Zero-Shot Benchmark for Generalizable and Robust Autonomous Driving Motion Planning [60.888463449435484]
We present Shift & Drift, a novel dual-track benchmark designed to rigorously stress-test motion planners across two critical axes of distribution shift.<n>We show that imitation learning methods achieve high scores in ID benchmarks, but suffer from persistent drift when subjected to temporally correlated actuation noise.<n>Our findings reveal an empirical trade-off between imitation fidelity and closed-loop resilience, providing the community with a rigorous benchmark to evaluate progress toward reliable deployment.
arXiv Detail & Related papers (2026-07-08T18:23:48Z) - Off the Rails: Hijacking the Scoring Head in Generative End-to-End Driving Planners with Safety-Violating Adversarial Perturbations [19.535238501602556]
We present textscDerail, an adversarial framework that exploits the scoring-head attack surface.<n>textscDerail flips the trajectory selection from a safe to an unsafe candidate, with score drops of $39$--$80%$ and collision rates of up to $50%$.<n>Our analysis suggests that safety-violating objectives govern attack effectiveness against generative AD planners, and that the scoring-head inference pattern itself is a recurring attack surface worth explicit defensive consideration.
arXiv Detail & Related papers (2026-06-29T18:32:29Z) - Test-Time Trajectory Optimization for Autonomous Driving [77.87162309994567]
End-to-end planners for autonomous driving typically generate a set of candidate trajectories, score each one, and return the highest-scoring candidate.<n>We treat the scorer as a learned trajectory-level reward function and search for trajectories that maximize it.<n>Our method, TOAD, runs the Cross-Entropy Method at test time, warm-started from the planner's proposals.
arXiv Detail & Related papers (2026-06-05T11:39:27Z) - CLEAR: Cognition and Latent Evaluation for Adaptive Routing in End-to-End Autonomous Driving [19.474428775260034]
We propose CLEAR, a framework that combines ultra-fast generative planning with deep semantic reasoning.<n> CLEAR employs Drive-JEPA as the visual encoder and replaces the multi-step denoising chain with a single-step conditional drift in a VAE latent space.<n>On the NAVSIM v1 benchmark, CLEAR achieves a state-of-the-art PDMS of 93.7.
arXiv Detail & Related papers (2026-06-04T14:32:10Z) - PIVOT: Bridging Planning and Execution in LLM Agents via Trajectory Refinement [22.285969725581044]
Large language model (LLM)-based agents generate seemingly coherent plans that fail upon execution due to infeasible actions, constraint violations, and compounding errors over extended horizons.<n>PIVOT addresses this plan-execution misalignment through a self-supervised framework that treats trajectories as optimizable objects iteratively refined via environment interaction.
arXiv Detail & Related papers (2026-05-11T20:43:20Z) - RAD-2: Scaling Reinforcement Learning in a Generator-Discriminator Framework [49.531001563853984]
RAD-2 is a unified generator-discriminator framework for closed-loop planning.<n>It produces diverse trajectory candidates, while an RL-optimized discriminator reranks these candidates according to their long-term driving quality.<n>It reduces the collision rate by 56% compared with strong diffusion-based planners.
arXiv Detail & Related papers (2026-04-16T17:59:44Z) - CorrectionPlanner: Self-Correction Planner with Reinforcement Learning in Autonomous Driving [55.88697462014118]
CorrectionPlanner is an autoregressive planner with self-correction.<n>It reduces collision rate by over 20% on Waymax and achieves state-of-the-art planning scores on nuPlan.
arXiv Detail & Related papers (2026-03-16T18:03:21Z) - See, Plan, Rewind: Progress-Aware Vision-Language-Action Models for Robust Robotic Manipulation [59.07792608884117]
We introduce See, Plan, Rewind (SPR), a progress-aware vision-language-action framework.<n>SPR operates through a continuous core cycle, Seeing the current state and upcoming milestone, Planning a trajectory towards the next 2D waypoint, and Rewinding to a recoverable state upon failure.<n>SPR achieves state-of-the-art robustness with the smallest performance drop, surpassing OpenVLA-OFT and UniVLA.
arXiv Detail & Related papers (2026-03-10T07:22:51Z) - Improving Diffusion Planners by Self-Supervised Action Gating with Energies [31.430422680816907]
We propose Self-supervised Action Gating with Energies (SAGE) to penalise dynamically inconsistent plans using a latent consistency signal.<n>SAGE trains a Joint-Embedding Predictive Architecture (JEPA) encoder on offline state sequences and an action-conditioned latent predictor for short horizon transitions.<n>At test time, SAGE assigns each sampled candidate an energy given by its latent prediction error and combines this feasibility score with value estimates to select actions.
arXiv Detail & Related papers (2026-03-03T06:36:16Z) - Optimistic Feasible Search for Closed-Loop Fair Threshold Decision-Making [0.0]
We study online learning of a one-dimensional threshold policy from bandit feedback.<n>We propose Optimistic Feasible Search (OFS), a simple grid-based method that maintains confidence bounds for reward and constraint residuals.
arXiv Detail & Related papers (2025-12-26T10:44:40Z) - Measuring What Matters: Scenario-Driven Evaluation for Trajectory Predictors in Autonomous Driving [8.115144579497644]
We propose a comprehensive pipeline that adaptively evaluates the predictor's performance by two dimensions: accuracy and diversity.<n>Experiments on a closed-loop benchmark using real-world datasets show that our pipeline yields a more reasonable evaluation than traditional metrics.
arXiv Detail & Related papers (2025-12-13T06:48:32Z) - Mimir: Hierarchical Goal-Driven Diffusion with Uncertainty Propagation for End-to-End Autonomous Driving [17.533465904228844]
We propose Mimir, a novel hierarchical dual-system framework capable of generating robust trajectories relying on goal points with uncertainty estimation.<n>Mimir surpasses previous state-of-the-art methods with a 20% improvement in the driving scoreS, while achieving 1.6 times improvement in high-level module inference speed.
arXiv Detail & Related papers (2025-12-08T03:31:25Z) - Judging with Confidence: Calibrating Autoraters to Preference Distributions [56.17041629492863]
We argue that a reliable autorater must learn to model the full distribution of preferences defined by a target population.<n>We present two learning methods tailored to different data conditions.<n>Our results show that finetuning autoraters with a distribution-matching objective leads to verbalized probability predictions that are better aligned with the target preference distribution.
arXiv Detail & Related papers (2025-09-30T20:36:41Z) - Plan-R1: Safe and Feasible Trajectory Planning as Language Modeling [74.41886258801209]
We propose a two-stage trajectory planning framework that decouples principle alignment from behavior learning.<n>Plan-R1 significantly improves planning safety and feasibility, achieving state-of-the-art performance.
arXiv Detail & Related papers (2025-05-23T09:22:19Z) - Centaur: Robust End-to-End Autonomous Driving with Test-Time Training [84.78837437133234]
We propose Centaur, which updates a planner's behavior via test-time training without relying on hand-engineered rules or cost functions.<n>We develop a novel uncertainty measure, called Cluster Entropy, which is simple, interpretable, and compatible with state-of-the-art planning algorithms.
arXiv Detail & Related papers (2025-03-14T17:59:41Z)
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.