| 动态拓扑网络最短路径启发式算法 |
| |
| 引用本文： | 江有福,吴伟志.动态拓扑网络最短路径启发式算法[J].计算机应用与软件,2008,25(5):36-38. |
| |
| 作者姓名： | 江有福 吴伟志 |
| |
| 作者单位： | 浙江海洋学院数理与信息学院,浙江,舟山,316004 |
| |
| 摘 要： | 针对动态拓扑网络的最优路径规划中存在的问题,研究了最短路径搜索算法的快速实现技术,提出了一种启发式快速最优路径规划算法.在分析经典迪杰斯特拉最短路径搜索算法和A*启发式搜索算法的基础上,利用椭圆曲线参数设定启发函数初始值,进一步缩小搜索范围.采用二叉堆结构来实现路径计算过程中优先级队列的一系列操作,从而提高了算法的执行效率.仿真试验结果表明该算法具有良好的性能.
|
| 关 键 词： | 最短路径 A*算法 二叉堆 动态拓扑 |
| 修稿时间： | 2006年7月28日 |
A HEURISTIC SHORTEST PATH ALGORITHM IN DYNAMIC TOPOLOGY NETWORK |
| |
| Jiang You-fu,Wu Wei-zhi.A HEURISTIC SHORTEST PATH ALGORITHM IN DYNAMIC TOPOLOGY NETWORK[J].Computer Applications and Software,2008,25(5):36-38. |
| |
| Authors: | Jiang You-fu Wu Wei-zhi |
| |
| Affiliation: | Jiang Youfu Wu Weizhi(College of Maths,Physics , Information,Zhejiang Ocean University,Zhoushan 316004,Zhejiang,China) |
| |
| Abstract: | Optimal path planning is widely recognized to be a critical issue in dynamic topology network.The fast implementation technology of the shortest path searching algorithm is studied,and a fast heuristic algorithm for route planning is proposed.Based on Dijkstra and A* algorithms,ellipse curve parameter is used to initialize the initial value of the A* heuristic function,and the searching nodes are reduced.Binary heap data structure is used to fulfill the operation of priority queue,and the computational effi... |
| |
| Keywords: | Shortest path A* algorithm Binary heap Dynamic topology |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
