Abstract
Many algorithms for computing optimal search plans for a moving target rely on being able to compute optimal plans for a stationary target. This chapter provides an overview of the standard models and results for optimal search for a stationary target. It discusses search sensors and some basic notions of detection modeling, including lateral range curves, sweep widths, and detection functions. It defines the search space and the prior distribution on target location in discrete and continuous space. It develops methods for finding search plans that maximize the probability of detecting the target by a fixed time and explores related optimal search problems such as minimizing the mean time to find the target. It presents algorithms that may be used to compute optimal plans in most cases. Optimal search for a stationary target is covered more extensively in Stone (2007).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Belkin B (1975) On the rate of expansion of gamma search plans. Oper Res 23:1033–1037
Charnes A, Cooper WW (1958) The theory of search: optimum distribution of search effort. Manag Sci 5:44–50
Coast Guard (2010) U.S. Coast Guard addendum to the United States search and rescue supplement (NSS) to the international aeronautical and maritime search and rescue manual (IAMSAR). COMDTINST M16130.2F, U.S., Coast Guard, Washington, DC
Everett H (1963) Generalized Lagrange multiplier method for solving problems of optimum allocation of resources. Oper Res 11:399–417
IAMSAR (2008) International aeronautical and maritime search and rescue manual, vol 2. IMO/ICAO, London/Montréal
Koopman BO (1946) Search and screening, vol 56, Operations evaluation group report. Center for Naval Analyses, Alexandria
Koopman BO (1956a) The theory of search. Part I. Kinematic bases. Oper Res 4:324–346
Koopman BO (1956b) The theory of search. Part II. Target detection. Oper Res 4:503–531
Koopman BO (1957) The theory of search. Part III. The optimum distribution of searching effort. Oper Res 5:613–626
Koopman BO (1980) Search and screening: general principles with historical applications. Pergamon Press, New York
Kratzke TM, Stone LD, Frost JR (2010) Search and rescue optimal planning system. In: Proceedings of the 13th international conference on information fusion, Edinburgh, UK, 26–29 July 2010
Richardson HR, Belkin B (1972) Optimal search with uncertain sweep width. Oper Res 20:764–784
Stone LD (1992) Search for the SS Central America: mathematical treasure hunting. Interfaces 22:32–54
Stone LD (2007) Theory of optimal search, 2nd edn. INFORMS, Catonsville
Washburn AR (2006) Piled-slab searches. Oper Res 54:1193–1200
Washburn AR (2014a) Search and detection, 5th edn. Create Space, North Charleston
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Stone, L.D., Royset, J.O., Washburn, A.R. (2016). Search for a Stationary Target. In: Optimal Search for Moving Targets. International Series in Operations Research & Management Science, vol 237. Springer, Cham. https://doi.org/10.1007/978-3-319-26899-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-26899-6_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26897-2
Online ISBN: 978-3-319-26899-6
eBook Packages: Business and ManagementBusiness and Management (R0)