A tight lower bound for semi-synchronous collaborative grid exploration
From MaRDI portal
Publication:5090903
DOI10.4230/LIPIcs.DISC.2018.13zbMath1497.68037OpenAlexW2898804437MaRDI QIDQ5090903
Roger Wattenhofer, Jara Uitto, Sebastian F. Brandt
Publication date: 21 July 2022
Full work available at URL: http://dblp.uni-trier.de/db/conf/wdag/disc2018.html#BrandtUW18
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Agent technology and artificial intelligence (68T42)
Related Items (5)
Algorithms for \(p\)-Faulty Search on a half-line ⋮ Building a nest by an automaton ⋮ Energy Consumption of Group Search on a Line ⋮ Exploration of High-Dimensional Grids by Finite Automata ⋮ Weighted group search on a line \& implications to the priority evacuation problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Searching in the plane
- How many ants does it take to find the food?
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- Collaborative search on the plane without communication
- Optimal constrained graph exploration
- Automata and Labyrinths
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Undirected Graph Exploration with ⊝(log log n) Pebbles
- Exploring an Infinite Space with Finite Memory Scouts
- Exploring an unknown graph
- Tree exploration with little memory
- Exploring Unknown Environments
- A Tight Lower Bound for the Capture Time of the Cops and Robbers Game
- Solving the ANTS Problem with Asynchronous Finite State Machines
- Group Search on the Line
- STACS 2004
This page was built for publication: A tight lower bound for semi-synchronous collaborative grid exploration
