DIFFERENTIAL GAME WITH A LIFELINE FOR THE INERTIAL MOVEMENTS OF PLAYERS

In this paper, we study the well-known problem of Isaacs called the "Life line" game when movements of players occur by acceleration vectors, that is, by inertia in Euclidean space. To solve this problem, we investigate the dynamics of the attainability domain of an evader through finding solvability conditions of the pursuit-evasion problems in favor of a pursuer or an evader. Here a pursuit problem is solved by a parallel pursuit strategy. To solve an evasion problem, we propose a strategy for the evader and show that the evasion is possible from given initial positions of players. Note that this work develops and continues studies of Isaacs, Petrosjan, Pshenichnii, Azamov, and others performed for the case of players' movements without inertia.

An Extended Reweighted ℓ1 Minimization Algorithm for Image Restoration

This paper proposes an effective extended reweighted ℓ1 minimization algorithm (ERMA) to solve the basis pursuit problem minu∈Rnu1:Au=f in compressed sensing, where A∈Rm×n, m≪n. The fast algorithm is based on linearized Bregman iteration with soft thresholding operator and generalized inverse iteration. At the same time, it also combines the iterative reweighted strategy that is used to solve minu∈Rnupp:Au=f problem, with the weight ωiu,p=ε+ui2p/2−1. Numerical experiments show that this l1 minimization persistently performs better than other methods. Especially when p=0, the restored signal by the algorithm has the highest signal to noise ratio. Additionally, this approach has no effect on workload or calculation time when matrix A is ill-conditioned.

Geometric models of the run method

This article discusses models of the run method in the pursuit problem. The considered models are based on the correction of the direction vector. Let’s assume that the intended direction on a plane is the line of sight between the pursuer and the target. The direction correction consists in the rotation of the velocity vector until it coincides with the line of sight. When constructing trajectories on the surface, a line of sight is built on the horizontal projection plane. After calculating horizontal projections, all points are projected back onto the surface. On the basis of the research carried out proposed a mathematical model, proposed mathematical models of the method of pursuit on a plane and on a surface given in an explicit form. Mathematical models are the development of chase and parallel approach methods. A modification of these methods is that the speed of the pursuer and the target are directed at random. These models can be in demand by developers of autonomous unmanned vehicles equipped with artificial intelligence systems.

Leader-Following Multi-Agent Coordination Control Accompanied With Hierarchical Q(λ)-Learning for Pursuit

In this paper, we investigate a pursuit problem with multi-pursuer and single evader in a two-dimensional grid space with obstacles. Taking a different approach to previous studies, this paper aims to address a pursuit problem in which only some pursuers can directly access the evader’s position. It also proposes using a hierarchical Q(λ)-learning with improved reward, with simulation results indicating that the proposed method outperforms Q-learning.

Mathematical Modeling and Functional Order Pursuits with Separated Dynamics

This work is devoted to the study of the pursuit problem in controlled systems described by a fractional-order equation with divided dynamics. For fixed player controls, representations of solutions are established in the form of analogs of the Cauchy formula using generalized matrix functions. Sufficient conditions are obtained for the possibility of completing the pursuit. Specific types of fractional differential equations and models of fractional dynamical systems are considered. The qualitative dynamics, issues of stability and controllability of such systems are discussed. Considered, try which, the motion of the equation is described with irrational orders. Problems of the type under study are encountered in modeling the processes of economic growth and in problems of stabilizing dynamic systems.

Research on the Multi-Robot Cooperative Pursuit Strategy Based on the Zero-Sum Game and Surrounding Points Adjustment

Making full use of the cooperation of multi-robots can improve the success rate of apursuit task. Therefore, this paper proposes a multi-robot cooperative pursuit strategy based on the zero-sum game and surrounding points adjustment. First, a mathematical description of the multi-robot pursuit problem is constructed, and the zero-sum game model is established considering the cooperation of the pursuit robots and the confrontation between the pursuit robots and the escape robot. By solving the game model, the optimal movement strategies of the pursuit robots and the escape robot are obtained. Then, the position adjustment method of the pursuit robots is studied based on the Hungarian algorithm, and the pursuit robots are controlled to surround the escape robot. Based on this, a multi-robot cooperative pursuit strategy is proposed that divides the pursuit process into two stages: pursuit robot position adjustment and game pursuit. Finally, the correctness and effectiveness of the multi-robot cooperative pursuit strategy are verified with simulation experiments. The multi-robot cooperative pursuit strategy allows the pursuit robots to capture the escape robot successfully without conflicts among the pursuit robots. It can be seen from the documented simulation experiments that the success rate of the pursuit task using the strategy proposed in this paper is 100%.

GEOMETRIC MODELS OF THE CHASE METHOD ON THE PLANE AND ON THE SURFACE DELIVERY

In this article models of the pursuit method in the pursuit problem. The considered models are based on the correction of the vector of the direction of motion. Suppose, on a plane, the intended direction is the line of sight of the pursuer and the target. Correction of the direction of movement consists in the rotation of the velocity vector until it coincides with the line of sight. When constructing trajectories on the surface, a line of sight is built on the horizontal projection plane. After calculating horizontal projections, all points are projected back onto the surface. Have been developed models for calculating the trajectories of the pursuer and the target in the problem of studying the plane and on the surface. Modifications of the mathematical models of the methods of parallel dropping and chasing were made in relation to the plane and the surface. In our models and algorithms, the speed of the pursuer can be directed arbitrarily. With the modification of the parallel displacement method, the straight line of this movement was replaced by a predicted trajectory of movement at a point in time, which moves to itself. When modifying the chase method, the line of sight was also replaced with a compound curve, taking into account the restrictions on the curvature of the pursuer trajectory. These models can be in demand by developers of autonomous unmanned vehicles equipped with artificial intelligence systems.

Matrix Resolving Function in the Nonstationary Linear Group Pursuit Problem Concepting Multiple Capture

In finite-dimensional Euclidean space, an analysis is made of the problem of pursuit of a single evader by a group of pursuers, which is described by a system of the form [Formula: see text] The goal of the group of pursuers is the capture of the evader by no less than [Formula: see text] different pursuers (the instants of capture may or may not coincide). Matrix resolving functions, which are a generalization of scalar resolving functions, are used as a mathematical basis of this study. Sufficient conditions are obtained for multiple capture of a single evader in the class of quasi-strategies. Examples illustrating the results obtained are given.