期刊文献+

基于云网格集成调度的防拥堵车辆路径规划算法 被引量:21

Anti Congestion Vehicle Path Planning Algorithm Based on Cloud Grid Integrated Scheduling
在线阅读 下载PDF
导出
摘要 在道路交通路网中,车辆拥堵问题是流量与路网结构之间相互作用的一个复杂动态过程,通过车辆路径规划,实现对路网网格集成调度,从而提高路网通行吞吐量。传统方法采用并行微观交通动态负载平衡预测算法实现车辆拥堵调度和车辆路径规划,不能准确判断路面上的车辆密度,路径规划效益不好。提出一种基于云网格集成调度的防拥堵车辆路径规划算法,即构建基于Small-World模型的云网格路网模型,采用RFID标签信息进行路况信息采集,实现交通网络拥堵评估信息特征的提取,采用固有模态函数加权平均求得各车道的车辆拥塞状态函数,对所有车道内车辆密度取统计平均可获得簇内的车辆密度。设计交通路网拥堵检测算法来对当前个体道路信息进行一维邻域搜索,从而实现车辆路径规划控制目标函数最佳寻优。通过动态博弈的方式求得车辆防拥堵路径的近似最优轨迹,实现路径规划算法的改进。仿真结果表明,该算法能准确规划车辆路径,实现最优路径控制,从而提高严重拥堵路段的车流速度和路网吞吐性能,性能优越。 In the road traffic network,traffic congestion problem is a complicated dynamic process of interaction between flow and the structure of the network.Through the vehicle path planning,the integration of the road network grid scheduling is realized,and traffic throughput can be improved.The traditional method adopts parallel microscopic traffic dynamic prediction algorithm to realize the vehicle congestion scheduling and vehicle routing planning,but the algorithm can not accurately judge the density of vehicles,and the performance is not good.An improved anti congestion vehicle path planning algorithm was proposed based on cloud grid integrated scheduling.The cloud road network model is constructed based on Small-World model,and RFID label is used to collect the traffic information.The intrinsic mode function weighted average is used to calculate the vehicle congestion state function of each lane,and the density of vehicles in all lanes is obtained from the statistical average available vehicle density cluster.The traffic road network congestion detection algorithm was designed,searching for the current road information of individual one-dimensional neighbor,then the vehicle path planning and best objective function optimization are realized.The dynamic game way is used to get the approximate optimal trajectory to improve the path planning algorithm.The simulation results show that the algorithm can accurately achieve the optimal vehicle path planning and control,and traffic speed and network throughput performance are improved in severe congestion state.It has better performance than traditional method.
作者 薛明 许德刚
出处 《计算机科学》 CSCD 北大核心 2015年第7期295-299,共5页 Computer Science
基金 国家自然科学基金资助项目(61202099) 河南省科技厅科技攻关项目(122102110107)资助
关键词 云网格 路网模型 吞吐量 路径规划 Cloud grid Road network model Throughput Path planning
  • 相关文献

参考文献11

  • 1Irnbush S. Joshi A. StreetSmart traffic: discovering and dis- seminating automobile congestion using VANET' s[C]// Vehi- cular Technology Conference(VTC200?). Dublin, 2007 : 11-15.
  • 2Marfia G,Roccetti M. Vehicular congestion detection and short- term forecasting: a new model with results[J]. IEEE Transac- tions on Vehicular Technology, 2011. 60(7) : 2936-2948.
  • 3Mandal K,Sen A,Chakraborty A, et al. Road traffic congestion monitoring and measurement using active RFID and GSM tech- nology[C]//lnt. IEEE Conf. Intelligent Transportation Systems (ITS). Washington DC,2011 : 1375-1379.
  • 4陈秀锋,许洪国,倪安宁.并行微观交通动态负载平衡预测方法仿真[J].计算机仿真,2013,30(8):164-168. 被引量:17
  • 5Leontiadis I,Marfia G,Mack D,et al. On the effectiveness of an opportunistic traffic management system for vehicular networks [J]. IEEE Transactions on Intelligent Transportation Systems, 2011,12(4) : 1537-1548.
  • 6Shen Wei, Wynter L. A New One-level Convex Optimization Approach for Estimating Origin-destination Demand [J'. Trans- portation Research Part B: Methodological, 2012,46 (10) : 1535- 1555.
  • 7Sun Hui-jun,Zhang Hui,Wu Jian-jun. Correlated scale-free net- work with community: modeling and transportation dynamics [J]. Nonlinear Dynamics, 2012,69 (4) : 2097-2104.
  • 8王光浩,吴越.一种车载自组织网络路况信息的数据信任模型[J].计算机科学,2014,41(6):89-93. 被引量:20
  • 9张子龙,薛静,乔鸿海,智永锋.基于改进SURF算法的交通视频车辆检索方法研究[J].西北工业大学学报,2014,32(2):297-302. 被引量:27
  • 10高觐悦.一种基于随机网格简化的Web可靠性分析方法研究[J].科技通报,2013,29(4):67-69. 被引量:2

二级参考文献67

  • 1胡乃静,赵亮,胡金化.基于Petri网的工作流结构正确性化简验证方法[J].小型微型计算机系统,2007,28(6):1076-1079. 被引量:8
  • 2Hafedh Mili,Ali Mili,Sherif Yacoub,等.韩柯等译.基于重用的软件工程-技术、组织和控制[M].北京:电子工业出版社,2003:13-25.
  • 3施建生,伍卫国,陆丽娜.Web使用挖掘研究与频繁遍历路径识别[D].西安:西安交通大学,2000.2.
  • 4DIJKSTRA E. A Note on Two Problems in Connection with Graphs [ J ]. Numerische Mathematics, 1959,1:269 - 271.
  • 5FLOYD R. Algorithm 97 : shortest path [ J ]. Communica- tions of the ACM, 1962,5 (6) :345.
  • 6FORD L R, Fulkerson D R. Flows in Networks [ M ]. San- ta Monica, CA: RAND Corporation, 1962.
  • 7HART P,NILSSON N, RAPHAEL B. A Formal Basis for the Heuristic Determination of Minimum Cost Paths [ J ]. IEEE Transactions on Systems Science and Cybernetics, 1968,4(2) :100 - 107.
  • 8FREDMAN M, TAR JAN R. Fibonacci Heaps and Their uses in Improved Network Optimization Algorithms [ J ]. Journal of the ACM, 1987,34 (3) :596 - 615.
  • 9PENG W, HU X F, ZHAO F. A Fast Algorithm to Find All-Pairs Shortest Paths in Complex Networks[J]. Proce- dia Computer Science,2012,9:557 - 566.
  • 10CHANT M. More Algorithms for All-Pairs Shortest Paths in Weighted Graphs [ J ]. SIAM Journal on Computing, 2010,39(5 ) :2075 - 2089.

共引文献56

同被引文献151

引证文献21

二级引证文献104

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部