A tight lower bound for semi-synchronous collaborative grid exploration
Distributed Computing, pp. 471-484, 2020.
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. (Theor Comput Sci 608:255–267, 2015) in the negative. In the setting we consider, time is divided into discrete s...More
PPT (Upload PPT)