Discrete Search with Directional Information
An unknown number N of cells are arranged in numerical order and an object is hidden in cell N. A searcher would like to maximize the probability of finding the object within n searches. A search in location i gives the information: \(N>i\), \(N=i\), or \(N<i\). However, there is a probability w of a wrong information which indicates \(i>N\) even though \(N>i\) or \(N=i.\) The authors consider several special cases and characterize the optimal search strategies when there are at most two cells and also when \(w=0\). They compare experimentally three intuitively reasonable strategies in the case that the object is hidden with equal probabilities in one of m cells.
- Operations research applications of dichotomous search
- Finding a hider by an unknown deadline
- A problem of minimax estimation with directional information
- A competitive search game with a moving target
- Search for an immobile hider on a stochastic network
- Designing repetitive screening procedures with imperfect inspections: an empirical Bayes approach
- Finding Mobile Data: Efficiency vs. Location Inaccuracy
- A whereabouts guess problem with imperfect information
- Discrete search with multiple sensors
This page was built for publication: Discrete Search with Directional Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4724423)