The Generalized Search for a Randomly Moving TargetReport as inadecuate




The Generalized Search for a Randomly Moving Target - Download this document for free, or read online. Document in PDF available to download.

A target is assumed to move randomly on one of twodisjoint lines L1 and L2 according to astochastic process . We have two searchers start looking for the losttarget from some points on the two lines separately. Each of the searchersmoves 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 isserious as a car filled with explosives which moves randomly in one of disjointroads, in these cases the search effort mustbe unrestricted and then we can use more than one searcher. In this paper weshow the existence of a search plan such that the expected value of the firstmeeting time between the target and one of the two searchers is minimum.

KEYWORDS

Stochastic Process; Expected Value; Linear Search; Optimal Search Plan

Cite this paper

Teamah, A. 2014 The Generalized Search for a Randomly Moving Target. Applied Mathematics, 5, 642-652. doi: 10.4236-am.2014.54060.





Author: Abdelmoneim Anwar Mohamed Teamah

Source: http://www.scirp.org/



DOWNLOAD PDF




Related documents