TITLE:
The Generalized Search for a Randomly Moving Target
AUTHORS:
Abdelmoneim Anwar Mohamed Teamah
KEYWORDS:
Stochastic Process; Expected Value; Linear Search; Optimal Search Plan
JOURNAL NAME:
Applied Mathematics,
Vol.5 No.4,
March
10,
2014
ABSTRACT: A target is assumed to move randomly on one of two
disjoint lines L1 and L2 according to a
stochastic process . We have two searchers start looking for the lost
target from some points on the two lines separately. Each of the searchers
moves continuously along his line in both directions of his starting point.
When the target is valuable as a person lost on one of disjoint roads, or is
serious as a car filled with explosives which moves randomly in one of disjoint
roads, in these cases the search effort must
be unrestricted and then we can use more than one searcher. In this paper we
show the existence of a search plan such that the expected value of the first
meeting time between the target and one of the two searchers is minimum.