An examination is made of a linear antagonistic differential game between two persons with a fixed instant of termination. The controls of the players are assumed to be scalar. The purpose of the first player is to bring three specified coordinates of the phase vector to a closed convex bounded set, and the interests of the second player are opposite to this. An algorithm for numerical construction of the set of all initial positions from which the problem can be solved by the first player is described. Examples of computer calculations are included.
zarkhpatsko1988.pdf (1656 KB).
Zarkh M.A., Patsko V.S. Numerical Solution of a Third-Order Directed Game // Soviet J. Comput. Syst. 26 (4), 1988. P. 92–99.
Patsko sector homepage