IJPAM: Volume 28, No. 2 (2006)


Abd-El-Moneim A.M. Teamah$^1$, Hamdy M. Abou-Gabal$^2$
$^{1,2}$Department of Mathematics
Faculty of Science
Tanta University
Tanta, EGYPT
$^1$e-mail: teamah4@hotmail.com
$^2$e-mail: hamdyabougabal@yahoo.com

Abstract.A target is assumed to move randomly according to a stochastic process on a straight line. Two searchers $S_{1}\,$ and $S_{2}$ start looking for the target, $S_{1}\,$starts looking for the target from some point $a_{o}$and $S_{2}$ starts from some other point $b_{o}$ on the line to detect the target. Each of the searchers moves continuously along the line in both directions from his starting point. In this paper we show the existence of a search plan such that the expected value of the first meeting time of the lost target is minimum.

Received: March 14, 2006

AMS Subject Classification: 60K30, 90B40

Key Words and Phrases: expected value, linear search, optimal search plan, stochastic processes

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2006
Volume: 28
Issue: 2