This article describes the pursuit model by the method of chasing a group of objects. All objects participating in the pursuit model move at a constant modulo velocity. The pursuing object moves along a certain trajectory and releases objects at specified intervals, whose task is to overtake the target by the chase method. A single target, in turn, is tasked to overtake the pursuer by the method of parallel convergence. A detection area is formed for each pursuing object. The detection area is formed by two beams. The velocity vector of an object is the bisector of the angle formed by such rays. If the target is in the detection area, then the object begins the pursuit by the chase method. If the target leaves the detection area, then the object makes a uniform and rectilinear movement. The task is to implement a dynamic model of multiple group pursuing, where each object has its own tasks, its own strategies. The model is developed using computer mathematics systems. According to the results of the research, animated images were created. Targeting methods such as the chase method, the parallel approach method and the proportional approach method are widely used in military affairs. But they, for the most part, require external control, such as pointing the target with a laser beam or satellite guidance to the target. There is no description of methods of targeting in offline mode in open sources of information. The research results may be in demand when designing unmanned aerial vehicles with elements of autonomous control and artificial intelligence.

The article considers the kinematic model of pursuit, transferred from plane to surface, by the method of parallel approach. Simulation of iterative pursuit processes is a topical continuation of autonomous unmanned vehicles. The aim of the article is to develop a model in which the trajectory of the pursuer is the result of following the predicted routes at each discrete moment in time. The research was carried out in the computer mathematics system Math CAD on a surface defined by a point basis. Situations with different initial states were simulated. Detailed results in the form of animated images based on materials, program codes can be found on the authors’ website and channel.

This article considers a kinematic, geometric model of the pursuit problem on a plane by the chase method, where the pursuer cannot instantly change the direction of movement, while moving at a constant modulo speed. The initial speed of the pursuer is not directed at the target when the pursuit begins. In order for the speed vector of the pursuer to be directed at the target after some time, we have developed a method that is based on following the trajectory that connects the pursuer and the target. This trajectory takes into account the inertia of the pursuer in the sense that the radius of curvature of the trajectory is not less than a certain threshold value. Based on the materials of this article, test programs were written and an animated image was made.

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 jth target achievement by ith pursuer. 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.

No abstract