Sciweavers

Share
ANTSW
2006
Springer

Covering a Continuous Domain by Distributed, Limited Robots

8 years 11 months ago
Covering a Continuous Domain by Distributed, Limited Robots
We present an algorithm for covering continuous domains by primitive robots whose only ability is to mark visited places with pheromone and to sense the level of the pheromone in their neighborhood. These pheromone marks can be sensed by all robots and thus provide a way for indirect communication between the robots. Apart from this, the robots have no means to communicate. Additionally they are memoryless, have no global information such as the domain map, own position, coverage percentage, etc. Despite the robots' simplicity, we show that they are able to cover efficiently any connected domains, including non-planar ones.
Eliyahu Osherovich, Alfred M. Bruckstein, Vladimir
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where ANTSW
Authors Eliyahu Osherovich, Alfred M. Bruckstein, Vladimir Yanovski
Comments (0)
books