Optimal spiral search plan for a randomly located target in the plane
by Mohamed Abd Allah El-Hadidy
International Journal of Operational Research (IJOR), Vol. 22, No. 4, 2015

Abstract: This paper addresses the problem of searching for a located target in the plane by using a unit-speed searcher starting at (0, 0). The plane is divided into cells. The searcher moves along spiral with line segment curve. It is desired to search in an optimal manner to minimise the expected time for detecting the target. An illustrative example has been given to demonstrate the applicability of this technique.

Online publication date: Sat, 09-May-2015

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 Operational Research (IJOR):
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