Searching for a Target Whose Truncated Brownian Motion
Searching for a Target Whose Truncated Brownian Motion
摘要
This paper presents search model for a randomly moving target which follows truncated Brownian motion. The conditions that make the expected value of the first meeting time between the searcher and the target is finite are given. We show the existence of an optimal strategy which minimizes this first meeting time.
This paper presents search model for a randomly moving target which follows truncated Brownian motion. The conditions that make the expected value of the first meeting time between the searcher and the target is finite are given. We show the existence of an optimal strategy which minimizes this first meeting time.
二级参考文献15
-
1Abd EI-Moneim A Mohamed. Search for a Randomly Moving Target with Unrestricted Effort. Annual Conference (Cairo) ISSR Vol. 34, Math Statistics, 1999. 48-56.
-
2El-Rayes A B, Abd El-Moneim M A. Oscillating Search for a Randomly Located Target. The Annual Conference (Cairo) ISSR Vol. 32 part II, 1997. 35-44.
-
3Ohsumi A. Optimal Search for a Markovian Target. Naval Research Logistics, 1991, 38(4).
-
4Elrayes A B, Abd El-Moneim M A. Searching for a Randomly Moving Target. The Third ORMA Conference, Egypt. Vol 2. 1989. 323-329.
-
5Washburn Alan R. Search and Detection. Second Edition. 1989.
-
6Beck A, Warren P. The Return of the Linear Search Problem. Israel J Math, 1973,14:169-183.
-
7Fristedt B, Heath D. Searching for a Particle on the Real Line. Adv Appl Prob, 1974,6:79-102.
-
8Frank W. An Optimal Search Problem. SIAM Rev, 1965,7:503-512.
-
9Stone L D. Theory of Optimal Search. New York:Academic Press, 1975.
-
10MC Cabe B J. Searching for One Dimensional Random Walker. J Appl Prob, 1974,11:86-93.
