Optimal searching for a randomly located target in a bounded known region
by Hamdy Mohamed Abou Gabal; Mohamed Abd Allah El-Hadidy
International Journal of Computing Science and Mathematics (IJCSM), Vol. 6, No. 4, 2015

Abstract: This paper addresses the problem of searching for a randomly located target in a bounded known region by a single searcher. The searcher wishes to find the target's position, that is given by the value of the two independent double truncated random variables (X; Y) and they have joint symmetric probability density function f(x; y). It is desired to search in an optimal manner to minimise the expected value of the time for detecting the target, assuming double truncated circular normal distributed estimates of its position.

Online publication date: Sat, 19-Sep-2015

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