通过增强奖励设计,让自动驾驶泊车更稳定高效。
Reward-Augmented Reinforcement Learning for Continuous Control in Precision Autonomous Parking via Policy Optimization Methods
- 设计三种奖励策略,提升连续控制下的学习效果。
- 里程碑奖励使成功率达91%,轨迹更平滑。
- 适合自动驾驶控制与强化学习研究者参考。
自动驾驶泊车(AP)是智能汽车自动化中的关键但复杂任务,具有空间限制严、近距离障碍物交互频繁及安全裕度要求高等特点。传统基于规则和模型预测的方法难以适应非线性与环境依赖的复杂性。为此,本文提出一种奖励增强学习框架(RARLAP),通过结构化奖励设计缓解连续域控制的挑战,在高保真Unity定制3D仿真环境中完全训练。系统评估三种奖励策略:仅目标奖励(GOR)、密集接近奖励(DPR)和里程碑增强奖励(MAR),并结合在线与离线策略优化方法。实验表明,采用在线策略的MAR实现91%的成功率,轨迹更平滑,行为更鲁棒;而GOR与DPR无法有效引导学习。收敛性与轨迹分析显示,该框架提升了策略适应性、加速了训练过程,并增强了安全性。总体而言,奖励增强能有效应对复杂泊车挑战,支持基于在线与离线方法的可扩展高效策略优化。代码已公开以保障可复现性。
原文摘要 · Abstract (English)
Autonomous parking (AP) represents a critical yet complex subset of intelligent vehicle automation, characterized by tight spatial constraints, frequent close-range obstacle interactions, and stringent safety margins. However, conventional rule-based and model-predictive methods often lack the adaptability and generalization needed to handle the nonlinear and environment-dependent complexities of AP. To address these limitations, we propose a reward-augmented learning framework for AP (RARLAP), that mitigates the inherent complexities of continuous-domain control by leveraging structured reward design to induce smooth and adaptable policy behavior, trained entirely within a high-fidelity Unity-based custom 3D simulation environment. We systematically design and assess three structured reward strategies: goal-only reward (GOR), dense proximity reward (DPR), and milestone-augmented reward (MAR), each integrated with both on-policy and off-policy optimization paradigms. Empirical evaluations demonstrate that the on-policy MAR achieves a 91\% success rate, yielding smoother trajectories and more robust behavior, while GOR and DPR fail to guide effective learning. Convergence and trajectory analyses demonstrate that the proposed framework enhances policy adaptability, accelerates training, and improves safety in continuous control. Overall, RARLAP establishes that reward augmentation effectively addresses complex autonomous parking challenges, enabling scalable and efficient policy optimization with both on- and off-policy methods. To support reproducibility, the code accompanying this paper is publicly available.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。