Ants: Mobile Finite State Machines

  title={Ants: Mobile Finite State Machines},
  author={Yuval Emek and Tobias Langner and Jara Uitto and Roger Wattenhofer},
Consider the Ants Nearby Treasure Search (ANTS) problem introduced by Feinerman, Korman, Lotker, and Sereni (PODC 2012), where n mobile agents, initially placed at the origin of an infinite grid, collaboratively search for an adversarially hidden treasure. In this paper, the model of Feinerman et al. is adapted such that the agents are controlled by a (randomized) finite state machine: they possess a constant-size memory and are able to communicate with each other through constant-size messages… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS