智能车辆最短路径算法的研究与实现  

The Research and Implementation of Intelligent Vehicle Shortest Path Algorithm

作　　者：李德龙[1] 张冰[2] 

机构地区：[1]西安通信学院,陕西西安710106 [2]南京财经大学,江苏南京210046

出　　处：《现代电子技术》2006年第19期133-134,137,共3页Modern Electronics Technique

摘　　要：最短路径算法是智能车辆路径规划问题的核心内容。从道路网络拓扑结构的自动构建以及Dijkstra算法中快速搜索技术的实现入手,综合考虑核心算法和数据存储结构两个方面,提出了直线优化Dijkstra算法。该算法能够有效降低时间复杂性,提高系统的效率。The shortest path algorithm is an important content in research of intelligent vehicle path planning. Starting with construction of the topological structure of network and the realization of rapid search technology of Dijkstra algorithm, considering of data storage framework, the paper proposes the improved Dijkstra shortest algorithm. It is based on the theory that the beeline is the shortest between two points and designs a reasonable limiting region to reduce the scale of search of the algorithm. The algorithm has the practicability and flexibility.

关 键 词：路径规划 最短路径算法 DIJKSTRA 智能车辆 

分 类 号：TP242.6[自动化与计算机技术—检测技术与自动化装置]