A note on the maximum size of a rectilinear maze
By: [by] Man-Tak Shing, Michael M. Mayer [and] Kim A.S. Hefner
Contributors: Mayer, Michael McClanahan; Hefner, Kim A. S.; Naval Postgraduate School (U.S.)
Publisher: Naval Postgraduate School
Published: 1989
Place of publication: Monterey, California
Language: eng
Subjects: Heuristic; Programming; Robots
Description: In this paper, we study the problem of searching through an unknown maze by a robot and show that the size of the largest rectilinear maze the robot can explore in at most k steps is bounded by 2k²  + 2k + 1 for mazes with circuits, and is bounded by 4k²/3 + 8k/3 + 1 for mazes without circuits, Furthermore, we show that the bounds ar
Notes: Title from cover.

"Prepared for: Naval Postgraduate School"--Cover.

"September 1989"--Cover.

"NPS52-89-057"--Cover.

Author(s) subject terms: Grid-graph, heuristics, maze, mobile robot, path finding, search, tree-maze.

Includes bibliographical references.

"Approved for public release; distribution unlimited"--Cover.

Technical report; 1989.

kmc/kmc 12/1/09.

aq/aq cc:9116 06/08/98