Solving the ANTS problem with asynchronous finite state machines

Yuval Emek; Tobias Langner; Jara Uitto; Roger Wattenhofer

doi:10.1007/978-3-662-43951-7_40

Solving the ANTS problem with asynchronous finite state machines

Yuval Emek, Tobias Langner, Jara Uitto, Roger Wattenhofer

Data and Decision Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Consider the Ants Nearby Treasure Search (ANTS) problem introduced by Feinerman, Korman, Lotker, and Sereni (PODC 2012), where n mobile agents, initially placed in a single cell of an infinite grid, collaboratively search for an adversarially hidden treasure. In this paper, the model of Feinerman et al. is adapted such that each agent is controlled by an asynchronous (randomized) finite state machine: they possess a constant-size memory and can locally communicate with each other through constant-size messages. Despite the restriction to constant-size memory, we show that their collaborative performance remains the same by presenting a distributed algorithm that matches a lower bound established by Feinerman et al. on the run-time of any ANTS algorithm.

Original language	English
Title of host publication	Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings
Pages	471-482
Number of pages	12
Edition	PART 2
DOIs	https://doi.org/10.1007/978-3-662-43951-7_40
State	Published - 2014
Event	41st International Colloquium on Automata, Languages, and Programming, ICALP 2014 - Copenhagen, Denmark Duration: 8 Jul 2014 → 11 Jul 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 2
Volume	8573 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	41st International Colloquium on Automata, Languages, and Programming, ICALP 2014
Country/Territory	Denmark
City	Copenhagen
Period	8/07/14 → 11/07/14

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-662-43951-7_40

Cite this

Emek, Y., Langner, T., Uitto, J., & Wattenhofer, R. (2014). Solving the ANTS problem with asynchronous finite state machines. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings (PART 2 ed., pp. 471-482). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8573 LNCS, No. PART 2). https://doi.org/10.1007/978-3-662-43951-7_40

Emek, Yuval ; Langner, Tobias ; Uitto, Jara et al. / Solving the ANTS problem with asynchronous finite state machines. Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 2. ed. 2014. pp. 471-482 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).

@inproceedings{0c80dd82848346db8bd853a30d4d7191,

title = "Solving the ANTS problem with asynchronous finite state machines",

abstract = "Consider the Ants Nearby Treasure Search (ANTS) problem introduced by Feinerman, Korman, Lotker, and Sereni (PODC 2012), where n mobile agents, initially placed in a single cell of an infinite grid, collaboratively search for an adversarially hidden treasure. In this paper, the model of Feinerman et al. is adapted such that each agent is controlled by an asynchronous (randomized) finite state machine: they possess a constant-size memory and can locally communicate with each other through constant-size messages. Despite the restriction to constant-size memory, we show that their collaborative performance remains the same by presenting a distributed algorithm that matches a lower bound established by Feinerman et al. on the run-time of any ANTS algorithm.",

author = "Yuval Emek and Tobias Langner and Jara Uitto and Roger Wattenhofer",

year = "2014",

doi = "10.1007/978-3-662-43951-7_40",

language = "אנגלית",

isbn = "9783662439500",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 2",

pages = "471--482",

booktitle = "Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings",

edition = "PART 2",

note = "41st International Colloquium on Automata, Languages, and Programming, ICALP 2014 ; Conference date: 08-07-2014 Through 11-07-2014",

}

Emek, Y, Langner, T, Uitto, J & Wattenhofer, R 2014, Solving the ANTS problem with asynchronous finite state machines. in Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 2 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 8573 LNCS, pp. 471-482, 41st International Colloquium on Automata, Languages, and Programming, ICALP 2014, Copenhagen, Denmark, 8/07/14. https://doi.org/10.1007/978-3-662-43951-7_40

Solving the ANTS problem with asynchronous finite state machines. / Emek, Yuval; Langner, Tobias; Uitto, Jara et al.
Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 2. ed. 2014. p. 471-482 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8573 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Solving the ANTS problem with asynchronous finite state machines

AU - Emek, Yuval

AU - Langner, Tobias

AU - Uitto, Jara

AU - Wattenhofer, Roger

PY - 2014

Y1 - 2014

N2 - Consider the Ants Nearby Treasure Search (ANTS) problem introduced by Feinerman, Korman, Lotker, and Sereni (PODC 2012), where n mobile agents, initially placed in a single cell of an infinite grid, collaboratively search for an adversarially hidden treasure. In this paper, the model of Feinerman et al. is adapted such that each agent is controlled by an asynchronous (randomized) finite state machine: they possess a constant-size memory and can locally communicate with each other through constant-size messages. Despite the restriction to constant-size memory, we show that their collaborative performance remains the same by presenting a distributed algorithm that matches a lower bound established by Feinerman et al. on the run-time of any ANTS algorithm.

AB - Consider the Ants Nearby Treasure Search (ANTS) problem introduced by Feinerman, Korman, Lotker, and Sereni (PODC 2012), where n mobile agents, initially placed in a single cell of an infinite grid, collaboratively search for an adversarially hidden treasure. In this paper, the model of Feinerman et al. is adapted such that each agent is controlled by an asynchronous (randomized) finite state machine: they possess a constant-size memory and can locally communicate with each other through constant-size messages. Despite the restriction to constant-size memory, we show that their collaborative performance remains the same by presenting a distributed algorithm that matches a lower bound established by Feinerman et al. on the run-time of any ANTS algorithm.

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

U2 - 10.1007/978-3-662-43951-7_40

DO - 10.1007/978-3-662-43951-7_40

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84904159514

SN - 9783662439500

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 471

EP - 482

BT - Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings

T2 - 41st International Colloquium on Automata, Languages, and Programming, ICALP 2014

Y2 - 8 July 2014 through 11 July 2014

ER -

Emek Y, Langner T, Uitto J, Wattenhofer R. Solving the ANTS problem with asynchronous finite state machines. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 2 ed. 2014. p. 471-482. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). doi: 10.1007/978-3-662-43951-7_40

Solving the ANTS problem with asynchronous finite state machines

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this