华南理工大学学报(自然科学版) ›› 2016, Vol. 44 ›› Issue (4): 101-108.doi: 10.3969/j.issn.1000-565X.2016.04.015

• 交通与运输工程 • 上一篇    下一篇

考虑信号交叉口转向类型的最优路径规划算法

周熙阳1 杨兆升1,2,3 张伟1,2,4† 邴其春1 商强1   

  1. 1. 吉林大学 交通学院,吉林 长春 130022; 2. 吉林大学 汽车仿真与控制国家重点实验室,吉林 长春 130022;3. 吉林大学 吉林省道路交通重点实验室,吉林 长春 130022; 4. 山东高速股份有限公司,山东 济南 250014
  • 收稿日期:2015-07-22 修回日期:2015-11-30 出版日期:2016-04-25 发布日期:2016-04-12
  • 通信作者: 张伟(1978-) ,男,博士后,主要从事智能交通运输系统研究. E-mail:z__wei@126.com
  • 作者简介:周熙阳(1989-) ,男,博士生,主要从事智能交通运输系统研究. E-mail: xyzhou@ vip. 126. com
  • 基金资助:
    国家科技支撑计划项目( 2014BAG03B03)

Optimal Route Planning Algorithm Considering Movement Type at Signal Intersections

ZHOU Xi-yang1 YANG Zhao-sheng1,2,3 ZHANG Wei1,2,4 BING Qi-chun1 SHANG Qiang1   

  1. 1.College of Transportation,Jilin University,Changchun 130022,Jilin,China; 2.State Key Laboratory of Automotive Simulation and Control,Jilin University,Changchun 130022,Jilin,China; 3.Jilin Province Key Laboratory of Road Traffic,Jilin University,Changchun 130022,Jilin,China; 4.Shandong High-Speed Group Co.,Ltd.,Jinan 250014,Shandong,China
  • Received:2015-07-22 Revised:2015-11-30 Online:2016-04-25 Published:2016-04-12
  • Contact: 张伟(1978-) ,男,博士后,主要从事智能交通运输系统研究. E-mail:z__wei@126.com
  • About author:周熙阳(1989-) ,男,博士生,主要从事智能交通运输系统研究. E-mail: xyzhou@ vip. 126. com
  • Supported by:
    Supported by the National Key Technology Research and Development Program of the Ministry of Science and Technology of China( 2014BAG03B03)

摘要: 针对现有最优路径规划算法没有充分考虑不同转向类型的车辆在信号交叉口处的等待时间,导致算出的最优路径实际效果不佳等问题,提出了一种考虑信号交叉口转向类型的最优路径规划算法. 首先,根据不同的转向类型构建了信号交叉口等待时间模型;然后,提出了一种改进的星型表,对路网中邻接路段之间的转向类型与相应参数进行表达和存储优化; 在此基础上,提出了考虑信号交叉口转向类型的拓展A* 算法( CMTA* 算法) ,并进行了算例验证. 结果表明,相比于传统算法和考虑信号交叉口等待时间的CWTSISP算法,CMTA* 算法所计算出的最优路径时间费用更低,并且运算效率更高.

关键词: 最优路径规划算法, 交叉口, 转向类型, 等待时间, 交通工程

Abstract: As the existing optimal route planning algorithms do not fully consider the waiting time of vehicles with different movement types at signal intersections,no satisfactory optimal routes can be obtained.In order to solve this problem,an optimal route planning algorithm considering the movement type at signal intersections is proposed.In this algorithm,first,a waiting time model considering the movement type at signal intersections is established.Then,an improved forward star structure is constructed to optimize the representation and storage of the movement type and information in the road network.Moreover,an extended A* algorithm considering the movement type,namely CMTA* algorithm,is developed,and a case study is carried out.The results show that,as compared with the traditional algorithm and the CWTSI-SP algorithm considering the waiting time at intersections,CMTA* algorithm helps to obtain better routes with lower time cost.

Key words: optimal route planning algorithm, intersection, movement type, waiting time, traffic engineering

中图分类号: