Discrete Search on the Circle.
NAVAL WEAPONS CENTER CHINA LAKE CALIF
Pagination or Media Count:
A finite number N of locations are equally spaced around the circumference of a circle. During each time interval of unit length a target and a searcher move simultaneously and independently among these locations. Each is allowed to move one unit counterclockwise, to stay where he is, or to move one unit clockwise. The motion of each is governed by a triple of probabilities invariant with respect to time. Between moves the searcher attempts to detect whether the target occupies the same location he does, with a constant detection probability and with false alarm probability zero. Given the triple governing the targets motion, the problem investigated is to determine the searchers triple so as to minimize the expected length of time until detection.
- Operations Research