| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 435626 | Theoretical Computer Science | 2015 | 13 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Yuval Emek, Tobias Langner, David Stolz, Jara Uitto, Roger Wattenhofer,