This paper studies a bounded discriminating domain for hybrid linear differential game with two players and two targets using viability theory. First of all, we prove that the convex hull of a closed set is also a dis...This paper studies a bounded discriminating domain for hybrid linear differential game with two players and two targets using viability theory. First of all, we prove that the convex hull of a closed set is also a discriminating domain if the set is a discriminating domain. Secondly, in order to determine that a bounded polyhedron is a discriminating domain, we give a result that it only needs to verify that the extreme points of the polyhedron meet the viability conditions. The difference between our result and the existing ones is that our result just needs to verify the finite points （extreme points） and the existing ones need to verify all points in the bounded polyhedron.展开更多
基金supported by National Science Foundation of China(11171221)Doctoral Program Foundation of Institutions of Higher Education of China(20123120110004)+2 种基金Natural Science Foundation of Shanghai(14ZR1429200)Innovation Program of Shanghai Municipal Education Commission(15ZZ073)Key Research Project Plan of Institutions of Higher of Henan Province(17A120010)
文摘This paper studies a bounded discriminating domain for hybrid linear differential game with two players and two targets using viability theory. First of all, we prove that the convex hull of a closed set is also a discriminating domain if the set is a discriminating domain. Secondly, in order to determine that a bounded polyhedron is a discriminating domain, we give a result that it only needs to verify that the extreme points of the polyhedron meet the viability conditions. The difference between our result and the existing ones is that our result just needs to verify the finite points （extreme points） and the existing ones need to verify all points in the bounded polyhedron.
