Autorentext

Dr. Stone is Chief Scientist at Metron Inc.  He is a member of the National Academy of Engineering and a fellow of the Institute for Operations Research and Management Science.

In 1975, the Operations Research Society of America awarded the Lanchester Prize to Dr. Stone's text, Theory of Optimal Search.  In 1986, he produced the probability maps used to locate the S.S. Central America which sank in 1857, taking millions of dollars of gold coins and bars to the ocean bottom one and one-half miles below.  In 2010 he led the team that produced the probability distribution that guided the French to the location of the underwater wreckage of Air France Flight AF447. He is a coauthor of the 2014 book, Bayesian Multiple Target Tracking.  He continues to work on a number of detection and tracking systems for the United States Navy and Coast Guard including the Search And Rescue Optimal Planning System used by the Coast Guard since 2007to plan searches for people missing at sea.

Dr. Johannes O. Royset is Associate Chair of Research and Associate Professor of Operations Research at the Naval Postgraduate School. Dr. Royset's research focuses on formulating and solving stochastic and deterministic optimization problems arising in data analysis, sensor management, and reliability engineering. Dr. Royset has a Doctor of Philosophy degree from the University of California at Berkeley (2002). He was awarded a National Research Council postdoctoral fellowship in 2003, a Young Investigator Award from the Air Force Office of Scientific Research in 2007, and the Barchi Prize as well as the MOR Journal Award from the Military Operations Research Society in 2009. He received the Carl E. and Jessie W. Menneken Faculty Award for Excellence in Scientific Research in 2010. Dr. Royset is an associate editor of Operations Research, Naval Research Logistics, Journal of Optimization Theory and Applications, and Computational Optimization and Applications.

Alan Washburn received a Ph. D. in Electrical Engineering from Carnegie Institute of Technology in 1965, and has been with the Operations Research Department at the Naval Postgraduate School since 1970. He is a member of the National Academy of Engineering, and is the recipient of several awards and prizes, including the Distinguished Civilian Service Award for his research and tutorial notes on several topics of importance to the Department of Defense. He is the author of over 50 scientific publications, including several books. His research is almost entirely military, emphasizing problems that employ search theory, game theory or both. He is a member of INFORMS and also of the Military Operations Research Society (MORS).   

Klappentext

Zusammenfassung

This book begins with a review of basic results in optimal search for a stationary target. It then develops the theory of optimal search for a moving target, providing algorithms for computing optimal plans and examples of their use. Next it develops methods for computing optimal search plans involving multiple targets and multiple searchers with realistic operational constraints on search movement. These results assume that the target does not react to the search. In the final chapter there is a brief overview of mostly military problems where the target tries to avoid being found as well as rescue or rendezvous problems where the target and the searcher cooperate. 

Larry Stone wrote his definitive book Theory of Optimal Search in 1975, dealing almost exclusively with the stationary target search problem. Since then the theory has advanced to encompass search for targets that move even as the search proceeds, and computers have developed sufficient capability to employ the improved theory. In this book, Stone joins Royset and Washburn to document and explain this expanded theory of search. The problem of how to search for moving targets arises every day in military, rescue, law enforcement, and border patrol operations. 

Inhalt
Introduction.- Search for a Stationary Target.- Search for a Moving Target in Discrete Space and Time.- Path-Constrained Search in Discrete Time and Space.- Search for Moving Targets in Continuous Space.- Constrained Search in Continuous Time and Space.- Search Games.