Walking an Unknown Street with Bounded Detour

A polygon with two distinguished vertices, s and g, is called a street iff the two boundary chains from s to g are mutually weakly visible. For a mobile robot with on-board vision system we describe a strategy for finding a short path from s to g in a street not known in advance, and prove that the length of the path created does not exceed 1+2. times the length of the shortest path from s to g . Experiments suggest that our strategy

• Type: Conference
• Year: 1991
• Where: FOCS
• Authors: Rolf Klein
• Keywords: Boundary Chains, Distinguished Vertices, FOCS 1991, Mobile Robot, Theoretical Computer Science