Resolving the pursuit evasion problem in known environment using graph theory Online publication date: Sun, 21-Nov-2010
by Rabah Lakel, Adel Djellal
International Journal of Bio-Inspired Computation (IJBIC), Vol. 2, No. 6, 2010
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook