TY - JOUR

T1 - How many ants does it take to find the food?

AU - Emek, Yuval

AU - Langner, Tobias

AU - Stolz, David

AU - Uitto, Jara

AU - Wattenhofer, Roger

N1 - Publisher Copyright:
© 2015 Elsevier B.V.

PY - 2015/12/1

Y1 - 2015/12/1

N2 - Consider the Ants Nearby Treasure Search (ANTS) problem, where n mobile agents, initially placed at the origin of an infinite grid, collaboratively search for an adversarially hidden treasure. The agents are controlled by deterministic/randomized finite or pushdown automata and are able to communicate with each other through constant-size messages. We show that the minimum number of agents required to solve the ANTS problem crucially depends on the computational capabilities of the agents as well as the timing parameters of the execution environment. We give lower and upper bounds for different scenarios.

AB - Consider the Ants Nearby Treasure Search (ANTS) problem, where n mobile agents, initially placed at the origin of an infinite grid, collaboratively search for an adversarially hidden treasure. The agents are controlled by deterministic/randomized finite or pushdown automata and are able to communicate with each other through constant-size messages. We show that the minimum number of agents required to solve the ANTS problem crucially depends on the computational capabilities of the agents as well as the timing parameters of the execution environment. We give lower and upper bounds for different scenarios.

KW - Collaborative search

KW - Finite automata

KW - Treasure search

UR - http://www.scopus.com/inward/record.url?scp=84979208071&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2015.05.054

DO - 10.1016/j.tcs.2015.05.054

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84979208071

SN - 0304-3975

VL - 608

SP - 255

EP - 267

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -