Multiple Capture in a Group Pursuit Problem with Fractional Derivatives

In a finite-dimensional Euclidean space, we consider a problem of pursuing one evader by a group of pursuers with equal capabilities of all participants. The dynamics of the problem is described by the system D(α)zi=azi+ui−v,ui,v∈V,\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D^{(\alpha)}z_i=az_i+u_i-v,\;\;\;u_i,v\in{V},$$\end{document} where D(α)f is the Caputo derivative of order α ∈ (1, 2) of a function f. The set of admissible controls V is compact and strictly convex, and a is a real number. The aim of the group of pursuers is to catch the evader by at least m different pursuers, possibly at different times. The terminal sets are the origin. The pursuers use quasi-strategies. We obtain sufficient conditions for the solvability of the pursuit problem in terms of the initial positions. The investigation is based on the method of resolving functions, which allows us to obtain sufficient conditions for the termination of the approach problem in some guaranteed time.