用离线强化学习让自动驾驶模型更稳健,比模仿学习成功率高3.2倍。
From Imitation to Optimization: A Comparative Study of Offline Learning for Autonomous Driving
- 用结构化状态表示和Transformer改进模仿学习基线。
- 在Waymo数据集上,离线强化学习使成功率达3.2倍、碰撞率降7.4倍。
- 适合追求高鲁棒性自动驾驶系统的研究者与工程师。
从大规模真实世界数据中学习鲁棒的驾驶策略是自动驾驶的核心挑战,因在线数据采集存在安全隐患且不切实际。虽然行为克隆(BC)提供了简单的模仿学习方法,但其训练出的策略极易失效,在闭环执行中会累积误差。本文构建了一套逐步复杂的BC基线,最终采用基于Transformer的模型,结合实体中心的状态表示。尽管该模型模仿损失较低,但在长时程模拟中仍表现不佳。随后,我们使用先进的离线强化学习算法保守Q学习(CQL),在相同数据与架构下训练,获得显著更鲁棒的策略。通过精心设计的奖励函数,CQL代理学习到一个保守的价值函数,能纠正微小错误并避免分布外状态。在Waymo Open Motion Dataset的1000个未见场景的大规模评估中,最终的CQL代理相比最强的BC基线,成功率提升3.2倍,碰撞率降低7.4倍,证明离线强化学习对于从静态专家数据中学习长时程鲁棒驾驶策略至关重要。
原文摘要 · Abstract (English)
Learning robust driving policies from large-scale, real-world datasets is a central challenge in autonomous driving, as online data collection is often unsafe and impractical. While Behavioral Cloning (BC) offers a straightforward approach to imitation learning, policies trained with BC are notoriously brittle and suffer from compounding errors in closed-loop execution. This work presents a comprehensive pipeline and a comparative study to address this limitation. We first develop a series of increasingly sophisticated BC baselines, culminating in a Transformer-based model that operates on a structured, entity-centric state representation. While this model achieves low imitation loss, we show that it still fails in long-horizon simulations. We then demonstrate that by applying a state-of-the-art Offline Reinforcement Learning algorithm, Conservative Q-Learning (CQL), to the same data and architecture, we can learn a significantly more robust policy. Using a carefully engineered reward function, the CQL agent learns a conservative value function that enables it to recover from minor errors and avoid out-of-distribution states. In a large-scale evaluation on 1,000 unseen scenarios from the Waymo Open Motion Dataset, our final CQL agent achieves a 3.2x higher success rate and a 7.4x lower collision rate than the strongest BC baseline, proving that an offline RL approach is critical for learning robust, long-horizon driving policies from static expert data.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。