Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers (Extended Abstract)

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

[2]  Rolf Klein,et al.  The two guards problem , 1991, SCG '91.

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

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

[5]  Lynne E. Parker,et al.  Behavior-Based Cooperative Robotics Applied to Multi-Target Observation , 1996, Intelligent Robots.

[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]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

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

[9]  Masafumi Yamashita,et al.  The Searchlight Scheduling Problem , 1990, SIAM J. Comput..