國立虎尾科技大學 |

Optimal search for moving targets

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Optimal search for moving targets/ by Lawrence D. Stone, Johannes O. Royset, Alan R. Washburn.
Author:	Stone, Lawrence D.
other author:	Royset, Johannes O.
Published:	Cham :Springer International Publishing : : 2016.,
Description:	xiv, 211 p. :ill., digital ; : 24 cm.;
Contained By:	Springer eBooks
Subject:	Industrial management - Research. -
Online resource:	http://dx.doi.org/10.1007/978-3-319-26899-6
ISBN:	9783319268996

Optimal search for moving targets
Stone, Lawrence D.

Optimal search for moving targets[electronic resource] /by Lawrence D. Stone, Johannes O. Royset, Alan R. Washburn. - Cham :Springer International Publishing :2016. - xiv, 211 p. :ill., digital ;24 cm. - International series in operations research & management science,v.2370884-8289 ;. - International series in operations research & management science ;106..

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.

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.

ISBN: 9783319268996

Standard No.: 10.1007/978-3-319-26899-6doiSubjects--Topical Terms:

643817
Industrial management
--Research.

LC Class. No.: HD30.4

Dewey Class. No.: 658.57

Optimal search for moving targets
LDR:02594nam a2200337 a 4500 001 863433
003 DE-He213
005 20160929172923.0
006 m d
007 cr nn 008maaau
008 170720s2016 gw s 0 eng d
020 $a 9783319268996 $q (electronic bk.)
020 $a 9783319268972 $q (paper)
024 7 $a 10.1007/978-3-319-26899-6 $2 doi
035 $a 978-3-319-26899-6
040 $a GP $c GP
041 0 $a eng
050 4 $a HD30.4
072 7 $a KJT $2 bicssc
072 7 $a KJMD $2 bicssc
072 7 $a BUS049000 $2 bisacsh
082 0 4 $a 658.57 $2 23
090 $a HD30.4 $b .S878 2016
100 1 $a Stone, Lawrence D. $3 1107470
245 1 0 $a Optimal search for moving targets $h [electronic resource] / $c by Lawrence D. Stone, Johannes O. Royset, Alan R. Washburn.
260 $a Cham : $c 2016. $b Springer International Publishing : $b Imprint: Springer,
300 $a xiv, 211 p. : $b ill., digital ; $c 24 cm.
490 1 $a International series in operations research & management science, $x 0884-8289 ; $v 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 Industrial management $x Research. $3 643817
650 0 $a Production management $x Research. $3 1107473
650 0 $a Operations research. $3 573517
650 0 $a Search theory. $3 672101
650 1 4 $a Business and Management. $2 eflch $3 934826
650 2 4 $a Operation Research/Decision Theory. $3 881408
650 2 4 $a Operations Research, Management Science. $3 785065
650 2 4 $a Market Research/Competitive Intelligence. $3 1069050
700 1 $a Royset, Johannes O. $3 1107471
700 1 $a Washburn, Alan R. $3 1107472
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer eBooks
830 0 $a International series in operations research & management science ; $v 106. $3 744236
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-26899-6
950 $a Business and Management (Springer-41169)