arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2008.11634cs.AIcs.LGcs.NEcs.SYeess.SY
收藏

现实限制条件下强化学习交通信号控制的奖励函数评估

Assessment of Reward Functions for Reinforcement Learning Traffic Signal Control under Real-World Limitations

University of Warwick(华威大学);Vivacity Labs

Alvaro Cabrejas-Egea, Shaun Howell, Maksis Knutins, Colm Connaughton

摘要:

自适应交通信号控制是缓解日益严重的交通拥堵后果的一个关键途径。SCOOT和SCATS等现有解决方案需要定期进行耗时的校准,无法很好地优化多种道路使用模式,并且需要手动管理许多实施计划。这些方法的最近替代方案是深度强化学习算法,其中代理学习如何针对系统的给定状态采取最适当的行动。这是由神经网络来引导的,该神经网络近似于奖励函数,该奖励函数向代理提供关于所采取的动作的性能的反馈,使其对所选择的特定奖励函数敏感。几位作者调查了文献中使用的奖励函数,但将结果差异归因于不同作品的奖励函数选择是有问题的,因为存在许多不受控制的差异,以及不同的结果指标。本文比较了代理人的性能,使用不同的奖励函数在模拟的一个路口在大曼彻斯特,英国,在各种需求配置文件,受现实世界的约束:现实的传感器输入,控制器,校准的需求,intergreen时间和阶段排序。所考虑的奖励指标是基于停止所花费的时间、损失时间、损失时间的变化、平均速度、队列长度、路口吞吐量和这些幅度的变化。这些奖励功能的性能进行比较的总等待时间。我们发现,速度最大化导致最低的平均等待时间在所有的需求水平,显示出显着更好的性能比其他奖励先前在文献中介绍。

英文摘要:

Adaptive traffic signal control is one key avenue for mitigating the growing consequences of traffic congestion. Incumbent solutions such as SCOOT and SCATS require regular and time-consuming calibration, can't optimise well for multiple road use modalities, and require the manual curation of many implementation plans. A recent alternative to these approaches are deep reinforcement learning algorithms, in which an agent learns how to take the most appropriate action for a given state of the system. This is guided by neural networks approximating a reward function that provides feedback to the agent regarding the performance of the actions taken, making it sensitive to the specific reward function chosen. Several authors have surveyed the reward functions used in the literature, but attributing outcome differences to reward function choice across works is problematic as there are many uncontrolled differences, as well as different outcome metrics. This paper compares the performance of agents using different reward functions in a simulation of a junction in Greater Manchester, UK, across various demand profiles, subject to real world constraints: realistic sensor inputs, controllers, calibrated demand, intergreen times and stage sequencing. The reward metrics considered are based on the time spent stopped, lost time, change in lost time, average speed, queue length, junction throughput and variations of these magnitudes. The performance of these reward functions is compared in terms of total waiting time. We find that speed maximisation resulted in the lowest average waiting times across all demand levels, displaying significantly better performance than other rewards previously introduced in the literature.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑