The searchlight scheduling problem
SIAM Journal on Computing
Searching for a mobile intruder in a polygonal region
SIAM Journal on Computing
Simple algorithms for searching a polygon with flashlights
Information Processing Letters
Randomized Pursuit-Evasion in Graphs
Combinatorics, Probability and Computing
Coordinated exploration of unknown labyrinthine environments applied to the pursuit evasion problem
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Applications of visibility space in polygon search problems
Applications of visibility space in polygon search problems
Visibility-based pursuit-evasion with limited field of view
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
| Hi-index | 0.00 |
In this article, we study a form of pursuit-evasion problem, in which one or more pursuers must find a strategy of moves in a given closed environment (such as building) to guarantee the detection of an unpredictable evader. The main idea is to use a graph of visibility between vertices and some techniques to bring this graph into a graph of building areas. Because of the increasing interest on the pursuit-evasion applications, such as: searching buildings for intruders, traffic control, military strategy and surgical operation, a lot of research (Basar and Olsder, 1999; Guibas et al., 1999; Hespanha et al., 1999, 2000; Suzuki and Yamashita, 1992) has been done on this problem. The main interest of this work is the simplification and test of the visibility graph. A technique to solve the pursuit-evasion problem has been proposed, this technique is the worst-case search. Finally, the used tool in the experimental work has been presented.