Find in Library

In this paper, we study pursuit and evasion differential game problems of one pursuer/one evader and many pursuers/one evader, respectively, in the space <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msup><mi mathvariant="double-struck">R</mi><mi>n</mi></msup></semantics></math></inline-formula>. In both problems, we obtain sufficient conditions that guarantee the completion of a pursuit and an evasion. We construct the players’ optimal strategies in both problems, and we estimate the possible distance that an evader can preserve from pursuers. Lastly, we illustrate our results via some numerical examples.