摘要
最短路径搜寻是智能交通系统(ITS)中车辆诱导的关键技术之一。作者根据城市交通道路网络建设的实际,研究了描述城市交通路网的道路数据库的结构。在此基础上采集大量道路信息,溶入GIS技术,建立城市道路网络数据库。用动态邻接矩阵对经典的Dijkstra算法进行改进,提高了运算效率。采用改进的算法实现了车辆诱导系统中的快速最短路径搜寻,并给出了车辆诱导系统搜寻最短路径的一个实例。
In intelligent vehicle navigation system,the shortest path searching is one of important technology.The authors study the structure of road network database according to the actual construction of road network in city.Based on the collection of road information,the road network database is constructed by means of GIS technology.Classical Dijkstra algorithm is optimized with dynamic adjacency matrix,which enhances the efficiency of calculation.The fast shortest path searching is carried out with the improved Dijkstra algorithm,and an example of the shortest path searching in vehicle guidance system is given.
出处
《公路交通科技》
CAS
CSCD
北大核心
2005年第3期105-107,共3页
Journal of Highway and Transportation Research and Development
基金
山东省教育厅中青年学术骨干基金资助(A2002 107)
