2011
DOI: 10.1016/j.apm.2011.03.024
|View full text |Cite
|
Sign up to set email alerts
|

Multiplicative linear search for a brownian target motion

Abstract: a b s t r a c tThis 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 w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
24
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 36 publications
(24 citation statements)
references
References 22 publications
(24 reference statements)
0
24
0
Order By: Relevance
“…They showed the existence of the optimal search plan which makes the expected value of the first meeting time between the searcher and target minimum. Mohamed et al [2] studied this problem for a Brownian target on one of n-intersected real lines.…”
Section: Introductionmentioning
confidence: 99%
“…They showed the existence of the optimal search plan which makes the expected value of the first meeting time between the searcher and target minimum. Mohamed et al [2] studied this problem for a Brownian target on one of n-intersected real lines.…”
Section: Introductionmentioning
confidence: 99%
“…El-Rayes et al [9] illustrated this problem when the target moves on the real line with a Brownian motion, and the searcher starts the search from the origin. Recently, Mohamed et al [10] discussed this problem for a Brownian target motion on one of -intersected real lines in which any information of the target position is not available to the searchers all the time. Mohamed et al formulate a search model and find the conditions under which the expected value of the first meeting time between one of the searchers and the target is finite.…”
Section: Introductionmentioning
confidence: 99%
“…After several decades of development, search problems are still largely of the same form as in 1942: a single target is lost and the problem is to find it efficiently. Therefore, the study of search plans for a lost target that either stationary or which move according to a known random motion has a remarkable importance in our life, because it has various applications like searching for a faulty unit in large linear system such as electrical power lines, petrol or gas supply under ground, missing boats and submarines, mining systems and search for a randomly located goal at two separated regions (see, e.g., El-Rayes and Mohamed, 1998Mohamed, , 1986Oshumi, 1991;El-Rayes et al, 2003;Mohamed et al, 2009Mohamed et al, , 2011Alpern and Haward, 2000).…”
Section: Introductionmentioning
confidence: 99%