Optimal layered search
作者:
J. R. Weisinger,
S. J. Benkoski,
期刊:
Naval Research Logistics (NRL)
(WILEY Available online 1989)
卷期:
Volume 36,
issue 1
页码: 43-60
ISSN:0894-069X
年代: 1989
DOI:10.1002/1520-6750(198902)36:1<43::AID-NAV3220360104>3.0.CO;2-W
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractThis 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.
点击下载:
PDF
(928KB)
返 回