16 search results - page 1 / 4 » Open Problem: Analyzing Ant Robot Coverage |
COLT
2010
Springer
13 years 2 months ago
2010
Springer
AROBOTS
2006
13 years 4 months ago
2006
How can a mobile robot measure the area of a closed region that is beyond its immediate sensing range? This problem, which we name as blind area measurement, is inspired from scout...
AGENTS
2001
Springer
13 years 9 months ago
2001
Springer
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...
CEC
2010
IEEE
13 years 2 months ago
2010
IEEE
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
IJRR
2008
13 years 4 months ago
2008
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...