Tight bounds for deterministic high-dimensional grid exploration

DOI10.4230/lipics.disc.2020.13zbMATH Open1543.68029MaRDI QIDQ6535010

Sebastian F. Brandt, Unnamed Author, Jara Uitto

Publication date: 2 November 2023

zbMATH Keywords

finite automatamobile agentsgrid search

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Distributed systems (68M14)

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 tight lower bound for semi-synchronous collaborative grid exploration
• Graph exploration by a finite automaton
• Collaborative search on the plane without communication
• The Revenge of the Linear Search Problem
• 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
• Exploration of High-Dimensional Grids by Finite Automata
• Solving the ANTS Problem with Asynchronous Finite State Machines

This page was built for publication: Tight bounds for deterministic high-dimensional grid exploration