Skip to content
Preprint

DriftParking: Trajectory Modeling via Drifting Field for End-to-End Automated Parking

Sep 2026 · 0 citations · 32 references
Computer Science

TL;DR

This work proposes DriftParking, a one-step trajectory generation framework that reconstructs the drifting-field paradigm for high-precision conditional trajectory generation, and replaces distribution-level attraction with conditional one-to-one attraction toward the paired expert trajectory, introduce expert-centered constructive repulsion, and adaptively attenuate repulsion near convergence.

Abstract

Automated parking requires generating complete and executable trajectories in highly constrained spaces with low tolerance for goal pose error. Existing end-to-end parking methods struggle to jointly achieve inference efficiency, trajectory quality, and precise endpoint alignment, while conventional imitation objectives provide limited supervision on structured deviations from expert maneuver geometry. We propose DriftParking, a one-step trajectory generation framework that reconstructs the drifting-field paradigm for high-precision conditional trajectory generation. Specifically, we replace distribution-level attraction with conditional one-to-one attraction toward the paired expert trajectory, introduce expert-centered constructive repulsion, and adaptively attenuate repulsion near convergence. We further formulate trajectory generation in an endpoint-residual space by decomposing each trajectory into a start-to-goal baseline and a learnable residual, turning endpoint alignment into a representation-level structural constraint on the supervision target while providing a structured space for repulsive supervision. DriftParking achieves state-of-the-art performance across all evaluation metrics. Closed-loop on-vehicle experiments across diverse parking scenarios further show a 97% parking success rate, demonstrating strong zero-shot generalization.

View source

Similar papers

Open access Aug 2026

HCAD-Net: end-to-end parking network with historical context and attention-based dual-decoder

A vision-based end-to-end autonomous parking framework trained through imitation learning that introduces a historical context fusion encoder to capture temporal dependencies from past vehicle motions, a dual-stream attention decoder to enhance interaction between scene features and trajectory representations, and kine...

Da Zheng, Bing-Li Zhang, Xinyu Wang et al. · 0 citations
#artificial intelligence Preprint Aug 2026

Aligning Multi-Trajectory Supervision with Policy Optimization for VLA Driving

A novel framework that aligns multi-trajectory supervision with policy optimization, and introduces two complementary mechanisms: feasibility-first advantage assignment and dynamic distillation to ensure that expanded trajectory supervision is effectively absorbed during policy optimization.

Tian Zhang, Zhuo Huang, Hong-Rui Ye et al. · 0 citations
Preprint Sep 2026

FeasibleFlow: One-Step Joint Transport of Configuration Feasibility and Trajectories for End-to-End Driving

This work proposes FeasibleFlow, a one-step end-to-end generative framework that jointly transports a configuration-space feasibility field and multimodal ego trajectories and introduces the Anchor-relative ranker (ARR) and Pareto-ReinFlow to balance safety and progress in candidate selection and generation.

Xiang Li, Bi-Kun Wang, Qing Xu et al. · 0 citations
Preprint Sep 2026

Designing Versatile Samples for Learned Trajectory Scoring

This work designs a training dataset that provides more informative supervision for the scorer and constructs two generators that perturb the logged human trajectory along the two axes a vehicle can be displaced: laterally toward the drivable boundary and longitudinally toward a leading vehicle.

Ya-Guang Li, Jia-Ru Zhang, Chu-Heng Wei et al. · 0 citations
Preprint Aug 2026

NeuralParker: A Reinforcement Learning Planner for Irregular Parking Environments

This work presents NeuralParker, a reinforcement learning-based hybrid planner for arbitrary-pose parking that encodes full-environment obstacle and boundary geometry in a target-relative vertex representation, allowing the policy to retain route-defining context throughout the approach.

Zihan Wang, Baixiang Huang, Yang Guan et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.