论文标题
连接和自动化车辆的最佳路由和协调
Combined Optimal Routing and Coordination of Connected and Automated Vehicles
论文作者
论文摘要
在这封信中，我们考虑了一个连接和自动化车辆（CAVS）100 \％渗透率的运输网络，并提出了一种最佳路由方法，该方法考虑了通过在特定的交通情况下协调骑士，例如交叉点，交叉点，合并道路和圆形往返来考虑网络中实现的效率。为了得出旅行请求的最佳路线，我们使用已经收到路由解决方案的CAV的信息。这使每个骑士都可以考虑道路上的交通状况。任何新旅行请求的解决方案都确定了每个交通情况下的最佳旅行时间，同时满足所有状态，控制和安全限制。我们通过数值模拟验证框架的性能。据我们所知，这是在路由问题中考虑骑士的协调的首次尝试。
In this letter, we consider a transportation network with a 100\% penetration rate of connected and automated vehicles (CAVs) and present an optimal routing approach that takes into account the efficiency achieved in the network by coordinating the CAVs at specific traffic scenarios, e.g., intersections, merging roadways, and roundabouts. To derive the optimal route of a travel request, we use the information of the CAVs that have already received a routing solution. This enables each CAV to consider the traffic conditions on the roads. The solution of any new travel request determines the optimal travel time at each traffic scenario while satisfying all state, control, and safety constraints. We validate the performance of our framework through numerical simulations. To the best of our knowledge, this is the first attempt to consider the coordination of CAVs in a routing problem.
