25 citations · 126 across the 37 of their papers we have counts for
3 papers · 2 filters
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…
Almost Universal Anonymous Rendezvous in the Plane
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc +1
Two mobile agents represented by points freely moving in the plane and starting at two distinct positions, have to meet. The meeting, called rendezvous, occurs when agents are at d…
Deterministic Treasure Hunt in the Plane with Angular Hints
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc +1
A mobile agent equipped with a compass and a measure of length has to find an inert treasure in the Euclidean plane. Both the agent and the treasure are modeled as points. In the b…