Optimal search using two nonconcurrent sensors

Search for a stationary target is considered for a situation in which two sensors are available, but cannot be used simultaneously. The cost (in time) of switching from one sensor to the other is ignored, and each sensor is assumed to have perfect discrimination. For a specified class of searches an optimal allocation of search effort is obtained. In the case of a circular normal prior target location distribution, an example is presented in which one sensor is assumed to have a fixed sweep width and the other a stochastic sweep width. An optimal plan is found for this example. This plan produces an allocation of search effort which is expended in a disk by one sensor and in a bounding annulus by the other.