arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1508.06173eess.SYcs.SY
收藏

交通系统中的阻塞问题规避

Blocking Avoidance in Transportation Systems

University of Illinois at Chicago(芝加哥伊利诺伊大学)

Shanyu Zhou, Hulya Seferoglu

AI总结:

本文研究交通系统中阻塞问题对交叉口等待时间的影响,提出基于意图信息的排队模型,并开发最短延迟算法以优化路径选择。

摘要:

阻塞问题自然出现在交通系统中,当多辆不同路线的车辆共享可用资源时会发生。本文研究了阻塞问题对交通系统交叉口等待时间的影响。我们假设不同车辆根据其互联网连接能力,可能向交叉口(特别是连接交通灯的设备)传达其意图(例如左转、右转或继续直行)。我们考虑这些设备收集的信息通过云基础交通控制系统传输和处理。因此,基于意图信息的云系统可以计算交叉口的平均等待时间。我们将此问题视为排队模型,并通过考虑(i)阻塞概率和(ii)车辆通信意图的能力来表征平均等待时间。然后,通过交叉口的平均等待时间,我们开发了最短延迟算法,计算交通网络中两点之间的最短延迟路径。我们的模拟结果证实了我们的分析,并表明我们的最短延迟算法在不了解阻塞问题的基线算法上显著改进。

英文摘要:

The blocking problem naturally arises in transportation systems as multiple vehicles with different itineraries share available resources. In this paper, we investigate the impact of the blocking problem to the waiting time at the intersections of transportation systems. We assume that different vehicles, depending on their Internet connection capabilities, may communicate their intentions (e.g., whether they will turn left or right or continue straight) to intersections (specifically to devices attached to traffic lights). We consider that information collected by these devices are transmitted to and processed in a cloud-based traffic control system. Thus, a cloud-based system, based on the intention information, can calculate average waiting times at intersections. We consider this problem as a queuing model, and we characterize average waiting times by taking into account (i) blocking probability, and (ii) vehicles' ability to communicate their intentions. Then, by using average waiting times at intersection, we develop a shortest delay algorithm that calculates the routes with shortest delays between two points in a transportation network. Our simulation results confirm our analysis, and demonstrate that our shortest delay algorithm significantly improves over baselines that are unaware of the blocking problem.

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

↑