Show simple item record

dc.contributor.authorHefner, Kim A. S.
dc.contributor.authorMayer, Michael McClanahan
dc.contributor.authorShing, ManTak
dc.date.accessioned2013-01-23T21:56:07Z
dc.date.available2013-01-23T21:56:07Z
dc.date.issued1989-09
dc.identifier.urihttp://hdl.handle.net/10945/26107
dc.description.abstractIn 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 squared + 2k + 1 for mazes with circuits, and is bounded by 4k squared/3 + 8k/3 + 1 for mazes without circuits, Furthermore, we show that the bounds are tight.en_US
dc.description.sponsorshipResearch funded by the Naval Postgraduate School Research Councilen_US
dc.description.urihttp://archive.org/details/noteonmaximumsiz00shin
dc.language.isoen_US
dc.publisherMonterey, California. Naval Postgraduate Schoolen_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.subject.lcshGROUP DECISION MAKINGen_US
dc.titleA note on the maximum size of a rectilinear mazeen_US
dc.typeTechnical Reporten_US
dc.subject.authorGrid-graphen_US
dc.subject.authorHeuristicsen_US
dc.subject.authorMazeen_US
dc.subject.authorMobile roboten_US
dc.subject.authorPath findingen_US
dc.subject.authorSearchen_US
dc.subject.authorTree-mazeen_US
dc.description.funderO & MN, Direct Fundingen_US
dc.identifier.npsreportNPS-52-89-057
dc.description.distributionstatementApproved for public release; distribution is unlimited.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record