Springer Optimal Search for Moving Targets: 237 (International Series in Operations Research & Management Science, 237)

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.  Review “This monograph contains an excellent review of the basic results in optimal search for stationary and moving targets. … The monograph represents a detailed, self-contained, informative resource for the study of optimal search problems for moving targets, which makes it worth reading for anyone interested in the topic!” (Alexander E. Guterman, Mathematical Reviews, February, 2017) From the Back Cover 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.   About the Author 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 2007 to plan searches for people missing at sea. Dr. Johannes O. Royset is Associate