Numerical analysis of time discretization of optimal control problems

More documents

Recommendations

Info

Conditions for order 4 bk Table 4: Order 4 Graph Condition Graph Condition 1 alkdkdl = bk 1 ajkdjck = 8 1 24 bi aikcidk = bk 5 biaijcicj = 24 1 8 2 cjdj = 1 bic 12 3 i = 1 4 1 ckd 2 k = 1 1 d 12 3 l = 1 4 Orders 5 to 7: FB & J. Laurent-Varin (2006), making the link to the theory <strong>of</strong> partitioned RK schemes and bicolored rooted trees. b 2 l 43
Conditions for order 5 Table 5: Ordre 5 Graph Condition Graph Condition bi aikaildkcl = bk 3 40 alkakjcjdl = 1 120 bi alkailcidk = bk 11 120 bibj ajkaikcicj = bk 2 15 1 amlalkdkdm = bk 1 30 1 almd blbm 2 ldm = 1 15 1 amld 2 ldm = 1 10 b 2 l biaikaijcjck = 1 20 biaikakjcicj = 1 bi bk bi blbm 1 bk 1 bk bi 30 alkaikcidl = 3 40 aimaildldm = 2 15 amkalkdldm = 1 b 2 l akld 2 k cl = 1 60 ailcid 2 l = 3 20 20 44
Page 1 and 2: Numerical analysis of time discreti
Page 3 and 4: This class of problems is quite lar
Page 5 and 6: The Euler discretization • N: num
Page 7 and 8: The simplest optimal time problem I
Page 9 and 10: Fuller’s problem I (work with J.
Page 11 and 12: Robbins state constrained problem I
Page 13 and 14: Robbins state constrained problem I
Page 15 and 16: Beam problem: a second-order state
Page 17 and 18: Discretization by Euler’s method
Page 19 and 20: Reduction by elimination of the con
Page 21 and 22: Shooting problem: discretized probl
Page 23 and 24: Error analysis • F: set of C 1 ma
Page 25 and 26: Second-order optimality conditions
Page 27 and 28: Link with the shooting formulation
Page 29 and 30: A priori parameterized control •
Page 31 and 32: Example: mid-point rule • If uk c
Page 33 and 34: Order computation “by hand” Den
Page 35 and 36: Order of a RK scheme I • We forma
Page 37 and 38: Exercice: order 2 yk +hyk+1,1+ 1 2h
Page 39 and 40: s Lagrangian (contracting yk +hk j=
Page 41 and 42: Partitionned Runge-Kutta (PRK) sche
Page 43: Conditions for order 1 to 3: dj :=
Page 47 and 48: Number of conditions for each order
Page 49 and 50: Definition 1. (i) A linear mapping
Page 51 and 52: Back to the mid-point rule • The
Page 53 and 54: Synthesis of part II: unconstrained
Page 55 and 56: III: CONTROL CONSTRAINTS (Hager, Do
Page 57 and 58: Active constraints Denote the set o
Page 59 and 60: Minimization of the Hamiltonian •
Page 65 and 66: Euler discretization ⎧ Min φ(yN)
Page 67 and 68: Geometrical hypotheses: junction po
Page 69 and 70: Junction points for the discretized
Page 71 and 72: Connection with stability analysis
Page 73 and 74: Connection with stability analysis
Page 75 and 76: High-order RK schemes and control c
Page 77 and 78: Abstract stability result (in view
Page 79 and 80: Since F1 is strongly coercive, it f
Page 81 and 82: Examples: high orders are natural
Page 83 and 84: Academic example: first-order state
Page 85 and 86: Academic example: first boundary ar
Page 87 and 88: Academic example: three boundary ar
Page 89 and 90: First-order state constraint: Min
Page 91 and 92: Third-order state constraint: Min
Page 93 and 94: In the sequel: we discuss only firs
Page 95 and 96:
Condition at junction point Case of
Page 97 and 98:
Homotopy path For θ ∈ [0,1]: Min
Page 99 and 100:
Proof. We have that 0 = pθ k+1fu(u
Page 101 and 102:
and similarly 0 ≥ gi(y θ k−1)
Page 103 and 104:
For ε > 0 small enough, we deduce
Page 105 and 106:
OPEN PROBLEMS • First-order state
Page 107 and 108:
Sources • J.F. Bonnans, J. Lauren
Page 109:
The End ! 108
show all

Numerical analysis of time discretization of optimal control problems

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?