LEADER 04089nam 22006495 450 001 9910254666103321 005 20200706175612.0 010 $a3-319-26899-6 024 7 $a10.1007/978-3-319-26899-6 035 $a(CKB)3710000000636323 035 $a(EBL)4497526 035 $a(DE-He213)978-3-319-26899-6 035 $a(MiAaPQ)EBC4497526 035 $a(PPN)226699773 035 $a(EXLCZ)993710000000636323 100 $a20160405d2016 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aOptimal Search for Moving Targets /$fby Lawrence D. Stone, Johannes O. Royset, Alan R. Washburn 205 $a1st ed. 2016. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2016. 215 $a1 online resource (222 p.) 225 1 $aInternational Series in Operations Research & Management Science,$x0884-8289 ;$v237 300 $aDescription based upon print version of record. 311 $a3-319-26897-X 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aIntroduction -- 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. . 330 $aThis 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. . 410 0$aInternational Series in Operations Research & Management Science,$x0884-8289 ;$v237 606 $aOperations research 606 $aDecision making 606 $aManagement science 606 $aMarket research 606 $aOperations Research/Decision Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/521000 606 $aOperations Research, Management Science$3https://scigraph.springernature.com/ontologies/product-market-codes/M26024 606 $aMarket Research/Competitive Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/513030 615 0$aOperations research. 615 0$aDecision making. 615 0$aManagement science. 615 0$aMarket research. 615 14$aOperations Research/Decision Theory. 615 24$aOperations Research, Management Science. 615 24$aMarket Research/Competitive Intelligence. 676 $a650 700 $aStone$b Lawrence D$4aut$4http://id.loc.gov/vocabulary/relators/aut$059128 702 $aRoyset$b Johannes O$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aWashburn$b Alan R$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910254666103321 996 $aOptimal Search for Moving Targets$91939172 997 $aUNINA