How many ants does it take to find the food?

DOI10.1016/j.tcs.2015.05.054zbMath1332.68259OpenAlexW1572182092MaRDI QIDQ896147

David Stolz, Jara Uitto, Tobias Langner, Roger Wattenhofer, Yuval Emek

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

zbMATH Keywords

finite automatacollaborative searchtreasure search

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Agent technology and artificial intelligence (68T42)

Related Items (17)

Search by a metamorphic robotic system in a finite 2D square grid ⋮ Pebble guided optimal treasure hunt in anonymous graphs ⋮ ANTS on a Plane ⋮ Deterministic treasure hunt in the plane with angular hints ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Building a nest by an automaton ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Wireless evacuation on \(m\) rays with \(k\) searchers ⋮ The Synergy of Finite State Machines ⋮ Energy Consumption of Group Search on a Line ⋮ Exploration of High-Dimensional Grids by Finite Automata ⋮ Group search of the plane with faulty robots ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Two-agent tree evacuation ⋮ Pebble guided near optimal treasure hunt in anonymous graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching in the plane
• A game of cops and robbers
• From ants to a(ge)nts: a special issue on ant-robotics
• Computation in networks of passively mobile finite-state sensors
• Graph exploration by a finite automaton
• Collaborative search on the plane without communication
• Trade-offs between selection complexity and performance when searching the plane without communication
• Undirected connectivity in log-space
• Exploring an unknown graph
• 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

This page was built for publication: How many ants does it take to find the food?