Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1-8 |
| Number of pages | 8 |
| Journal | Information Processing Letters |
| Volume | 92 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Oct 16 2004 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications
Cite this
Searching a polygonal region by a group of stationary k-searchers. / Yamashita, Masafumi; Suzuki, Ichiro; Kameda, Tiko.
In: Information Processing Letters, Vol. 92, No. 1, 16.10.2004, p. 1-8.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Searching a polygonal region by a group of stationary k-searchers
AU - Yamashita, Masafumi
AU - Suzuki, Ichiro
AU - Kameda, Tiko
PY - 2004/10/16
Y1 - 2004/10/16
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=4344636859&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=4344636859&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2004.06.010
DO - 10.1016/j.ipl.2004.06.010
M3 - Article
VL - 92
SP - 1
EP - 8
JO - Information Processing Letters
JF - Information Processing Letters
SN - 0020-0190
IS - 1
ER -