Relaxation of pursuit-evasion differential game and program absorption operator

Abstract

We consider some natural relaxation of pursuit-evasion differential game. For two closed sets, which are parameters, similar guidance problem for ε-neighborhoods is being solved. We are interested in finding a minimal size of such neighborhoods, which allows player I successfully solve his guidance problem in the class of generalized non-anticipating strategies. To resolve above-mentioned differential game, a modification of Program Iterations Method is implemented. Size of the neighborhoods is found as a position function and it's defined by application of special iterative procedure further below. As a corollary, it is shown that desired function is a fixed point of the open-loop operator, which defines the procedure. © 2020 Udmurt State University. All rights reserved.