Automated Distribution of Defenders in an Antagonistic Group Game

This article examines a computer model of a quasi-discrete group pursuit game. In which there are pursuers, goals and defenders. In the article's model, the task of the pursuers is to achieve static goals. Achieving one goal is possible by several pursuers at different times. The task of the defenders is to defeat the pursuers. A win for the pursuers can be considered the achievement of at least one of the pursuers of their goal. The defeat of all targets can be considered a win for the defenders. For defenders, the number of pursuers is not certain. In the model of the article, a unified environment for detecting pursuers is formed. The pursuer is considered detected if it enters this area. The assignment of a target defender to the detected pursuer is carried out according to several optimization criteria. The defender may be appointed from the estimated time of achievement. 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 the pursuer can be selected by the minimum distance to him. The article also discusses options for localizing defenders at one point.