Optimal spiral search plan for a randomly located target in the plane (Q2627574)

From MaRDI portal
Revision as of 07:54, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Optimal spiral search plan for a randomly located target in the plane
scientific article

    Statements

    Optimal spiral search plan for a randomly located target in the plane (English)
    0 references
    31 May 2017
    0 references
    Summary: 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.
    0 references
    spiral search
    0 references
    line segment
    0 references
    unit-speed searcher
    0 references
    revolution
    0 references
    circular normal distribution
    0 references
    optimal search path
    0 references
    randomly located targets
    0 references

    Identifiers