| 基于Mapinfo的最短路径混合搜索算法 |
| |
| 引用本文： | 汤晓,李贻斌,王彦堂,张娟.基于Mapinfo的最短路径混合搜索算法[J].山东理工大学学报,2006,20(2):81-84. |
| |
| 作者姓名： | 汤晓 李贻斌 王彦堂 张娟 |
| |
| 作者单位： | 山东大学机器人研究中心 山东济南250061 |
| |
| 摘 要： | 在迪杰斯特拉(Dijkstra)算法的基础上,针对有较多节点和道路的大网络在求解最短路径时计算时间慢、扩展节点多的缺点,采用基于局部最优方向和A*算法的混合算法,利用局部最优方向法的结果,对A*算法的启发函数加以改造,可以减少扩展的节点数量,快速的找到一条最短路径.通过实验仿真证实了该算法的快速有效性.
|
| 关 键 词： | Mapinfo 最短路径规划 混合搜索算法 |
| 文章编号： | 1672-6197(2006)02-0081-04 |
| 收稿时间： | 06 30 2005 12:00AM |
| 修稿时间： | 2005年6月30日 |
Hybrid algorithm of path planning based on Mapinfo |
| |
| TANG Xiao,LI Yi-bin,WANG Yan-tang,ZHANG Juan.Hybrid algorithm of path planning based on Mapinfo[J].Journal of Shandong University of Technology:Science and Technology,2006,20(2):81-84. |
| |
| Authors: | TANG Xiao LI Yi-bin WANG Yan-tang ZHANG Juan |
| |
| Abstract: | In order to reduce the time for expanding to obtain a shortest path in a big traffic network which has a lot of nodes and paths,we deduced a hybrid algorithm by the A~* algorithm and local optimal direction method based on Dijkstra's shortest path algorithm.Using the result of the local optimal direction algorithm,the heuristic function of A~* algorithm was rebuilt.It can reduce the number of expanded nodes and reduce the time for finding the shortest path.Experimental results show that the algorithm is effective and speedy. |
| |
| Keywords: | Mapinfo shortent peth planning hybrid search algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
