Approaching a coalition of evaders
This paper studies a very simple model of conflict in which a pursuer approaches a coalition of evaders. The distance between the pursuer and the coalition is defined as the distance to the remotest evader. In the special case of two evaders, the optimal pursuit strategy is derived, as well as the guaranteed distance to the coalition. For the case of more than two evaders, an upper bound of this distance, which corresponds to a programmed method of selection of a pair of evaders being approached, is obtained.
scientific article; zbMATH DE number 4016645