Set-Valued Numerical Analysis for Optimal Control and Differential Games

Cardaliaguet, Pierre; Quincampoix, Marc; Saint-Pierre, Patrick

doi:10.1007/978-1-4612-1592-9_4

Cited by 180 publications

(244 citation statements)

References 34 publications

Supporting

Mentioning

238

Contrasting

Unclassified

Order By: Relevance

“…In papers [8,9], P. Cardaliaguet, M. Quincampoix, and P. Saint-Pierre have considered an "acoustic" variant of the homicidal chauffeur problem suggested by Pierre Bernhard [4]. It is supposed that the constraint ν on the control of player E depends on the state (x, y).…”

Section: Acoustic Version Of the Homicidal Chauffeur Gamementioning

confidence: 99%

Homicidal Chauffeur Game: History and Modern Studies

Patsko¹,

Turova²

2010

Annals of the International Society of Dynamic Games

View full text Add to dashboard Cite

Section: Acoustic Version Of the Homicidal Chauffeur Gamementioning

confidence: 99%

Homicidal Chauffeur Game: History and Modern Studies

Patsko¹,

Turova²

2010

Annals of the International Society of Dynamic Games

View full text Add to dashboard Cite

“…There is a large body of literature on approximation methods in viability theory such as that by Aubin and Frankowska [4] and Cardaliaguet et al [5]. Approximation methods based on ellipsoidal techniques have been considered by Kurzhanski and Varaiya [17], [18].…”

Section: Introductionmentioning

confidence: 99%

Optimal Semicomputable Approximations to Reachable and Invariant Sets

Collins

2007

Theory Comput Syst

View full text Add to dashboard Cite

Abstract. In this paper we consider the computation of reachable, viable and invariant sets for discrete-time systems. We use the framework of type-two effectivity, in which computations are performed by Turing machines with infinite input and output tapes, with the representations of computable topology. We see that the reachable set is lower-semicomputable, and the viability and invariance kernels are uppersemicomputable. We then define an upper-semicomputable over-approximation to the reachable set, and lower-semicomputable under-approximations to the viability and invariance kernels, and show that these approximations are optimal.

show abstract

“…Moreover, we propose to compare this way of doing to other approaches (algorithms) which address the problem of computing, approaching or over approximating reachable sets with non linear kinematics (level set methods [10], victory domains from viability theory [5]). In a general manner, we would like to consider other approaches dedicated to suboptimal multi player strategies : reflection of forward reachable sets [9], minimization / maximization of the growth of particular level set functions ( [13], [14]), LQ approach with evader terminal constrains and specific guidance law (Proportional Navigation) for the pursuers [2].…”

mentioning

confidence: 99%

Linear Differential Game with Two Pursuers and One Evader

Ménec

2010

Annals of the International Society of Dynamic Games

View full text Add to dashboard Cite

The purpose of this paper is to compute two on one differential game No Escape Zones (NEZ) [8]. The main objective (over the scope of this paper) consists in designing suboptimal strategies in many on many engagements. 1x1 NEZ and 2x1 NEZ are components involved in suboptimal approaches we propose (i.e. "Moving Horizon Hierarchical Decomposition Algorithm" [6]). Several specific two pursuers one evader differential games have been already studied ([4], [7]). Nevertheless, we propose to compute 2x1 NEZ from 1x1 DGL/1 NEZ because DGL models are games with well defined analytical solutions [12].We consider head on scenarios with two pursuers (P1 and P2) and one evader (E). First we summarize results about one on one pursuit evasion game using DGL/1 models. DGL/1 differential games are co planar interceptions with constant velocities, bounded controls assuming small motion variations around the collision course triangle. Under this assumption the kinematics are linear. Each player is represented as a first order system (time lag constant). The criterion is the terminal miss distance (terminal cost only, absolute value of the terminal miss perpendicular to the initial Line Of Sight, LOS). DGL/1 are fixed time duration differential games, with final time defined by the closing velocity (assumed constant) and the initial pursuer evader range. The terminal projection procedure [3] allows to reduce the initial four dimension state vector representation to a scalar representation and to represent the optimal trajectories in the ZEM (Zero Effort Miss), Tgo (Time to Go) coordinate frame. The (ZEM, Tgo) frame is divided into two regions, the regular area and the singular one. For some appropriated differential game parameters (pursuer to evader maximum acceleration ratio μ and evader to pursuer time lag ratio ε), the singular area plays the role of capture zone so called also NEZ (leading to zero terminal miss), whilst the regular area corresponds to the non capture zone. The NEZ can be bounded (closed) or unbounded (open). The natural optimal strategies are bang-bang controls corresponding to the sign of ZEM (some refinements exist when defining optimal controls inside the NEZ). We start the 2x1 DGL/1 analysis with unbounded 1x1 NEZ as pictured in Figure 1 (NEZ delimited by the two plain red lines, non capture zone corresponding to the state space filled with optimal trajectories in dot blue lines). Moreover, we first assume same Tgo in each DGL/1 game (same initial range, same velocity for each pursuer).

show abstract

Set-Valued Numerical Analysis for Optimal Control and Differential Games

Cited by 180 publications

References 34 publications

Homicidal Chauffeur Game: History and Modern Studies

Homicidal Chauffeur Game: History and Modern Studies

Optimal Semicomputable Approximations to Reachable and Invariant Sets

Linear Differential Game with Two Pursuers and One Evader

Contact Info

Product

Resources

About