{'fraction_non_alphanumeric': 0.024208566108007448, 'fraction_numerical': 0.00186219739292365, 'mean_word_length': 4.779569892473118, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Capture of two coordinated evaders in a problem with fractional derivatives, phase restrictions and a simple matrix

In the finite-dimensional Euclidean space, a task of pursuing two evaders by a group of pursuers is considered, described by a system of the form D(α)zij=azij+ui−v, where D(α)f is the Caputo fractional derivative of order α∈(0,1) of the function f, and a is a real number. It is assumed that all evaders use the same control and that the evaders do not leave a convex cone with vertex at the origin. The aim of the group of pursuers is to capture two evaders. The pursuers use program counterstrategies based on information about the initial positions and the control history of the evaders. The set of admissible controls is a unit ball centered at zero, the target sets are the origins. In terms of initial positions and game parameters, sufficient conditions for the capture are obtained. Using the method of resolving functions as a basic research tool, we derive sufficient conditions for the solvability of the approach problem in some guaranteed time