An efficient solution to the corridor search problem

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The corridor search problem is the problem of searching for a mobile intruder in the corridor, which is a polygonal region P with an entrance u and an exit r. by the mobile searcher having flashlights whose visibility is limited to the rays emanating from his position. In this paper, we relate the corridor search problem to the well studied two- guard problem, which gives us efficient solutions for several versions of the corridor search problem. Specially, we can decide whether there exists a schedule for the searcher having two flashlights to detect the intruder in O(rclogrc) time, and if so generate such a schedule in 0(rclogrc + k) time, where k (< n2) is the minimum number of search instructions. Our results improve upon the previous time bounds 0(n2) and 0(rc2logrc), respectively.

Cite

CITATION STYLE

APA

Tan, X. (2000). An efficient solution to the corridor search problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1763, pp. 317–331). Springer Verlag. https://doi.org/10.1007/978-3-540-46515-7_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free