Deterministic treasure hunt in the plane with angular hints

DOI10.1007/s00453-020-00724-4zbMath1476.68278arXiv2005.00875OpenAlexW3031581840MaRDI QIDQ2205634

Sébastien Bouchard, Andrzej Pelc, Yoann Dieudonné, Franck Petit

Publication date: 21 October 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.00875

zbMATH Keywords

hintcostplanemobile agentexplorationtreasure hunt

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Pebble guided optimal treasure hunt in anonymous graphs ⋮ Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs ⋮ Impact of knowledge on the cost of treasure hunt in trees ⋮ Treasure hunt in graph using pebbles ⋮ Pebble guided near optimal treasure hunt in anonymous graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching for an axis-parallel shoreline
• Online algorithms for searching and exploration in the plane
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane
• Partitions of mass-distributions and of convex bodies by hyperplanes
• How many ants does it take to find the food?
• On the two-dimensional cow search problem
• The theory of search games and rendezvous.
• Reaching a target in the plane with no information
• Online searching with turn cost
• Yet more on the linear search problem
• Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
• Treasure Hunt with Advice
• Symmetry Breaking in the Plane
• Generalized self-approaching curves

This page was built for publication: Deterministic treasure hunt in the plane with angular hints