2005
DOI: 10.1070/sm2005v196n04abeh000890
|View full text |Cite
|
Sign up to set email alerts
|

Construction of solutions in certain differential games with phase constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
6
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(6 citation statements)
references
References 0 publications
0
6
0
Order By: Relevance
“…Since about fifteen years, several groups are working on appropriate numerical methods (see e.g. [17,18,19,20,21]), but only few three-dimensional problems are solved numerically. The following example deals with a very famous unsolved problem.…”
Section: Examplementioning
confidence: 99%
“…Since about fifteen years, several groups are working on appropriate numerical methods (see e.g. [17,18,19,20,21]), but only few three-dimensional problems are solved numerically. The following example deals with a very famous unsolved problem.…”
Section: Examplementioning
confidence: 99%
“…Backward procedures for the construction of the solvability sets at given time and by given time are intensively developed (Grigor'eva et al, 2005), (Mikhalev & Ushakov, 2007) for control problems and differential games. Elements of the backward constructions are included in one or another form (Sethian, 1999), (Cristiani & Falcone, 2009) into grid methods for solving differential games.…”
Section: Backward Procedures For Construction Of Solvability Setsmentioning
confidence: 99%
“…Different approaches for computing the reachable sets, including those for systems with state constraints, are presented in [14,17,16,6,13,1,3,11,7,8]. The method of removing state constraints in the construction of reachable sets for differential inclusions was proposed in [12], where the tube of trajectories of the differential inclusion with convex state constraint was approximated by the solutions of a family of differential inclusions without constraints depending on a matrix "penalty" parameter.…”
mentioning
confidence: 99%
“…Consider the solution x ε (t) of system (6) corresponding to the control u(·) ∈ U. Since f ε (x, u) is a convex combination of the vectors f (x, u) and f (x,ū(x)) belonging to the convex set f (x, U ), we see thatẋ ε (t) ∈ f (x ε (t), U ) a.e.…”
mentioning
confidence: 99%