@inproceedings{8405342c38c64765973275b5e0c0a6bd,
title = "How many ants does it take to find the food?",
abstract = "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.",
author = "Yuval Emek and Tobias Langner and David Stolz and Jara Uitto and Roger Wattenhofer",
year = "2014",
doi = "10.1007/978-3-319-09620-9_21",
language = "الإنجليزيّة",
isbn = "9783319096193",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "263--278",
booktitle = "Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Proceedings",
note = "21st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2014 ; Conference date: 23-07-2014 Through 25-07-2014",
}