Double linear search problem for a Brownian target motion

MaRDI QIDQ951780zbMATH OpenFDO

Authors Abd El-Moneim A. M. Teamah, Hamdy M. Abou-Gabal

Publication date 3 November 2008

Published in Journal of the Egyptian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

Brownian motionexpected valuelinear searchoptimal search plan

Mathematics Subject Classification ID

Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Search theory (90B40)

Review text

The present paper deals with a double search model. The existence of the optimal search plan is shown, which minimizes the expected value of the first meeting time between one of the searchers and the target.

Recommendations

• Multiplicative linear search for a Brownian target motion
• Linear search for a Brownian target motion
• Searching for a d-dimensional Brownian target with multiple sensors
• Optimal multiplicative generalized linear search plan for a discrete random walker
• Optimal searching for a Helix target motion

Cited in

(5)

• Linear search for a Brownian target motion
• Searching for a d-dimensional Brownian target with multiple sensors
• The likely antecedents of improbable events: optimal search strategies
• Multiplicative linear search for a Brownian target motion
• Optimal multiplicative generalized linear search plan for a discrete random walker

This page was built for publication: Double linear search problem for a Brownian target motion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q951780)