A Visibility-Based Pursuit-Evasion Problem

@article{Guibas1999AVP,
  title={A Visibility-Based Pursuit-Evasion Problem},
  author={L. Guibas and J. Latombe and S. LaValle and David C. Lin and R. Motwani},
  journal={Int. J. Comput. Geom. Appl.},
  year={1999},
  volume={9},
  pages={471-494}
}
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… Expand
Finding an unpredictable target in a workspace with obstacles
Visibility-Based Pursuit-Evasion in an Unknown Planar Environment
Randomized pursuit-evasion in a polygonal environment
A Complete Algorithm for Searchlight Scheduling
Complete and optimal visibility-based pursuit-evasion
Visibility-based Pursuit-evasion with Limited Field of View
Pursuit-evasion in an unknown environment using gap navigation trees
Multi-robot pursuit with visibility constraints
Locating and Capturing an Evader in a Polygonal Environment
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 39 REFERENCES
Finding an unpredictable target in a workspace with obstacles
The complexity of robot motion planning
Mobile robot self-location using model-image feature correspondence
Searching for a Mobile Intruder in a Polygonal Region
The Robot Localization Problem
...
1
2
3
4
...