Estimation of the efficiency of algorithms of radar observation with controlled and cycle surveillance order

Attention is given to the problem of detecting targets appearing in a surveillance zone at random moments of time. Mathematical modeling shows that, in the case of a low-intensity target stream, the algorithm with a cyclic surveillance order in combination with a sequential decision rule provides for (given the optimal choice of the lower threshold) practically the same mean detection time for each target as the algorithm involving control of the surveillance order according to the maximum a posteriori probability.