首页> 美国卫生研究院文献>Sensors (Basel Switzerland) >A Cooperative Traffic Control of Vehicle–Intersection (CTCVI) for the Reduction of Traffic Delays and Fuel Consumption
【2h】

A Cooperative Traffic Control of Vehicle–Intersection (CTCVI) for the Reduction of Traffic Delays and Fuel Consumption

机译:车辆交叉口的协同交通控制(CTCVI)以减少交通延误和燃油消耗

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

The problem of reducing traffic delays and decreasing fuel consumption simultaneously in a network of intersections without traffic lights is solved by a cooperative traffic control algorithm, where the cooperation is executed based on the connection of Vehicle-to-Infrastructure (V2I). This resolution of the problem contains two main steps. The first step concerns the itinerary of which intersections are chosen by vehicles to arrive at their destination from their starting point. Based on the principle of minimal travel distance, each vehicle chooses its itinerary dynamically based on the traffic loads in the adjacent intersections. The second step is related to the following proposed cooperative procedures to allow vehicles to pass through each intersection rapidly and economically: on one hand, according to the real-time information sent by vehicles via V2I in the edge of the communication zone, each intersection applies Dynamic Programming (DP) to cooperatively optimize the vehicle passing sequence with minimal traffic delays so that the vehicles may rapidly pass the intersection under the relevant safety constraints; on the other hand, after receiving this sequence, each vehicle finds the optimal speed profiles with the minimal fuel consumption by an exhaustive search. The simulation results reveal that the proposed algorithm can significantly reduce both travel delays and fuel consumption compared with other papers under different traffic volumes.
机译:通过协作交通控制算法解决了在没有交通信号灯的交叉路口网络中同时减少交通延误和减少燃油消耗的问题,该算法基于车辆到基础设施(V2I)的连接来执行协作。解决问题的方法包括两个主要步骤。第一步涉及车辆选择哪个十字路口以从其起点到达目的地的路线。基于最小行驶距离的原理,每辆车都会根据相邻交叉路口的交通负荷动态选择路线。第二步与以下建议的合作程序有关,以允许车辆快速经济地通过每个交叉路口:一方面,根据车辆在通信区域边缘通过V2I发送的实时信息,应用每个交叉路口动态规划(DP),以最小的交通延误协同优化车辆的通过顺序,使车辆可以在相关的安全约束下快速通过交叉路口;另一方面,在接收到此序列之后,每辆车都会通过详尽搜索找到具有最小燃油消耗的最佳速度曲线。仿真结果表明,与其他论文相比,该算法在不同交通量下可以显着减少旅行延误和燃油消耗。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号