205 search results - page 1 / 41 » On the Competitive Complexity of Navigation Tasks |
DAGSTUHL
2000
13 years 6 months ago
2000
A strategy S solving a navigation task T is called competitive with ratio r if the cost of solving any instance t of T does not exceed r times the cost of solving t optimally. The ...
IJCGA
2010
13 years 3 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
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...
ICRA
2007
IEEE
13 years 11 months ago
2007
IEEE
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
ICGA
1993
13 years 5 months ago
1993