5 citations · 10 across the 6 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2010
Optimal competitive online ray search with an error-prone robot
Tom Kamphans, Elmar Langetepe
We consider the problem of finding a door along a wall with a blind robot that neither knows the distance to the door nor the direction towards of the door. This problem can be sol…
cs.CG2010★ 5 cited
Exploring Simple Triangular and Hexagonal Grid Polygons Online
Daniel Herrmann, Tom Kamphans, Elmar Langetepe
We investigate the online exploration problem (aka covering) of a short-sighted mobile robot moving in an unknown cellular environment with hexagons and triangles as types of cells…
cs.CG2010★ 1 cited
Exploring Grid Polygons Online
Christian Icking, Tom Kamphans, Rolf Klein +1
We investigate the exploration problem of a short-sighted mobile robot moving in an unknown cellular room. To explore a cell, the robot must enter it. Once inside, the robot knows…