| 具有稀疏障碍的近似迷宫算法 |
| |
| 引用本文： | 孙巧榆,潘荫荣,孙强,胡幼华. 具有稀疏障碍的近似迷宫算法[J]. 计算机应用与软件, 2003, 20(5): 37-39 |
| |
| 作者姓名： | 孙巧榆 潘荫荣 孙强 胡幼华 |
| |
| 作者单位： | 1. 淮海工学院电子工程系,连云港,222005
2. 华东师范大学计算机科学系,上海,200062 |
| |
| 摘 要： | 本文中给出了一个在具有稀疏障碍的迷宫中寻找给定两个单元之间的最短路径的走迷宫算法,算法以“不改变方向”为预测条件,沿直线方向扩展。经大量的随机实验对比,结果证明本文中的算法大量地缩减了搜索范围,是一个高效的算法。
|
| 关 键 词： | 近似迷宫算法 稀疏障碍 最短路径 最小迂回 路径回找 |
AN APPROXIMATELY MAZE- ALGORITHM FOR A SHORTEST PATH WITH SPARSE OBSTACLES |
| |
| Sun Qiaoyu. AN APPROXIMATELY MAZE- ALGORITHM FOR A SHORTEST PATH WITH SPARSE OBSTACLES[J]. Computer Applications and Software, 2003, 20(5): 37-39 |
| |
| Authors: | Sun Qiaoyu |
| |
| Abstract: | This article presents a maze-running algorithm, which is used to find a shortest path between two given points in a grid with sparse polygon obstacles. The algorithm executes the search using a " don't change direction" heuristic along the line towards the target point. According to the result of many contrastive on-the-fly experiments, the algorithm substantially reduce the size of the searching region. It is an efficient algorithm. |
| |
| Keywords: | Maze algorithm Shortest path Sparse obstacle Minimum detour |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
