Impact of knowledge on the cost of treasure hunt in trees

DOI10.1002/net.22075OpenAlexW3195783669MaRDI QIDQ6087562

Arnaud Labourel, Sébastien Bouchard, Andrzej Pelc

Publication date: 12 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22075

zbMATH Keywords

treemobile agenttreasure hunt

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Searching for an axis-parallel shoreline
• Online algorithms for searching and exploration in the plane
• Infinite linear programming and online searching with turn cost
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane
• Optimal graph exploration without good maps
• On the two-dimensional cow search problem
• Agent searching in a tree and the optimality of iterative deepening
• The theory of search games and rendezvous.
• Reaching a target in the plane with no information
• Piecemeal graph exploration by a mobile robot.
• A correction to: ``Agent searching in a tree and the optimality of iterative deepening
• Multi-round cooperative search games with multiple players
• Deterministic treasure hunt in the plane with angular hints
• Searching for a non-adversarial, uncooperative agent on a cycle
• Online searching with turn cost
• On the linear search problem
• Yet more on the linear search problem
• Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
• Optimal constrained graph exploration
• Search Games: A Review
• Treasure Hunt with Advice
• Competitive Online Approximation of the Optimal Search Ratio
• Improved Lower Bounds for Shoreline Search
• Competitive Search in Symmetric Trees
• Lower bounds in on-line geometric searching
• The ultimate strategy to search on \(m\) rays?

This page was built for publication: Impact of knowledge on the cost of treasure hunt in trees