Using Bi-Directional Information Exchange to Improve Decentralized Schedule-Driven Traffic Control

Using Bi-Directional Information Exchange to Improve Decentralized Schedule-Driven Traffic Control
复制标题

使用双向信息交换改进分散式调度驱动的交通控制

DOI:
--
复制
发表时间:
2019
期刊:
International Conference on Automated Planning and Scheduling
影响因子:
--
通讯作者:
Stephen F. Smith
Stephen F. Smith
中科院分区:
--
文献类型:
--
作者:
Hsu;Stephen F. Smith

文献摘要

被引文献

相似文献

最近在分散的、时间表驱动的交通控制方面的工作已经证明了在复杂的城市道路网络中提高交通流效率的能力。在这种方法中,调度代理与每个交叉点相关联。每个智能体感知到接近其交叉路口的交通,并实时构建一个时间表,以最大限度地减少当前展望范围内接近交叉路口的车辆的累积等待时间。为了以可伸缩的方式实现网络级协调,调度代理只与它们的直接邻居通信。每次智能体生成一个新的交叉调度时,它将其预期流出量作为对未来需求的预测传递给下游邻居,这些流出量附加到下游智能体的本地感知需求中。在本文中,我们扩展了这个基本的协调算法,以额外地纳入反映交叉口当前拥塞水平的互补信息流到其上游邻居。基于这些双向信息流,我们提出了一种异步去中心化的交叉口调度和拥堵水平估计更新算法。通过将该算法与基本操作的自优化决策联系起来,我们能够接近全网最优性,并减少由于严格自利益交叉控制决策而导致的低效率。
Recent work in decentralized, schedule-driven traffic control has demonstrated the ability to improve the efficiency of traffic flow in complex urban road networks. In this approach, a scheduling agent is associated with each intersection. Each agent senses the traffic approaching its intersection and in real-time constructs a schedule that minimizes the cumulative wait time of vehicles approaching the intersection over the current look-ahead horizon. In order to achieve network level coordination in a scalable manner, scheduling agents communicate only with their direct neighbors. Each time an agent generates a new intersection schedule it communicates its expected outflows to its downstream neighbors as a prediction of future demand and these outflows are appended to the downstream agent’s locally perceived demand. In this paper, we extend this basic coordination algorithm to additionally incorporate the complementary flow of information reflective of an intersection’s current congestion level to its upstream neighbors. We present an asynchronous decentralized algorithm for updating intersection schedules and congestion level estimates based on these bi-directional information flows. By relating this algorithm to the self-optimized decision making of the basic operation, we are able to approach network-wide optimality and reduce inefficiency due to strictly self-interested intersection control decisions.