Linear evasion differential game of one evader and several pursuers with integral constraints

Abstract

Abstract An evasion differential game of one evader and many pursuers is studied. The dynamics of state variables $$x_1,\ldots , x_m$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>x</mml:mi> <mml:mn>1</mml:mn> </mml:msub> <mml:mo>,</mml:mo> <mml:mo>…</mml:mo> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>x</mml:mi> <mml:mi>m</mml:mi> </mml:msub> </mml:mrow> </mml:math> are described by linear differential equations. The control functions of players are subjected to integral constraints. If $$x_i(t) \ne 0$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msub> <mml:mi>x</mml:mi> <mml:mi>i</mml:mi> </mml:msub> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>t</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> <mml:mo>≠</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> </mml:math> for all $$i \in \{1,\ldots ,m\}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>i</mml:mi> <mml:mo>∈</mml:mo> <mml:mo>{</mml:mo> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mo>…</mml:mo> <mml:mo>,</mml:mo> <mml:mi>m</mml:mi> <mml:mo>}</mml:mo> </mml:mrow> </mml:math> and $$t \ge 0$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>t</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> </mml:math> , then we say that evasion is possible. It is assumed that the total energy of pursuers doesn’t exceed the energy of evader. We construct an evasion strategy and prove that for any positive integer m evasion is possible.