A game problem of group search for an evader

In a problem of optimizing the probability of detecting one evader by a group of controlled objects within a finite time interval the search is studied with and without data exchange in the group and optimality conditions are provided for choice of controls with a priori availability of data. A technique is described of optimizing secrete search and of recognizing the detection radius as a function of the players' speeds. The importance of data exchange in the group is illustrated with a plain mode example.