Searching for a d-dimensional Brownian target with multiple sensors

Mohamed Abd Allah El-Hadidy

International Journal of Mathematics in Operational Research, 2016, vol. 9, issue 3, 279-301

Abstract: We consider a search problem for a d-dimensional Brownian target that moves randomly on d-space. We have n-searchers moving with a linear paths in d-dimension to search for the target. Each of the searchers moves continuously along its line in both directions of the starting point (origin of its line). The purpose of this paper is to formulate a search model and find the condition under which the expected value of the first meeting time between one of the searchers and the target finite. Also, we show the existence of the optimal search plan that minimises the expected value of the first meeting time.

Keywords: disjoint real lines; finite search plan; d-dimensional Brownian motion; digonal matrix; optimal search plan; multiple sensors. (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=78822 (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:9:y:2016:i:3:p:279-301

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 ().