交通运输系统工程与信息 ›› 2008, Vol. 8 ›› Issue (2): 64-68 .

• 系统工程理论与方法 • 上一篇    下一篇

基于交通约束的高效路径规划算法

杨东凯*1,2;陈志宇1 ;吴今培1 ;徐爱功2   

  1. 1北京航空航天大学 电子信息工程学院 北京 100083 ; 2 辽宁工程技术大学 地理空间信息技术及应用重点实验室,辽宁 阜新 123000
  • 收稿日期:2007-10-31 修回日期:2008-01-21 出版日期:2008-04-25 发布日期:2008-04-25
  • 通讯作者: 杨东凯
  • 作者简介:杨东凯(1972-),男,山东人,副教授.
  • 基金资助:

    辽宁工程技术大学地理空间信息技术及应用重点实验室开放基金(2004007).

High Efficient Route Planning Algorithm Based on Traffic Constraints

Yang Dong-kai 1,2 ;Chen Zhi-yu 1 ;Wu Jin-pei 1 ;Xu Ai-gong 2   

  1. 1 School of Electronic and Information Engineering, Beihang University, Beijing 100083, China;
    2 Geomatics and applications laboratory, LiaoNing Technological University,Fuxin123000, LiaoningChina
  • Received:2007-10-31 Revised:2008-01-21 Online:2008-04-25 Published:2008-04-25
  • Contact: Yang Dong-kai

摘要: 分析了路径规划问题及其在交通约束条件下的特点。从算法改进和模型改进两方面对路径规划算法进行了研究,在详细分析Dijkstra算法步骤和对偶法的基础上,给出了交通约束的数学模型及道路网络的相关定理。基于传统Dijkstra算法,对搜索过程中的节点和边的标记方式和规则进行了改进,提出了一种在交通约束条件下的高效路径规划算法。该算法通过减少搜索节点和标记边的次数而减少搜索过程中的运算量。仿真结果表明,该算法对偶法1/3~1/4的运算量。

关键词: 路径规划, 交通约束, Dijkstra算法

Abstract: This paper analyzes the characteristics of route planning with traffic constraints. It explores the route planning algorithm from both the algorithm modifications and modeling modifications. Meanwhile, based on the elaborate analysis of Dijkstra algorithm steps and dual method, this paper discusses the mathematic model with traffic constraints and the relative theorem on road network. In addition, the traditional Dijkstra algorithm is modified for the node searching and link marking rule during the planning process. Furthermore, a high efficient algorithm is proposed with consideration of traffic constraints. It decreases the computation time through decreasing the searching nodes and link marking times. The simulation result indicates that the computation complexity the presented algorithm is 1/3-1/4 of the dual method.

Key words: route-planning, traffic constraints, Dijkstra algorithm

中图分类号: