Searching for a one-dimensional random walker: Deterministic strategies with a time budget when crossing is allowed

We present deterministic strategies for capturing a target performing a discrete random walk on a discretized line segment. The searcher has a limited time budget. Its goal is to maximize the probability of capturing the target within the budget. A challenging aspect of our model is that the target can cross the searcher without being captured when they take the same edge at the same time in opposite directions. We present a Partially Observable Markov Decision Process (POMDP) approach for finding the optimal search strategy. We also present an efficient approximate solution to the POMDP. The strategies found by this approach reveal structural properties of the efficient search strategies which we exploit to solve the problem efficiently without running the POMDP.

[1]  Pratap Tokekar,et al.  Long-Term Search Through Energy Efficiency and Harvesting , 2013 .

[2]  S. Redner,et al.  Kinetics of a Diiusive Capture Process: Lamb Besieged by a Pride of Lions , 2022 .

[3]  Geoffrey A. Hollinger,et al.  Search and pursuit-evasion in mobile robotics , 2011, Auton. Robots.

[4]  Volkan Isler,et al.  Searching for a one-dimensional random walker: Randomized strategy with energy budget , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  Chinya V. Ravishankar,et al.  A framework for pursuit evasion games in Rn , 2005, Inf. Process. Lett..

[6]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[7]  Sidney Redner,et al.  A guide to first-passage processes , 2001 .

[8]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[9]  J. Stoyanov.  A Guide to First‐passage Processes , 2003 .

[10]  M. Karonski.  Collisions among Random Walks on a Graph , 1993 .

[11]  Pratap Tokekar,et al.  A robotic system for monitoring carp in Minnesota lakes , 2010, J. Field Robotics.

[12]  David Elkind,et al.  Learning: An Introduction , 1968 .

[13]  Sebastian Thrun,et al.  Probabilistic robotics , 2002, CACM.

[14]  Alan Gabel,et al.  Can a lamb reach a haven before being eaten by diffusing lions? , 2012, 1203.2985.

[15]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[16]  B. McCabe.  SEARCHING FOR A ONE-DIMENSIONAL RANDOM WALKER , 1974 .