How many ants does it take to find the food?
DOI10.1016/J.TCS.2015.05.054zbMATH Open1332.68259OpenAlexW1572182092MaRDI QIDQ896147FDOQ896147
Authors: Yuval Emek, Tobias Langner, David Stolz, Jara Uitto, Roger Wattenhofer 
Publication date: 11 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.054
Recommendations
Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Agent technology and artificial intelligence (68T42)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Searching in the plane
- Computation in networks of passively mobile finite-state sensors
- Undirected connectivity in log-space
- Exploring an unknown graph
- A game of cops and robbers
- Graph exploration by a finite automaton
- Collaborative search on the plane without communication
- Tree exploration with little memory
- Memory lower bounds for randomized collaborative search and implications for biology
- Exploring Unknown Environments
- Solving the ANTS problem with asynchronous finite state machines
- Stone age distributed computing
- From ants to a(ge)nts: a special issue on ant-robotics
- Trade-offs between selection complexity and performance when searching the plane without communication
- Title not available (Why is that?)
Cited In (27)
- The Synergy of Finite State Machines
- A tight lower bound for semi-synchronous collaborative grid exploration
- Group search of the plane with faulty robots
- 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
- Graph exploration by a deterministic memoryless automaton with pebbles
- Use of information, memory and randomization in asynchronous gathering
- Search by a metamorphic robotic system in a finite 2D square grid
- Title not available (Why is that?)
- 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?
- Tight bounds for deterministic high-dimensional grid exploration
- The ANTS problem
- Wireless evacuation on \(m\) rays with \(k\) searchers
- Evacuation of equilateral triangles by mobile agents of limited communication range
- Title not available (Why is that?)
- Memory lower bounds for randomized collaborative search and implications for biology
- Solving the ANTS problem with asynchronous finite state machines
- Energy consumption of group search on a line
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)
