Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs

10/28/2020
by   Sébastien Bouchard, et al.
0

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 is known as treasure hunt. The agent has no a priori knowledge of the graph, of the location of the treasure or of the initial distance to it. The cost of a treasure hunt algorithm is the worst-case number of edge traversals performed by the agent until finding the treasure. Awerbuch, Betke, Rivest and Singh [3] considered graph exploration and treasure hunt for finite graphs in a restricted model where the agent has a fuel tank that can be replenished only at the starting node s. The size of the tank is B=2(1+α)r, for some positive real constant α, where r, called the radius of the graph, is the maximum distance from s to any other node. The tank of size B allows the agent to make at most ⌊ B⌋ edge traversals between two consecutive visits at node s. Let e(d) be the number of edges whose at least one extremity is at distance less than d from s. Awerbuch, Betke, Rivest and Singh [3] conjectured that it is impossible to find a treasure hidden in a node at distance at most d at cost nearly linear in e(d). We first design a deterministic treasure hunt algorithm working in the model without any restrictions on the moves of the agent at cost 𝒪(e(d) log d), and then show how to modify this algorithm to work in the model from [3] with the same complexity. Thus we refute the above twenty-year-old conjecture. We observe that no treasure hunt algorithm can beat cost Θ(e(d)) for all graphs and thus our algorithms are also almost optimal.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/10/2021

Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs

We study the problem of treasure hunt in a graph by a mobile agent. The ...
research
03/18/2023

Explorable families of graphs

Graph exploration is one of the fundamental tasks performed by a mobile ...
research
03/28/2023

Universal Coating in the 3D Hybrid Model

Motivated by the prospect of nano-robots that assist human physiological...
research
07/29/2021

The Complexity of Growing a Graph

Motivated by biological processes, we introduce here the model of growin...
research
05/02/2020

Deterministic Treasure Hunt in the Plane with Angular Hints

A mobile agent equipped with a compass and a measure of length has to fi...
research
02/16/2019

Cost vs. Information Tradeoffs for Treasure Hunt in the Plane

A mobile agent has to find an inert treasure hidden in the plane. Both t...
research
01/17/2006

Learning about knowledge: A complex network approach

This article describes an approach to modeling knowledge acquisition in ...

Please sign up or login with your details

Forgot password? Click here to reset