Visibility-Based Pursuit-Evasion in a Polygonal Environment
@inproceedings{Guibas1997VisibilityBasedPI, title={Visibility-Based Pursuit-Evasion in a Polygonal Environment}, author={L. Guibas and J. Latombe and S. LaValle and D. Lin and R. Motwani}, booktitle={WADS}, year={1997} }
This paper addresses the problem of planning the motion of one or more pursuers in a polygonal environment to eventually “see” an evader that is unpredictable, has unknown initial position, and is capable of moving arbitrarily fast. This problem was first introduced by Suzuki and Yamashita. Our study of this problem is motivated in part by robotics applications, such as surveillance with a mobile robot equipped with a camera that must find a moving target in a cluttered workspace. A few bounds… CONTINUE READING
Topics from this paper
217 Citations
Visibility-Based Pursuit-Evasion in an Unknown Planar Environment
- Mathematics, Computer Science
- Int. J. Robotics Res.
- 2004
- 121
- PDF
Surveillance Strategies for a Pursuer with Finite Sensor Range
- Computer Science
- Int. J. Robotics Res.
- 2007
- 59
- PDF
Complete and optimal visibility-based pursuit-evasion
- Computer Science
- Int. J. Robotics Res.
- 2017
- 7
- Highly Influenced
- PDF
Pursuit-evasion in an unknown environment using gap navigation trees
- Computer Science
- 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566)
- 2004
- 41
- PDF
A complete algorithm for visibility-based pursuit-evasion with multiple pursuers
- Mathematics, Computer Science
- 2014 IEEE International Conference on Robotics and Automation (ICRA)
- 2014
- 22
- Highly Influenced
- PDF
Maintaining strong mutual visibility of an evader moving over the reduced visibility graph
- Computer Science
- Auton. Robots
- 2016
- 3
- PDF
A Complexity result for the pursuit-evasion game of maintaining visibility of a moving evader
- Mathematics, Computer Science
- 2008 IEEE International Conference on Robotics and Automation
- 2008
- 35
- PDF
A sampling-based algorithm for multi-robot visibility-based pursuit-evasion
- Mathematics, Computer Science
- 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems
- 2014
- 9
- Highly Influenced
- PDF
References
SHOWING 1-10 OF 32 REFERENCES
Finding an unpredictable target in a workspace with obstacles
- Engineering, Computer Science
- Proceedings of International Conference on Robotics and Automation
- 1997
- 190
On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers
- Mathematics
- 1983
- 277
Searching for a Mobile Intruder in a Polygonal Region
- Mathematics, Computer Science
- SIAM J. Comput.
- 1992
- 310
Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem
- Mathematics, Computer Science
- Int. J. Comput. Geom. Appl.
- 1995
- 78
- PDF
Mobile robot self-location using model-image feature correspondence
- Computer Science
- IEEE Trans. Robotics Autom.
- 1996
- 105
- PDF
A theorem on polygon cutting with applications
- Mathematics, Computer Science
- 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
- 1982
- 290
Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Mathematics, Computer Science
- TOGS
- 1985
- 1,178