Searching with an autonomous robot

Authors:
Sandor Fekete;Rolf Klein;Andreas Nuechter
Affiliations:
TU Braunschweig, Braunschweig, Germany;University of Bonn, Bonn, Germany;Schloss Birlinghoven, Sankt Augustin, Germany
Venue:
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Year:
2004

Citing 1
Cited 5

The Polygon Exploration Problem

SIAM Journal on Computing

Minimum-cost coverage of point sets by disks

Proceedings of the twenty-second annual symposium on Computational geometry
Online searching with an autonomous robot

Computational Geometry: Theory and Applications
Online searching with turn cost

Theoretical Computer Science - Approximation and online algorithms
Polygon exploration with time-discrete vision

Computational Geometry: Theory and Applications
Online searching with an autonomous robot

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We demonstrate how one of the classical areas of computationalgeometry has reached practical application, which in turngives rise to new, fascinating geometric problems.In particular, we discuss the problem of developing a goodonline strategy for anautonomous mobile robot to locate an object that is hidden behinda corner or door.