4 search results - page 1 / 1 » Optimal Deterministic Ring Exploration with Oblivious Asynch... |
107
Voted
SIROCCO
2010
14 years 11 months ago
2010
We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the abil...
98
Voted
WDAG
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we study the exclusive perpetual exploration problem with mobile anonymous and oblivious robots in a discrete space. Our results hold for the most generic settings:...
85
Voted
OPODIS
2007
15 years 2 months ago
2007
110
click to vote
SIROCCO
2008
15 years 2 months ago
2008
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...