Surveillance of a polygonal area by a mobile searcher from the boundary: searchability testing

Authors:
Binay Bhattacharya;Tsunehiko Kameda;John Z. Zhang
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, BC, Canada;School of Computing Science, Simon Fraser University, Burnaby, BC, Canada;Department of Mathematics and Computer Science, University of Lethbirdge, Lethbridge, Canada
Venue:
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Year:
2009

Citing 5
Cited 0

Searching for a mobile intruder in a polygonal region

SIAM Journal on Computing
LR-visibility in polygons

Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Characterizing LR-visibility polygons and related problems

Computational Geometry: Theory and Applications
A characterization of polygonal regions searchable from the boundary

IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
Online polygon search by a seven-state boundary 1-searcher

IEEE Transactions on Robotics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the surveillance of a polygonal area by a robot, which is equipped with a flashlight and moves along the polygon boundary. Its aim is to illuminate any intruder who can move faster than the moving flashlight beam, trying to avoid detection. We propose an O(n)-time algorithm for testing if it is possible for such a robot to always detect any intruder in a given polygon, where n is the number of vertices of the given polygon. This improves upon the best previous time complexity of O(n log n).