中文

Operations Research Transactions >

2016 , Vol. 20 >Issue 1: 105 - 111

DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2016.01.010

Determining the discriminating domain for linear differential games based on viability theory

Expand
  • 1. Business School, University of Shanghai for Science and Technology, Shanghai 200093, China; 2.  School of Mathematics and Information Science, Henan Polytechnic University, Jiaozuo 454003, Henan, China

Received date: 2015-04-02

  Online published: 2016-03-15

Fold

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

Cite this article

HAN Yanli, GAO Yan . Determining the discriminating domain for linear differential games based on viability theory[J]. Operations Research Transactions, 2016 , 20(1) : 105 -111 . DOI: 10.15960/j.cnki.issn.1007-6093.2016.01.010

References

[1] Krasovskii N N, Subbotin A I. Game Theoretical Control Problems [M]. New York: Springer-Verlag, 1988.
[2] Krasovskii N N, Subbotin A I. Universal optimal strategies in positional differential games [J]. Differential Equation, 1984, 19(11): 1377-1382.
[3] Cardallaguet P. Differential game with two players and one target [J]. SIAM Journal on Control and Optimization, 1996, 34(4): 1441-1460.
[4] Cardallaguet P, Quincampoix M, Saint-pierre P. Some algorithms for differential game with two-players and one target [J]. Mathematical Modeling and Numerical Analysis, 1994, 28(4): 441-461.
[5] Cardallaguet P, Quincampoix M, Saint-pierre P. Pursuit differential games with state constraints [J]. SIAM Journal on Control and Optimization, 2002, 39(5): 1615-1632.
[6] Gao Y, Lggeros J, Quincampoix M. On the reachability problem of uncertain hybrid systems [J]. IEEE Transactions on Automatic Control, 2007, 52(9): 1572-1586.
[7] 张霞, 高岩, 夏尊铨. 追捕逃逸型微分对策问题的识别域判别 [J]. 上海理工大学学报, 2012, 34(5): 452-455.
[8] Nikolai B, Varvara T. Numerical construction of viable sets for autonomous conflict control systems [J]. Mathematics, 2014, 2(2): 68-82.
[9] Aubin J P. Viability Theory [M]. Boston: Birkhauser, 1991.
[10] 俞建. $\displaystyle\sup\limits_{{x\in X}}\displaystyle\inf\limits_{_{y\in Y}}f(x,y)=\displaystyle\inf\limits_{_{y\in Y}}\displaystyle\sup\limits_{{x\in X}}f(x,y)$的充分必要条件 [J]. 贵州工学院学报, 1996, 25(5): 1-2.
Options
Outlines

/

〈 〉