On Exact Construction of Solvability Set for Differential Games with Simple Motion and Non-convex Terminal Set

Two-player zero-sum differential games with simple motion in the plane are considered. An explicit formula describing the solvability set is well-known for a convex terminal set. The paper suggests a way of exact construction of solvability set in the case of non-convex polygonal terminal set and polygonal constraints of the players’ controls. Some illustrative examples are computed.