How many ants does it take to find the food?

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationStructural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, Proceedings
Pages263-278
Number of pages16
DOIs
StatePublished - 2014
Event21st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2014 - Takayama, Japan
Duration: 23 Jul 201425 Jul 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8576 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2014
Country/TerritoryJapan
CityTakayama
Period23/07/1425/07/14

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'How many ants does it take to find the food?'. Together they form a unique fingerprint.

Cite this