Name
Abstract | ||
|---|---|---|
We provide a competitive strategy for a mobile robot with vision, that has to explore an unknown simple polygon starting from and returning to a given point on the boundary. Our strategy creates a tour that does not exceed in length 133 times the length of the optimal watchman route. This paper is the first to describe a complete strategy and to give a proof for such a constant competitive factor. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.5555/314161.314253 | SODA |
Keywords | Field | DocType |
competitive strategy,mobile robot | Polygon,Mathematical optimization,Computer science,Competitive advantage,Simple polygon,Robot,Mobile robot | Conference |
ISBN | Citations | PageRank |
0-89871-390-0 | 14 | 2.02 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frank Hoffmann | 1 | 14 | 2.02 |
| Christian Icking | 2 | 364 | 33.17 |
| Rolf Klein | 3 | 237 | 19.69 |
| Klaus Kriegel | 4 | 242 | 26.37 |