|
Showing 1 - 2 of
2 matches in All Departments
Search Theory is one of the original disciplines within the field
of Operations Research. It deals with the problem faced by a
Searcher who wishes to minimize the time required to find a hidden
object, or "target. " The Searcher chooses a path in the "search
space" and finds the target when he is sufficiently close to it.
Traditionally, the target is assumed to have no motives of its own
regarding when it is found; it is simply stationary and hidden
according to a known distribution (e. g. , oil), or its motion is
determined stochastically by known rules (e. g. , a fox in a
forest). The problems dealt with in this book assume, on the
contrary, that the "target" is an independent player of equal
status to the Searcher, who cares about when he is found. We
consider two possible motives of the target, and divide the book
accordingly. Book I considers the zero-sum game that results when
the target (here called the Hider) does not want to be found. Such
problems have been called Search Games (with the "ze- sum"
qualifier understood). Book II considers the opposite motive of the
target, namely, that he wants to be found. In this case the
Searcher and the Hider can be thought of as a team of agents
(simply called Player I and Player II) with identical aims, and the
coordination problem they jointly face is called the Rendezvous
Search Problem.
Search Theory is one of the original disciplines within the field
of Operations Research. It deals with the problem faced by a
Searcher who wishes to minimize the time required to find a hidden
object, or "target. " The Searcher chooses a path in the "search
space" and finds the target when he is sufficiently close to it.
Traditionally, the target is assumed to have no motives of its own
regarding when it is found; it is simply stationary and hidden
according to a known distribution (e. g. , oil), or its motion is
determined stochastically by known rules (e. g. , a fox in a
forest). The problems dealt with in this book assume, on the
contrary, that the "target" is an independent player of equal
status to the Searcher, who cares about when he is found. We
consider two possible motives of the target, and divide the book
accordingly. Book I considers the zero-sum game that results when
the target (here called the Hider) does not want to be found. Such
problems have been called Search Games (with the "ze- sum"
qualifier understood). Book II considers the opposite motive of the
target, namely, that he wants to be found. In this case the
Searcher and the Hider can be thought of as a team of agents
(simply called Player I and Player II) with identical aims, and the
coordination problem they jointly face is called the Rendezvous
Search Problem.
|
You may like...
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.