25 citations · 69 across the 12 of their papers we have counts for
8 papers · 1 filter
Impact of Knowledge on the Cost of Treasure Hunt in Trees
Sébastien Bouchard, Arnaud Labourel, Andrzej Pelc
A mobile agent has to find an inert target in some environment that can be a graph or a terrain in the plane. This task is known as treasure hunt. We consider deterministic algorit…
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs
Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel +1
A mobile agent navigating along edges of a simple connected graph, either finite or countably infinite, has to find an inert target (treasure) hidden in one of the nodes. This task…
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…
Collaborative Delivery with Energy-Constrained Mobile Robots
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das +5
We consider the problem of collectively delivering some message from a specified source to a designated target location in a graph, using multiple mobile agents. Each agent has a l…
Rendezvous in Networks in Spite of Delay Faults
Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel +1
Two mobile agents, starting from different nodes of an unknown network, have to meet at the same node. Agents move in synchronous rounds using a deterministic algorithm. Each agent…
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…