Deterministic Meeting of Sniffing Agents in the Plane
From MaRDI portal
Publication:2835027
DOI10.1007/978-3-319-48314-6_14zbMath1392.68414arXiv1709.06217OpenAlexW2548581226MaRDI QIDQ2835027
Publication date: 1 December 2016
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.06217
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)
Related Items (1)
Cites Work
- Gathering of asynchronous robots with limited visibility
- Gathering few fat mobile robots in the plane
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Deterministic polynomial approach in the plane
- Deterministic rendezvous in graphs
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
- Rendezvous of Two Robots with Constant Memory
- Delays Induce an Exponential Memory Gap for Rendezvous in Trees
- Distributed Computing by Mobile Robots: Gathering
- Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids
- Two Dimensional Rendezvous Search
- Fault-Tolerant Rendezvous in Networks
- How to meet asynchronously at polynomial cost
- Randomized Rendez-Vous with Limited Memory
- Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
- LATIN 2004: Theoretical Informatics
This page was built for publication: Deterministic Meeting of Sniffing Agents in the Plane
