A METHOD FOR SOLVING ARBITRARY-WALL MAZES BY COMPUTER

被引:8
作者
SUTHERLA.IE
机构
[1] M.LT., Cambridge, Mass.
关键词
D O I
10.1109/T-C.1969.222592
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A method for solving mazes with extended open areas and arbitrarily placed walls is described. This method reduces large open areas containing many possible paths to a small set of shortest paths. It is then possible to use Moore's algorithm of which the paper includes a summary. A computer simulation of a vehicle exploring an unknown maze is discussed. Crude navigation and measurement are sufficient for maze solving with the techniques described. © 1969 IEEE. All rights reserved.
引用
收藏
页码:1092 / &
相关论文
共 3 条
[1]   A MODIFICATION OF LEES PATH CONNECTION ALGORITHM [J].
AKERS, SB .
IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1967, EC16 (01) :97-+
[2]  
LEE CY, 1961, IRE T ELECTRON COMPU, VEC10, P346
[3]  
MOORE EF, 1959, ANN COMPUTATION LABO, V30, P285