LINEAR SEARCH FOR A BROWNIAN TARGET MOTION

摘要/Abstract

摘要：

A target is assumed to move according to a Brownian motion on the real line.
The searcher starts from the origin and moves in the two directions from the starting point.
The object is to detect the target. The purpose of this paper is to find the conditions under
which the expected value of the first meeting time of the searcher and the target is finite,
and to show the existence of a search plan which made this expected value minimum.

关键词: Brownian process, expected value, linear search, optimal search plan

Abstract:

Key words: Brownian process, expected value, linear search, optimal search plan

中图分类号:

60K10

A. B. El-Rayes1 Abd El-Moneim A. Mohamed1 Hamdy M. Abou Gabal2. LINEAR SEARCH FOR A BROWNIAN TARGET MOTION[J]. 数学物理学报(英文版), 2003, 23(3): 321-.

A. B. El-Rayes1 Abd El-Moneim A. Mohamed1 Hamdy M. Abou Gabal2. LINEAR SEARCH FOR A BROWNIAN TARGET MOTION[J]. Acta mathematica scientia,Series B, 2003, 23(3): 321-.

[1]	陈世平, 胡德坤. THE SOLUTION TO THE SK-MODEL[J]. 数学物理学报(英文版), 2002, 22(2): 283-288.
[2]	魏刚, 陈世平. PRICING AND HEDGING OPTION UNDER PORTFOLIO CONSTRAINED[J]. 数学物理学报(英文版), 2001, 21(4): 483-494.
[3]	向开南. A REMARK ON A BMO MARTINGALE[J]. 数学物理学报(英文版), 2000, 20(4): 511-514.