|
Universität Bonn -> Institut für Informatik -> Abteilung V | ||
CS-APX-Reports 1994 | Copyright 1994 Universität Bonn, Institut für Informatik, Abt. V | |
8921
|
Randomized Navigation to a Wall through Convex Obstacles
Piotr Berman, Marek Karpinski [Download PostScript] [Download PDF] We consider the problem of navigating through an unknown enviroment in which the obstacles are convex, and each contains a circle of diameter 1. The task is to reach a given straight line, in the distance $n$ from our original position. Our randomized algorithm has competitive ratio $n^{0.75}$, and it uses tactile information only. This is the first algorithm that offers any competitive ratio for the problem. |
|
Last Change:
11/05/14 at 09:50:43
English |
Universität Bonn -> Institut für Informatik -> Abteilung V |