Open AccessTechnical Note—Threshold Probabilities when Searching for a Moving Target
Author(s) -
Paul J. Schweitzer
Publication year - 1971
Publication title -
operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.797
H-Index - 140
eISSN - 1526-5463
pISSN - 0030-364X
DOI - 10.1287/opre.19.3.707
Subject(s) - markov chain , simple (philosophy) , pollock , computer science , state (computer science) , mathematics , mathematical optimization , algorithm , statistics , philosophy , epistemology , fishery , biology
Pollock has examined a model of search for a target whose transitions between two regions are described by a two-state stationary Markov chain. The minimum-search policy is characterized by a threshold probability π* that determines which region to search next. This note presents a simple recursive procedure for calculating π*.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom