Existence of optimal N -slinky-turn-spiral search paths for finding N -dimensional Brownian target

Mohamed Abd Allah El-Hadidy

International Journal of Mathematics in Operational Research, 2021, vol. 19, issue 2, 180-203

Abstract: This paper presents more effective search technique for finding the N-dimensional Brownian target in N-dimensional space by using N-searchers. Each searcher moves along slinky-turn-spiral curve and starts its motion from the origin. An adaptive geometric features such as curvature and torsion of each searching path to meet the target is proposed. Rather than showing the existence of finite and optimal search paths, we find these optimal search paths which minimise the expected value of the first meeting time between one of the searchers and the target based on its geometric characteristics and features. A simulation study has been discussed to demonstrate the applicability of this technique.

Keywords: optimal search theory; geometric features; N -dimensional Brownian target; first meeting time. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=116313 (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:19:y:2021:i:2:p:180-203

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