The role of target modeling in designing search strategies

This paper studies the problem of searching for an unknown moving target in a bounded two-dimensional convex area with a mobile robot. A key component of designing a search strategy is the target motion model, which is often unknown in practical scenarios. When designing search strategies, researchers either (1) ignore the target motion and treat the target as a stationary object with unknown location, (2) treat the target as an adversary and model the search task as a game, or (3) use a stochastic model such as a random walk. For each of these models we analyze possible search paths with the objective of minimizing the expected capture time. Our intent is to investigate how the choice of the model influences the choice of the strategy and consequently how the capture time will depend on this choice. In addition to a theoretical analysis, we compare the strategies in simulation.

[1]  J. K. Anlauf,et al.  Asymptotically Exact Solution of the One-Dimensional Trapping Problem , 1984 .

[2]  Pratap Tokekar,et al.  Coverage and Active Localization for Monitoring Invasive Fish with an Autonomous Boat , 2012 .

[3]  Pratap Tokekar,et al.  Tracking Aquatic Invaders: Autonomous Robots for Monitoring Invasive Fish , 2013, IEEE Robotics & Automation Magazine.

[4]  Przemyslaw G. Bajer,et al.  Recruitment and abundance of an invasive fish, the common carp, is driven by its propensity to invade and reproduce in basins that experience winter-time hypoxia in interconnected lakes , 2009, Biological Invasions.

[5]  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.

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

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

[8]  Geoffrey A. Hollinger,et al.  Efficient Multi-robot Search for a Moving Target , 2009, Int. J. Robotics Res..

[9]  Joel W. Burdick,et al.  Analysis of Search Decision Making Using Probabilistic Search Strategies , 2012, IEEE Transactions on Robotics.

[10]  S. Gal.  Search Games with Mobile and Immobile Hider , 1979 .

[11]  S. Redner,et al.  Capture of the lamb: Diffusing predators seeking a diffusing prey , 1999, cond-mat/9905299.

[12]  Frederic Bartumeus,et al.  ANIMAL SEARCH STRATEGIES: A QUANTITATIVE RANDOM‐WALK ANALYSIS , 2005 .

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

[14]  Volkan Isler,et al.  Searching for a one-dimensional random walker: Deterministic strategies with a time budget when crossing is allowed , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[15]  S. Redner.  A guide to first-passage processes , 2001 .

[16]  Noga Alon,et al.  Many Random Walks Are Faster Than One , 2011, Comb. Probab. Comput..

[17]  Athanasios Kehagias,et al.  Cops and invisible robbers: The cost of drunkenness , 2012, Theor. Comput. Sci..

[18]  Micah Adler,et al.  Randomized Pursuit-Evasion in Graphs , 2002, Combinatorics, Probability and Computing.

[19]  Shlomo Havlin,et al.  On the survival probability of a random walk in a finite lattice with a single trap , 1985 .

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

[21]  Howie Choset,et al.  Coverage of Known Spaces: The Boustrophedon Cellular Decomposition , 2000, Auton. Robots.

[22]  P. Kareiva,et al.  Analyzing insect movement as a correlated random walk , 1983, Oecologia.

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