A tight lower bound for semi-synchronous collaborative grid exploration

Abstract: Recently, there has been a growing interest in grid exploration by agents with limited capabilities. We show that the grid cannot be explored by three semi-synchronous finite automata, answering an open question by Emek et al. [TCS'15] in the negative.

In the setting we consider, time is divided into discrete steps, where in each step, an adversarially selected subset of the agents executes one look-compute-move cycle. The agents operate according to a shared finite automaton, where every agent is allowed to have a distinct initial state. The only means of communication is to sense the states of the agents sharing the same grid cell. The agents are equipped with a global compass and whenever an agent moves, the destination cell of the movement is chosen by the agent's automaton from the set of neighboring grid cells. In contrast to the four agent protocol by Emek et al., we show that three agents do not suffice for grid exploration

Object Details

• Location: Deutsche Nationalbibliothek Frankfurt am Main
• Extent: Online-Ressource
• Language: Englisch
• Notes: 32nd International Symposium on Distributed Computing : DISC 2018. - Wadern, 2018. - 13:1-13:17, ISBN: 978-3-95977-092-7

Contributors, Places and Time

• Event: Veröffentlichung
• (where): Freiburg
• (who): Universität
• (when): 2022
• Creator: Brandt, Sebastian ; Uitto, Jara ; Wattenhofer, Roger
• Contributor: Albert-Ludwigs-Universität Freiburg. Algorithms and Complexity

Further information

• DOI: 10.4230/LIPIcs.DISC.2018.13
• URN: urn:nbn:de:bsz:25-freidok-2263514
• Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
• Last update: 15.08.2025, 7:31 AM CEST