Random search in a bounded area
by Abd El-Moneim AnwarMohamed Teamah; Hamdy Mohamed Abou Gabal; Mohamed Abd Allah El-Hadidy
International Journal of Mathematics in Operational Research (IJMOR), Vol. 10, No. 2, 2017

Abstract: This paper investigates a random search problem for a randomly moving target in a bounded area in which any time information of the target position is not available to the searcher. Let (X, Y) be two independent truncated random variables represent the position of the target at any time. We have one searcher starts searching for this target from a random point in the plane. In this paper, we found the distribution of the first meeting time between the searcher and the target and found the expected value of it.

Online publication date: Tue, 31-Jan-2017

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 Mathematics in Operational Research (IJMOR):
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