arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2210.08445cs.AI
收藏

基于连接的交叉口实时的控制调度

Connection-Based Scheduling for Real-Time Intersection Control

Rapid Flow Technologies Inc.(快速流技术公司);Carnegie Mellon University(卡内基梅隆大学)

Hsu-Chieh Hu, Joseph Zhou, Gregory J. Barlow, Stephen F. Smith

摘要:

本文提出了一种启发式的实时的【形】自适应交通信号控制调度算法。该算法采用基于车道的模型,该模型估计通过不同车道接近交叉口的所有车辆的到达时间,然后计算时间表(即,信号配时计划),其最小化由所有接近的车辆引起的累积延迟。描述了状态空间、修剪检查和A* 搜索的容许启发式算法,并表明它们能够实时的【形】生成交叉口调度(即,每一秒)。由于算法的有效性,无论是在模拟测试环境中还是在实际的现场测试中,所提出的方法在运行时性能上都优于表现力较低的动态规划方法和以前的基于A* 的方法。

英文摘要:

We introduce a heuristic scheduling algorithm for real-time adaptive traffic signal control to reduce traffic congestion. This algorithm adopts a lane-based model that estimates the arrival time of all vehicles approaching an intersection through different lanes, and then computes a schedule (i.e., a signal timing plan) that minimizes the cumulative delay incurred by all approaching vehicles. State space, pruning checks and an admissible heuristic for A* search are described and shown to be capable of generating an intersection schedule in real-time (i.e., every second). Due to the effectiveness of the heuristics, the proposed approach outperforms a less expressive Dynamic Programming approach and previous A*-based approaches in run-time performance, both in simulated test environments and actual field tests.

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

↑