Deterministic treasure hunt and rendezvous in arbitrary connected graphs

DOI10.1016/j.ipl.2023.106455arXiv2310.01136MaRDI QIDQ6195335

Andrzej Pelc, Debasish Pattanayak

Publication date: 13 March 2024

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsrendezvousmobile agenttimetreasure hunt

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• Searching in the plane
• How to find a point on a line within a fixed distance
• Operations research/management science at work.
• Piecemeal graph exploration by a mobile robot.
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Advice complexity of treasure hunt in geometric terrains
• Byzantine gathering in polynomial time
• Asynchronous approach in the plane: a deterministic polynomial algorithm
• Revisiting the Problem of Searching on a Line
• Synchronous Rendezvous for Location-Aware Agents
• Distributed Computing by Mobile Robots: Gathering
• Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
• How to meet asynchronously at polynomial cost
• Faster Treasure Hunt and Better Strongly Universal Exploration Sequences
• The ultimate strategy to search on \(m\) rays?
• Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs