Optimal Multiplicative Generalized Linear Search Plan for a Discrete Random Walker

Figure 2

(a) and (b) give the optimal expected value of the first meeting time between 𝑆_𝑖 and the target that moves with discrete random walk in one dimension.

(a) 𝑏=1

(b) 𝑏=2