1 citations · 1 across the 1 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
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…
cs.DS2020
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…