Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1704985 | Applied Mathematical Modelling | 2011 | 13 Pages |
Abstract
This paper investigates a search problem for a brownian target motion on one of n-intersected real lines in which any information of the target position is not available to the searchers all the time. We have n-searchers start searching for the target from the origin that is the intersection point of these lines. Each of the searchers moves continuously along his line in both directions of the starting point. The purpose of this paper is to formulate a search model and find the condition under which the expected value of the first meeting time between one of the searchers and the target is finite. Also, we show the existence of the optimal search plan which minimizes the expected value of the first meeting time and find it.
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Abd El-Moneim Anwar Mohamed, Mohamed Abd El-Hady Kassem, Mohamed Abd Allah El-Hadidy,