Exploration of High-Dimensional Grids by Finite Automata
From MaRDI portal
Recommendations
- Tight bounds for deterministic high-dimensional grid exploration
- Exploring an infinite space with finite memory scouts
- A tight lower bound for semi-synchronous collaborative grid exploration
- A tight lower bound for semi-synchronous collaborative grid exploration
- scientific article; zbMATH DE number 6784996
Cites work
- A tight lower bound for semi-synchronous collaborative grid exploration
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Autonomous mobile robots with lights
- Exploring an infinite space with finite memory scouts
- Graph exploration by a finite automaton
- Group search on the line
- How many ants does it take to find the food?
- scientific article; zbMATH DE number 4062645 (Why is no real title available?)
- More on the linear search problem
- On Cumulative Sums of Random Variables
- On the linear search problem
- On the two-dimensional cow search problem
- Online algorithms for searching and exploration in the plane
- Parallel searching in the plane
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Revisiting the problem of searching on a line
- Solving the ANTS problem with asynchronous finite state machines
- The power of a pebble: Exploring and mapping directed graphs
- The return of the linear search problem
- Trade-offs between selection complexity and performance when searching the plane without communication
- Wireless evacuation on m rays with k searchers
Cited in
(4)
This page was built for publication: Exploration of High-Dimensional Grids by Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092342)
