56 search results - page 4 / 12 » Optimality and Competitiveness of Exploring Polygons by Mobi... |
EWCG
2000
13 years 8 months ago
2000
We investigate the exploration problem of a short-sighted mobile robot moving about in an unknown cellular room. In order to explore a cell, the robot must enter it. Once inside, ...
ICRA
2007
IEEE
14 years 1 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...
ICRA
2006
IEEE
14 years 1 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...
IBERAMIA
2004
Springer
14 years 25 days ago
2004
Springer
In this paper we address the problem of finding an object in a polygonal environment as quickly as possible on average, with a team of mobile robots that can sense the environment...
ICRA
2008
IEEE
14 years 1 months ago
2008
IEEE
— What is the shortest or fastest path a mobile robot can follow between two configurations in the unobstructed plane? The answer to this fundamental question is only known anal...