TY - GEN
T1 - Exploring an infinite space with finite memory scouts
AU - Cohen, Lihi
AU - Emek, Yuval
AU - Louidor, Oren
AU - Uittox, Jara
N1 - Publisher Copyright:
Copyright © by SIAM.
PY - 2017
Y1 - 2017
N2 - Consider a small number of scouts exploring the infinite d-dimensional grid with the aim of hitting a hidden target point. Each scout is controlled by a probabilistic finite automaton that determines its movement (to a neighboring grid point) based on its current state. The scouts, that operate under a fully synchronous schedule, communicate with each other (in a way that affects their respective states) when they share the same grid point and operate independently otherwise. Our main research question is: How many scouts are required to guarantee that the target admits a finite mean hitting time? Recently, it was shown that d+1 is an upper bound on the answer to this question for any dimension d ≥ 1 and the main contribution of this paper comes in the form of proving that this bound is tight for d ∈ {1; 2}.
AB - Consider a small number of scouts exploring the infinite d-dimensional grid with the aim of hitting a hidden target point. Each scout is controlled by a probabilistic finite automaton that determines its movement (to a neighboring grid point) based on its current state. The scouts, that operate under a fully synchronous schedule, communicate with each other (in a way that affects their respective states) when they share the same grid point and operate independently otherwise. Our main research question is: How many scouts are required to guarantee that the target admits a finite mean hitting time? Recently, it was shown that d+1 is an upper bound on the answer to this question for any dimension d ≥ 1 and the main contribution of this paper comes in the form of proving that this bound is tight for d ∈ {1; 2}.
UR - http://www.scopus.com/inward/record.url?scp=85016176804&partnerID=8YFLogxK
U2 - 10.1137/1.9781611974782.14
DO - 10.1137/1.9781611974782.14
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85016176804
T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
SP - 207
EP - 224
BT - 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017
A2 - Klein, Philip N.
T2 - 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017
Y2 - 16 January 2017 through 19 January 2017
ER -