Random search in a bounded area

Abd El-Moneim AnwarMohamed Teamah, Hamdy Mohamed Abou Gabal and Mohamed Abd Allah El-Hadidy

International Journal of Mathematics in Operational Research, 2017, vol. 10, issue 2, 137-149

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.

Keywords: first meeting time; random search path; truncated distribution; circular normal; Jacobian of the transformation; bounded areas; randomly moving targets. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=81921 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:10:y:2017:i:2:p:137-149

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().