Solving the ANTS Problem with Asynchronous Finite State Machines

DOI10.1007/978-3-662-43951-7_40zbMath1411.68158OpenAlexW324003786MaRDI QIDQ5167861

Yuval Emek, Jara Uitto, Tobias Langner, Roger Wattenhofer

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43951-7_40

Mathematics Subject Classification ID

Distributed algorithms (68W15) Agent technology and artificial intelligence (68T42)

Related Items (19)

Unnamed Item ⋮ Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) ⋮ Lower and upper competitive bounds for online directed graph exploration ⋮ The ANTS problem ⋮ Searching without communicating: tradeoffs between performance and selection complexity ⋮ Constant space and non-constant time in distributed computing ⋮ Evacuating an Equilateral Triangle in the Face-to-Face Model ⋮ Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) ⋮ Multi-round cooperative search games with multiple players ⋮ ANTS on a Plane ⋮ Evacuating from \(\ell_p\) unit disks in the wireless model ⋮ How many ants does it take to find the food? ⋮ Evacuating equilateral triangles and squares in the face-to-face model ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Unnamed Item ⋮ The Synergy of Finite State Machines ⋮ 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

This page was built for publication: Solving the ANTS Problem with Asynchronous Finite State Machines