Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers
暂无分享,去创建一个
Masafumi Yamashita | Ichiro Suzuki | Hideki Umemoto | Tsunehiko Kameda | M. Yamashita | T. Kameda | I. Suzuki | H. Umemoto
[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] Svante Carlsson,et al. Finding the Shortest Watchman Route in a Simple Polygon , 1993, ISAAC.
[4] J. Kahn,et al. Traditional Galleries Require Fewer Watchmen , 1983 .
[5] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[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] Masafumi Yamashita,et al. The Searchlight Scheduling Problem , 1990, SIAM J. Comput..
[8] Lynne E. Parker,et al. Behavior-Based Cooperative Robotics Applied to Multi-Target Observation , 1996, Intelligent Robots.
[9] Masafumi Yamashita,et al. Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..
[10] 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..
[11] Svante Carlsson,et al. Finding the Shortest Watchman Route in a Simple Polygon , 1993, ISAAC.
[12] Thomas C. Shermer. Computing Bushy and Thin Triangulations , 1991, Comput. Geom..
[13] Paul J. Heffernan,et al. An optimal algorithm for the two-guard problem , 1993, SCG '93.
[14] Andrea S. LaPaugh,et al. Recontamination does not help to search a graph , 1993, JACM.
[15] D. T. Lee,et al. Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.
[16] J. O'Rourke. An alternate proof of the rectilinear art gallery theorem , 1983 .
[17] T. D. Parsons,et al. Pursuit-evasion in a graph , 1978 .
[18] Tomio Hirata,et al. Constructing Shortest Watchman Routes by Divide-and-Conquer , 1993, ISAAC.
[19] Simeon C. Ntafos,et al. Optimum Watchman Routes , 1988, Inf. Process. Lett..