翁敏, 毋河海, 杜清运, 李林燕. 基于道路网络知识的启发式层次路径寻找算法[J]. 武汉大学学报 ( 信息科学版), 2006, 31(4): 360-363.
引用本文: 翁敏, 毋河海, 杜清运, 李林燕. 基于道路网络知识的启发式层次路径寻找算法[J]. 武汉大学学报 ( 信息科学版), 2006, 31(4): 360-363.
WENG Min, WU Hehai, DU Qingyun, LI Linyan. A Heuristic and Hierarchical Wayfinding Algorithm Based on the Knowledge of Road Network[J]. Geomatics and Information Science of Wuhan University, 2006, 31(4): 360-363.
Citation: WENG Min, WU Hehai, DU Qingyun, LI Linyan. A Heuristic and Hierarchical Wayfinding Algorithm Based on the Knowledge of Road Network[J]. Geomatics and Information Science of Wuhan University, 2006, 31(4): 360-363.

基于道路网络知识的启发式层次路径寻找算法

A Heuristic and Hierarchical Wayfinding Algorithm Based on the Knowledge of Road Network

  • 摘要: 基于道路网络的知识,探讨了定义一个层次拓扑来帮助路径寻找及如何确定层次之间转换的入/出结点,并结合启发式技术来提高路径计算性能的路径寻找算法。实验表明,该方法不仅可以减少计算所需要的时间和空间,也会产生一个符合人类思维特点的解。

     

    Abstract: 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.

     

/

返回文章
返回