Searching for mobile intruders in a polygonal region by a group of mobile searchers

Algorithmica (New York)

Volumn 31, Issue 2, 2001, Pages 208-236

  Yamashita, M ^a   Umemoto, H ^b   Suzuki, I ^c   Kameda, T ^d  

^a KYUSHU UNIVERSITY   (Japan)

^b ANRITSU CORPORATION   (Japan)

^c University of Wisconsin Milwaukee   (United States)

^d SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Art gallery problem; Graph search problem; Multirobot system; Polygon search number; Polygon search problem; Searchlight problem

Indexed keywords

MOBILE TELECOMMUNICATION SYSTEMS; NUMBER THEORY; ROBOTS;

POLYGON SEARCH;

GRAPH THEORY;

EID: 0242269948     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0045-3     Document Type: Article

References (18)

1. S. Carlsson, H. Jonsson, and B. J. Nilsson: Finding the shortest watchman route in a simple polygon, Proc. 4th International Symposium on Algorithms and Compulation, Hong Kong, 1993, pp. 58-67.
2. W.-P. Chin and S. Ntafos, Optimum watchman routes, Proc. 2nd ACM Symposium on Computational Geometry, 1986, pp. 24-33.
3. W.-P. Chin and S. Ntafos, Optimum watchman routes, Inform. Process. Lett., 28 (1988), 39-44.
4. D. Crass, I. Suzuki, and M. Yamashita, Searching for a mobile intruder in a corridor-the open edge variant of the polygon search problem, Internat. J. Comput. Geom. Appl., 5(4) (1995), 397-412.
5. M. de Berg and R. Klein, private communication, 1993.
6. P. J. Heffeman, An optimal algorithm for the two-guard problem, Proc. 9th ACM Symposium on Computational Geometry, 1993, pp. 348-358.
7. C. Icking and R. Klein, The two guards problem, Proc. 7th ACM Symposium on Computational Geometry, 1991, pp. 166-175.
8. J. Kahn, M. Klawe, and D. Kleitman, Traditional galleries require fewer watchmen, SIAM J. Algebraic Discrete Methods, 4(2) (1983), 194-206.
9. A. S. LaPaugh, Recontamination does not help to search a graph, J. Assoc. Comput. Mach., 40(2) (1993), 224-245.
10. D. T. Lee and A. K. Lin, Computational complexity of art gallery problems, IEEE Trans. Inform. Theory, 32(2) (1986), 276-282.
11. N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou, The complexity of searching a graph, J. Assoc. Comput. Mach., 35(1) (1988), 18-44.
12. J. O'Rourke, An alternate proof of the rectilinear art gallery theorem, J. Geom., 21 (1983), 118-130.
13. J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, New York, 1987.
14. T. D. Parsons, Pursuit-evasion in a graph, in Theory and Applications of Graphs, Y. Alavi and D. Lick (eds.), Lecture Notes in Mathematics 642, Springer-Verlag, Berlin, 1976, pp. 426-441.
15. T. Shermer, Computing bushy and thin triangulations, in Snapshots of Computational and Discrete Geometry, G. Toussaint (ed.), Technical Report SOCS-88.11, School of Computer Science, McGill University, Montreal, June 1988, pp. 119-133.
16. K. Sugihara, I. Suzuki, and M. Yamashita, The searchlight scheduling problem, SIAM J. Comput., 19(6) (1990), 1024-1040.
17. I. Suzuki and M. Yamashita, Searching for a mobile intruder in a polygonal region, SIAM J. Comput., 21(5) (1992), 868-888.
18. X. Tan and T. Hirata: Constructing shortest watchman routes by divide-and-conquer, Proc. 4th International Symposium on Algorithms and Computation, Hong Kong, 1993, pp. 68-77.