用单步潜空间漂移+场景感知聚合,高效生成可执行驾驶轨迹。
DRIFT: Drift and Aggregation for Motion Planning

- 单次批量生成48个候选轨迹特征,支持多行为建模。
- 在NAVSIM上达89.6 PDMS和90.4 EPDMS,符合车道且推进顺利。
- 适合实时自动驾驶系统,推理仅需66.43毫秒。
端到端轨迹规划器需在实时约束下表示多种合理驾驶行为并输出单一可执行轨迹。基于提案的方法通过生成多个候选解来应对不确定性,但如何将提案集转化为最终规划仍是关键挑战。本文提出DRIFT,一种固定深度的规划器,结合紧凑轨迹潜空间中的一步漂移与场景感知的提案聚合。在预训练视觉编码器特征条件下,DRIFT解码器一次性批量生成48个提案特征,其中α=0.5时生成32个样本,α=0.9时生成16个样本。轻量级聚合头融合提案特征与场景、导航及自身状态信息,直接预测最终轨迹,无需轨迹级质量标签。输出通过专家轨迹模仿与地图导出边界正则化训练,后者惩罚位于可行驶区域外或靠近边界的路径点。在NAVSIM navtest上,DRIFT实现89.6 PDMS和90.4 EPDMS,具有强可行驶区域合规性与良好自身推进表现。提案生成与聚合模块在NVIDIA RTX 4090上耗时10.82毫秒,全模型推断(含视觉主干)为66.43毫秒。结果表明,单步潜空间提案生成与直接聚合提供了一种高效的多假设运动规划方案。
原文摘要 · Abstract (English)
End-to-end trajectory planners need to represent multiple plausible driving behaviors while producing a single executable trajectory under real-time constraints. Proposal-based approaches address this ambiguity by generating multiple candidates, but converting the proposal set into a final plan remains a key design problem. We present DRIFT, a fixed-depth planner that combines one-step drifting in a compact trajectory latent space with scene-aware proposal aggregation. Conditioned on features from a pretrained visual encoder, the DRIFT Decoder generates 48 proposal features in a single batched pass, with 32 samples at alpha=0.5 and 16 samples at alpha=0.9. A lightweight Aggregation Head integrates these features with scene, navigation, and ego-state information and directly predicts the final trajectory without requiring trajectory-level quality labels for aggregation. Its output is trained with expert-trajectory imitation and a map-derived boundary regularizer that penalizes waypoints outside the drivable polygon and inside waypoints near its boundary. On NAVSIM navtest, DRIFT achieves 89.6 PDMS and 90.4 EPDMS, with strong drivable-area compliance and ego progress among the methods compared. The proposal-generation and aggregation module runs in 10.82 ms on an NVIDIA RTX 4090, while full-model inference including the visual backbone takes 66.43 ms. These results show that one-step latent proposal generation and direct aggregation provide an efficient design for multi-hypothesis motion planning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。