Pursuit-evasion in an unknown environment using gap navigation trees

In this paper we present an online algorithm for pursuit-evasion in a unknown simply connected environment, for one pursuer that has minimal sensing and carries a set of stationary sentries that it can drop off and pick up during the pursuit. In our sensing model, the pursuer is only able to detect discontinuities in depth information (gaps), and it is able to find all of the evaders without any explicit localization or geometric information, by using a gap navigation tree. The strategy is based on growing an evader-free region, by reading "exploration" schedules from the gap navigation tree, that is constructed online. We prove that a pursuer with k + 1 sentries can clear any environment that could be cleared by k pursuers using the algorithm in L.J. Guibas et al. (1999), which required a complete map and perfect sensing.

[1]  Giora Slutzki,et al.  An algorithm for searching a polygonal region with a flashlight , 2000, SCG '00.

[2]  Vladimir J. Lumelsky,et al.  Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape , 1987, Algorithmica.

[3]  Javier Minguez,et al.  Nearness diagram (ND) navigation: collision avoidance in troublesome scenarios , 2004, IEEE Transactions on Robotics and Automation.

[4]  Leonidas J. Guibas,et al.  A Visibility-Based Pursuit-Evasion Problem , 1999, Int. J. Comput. Geom. Appl..

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

[6]  Howie Choset,et al.  Sensor Based Planing, Part I: The Generalized Voronoi Graph , 1995, ICRA.

[7]  Nils J. Nilsson,et al.  A Mobile Automaton: An Application of Artificial Intelligence Techniques , 1969, IJCAI.

[8]  G. Swaminathan.  Robot Motion Planning , 2006 .

[9]  Christos H. Papadimitriou,et al.  The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[10]  Masafumi Yamashita,et al.  Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..

[11]  Steven M. LaValle,et al.  Visibility-based pursuit-evasion: the case of curved environments , 2001, IEEE Trans. Robotics Autom..

[12]  Andrea S. LaPaugh,et al.  Recontamination does not help to search a graph , 1993, JACM.

[13]  Giora Slutzki,et al.  An Algorithm for Searching a Polygonal Region with a Flashlight , 2002, Int. J. Comput. Geom. Appl..

[14]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[15]  Ivan Hal Sudborough,et al.  The Vertex Separation and Search Number of a Graph , 1994, Inf. Comput..

[16]  Sampath Kannan,et al.  Randomized pursuit-evasion with limited visibility , 2004, SODA '04.

[17]  J. Burdick,et al.  Sensor based planning. I. The generalized Voronoi graph , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[18]  D. T. Lee,et al.  Two-Guard Walkability of Simple Polygons , 1998, Int. J. Comput. Geom. Appl..

[19]  Kyung-Yong Chwa,et al.  Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher , 2001, ICALP.

[20]  Steven M. LaValle,et al.  Locally-optimal navigation in multiply-connected environments without geometric maps , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[21]  Nils J. Nilsson,et al.  A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.

[22]  Vladimir J. Lumelsky,et al.  Incorporating body dynamics into sensor-based motion planning: the maximum turn strategy , 1997, IEEE Trans. Robotics Autom..

[23]  Leonidas J. Guibas,et al.  Visibility-Based Pursuit-Evasion in a Polygonal Environment , 1997, WADS.

[24]  Steven M. LaValle,et al.  Visibility-Based Pursuit-Evasion in an Unknown Planar Environment , 2004, Int. J. Robotics Res..

[25]  Leonidas J. Guibas,et al.  Sweeping simple polygons with a chain of guards , 2000, SODA '00.

[26]  Ehud Rivlin,et al.  Range-sensor based navigation in three dimensions , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[27]  M. Yamashita,et al.  On-Line Polygon Search by a Six-State Boundary 1-Searcher , 2003 .

[28]  Leonidas J. Guibas,et al.  The Robot Localization Problem , 1995, SIAM J. Comput..

[29]  P. Varaiya,et al.  Differential Games , 1994 .

[30]  Leonidas J. Guibas,et al.  Visibility Queries in Simple Polygons and Applications , 1998, ISAAC.

[31]  Steven M. LaValle,et al.  Optimal navigation and object finding without geometric maps or localization , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[32]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .