Existence of optimal N-slinky-turn-spiral search paths for finding N-dimensional Brownian target
by Mohamed Abd Allah El-Hadidy
International Journal of Mathematics in Operational Research (IJMOR), Vol. 19, No. 2, 2021

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.

Online publication date: Tue, 20-Jul-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com