A Model of Automated Allocation in the Task of Group Pursuit with Defenders

This paper considers a computer model of a quasi-discrete group pursuit game with pursuers, targets, and defenders. In the model proposed in the paper, the task of the pursuers is to achieve static targets. It is possible for multiple pursuers to achieve one target at different times. The task of the defenders is to defeat the pursuers. A win for the pursuers can be defined as at least one of the pursuers reaching their target. A win for the defenders can be the defeat of all targets. For the defenders the number of pursuers is not definite. In the model, a single environment of pursuer detection is formed. A pursuer is considered detected if it enters the given area. The assignment of a target defender to a detected pursuer is performed according to several optimization criteria. The defender can be assigned from the estimated time to reach. In one implementation of the model, this is the minimum time from the sample for a given defender. As a variant of the optimization factor, the defender for a pursuer can be selected based on the minimum distance to the pursuer. The paper also considers variants of defender localizations at a single point. #CSOC1120.