Visibility-Based Pursuit-Evasion in a Polygonal Environment

This paper addresses the problem of planning the motion of one or more pursuers in a polygonal environment to eventually “see” an evader that is unpredictable, has unknown initial position, and is capable of moving arbitrarily fast. This problem was first introduced by Suzuki and Yamashita. Our study of this problem is motivated in part by robotics applications, such as surveillance with a mobile robot equipped with a camera that must find a moving target in a cluttered workspace. A few bounds are introduced, and a complete algorithm is presented for computing a successful motion strategy for a single pursuer. For simply-connected free spaces, it is shown that the minimum number of pursuers required is θ(lg n). For multiply-connected free spaces, the bound is θ(√h+lg n) pursuers for a polygon that has n edges and h holes. A set of problems that are solvable by a single pursuer and require a linear number of recontaminations is shown. The complete algorithm searches a finite cell complex that is constructed on the basis of critical information changes. It has been implemented and computed examples are shown.

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

[2]  Fillia Makedon,et al.  On minimizing width in linear layouts , 1989, Discret. Appl. Math..

[3]  Ivan Hal Sudborough,et al.  Min Cut is NP-Complete for Edge Weigthed Trees , 1986, ICALP.

[4]  J. Schwartz,et al.  On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers , 1983 .

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

[6]  Leonidas J. Guibas,et al.  Finding an unpredictable target in a workspace with obstacles , 1997, Proceedings of International Conference on Robotics and Automation.

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

[8]  Steven M. LaValle,et al.  A game-theoretic framework for robot motion planning , 1996 .

[9]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[10]  J. T. Shwartz,et al.  On the Piano Movers' Problem : III , 1983 .

[11]  Jake K. Aggarwal,et al.  Mobile robot self-location using model-image feature correspondence , 1996, IEEE Trans. Robotics Autom..

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

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

[14]  T. C. Shermer,et al.  Recent results in art galleries (geometry) , 1992, Proc. IEEE.

[15]  Masafumi Yamashita,et al.  Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem , 1995, Int. J. Comput. Geom. Appl..

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

[17]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[18]  Simeon C. Ntafos,et al.  Optimum watchman routes , 1986, SCG '86.

[19]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[20]  T. Shermer.  Recent Results in Art Galleries , 1992 .

[21]  Rufus Isaacs,et al.  Differential Games , 1965 .

[22]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[23]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[24]  Paul D. Seymour,et al.  Monotonicity in Graph Searching , 1991, J. Algorithms.