3 papers
cs.DS2017
Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots
Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis +2
A graph environment must be explored by a collection of mobile robots. Some of the robots, a priori unknown, may turn out to be unreliable. The graph is weighted and each node is a…
cs.DS2011
Black Hole Search with Finite Automata Scattered in a Synchronous Torus
Jérémie Chalopin, Shantanu Das, Arnaud Labourel +1
We consider the problem of locating a black hole in synchronous anonymous networks using finite state agents. A black hole is a harmful node in the network that destroys any agent…
cs.MA2011
Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings
Jérémie Chalopin, Shantanu Das, Arnaud Labourel +1
We study the problem of locating a particularly dangerous node, the so-called black hole in a synchronous anonymous ring network with mobile agents. A black hole is a harmful stati…