Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1303571 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- A game of cops and robbers
- Collaborative search on the plane without communication
- Computation in networks of passively mobile finite-state sensors
- Exploring Unknown Environments
- Exploring an unknown graph
- From ants to a(ge)nts: a special issue on ant-robotics
- Graph exploration by a finite automaton
- Memory lower bounds for randomized collaborative search and implications for biology
- Searching in the plane
- Solving the ANTS problem with asynchronous finite state machines
- Stone age distributed computing
- Trade-offs between selection complexity and performance when searching the plane without communication
- Tree exploration with little memory
- Undirected connectivity in log-space
Cited in
(32)- Solving the ANTS problem with asynchronous finite state machines
- Energy consumption of group search on a line
- Infinite grid exploration with synchronous myopic robots without chirality
- Trade-offs between selection complexity and performance when searching the plane without communication
- The Synergy of Finite State Machines
- Group search of the plane with faulty robots
- A tight lower bound for semi-synchronous collaborative grid exploration
- A tight lower bound for semi-synchronous collaborative grid exploration
- Building a nest by an automaton
- ANTS on a Plane
- Pebble guided near optimal treasure hunt in anonymous graphs
- Two-agent tree evacuation
- Deterministic treasure hunt in the plane with angular hints
- Use of information, memory and randomization in asynchronous gathering
- Graph exploration by a deterministic memoryless automaton with pebbles
- Search by a metamorphic robotic system in a finite 2D square grid
- scientific article; zbMATH DE number 7561402 (Why is no real title available?)
- Exploration of convex terrains by a deterministic automaton with pebbles
- Busy agents on a line
- Pebble guided optimal treasure hunt in anonymous graphs
- How Do Mobile Agents Benefit from Randomness?
- Exploration of High-Dimensional Grids by Finite State Machines
- Exploration of High-Dimensional Grids by Finite Automata
- Searching without communicating: tradeoffs between performance and selection complexity
- How many ants does it take to find the food?
- The ANTS problem
- Tight bounds for deterministic high-dimensional grid exploration
- Wireless evacuation on \(m\) rays with \(k\) searchers
- Exploring wedges of an oriented grid by an automaton with pebbles
- Evacuation of equilateral triangles by mobile agents of limited communication range
- scientific article; zbMATH DE number 7525472 (Why is no real title available?)
- Memory lower bounds for randomized collaborative search and implications for biology
This page was built for publication: How many ants does it take to find the food?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896147)
