...
首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >Cooperative Multiagent Deep Deterministic Policy Gradient (CoMADDPG) for Intelligent Connected Transportation with Unsignalized Intersection
【24h】

Cooperative Multiagent Deep Deterministic Policy Gradient (CoMADDPG) for Intelligent Connected Transportation with Unsignalized Intersection

机译:与无罪交叉口的智能连接运输的合作多态深度决定性政策梯度(COMADDPG)

获取原文
   

获取外文期刊封面封底 >>

       

摘要

Unsignalized intersection control is one of the most critical issues in intelligent transportation systems, which requires connected and automated vehicles to support more frequent information interaction and on-board computing. It is very promising to introduce reinforcement learning in the unsignalized intersection control. However, the existing multiagent reinforcement learning algorithms, such as multiagent deep deterministic policy gradient (MADDPG), hardly handle a dynamic number of vehicles, which cannot meet the need of the real road condition. Thus, this paper proposes a Cooperative MADDPG (CoMADDPG) for connected vehicles at unsignalized intersection to solve this problem. Firstly, the scenario of multiple vehicles passing through an unsignalized intersection is formulated as a multiagent reinforcement learning (RL) problem. Secondly, MADDPG is redefined to adapt to the dynamic quantity agents, where each vehicle selects reference vehicles to construct a partial stationary environment, which is necessary for RL. Thirdly, this paper incorporates a novel vehicle selection method, which projects the reference vehicles on a virtual lane and selects the largest impact vehicles to construct the environment. At last, an intersection simulation platform is developed to evaluate the proposed method. According to the simulation result, CoMADDPG can reduce average travel time by 39.28% compared with the other optimization-based methods, which indicates that CoMADDPG has an excellent prospect in dealing with the scenario of unsignalized intersection control.
机译:无信号化的交叉控制是智能交通系统中最关键的问题之一,需要连接和自动车辆来支持更频繁的信息交互和车载计算。在无罪化的交叉点控制中引入钢筋学习非常有希望。然而,现有的多算法强化学习算法,例如多眼深度决定性政策梯度(MADDPG),几乎没有处理动态数量的车辆,这不能满足真正的道路状况的需要。因此,本文提出了一种在无罪化交叉路口的连接车辆的合作Maddpg(Comaddpg),以解决这个问题。首先,通过无罪化交集的多个车辆的场景被制定为多轴增强学习(RL)问题。其次,MaddPG被重新定义以适应动态量代理,其中每辆车选择参考车辆以构建部分静止环境,这对于R1是必要的。第三,本文采用了一种新颖的车辆选择方法,该方法将参考车辆投射在虚拟车道上,并选择最大的冲击车辆以构建环境。最后,开发了一个交叉点模拟平台来评估所提出的方法。根据仿真结果,与其他基于优化的方法相比,Comaddpg可以将平均旅行时间减少39.28%,这表明Comaddpg在处理无罪化交叉点控制的情况下具有出色的前景。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号