RT Journal Article ID 1b926b63388ea9ae A1 Rappoport, Iosif S. T1 Method of Resolving Functions in the Group Pursuit Problem with a Terminal Pay Off Function and Integral Constraints on Controls JF Journal of Automation and Information Sciences JO JAI(S) YR 2019 FD 2019-07-19 VO 51 IS 4 SP 24 OP 42 K1 linear differential game K1 terminal pay off function K1 integral constraints K1 multi-valued mapping K1 measurable selector K1 stroboscopic strategy K1 group approach AB A method is proposed for solving game dynamics problems with a terminal pay off function and integral constraints on controls which consists in systematical using the ideas of Fenhel−Moreau as applied to the general scheme of resolving functions method. The essence of the proposed method lies in the fact that the resolving function can be expressed in terms of the function conjugate to the pay off function and using the involute of the conjugation operator for a convex closed function to obtain a guaranteed estimate of the terminal value of the pay off function which is represented by the paying off value at the initial time instant and the integral of the resolving function. The main feature of the method is the cumulative principle used in the current summation of the resolving function for estimating the game quality until a certain threshold value is reached. The paper considers linear differential games of group pursuit with a terminal pay off function and integral constraints on controls. Sufficient conditions for the game completion in a finite guaranteed time in a class of quasi-strategies are formulated. Two schemes of the resolving functions method are proposed that ensure without additional assumptions the game completion in the final guaranteed time in the class of stroboscopic strategies. The results of comparing the guaranteed times of different schemes of the resolving functions method are presented. PB Begell House LK https://www.dl.begellhouse.com/journals/2b6239406278e43e,5d8c923147c650c2,1b926b63388ea9ae.html