摘要
基于道路网络的知识,探讨了定义一个层次拓扑来帮助路径寻找及如何确定层次之间转换的入/出结点,并结合启发式技术来提高路径计算性能的路径寻找算法。实验表明,该方法不仅可以减少计算所需要的时间和空间,也会产生一个符合人类思维特点的解。
On the basis of the knowledge about the road network, an integrated approach using heuristic techniques and an efficient search algorithm for route finding, which improves the performance of the hierarchical routing algorithm with acceptable loss of accuracy, are presented. This technique not only substantially reduces the time and space required in computation, but also produces human oriented and personalized solutions.
出处
《武汉大学学报（信息科学版）》
EI
CSCD
北大核心
2006年第4期360-363,共4页
Geomatics and Information Science of Wuhan University
基金
国家自然科学基金资助项目(40171079)
关键词
层次路径寻找
道路网络
启发式技术
hierarchical wayfinding
road network
heuristic techniques
