Visibility-based pursuit-evasion: the case of curved environments

We consider the problem of visually searching for an unpredictable target that can move arbitrarily fast in a simply-connected, curved, two-dimensional environment. A complete algorithm is presented that is guaranteed to find the elusive target if it is possible for a single pursuer. The key to the algorithm is a cell decomposition based on critical visibility events that occur because of inflections and bitangents of the environment boundary. We have implemented the cell decomposition algorithm, and show several computed examples. The technique is an extension and simplification of a previous technique for searching a polygonal environment. Our solution can also be considered as a step towards a unified approach to pursuit-evasion strategies that have little dependency on the representation of the environment.

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

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

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

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

[5]  Simeon C. Ntafos,et al.  Optimum Watchman Routes , 1988, Inf. Process. Lett..

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

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

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

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

[10]  Michel Pocchiola,et al.  The visibility complex , 1993, SCG '93.

[11]  Jérôme Barraquand,et al.  Motion planning with uncertainty: the information space approach , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

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

[13]  Bruce Randall Donald,et al.  On Information Invariants in Robotics , 1995, Artif. Intell..

[14]  David J. Kriegman,et al.  Computing exact aspect graphs of curved objects: Algebraic surfaces , 1990, International Journal of Computer Vision.

[15]  Kenneth Y. Goldberg,et al.  Orienting polygonal parts without sensors , 1993, Algorithmica.