摘要
给出了一个在具有稀疏矩形障碍的迷宫中寻找给定的两个单元之间的最短路径的算法。本算法以“不改变方向”为预测条件 ,根据迷宫中各障碍与起讫单元之间的相对位置沿水平或竖直的方向进行直线扩展以缩小搜索范围并减少搜索时间。经大量的实例验证和实验对比 。
A maze running algorithm is proposed to find the shortest path between two given points in a grid with sparse rectangular obstacles. Under the precondition of not changing the direction, this algorithm can extend vertically and horizontally along lines towards the target point according to the relative positions of obstacles and points, thus narrowing down the searching area and shortening the searching time. Experiments and analytical comparisons show that the given algorithm can greatly narrow down the searching area with high precision and speed when the obstacles are sparse.
出处
《淮海工学院学报（自然科学版）》
CAS
2002年第3期24-27,共4页
Journal of Huaihai Institute of Technology:Natural Sciences Edition
