5 search results - page 1 / 1 » Optimal Competitive Online Ray Search with an Error-Prone Ro... |
WEA
2005
Springer
13 years 10 months ago
2005
Springer
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 so...
ICRA
2006
IEEE
13 years 10 months ago
2006
IEEE
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
STACS
1999
Springer
13 years 8 months ago
1999
Springer
We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √ 2, thus matching the best lower bound known before. This finally ...
COMPGEOM
1994
ACM
13 years 8 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We discuss online strategies for visibility-based searching for an object hidden behind a corner, using Kurt3D, a real autonomous mobile robot. This task is closely related to a n...