SOME ALGORITHMS FOR DIFFERENTIAL-GAMES WITH 2 PLAYERS AND ONE TARGET

被引：12

作者：

CARDALIAGUET, P ^{[1
]}

QUINCAMPOIX, M ^{[1
]}

SAINTPIERRE, P ^{[1
]}

机构：

[1] UNIV TOURS, DEPT MATH, F-37200 TOURS, FRANCE

来源：

ESAIM-MATHEMATICAL MODELLING AND NUMERICAL ANALYSIS-MODELISATION MATHEMATIQUE ET ANALYSE NUMERIQUE | 1994年 / 28卷 / 04期

关键词：

D O I：

10.1051/m2an/1994280404411

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We provide algorithms finding victory domains of a differential game with two players and one target. For doing this we do not need to compute trajectories of the game. We present two kinds of algorithms. The algorithms in continuous case give the victory set as a limit of an suitable decreasing sequence of closed sets. The algorithms in discrete cases give discrete sets approximating the victory domain. In the two cases, we prove convergence results.

引用

页码：441 / 461

页数：21

共 22 条

[1]

Aubin J.P., 1992, VIABILITY THEORY

[2]

AUBIN JP, 1989, LECTURE NOTES CONTRO, V121, P337

[3]

AUBIN JP, 1991, SET VALUED ANAL

[4]

BERNHARD P, 1979, THESIS PARIS 6

[5]

BERNHARD P, 1989, ETUDE BARRIERE UN PR

[6]

CARDALIAGUET P, UNPUB DISCRIMINATING

[7]

CARDALIAGUET P, UNPUB TARGET PROBLEM

[8] SOME PROPERTIES OF VISCOSITY SOLUTIONS OF HAMILTON-JACOBI EQUATIONS [J].

CRANDALL, MG ;

EVANS, LC ;

LIONS, PL .

TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1984, 282 (02) :487-502

[9]

ELLIOTT R., 1972, MEM AM MATH SOC, V126

[10]

FRANKOWSKA H, 1992, INT SERIES NUMERICAL, V107

← 1 2 3 →