Computation of solvability set for differential games in the plane with simple motion and non-convex terminal set

摘要

The paper suggests an algorithm for an exact construction of solvability set in a differential game with simple motion in the plane, with a fixed terminal time and a polygonal (in the general case, non-convex) terminal set. Some examples of solvability sets are computed.