用强化学习让自动驾驶车在危险区域中快速规划安全路径。
Path Planning Using Deep Deterministic Policy Gradient: A Reinforcement Learning Approach

- 用深度确定性策略梯度直接学从位置到动作的映射
- 训练后能覆盖更广起始点,确保路径安全且高效
- 适合需要实时决策的自动驾驶任务
自主车辆在充满威胁的环境中进行路径规划是一项基础挑战,因问题本身非线性且非凸。传统最优控制方法虽可生成理想路径,但计算时间过长,难以满足实时决策需求。本文提出基于深度确定性策略梯度(DDPG)的方法,将威胁建模为多个圆形‘禁区’。任务失败条件为:车辆进入任一禁区或未抵达目标邻近区域。智能体在模拟环境中通过试错训练,学习从当前位置和朝向直接映射到一系列可行动作,以安全抵达目的地。奖励函数包含三部分:(a) 以目标点为中心的吸引场,(b) 以障碍物中心为源的排斥场,(c) 控制能量消耗惩罚(转向幅度),间接鼓励直线路径。训练后的智能体可识别最广泛的安全起始点集合,为任务可行性提供预判,助力任务规划。仿真验证表明,该方法生成路径有效且速度显著优于传统伪谱最优控制方法,更适合实时应用。
原文摘要 · Abstract (English)
Path-planning for autonomous vehicles in threat-laden environments is a fundamental challenge because the problem is nonlinear and nonconvex even in simplest scenarios. While traditional optimal control methods can be used to find ideal paths, the computational time is often too slow for real-time decision-making. To solve this challenge, we propose a method based on Deep Deterministic Policy Gradient (DDPG) and model the threat as possibly multiple circular 'no-go' zones. A mission is regarded as a failure if the vehicle enters this restricted zone at any time or does not reach a neighborhood of the destination. The DDPG agent is trained through trial and error in a simulated environment, learning a direct mapping from its current state (position and heading) to a series of feasible actions that guide the agent to safely reach its destination. The reword function has three parts: (a) an attractive field centered at the final destination, (b) some repulsive fields centered at the origins of circular obstacles, and (c) a penalty of control energy consumption (the magnitude of heading change) that indirectly in favor for straight path. The DDPG trains the agent using these incentives to find the largest possible set of starting points wherein a safe path to the destination is guaranteed. This provides critical information for mission planning, showing beforehand whether a task is achievable from a given starting point, assisting pre-mission planning activities. The approach is validated in simulation. A comparison between the DDPG method and a traditional optimal control (pseudo-spectral) method is carried out. The results show that the learning-based agent produces effective paths while being significantly faster, making it a better fit for real-time applications.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。