A Tight Lower Bound for Semi-Synchronous Collaborative Grid Exploration

DISC, pp. 13:1-13:17, 2018.

Cited by: 10|Bibtex|Views21
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com

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. [TCSu002715] in the negative.In the setting we consider, time is divided into discrete steps, where in each step,...More

Code:

Data:

Your rating :
0

 

Tags
Comments