We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
A strategy for working with incomplete information is called competitive if it solves each problem instance at a cost not exceeding the cost of an optimal solution (with full info...
We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √ 2, thus matching the best lower bound known before. This finally ...
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elm...