A linear group pursuit problem with fractional derivatives and different player capabilities

In a finite-dimensional Euclidean space, the problem of pursuit of one evader by a group of pursuers is considered, described by a system of the form D-(alpha) x(i) = a(i)x(i) + u(i), u(i) is an element of U-i, D-(alpha) y = ay + v, v is an element of V, where D((alpha))f is the Caputo derivative of order alpha is an element of (1, 2) of the function f. Sets of admissible controls U-i, V are convex compacts, a(i), a are real numbers. Terminal sets are convex compacts. Sufficient conditions for the solvability of the problems of pursuit and evasion are obtained. In the study, the method of resolving functions is used as the basic one.