Metraipolis › archive › dc_b6066d5ef91a

DriftingPlanner: Drifting Generative Models for One-Step Trajectory Planning in End-to-End Autonomous Driving — arXiv:2611.01283

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01283
License (as archived)
CC0-1.0
Archived
2026-11-03T18:53:23.595Z
SHA-256 of the archived text
c4715348292f52c86515c0f7e127a3194192f3ce59c5824ad16b9ed0855660cc
Stable URL of this page
https://metraipolis.com/documento/dc_b6066d5ef91a

How to cite

DriftingPlanner: Drifting Generative Models for One-Step Trajectory Planning in End-to-End Autonomous Driving — arXiv:2611.01283 — arXiv (en), https://arxiv.org/abs/2611.01283 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b6066d5ef91a (Metraipolis archive dc_b6066d5ef91a, sha256 c4715348292f52c86515c0f7e127a3194192f3ce59c5824ad16b9ed0855660cc)
BibTeX
@misc{dcb6066d5ef91a,
  title = {DriftingPlanner: Drifting Generative Models for One-Step Trajectory Planning in End-to-End Autonomous Driving — arXiv:2611.01283},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01283},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b6066d5ef91a; sha256 c4715348292f52c86515c0f7e127a3194192f3ce59c5824ad16b9ed0855660cc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01283. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

End-to-end planners decode the ego trajectory either by coordinate regression, which is fast but blends plausible maneuvers into one trajectory that may follow none of them, or by diffusion and flow matching, which model the trajectory distribution but need several inference steps. Drifting models move this iteration into training: a one-step generator learns to follow an attraction--repulsion field between generated and ground-truth samples. Drifting was developed for class-conditional image generation, where every class supplies many positive samples. In planning, every scene is its own condition. Pooling scenes would attract the generated trajectories of one scene to the ground truth of unrelated scenes, whereas computing the field per scene leaves a single positive, the expert trajectory. Mutual repulsion then holds the generated trajectories on a shell around it, so any single generated trajectory deviates from the ground truth. We present DriftingPlanner, a trajectory planner trained with the drifting loss alone, without any coordinate regression term. It computes the field per scene and removes the shell at inference: it decodes every noise vector together with its negation in one batched pass, and averaging each antithetic pair cancels the linear part of the displacement from the shell center. On NAVSIM navtest, DriftingPlanner reaches a state-of-the-art 93.75 PDMS, and with single-step inference its drifting decoder comes within 0.13 PDMS of the best diffusion or flow matching setting, which needs ten inference steps.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv cs.CV, nuovi lavori del giorno).
Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV) ; Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2611.01283 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:16:52.921Z dalla pagina https://arxiv.org/list/cs.CV/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).