A pursuit-evasion problem-solving strategy based on probability estimation in a planer region
by Yongyao Li; Jiancong Fan
International Journal of Computing Science and Mathematics (IJCSM), Vol. 4, No. 2, 2013

Abstract: The pursuit-evasion problem in planar regions is presented, and a strategy based on probability estimation is proposed. The instant evasion routines of the evader are abstracted and described by linear and non-linear probabilistic models. The pursuer computes the capture probabilities of the instant evasion trajectories dynamically to achieve the behaviour process and moving strategy. The proposed strategy takes advantages of evolutionary ideas and estimation of probabilistic distribution approach, and the efficiency and convergence of the strategy in this paper are verified. The simulation experiments show that the proposed approach has better performances on the success rates of capture and the capture time, and the experimental results show that the pursuers can capture the evaders successfully in limited time.

Online publication date: Sat, 10-May-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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