Dynamic programming methods for modelling the target distribution matrix in pursuit tasks

Abstract

In this paper we consider modelling a matrix describing the process of group pursuit for a set of goals. The matrix reflects the number of opposing parties, namely the number of pursuers and the number of goals. Each cell of such matrix is a structured variable, which contains information about predicted time of jthtarget achievement by ithpursuer. From the finite set of pursuers distribution by aims, the one which provides minimal value of criterion among permissible values of times of achievement of aims by pursuers, is chosen. The admissible criteria are the maximal time of pursuers' achievement of goals for each distribution of pursuers according to the goals.