5 search results - page 1 / 1 » Computing Without Communicating: Ring Exploration by Asynchr... |
103
Voted
OPODIS
2007
15 years 4 months ago
2007
129
Voted
SIROCCO
2008
15 years 4 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. ...
123
Voted
SIROCCO
2010
15 years 1 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...
111
Voted
WDAG
2010
Springer
15 years 19 days 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:...
129
Voted
WG
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...