Searching a polygonal region by a group of stationary k-searchers

We study the problem of searching for mobile intruders in a polygonal region by stationary searchers having various levels of vision given by the number of flashlights that a searcher carries. We show that (2g - 1) 1-searchers (i.e., 2g - 1 searchers with one flashlight each) are always sufficient, and sometimes necessary, to search a simple polygonal region having a guard number g, which is the size of a minimum guard set. We also show that g (h + 1)-searchers (i.e., g searchers with h + 1 flashlights each), and consequently g(h+1) 1-searchers as well, can always search a polygonal region with h ≥ 1 holes having a guard number g.