• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Optimal Search for Moving Targets

Optimal Search for Moving Targets

Paperback

Series: International Operations Research & Management Science, Book 237

Business GeneralMarketingProbability & Statistics

ISBN10: 3319800388
ISBN13: 9783319800387
Publisher: Springer Nature
Published: Apr 24 2018
Pages: 211
Weight: 0.72
Height: 0.48 Width: 6.14 Depth: 9.21
Language: English

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.

1 different editions

Also available

Also in

Marketing