Optimal Search for Moving Targets
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 meth
- PDF / 3,958,711 Bytes
- 222 Pages / 439.42 x 683.15 pts Page_size
- 64 Downloads / 237 Views
Lawrence D. Stone Johannes O. Royset Alan R. Washburn
Optimal Search for Moving Targets
International Series in Operations Research & Management Science Volume 237
Series Editor Camille C. Price Stephen F. Austin State University, TX, USA Associate Series Editor Joe Zhu Worcester Polytechnic Institute, MA, USA Founding Series Editor Frederick S. Hillier Stanford University, CA, USA
More information about this series at http://www.springer.com/series/6161
Lawrence D. Stone • Johannes O. Royset Alan R. Washburn
Optimal Search for Moving Targets
123
Lawrence D. Stone Metron, Inc. Reston, VA, USA
Johannes O. Royset Naval Postgraduate School Monterey, CA, USA
Alan R. Washburn Naval Postgraduate School Monterey, CA, USA
ISSN 0884-8289 ISSN 2214-7934 (electronic) International Series in Operations Research & Management Science ISBN 978-3-319-26897-2 ISBN 978-3-319-26899-6 (eBook) DOI 10.1007/978-3-319-26899-6 Library of Congress Control Number: 2016931331 Springer Cham Heidelberg New York Dordrecht London © Springer International Publishing Switzerland 2016 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. Printed on acid-free paper Springer International Publishing AG Switzerland is part of Springer Science+Business Media (www. springer.com)
Foreword
It has been more than 40 years since the publication in 1975 of the definitive book, Theory of Optimal Search, which dealt 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. The problem of how to search for moving targets arises every day in military, rescue, law enforcement, and border patrol operations. In this book the authors document and explain this expanded theory of search and show how it can be applied. Shortly after 1975, Scott Brown, Alan Washburn, Lawrence Stone, and others began the development of a theory for s
Data Loading...
