AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT-Reference-Cited by-同舟云学术

AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT

Published:2002-02 Issue:01n02 Volume:12 Page:87-113
ISSN:0218-1959
Container-title:International Journal of Computational Geometry & Applications
language:en
Short-container-title:Int. J. Comput. Geom. Appl.

Author:

LAVALLE STEVEN M.¹,SIMOV BORISLAV H.²,SLUTZKI GIORA³

Affiliation:

1. Department of Computer Science, University of Illinois, Urbana, IL 61801, USA

2. Enterprise Systems Technology Lab, Hewlett-Packard Co., Cupertino, CA 95014, USA

3. Department of Computer Science, Iowa State University, Ames, IA 50011, USA

Abstract

We present an algorithm for a single pursuer with one flashlight searching for an unpredictable, moving target in a 2D environment. The algorithm decides whether a simple polygon with n edges and m concave regions can be cleared by the pursuer, and if so, constructs a search schedule of length O(m) in time O(m2+m log n+n). The key ideas in this algorithm include a representation called "visibility obstruction diagram" and its "skeleton": a combinatorial decomposition based on a number of critical visibility events. An implementation is presented along with a computed example.

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science

Link

https://www.worldscientific.com/doi/pdf/10.1142/S021819590200075X

Reference8 articles.

1. Ray shooting in polygons using geodesic triangulations

2. SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM

3. AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM

4. A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk

5. THE TWO GUARDS PROBLEM

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Complete and optimal visibility-based pursuit-evasion;The International Journal of Robotics Research;2017-07

2. An alternative proof for the equivalence of ∞-searcher and 2-searcher;Theoretical Computer Science;2016-06

3. Searching a Circular Corridor with Three Flashlights;2015 IEEE Fifth International Conference on Big Data and Cloud Computing;2015-08

4. Minimization of the maximum distance between the two guards patrolling a polygonal region;Theoretical Computer Science;2014-05

5. Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region;Frontiers in Algorithmics and Algorithmic Aspects in Information and Management;2012