國立虎尾科技大學 |

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.
Description:	XIV, 211 p. 46 illus., 11 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Operations research. -
Online resource:	https://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. - 1st ed. 2016. - XIV, 211 p. 46 illus., 11 illus. in color.online resource. - International Series in Operations Research & Management Science,2370884-8289 ;. - International Series in Operations Research & Management Science,227.

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:

573517
Operations research.

LC Class. No.: HD30.23

Dewey Class. No.: 658.40301

Optimal Search for Moving Targets
LDR:03023nam a22004215i 4500 001 971091
003 DE-He213
005 20200706175612.0
007 cr nn 008mamaa
008 201211s2016 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
035 $a 978-3-319-26899-6
050 4 $a HD30.23
072 7 $a KJT $2 bicssc
072 7 $a BUS049000 $2 bisacsh
072 7 $a KJT $2 thema
072 7 $a KJMD $2 thema
082 0 4 $a 658.40301 $2 23
100 1 $a Stone, Lawrence D. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $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.
250 $a 1st ed. 2016.
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 Operations research. $3 573517
650 0 $a Decision making. $3 528319
650 0 $a Management science. $3 719678
650 0 $a Market research. $2 bicssc $3 809436
650 1 4 $a Operations Research/Decision Theory. $3 669176
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. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1107471
700 1 $a Washburn, Alan R. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1107472
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319268972
776 0 8 $i Printed edition: $z 9783319268989
776 0 8 $i Printed edition: $z 9783319800387
830 0 $a International Series in Operations Research & Management Science, $x 0884-8289 ; $v 227 $3 1254441
856 4 0 $u https://doi.org/10.1007/978-3-319-26899-6
912 $a ZDB-2-BUM
912 $a ZDB-2-SXBM
950 $a Business and Management (SpringerNature-41169)
950 $a Business and Management (R0) (SpringerNature-43719)