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

Masafumi Yamashita, Ichiro Suzuki, Tiko Kameda

Research output: Contribution to journalArticle

8 Citations (Scopus)

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 languageEnglish
Pages (from-to)1-8
Number of pages8
JournalInformation Processing Letters
Volume92
Issue number1
DOIs
Publication statusPublished - Oct 16 2004

Fingerprint

Flashlights
Sufficient
Necessary

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 journalArticle

Yamashita, Masafumi ; Suzuki, Ichiro ; Kameda, Tiko. / Searching a polygonal region by a group of stationary k-searchers. In: Information Processing Letters. 2004 ; Vol. 92, No. 1. pp. 1-8.
@article{44fb713da480446bb5e00a502b83132b,
title = "Searching a polygonal region by a group of stationary k-searchers",
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.",
author = "Masafumi Yamashita and Ichiro Suzuki and Tiko Kameda",
year = "2004",
month = "10",
day = "16",
doi = "10.1016/j.ipl.2004.06.010",
language = "English",
volume = "92",
pages = "1--8",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "1",

}

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 -