摘要
提出一种新的蜘蛛式路网模型,它以路口的一般性特征为基础,对复杂城市路网结构的物理和交通连通性进行一致性的描述,并能够以此为基础实现与普通图结构同等时间复杂度的最优路径算法.试验表明基于该模型的数字地图能高效地实现路径规划和导航相关操作,为驾车者提供丰富的行车信息,适合于车载导航使用.
This paper proposes a newly developed spider-web model based on the general characteristics of road intersections.It describes the physical and traffic connectivity of networks in a coherent way.Shortest paths algorithms based on it can reach the same time-efficiency as on normal graph structures.Experiments show digital maps based on this model can implement paths planning and navigation-related operations efficiently and provide abundant driving information.The model is proved practical for In-Vehicle Navigation Systems.
出处
《武汉理工大学学报(交通科学与工程版)》
2010年第3期439-442,共4页
Journal of Wuhan University of Technology(Transportation Science & Engineering)
基金
北京市科技计划项目资助
关键词
道路交通网络
车辆导航
蛛网模型
A*最短路径算法
road traffic networks
vehicle navigation
spider-web road network model
A* shortest paths algorithm