.png){kind=icon}
返回
On Optimizing Reservation-Based Intersection Controls
.png){kind=icon}
OA
AI
DOI：10.1109/TITS.2016.2574948.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Tile-based reservation intersection control for autonomous vehicles has the potential to reduce intersection delays beyond optimized traffic signals. A major question in implementing reservations is the underdetermined problem of resolving conflicting reservation requests. Previous work studied prioritizing requests by first come first served or holding auctions at intersections, but the possibilities are infinite. Furthermore, although selfish routing behavior could affect the benefits of the reservation prioritization, reservation control has not been studied with user equilibrium routing due to its microsimulation definition. This paper addresses these issues by presenting an integer program formulation of the conflict point simplification of reservations. The feasible region is transformed, resulting in a more tractable integer program on conflict regions for dynamic traffic assignment. Because the integer program is NP-hard we present a polynomial-time heuristic. Finally, we demonstrate the potential utility of this heuristic by demonstrating objective functions that reduce travel time and energy consumption on a city network.
Keyword:
Autonomous vehicles
reservation-based control
dynamic traffic assignment
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.4
论文数:
9.7K
被引数:
6.3W
机构
引用论文
.png){kind=icon}
分享收藏Fabrication and properties of SiO
2f
/SiO
2
composite ceramic based on stereolithography technology
OAAI
OAAI分享收藏分享收藏
查看更多内容