On the existence of a finite linear search plan with random distances and velocities for a one-dimensional Brownian target

Mohamed Abd Allah El-Hadidy

International Journal of Operational Research, 2020, vol. 37, issue 2, 245-258

Abstract: In this paper, we consider a linear search model that takes into consideration the velocities and the distances which the searcher do them are independent random variables with known probability density functions (PDFs). The searcher moves continuously along the line in both directions of the starting point (origin of line). We use the Fourier-Laplace representation to give an analytical expression for the density of the random distance in the model. Also, we get the conditions that make the expected value of the first meeting time between the searcher and the target is finite.

Keywords: linear search problem; finite search plan; one-dimensional Brownian motion; Fourier-Laplace transform. (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=105369 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:37:y:2020:i:2:p:245-258

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().