Going Home Through an Unknown Street
We present a new strategy for searching for a goal in a street. The strategy works in two phases. First it follows an angular bisector, then it uses circular arcs based only on one side of the street. A competitive factor of 1.514 is achieved which is remarkably close to the lower bound of v2. Secondly, we assume that the location of the goal is known to the robot. We prove a lower bound of v2 on the competitive ratio of any deterministic strategy for searching in streets with known destination.
Nutzung und Vervielfältigung:
Alle Rechte vorbehalten