Premium
Optimal layered search
Author(s) -
Weisinger J. R.,
Benkoski S. J.
Publication year - 1989
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(198902)36:1<43::aid-nav3220360104>3.0.co;2-w
Subject(s) - mathematics , mathematical optimization , point (geometry) , space (punctuation) , integer (computer science) , bivariate analysis , search problem , distribution (mathematics) , computer science , statistics , mathematical analysis , geometry , programming language , operating system
This article investigates the problem of planning an optimal layered search for a stationary target. A search is layered if it assigns each point in the search space an integer number of glimpses or looks. General necessary and sufficient conditions and an existence theorem are obtained. The special case in which the initial target distribution is bivariate normal is considered in detail.