Generalised linear search plan for a D-dimensional random walk target

Mohamed Abd Allah El-Hadidy

International Journal of Mathematics in Operational Research, 2019, vol. 15, issue 2, 211-241

Abstract: In this paper, we present a mathematical search model that studies the generalised linear search plan for detecting a d-dimensional random walk target. The target will meet one of the searchers where each searcher starts its motion from any point rather than the origin on n-disjoint real lines in ℝⁿ. Rather than, finding the conditions that show the finiteness of this search plan, we study the existence of the optimal search plan that minimises the expected value of the first meeting time between one of the searchers and the target.

Keywords: linear search method; d-dimensional random walk; finite search plan; optimal search plan; semi continuous mapping. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=101622 (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:ijmore:v:15:y:2019:i:2:p:211-241

Access Statistics for this article

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