Defense Planning for a Moving Target Against Multiple Attackers Using a Defender via the Monte Carlo Tree Search

The problem of protecting a moving target from an attack by multiple pursuing attackers using an interceptor defender is considered. A rigorous mathematical formulation of the problem is presented, quality criteria for defense plans are introduced, and mathematical properties of the problem are formulated. Based on these properties, heuristic rules and algorithms for their application are proposed in order to construct suboptimal solutions.