首页> 外文会议>IEEE/ACM international symposium on cluster, cloud and grid computing >Intelligent Congestion Avoidance Algorithm and System -- Application of Data Vitalization
【24h】

Intelligent Congestion Avoidance Algorithm and System -- Application of Data Vitalization

机译:智能拥塞避免算法和系统-数据生命力的应用

获取原文
获取外文期刊封面目录资料

摘要

This paper proposes a novel method for the timely selection of a shortest travel time route for drivers. The problem is formulated as a path planning problem: traffic congestion avoidance in an urban traffic network using multi-source traffic information. The key idea is to compute the travel time for each road section and to dynamically select the fastest path according to the traffic. We collect traffic information from the Internet and combine this current information with historical data for path planning. This information defines traffic hotspots that could produce traffic jams on the road. An improved traffic impedance model is used for calculating the road travel time in this paper according to the traffic conditions. The improved impedance model needs to import the impact level of traffic hotspots, so we also proposed a novel time-space influence model for calculating the hotspots impedance level on the road. In order to obtain the final path, we update the operation on the queue in the SPFA algorithm for dynamic routing on stochastic traffic network. Experiments on the real scenario using Google map for navigation for drivers demonstrate a shortest travel time path effectively.
机译:本文提出了一种及时选择驾驶员最短行驶时间路线的新方法。该问题被表述为路径规划问题:使用多源交通信息来避免城市交通网络中的交通拥堵。关键思想是计算每个路段的行驶时间,并根据交通动态选择最快的路径。我们从Internet收集交通信息,并将当前信息与历史数据结合起来进行路径规划。该信息定义了可能在道路上造成交通拥堵的交通热点。根据交通情况,采用改进的交通阻抗模型来计算道路行驶时间。改进的阻抗模型需要引入交通热点的影响水平,因此我们还提出了一种新颖的时空影响模型来计算道路上的热点阻抗水平。为了获得最终路径,我们在SPFA算法中更新了队列上的操作,以在随机交通网络上进行动态路由。使用谷歌地图为驾驶员导航的真实场景实验证明了最短的旅行时间路径。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号