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 methods for computing optimal search plans involv...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς: Stone, Lawrence D. (Συγγραφέας), Royset, Johannes O. (Συγγραφέας), Washburn, Alan R. (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2016.
Σειρά:International Series in Operations Research & Management Science, 237
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03467nam a22005295i 4500
001 978-3-319-26899-6
003 DE-He213
005 20170731142725.0
007 cr nn 008mamaa
008 160405s2016 gw | s |||| 0|eng d
020 |a 9783319268996  |9 978-3-319-26899-6 
024 7 |a 10.1007/978-3-319-26899-6  |2 doi 
040 |d GrThAP 
050 4 |a HD30.23 
072 7 |a KJT  |2 bicssc 
072 7 |a KJMD  |2 bicssc 
072 7 |a BUS049000  |2 bisacsh 
082 0 4 |a 658.40301  |2 23 
100 1 |a Stone, Lawrence D.  |e author. 
245 1 0 |a Optimal Search for Moving Targets  |h [electronic resource] /  |c by Lawrence D. Stone, Johannes O. Royset, Alan R. Washburn. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2016. 
300 |a XIV, 211 p. 46 illus., 11 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a International Series in Operations Research & Management Science,  |x 0884-8289 ;  |v 237 
505 0 |a 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.   . 
520 |a 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.  . 
650 0 |a Business. 
650 0 |a Market research. 
650 0 |a Operations research. 
650 0 |a Decision making. 
650 0 |a Management science. 
650 1 4 |a Business and Management. 
650 2 4 |a Operation Research/Decision Theory. 
650 2 4 |a Operations Research, Management Science. 
650 2 4 |a Market Research/Competitive Intelligence. 
700 1 |a Royset, Johannes O.  |e author. 
700 1 |a Washburn, Alan R.  |e author. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783319268972 
830 0 |a International Series in Operations Research & Management Science,  |x 0884-8289 ;  |v 237 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-26899-6  |z Full Text via HEAL-Link 
912 |a ZDB-2-BUM 
950 |a Business and Management (Springer-41169)