Abstract:

This paper studies a bounded discriminating domain for linear pursuit-evasion differential games using viability theory. Researching a bounded polyhedron who is a convex hull of finite points for the discriminating domain of linear differential games by viability theory, we just need to test whether the extreme points of the polyhedron meet the viability conditions. Then, using the relationship between viability and discriminating domain, we can determine whether the polyhedron is the discriminating domain of the differential games. It is easy to be used.

Key words: differential games, viability theory, discriminating domain, nonsmooth analysis