The paper investigates a differential game of simple pursuit, when the controls of two opposing players are subject to integral constraints of a generalized type. The generalization of the proposed restriction lies in the fact that it includes previously known restrictions such as integral, geometric, linear, exponential and their mixtures. In general, it includes 25 types of pursuit problems with such different types of constraints. To solve the pursuit problem under such generalized constraints, we propose a parallel pursuit strategy ($\Pi$-strategy for short) and find sufficient conditions for the solvability of this problem. At the end of the article, tables are provided that list each particular type of game, the conditions for its solvability, the resolving function (which determines the corresponding $\Pi$-strategy), and the time of capture.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.