A direct method of solution of linear differential pursuit-evasion games (Q1065733)

The author considers a pursuit-evasion differential game described by the equation \(\dot z=A(t)z-u+v\), \(z(t_ 0)=z_ 0\), \(z\in {\mathbb{R}}^ p\). Player v's strategies are measurable functions \(v(t)\in V(t)\subset {\mathbb{R}}^ p\) depending on time only, whereas player u's strategies are functions u(t,\(\{v(s)| s\in [t_ 0,t]\})=\tilde u(t)\in U(t)\subset {\mathbb{R}}^ p\). Player u tries to make the point z encounter a terminal set M; player v's aim is contrary. A sufficient condition for the evasion to be completed is obtained. An example is given.