Abstract
The exploration problems are studied where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the first problem setting, a robot has to explore a geometric scene with n rectangles. In the second problem setting, a robot has to explore a grid graph with obstacles in a piecemeal fashion. An efficiency strategy for piecemeal exploration of grids with arbitrary rectilinear obstacles is presented.
| Original language | English |
|---|---|
| Pages | S842-S843 |
| State | Published - 1999 |
| Externally published | Yes |
| Event | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA Duration: 17 Jan 1999 → 19 Jan 1999 |
Conference
| Conference | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| City | Baltimore, MD, USA |
| Period | 17/01/99 → 19/01/99 |