Project Optimal Control: Optimal Control with State Variable Inequality Constraints (SVIC)

Size: px
Start display at page:

Download "Project Optimal Control: Optimal Control with State Variable Inequality Constraints (SVIC)"

Transcription

1 Project Optimal Control: Optimal Control with State Variable Inequality Constraints (SVIC) Mahdi Ghazaei, Meike Stemmann Automatic Control LTH Lund University

2 Problem Formulation Find the maximum of the following cost functional subject to the contraints on states and control signals: J(u) = T 0 F (x(t), u(t), t)dt + S(x(T ), T ) ẋ(t) = f(x(t), t), x(0) = x 0 g(x(t), u(t), t) 0 h(x(t), t) 0 a(x(t ), T ) 0 b(x(t ), T ) = 0

3 Outline State Constraints Direct Adjoining Approach Indirect Adjoining Approach Example: Double Integrator Numerical Solution by Interior-Point Method Direct Approach Conclusion

4 Constraint Qualification for terminal constraints: rank for mixed constraints: [ a/ x ] diag(a) b/ x 0 = l + l a : E n E E l, b : E n E E l rank[ g/ u diag(g)] = s s : E n E m E E s

5 Order of Pure State Constraints h 0 (x, u, t) = h = h(x, t) h 1 (x, u, t) = ḣ = h x(x, t)f(x, u, t) + h t (x, t) h 2 (x, u, t) = ḣ1 = h 1 x(x, t)f(x, u, t) + h 1 t (x, t). h p (x, u, t) = ḣp 1 = h p 1 x (x, t)f(x, u, t) + h p 1 t (x, t) The state constraint is of order p if h i u(x, u, t) = 0 for 0 i p 1, h p u(x, u, t) 0

6 Direct Adjoining approach, Hamiltonian Hamiltonian and Lagrangian (P-form): H(x, u, λ 0, λ, t) = λ 0 F (x, u, t) + λf(x, u, t) L(x, u, λ 0, λ, µ, ν, t) = H(x, u, λ 0, λ, t) + µg(x, u, t) + νh(x, u, t) Control region: Ω(x, t) = {u E m g(x, u, t) 0}

7 Direct Adjoining approach, Theorem Part 1 {x (.), u (.)} an optimal pair for the problem on slide 2 over [0 T ] such that u (.)is right-continuous with left-hand limits constraint qualification holds for every tripple {t, x (t), u}, t [0 T ], u Ω(x (t), u) Assume x (t) has only finitely many junction times Then there exist a constant λ 0 0 a piecewise absolutely continuous costate trajectory λ(.) mapping [0, T ] into E n piecewise continuous multiplyer functions µ(.) and ν(.) mapping [0, T ] into E s and E q, respectively a vector η(τ i ) E q for each point τ i of discontinuity of λ(.) α E l and β E l, γ E q, not all zero, such that the following conditions hold almost everywhere:

8 Direct Adjoining approach, Theorem Part 2 Hamiltonian Maximization u (t) = arg max H(x (t), u, λ 0, λ(t), t) u Ω(x (t),t) L u [t] = H u[t] + µg u[t] = 0 λ(t) = L x [t] and µ(t) 0, µ(t)g [t] = 0 ν(t) 0, ν(t)h [t] = 0 dh [t] /dt = dl [t] /dt = L t [t] L [t]/ t,

9 Direct Adjoining approach, Theorem Part 3 At the terminal time T, the transversality conditions hold. λ(t ) = λ 0 S x [T ] + αa x [T ] + βb x [T ] + γh x [T ] α 0, γ 0, αa [T ] = γh [T ] = 0 For any time τ in the boundary interval and for any contact time τ, the costate trajectory may have a discontinuouty given by the following conditions. λ(τ ) = λ(τ + ) + η(τ)h x [τ] H [ τ ] = H [ τ +] η(τ)h t [τ] η(τ) 0, η(τ)h [τ] = 0

10 Indirect Adjoining approach, Hamiltonian Hamiltonian and Lagrangian (P-form): H(x, u, λ 0, λ, t) = λ 0 F (x, u, t) + λf(x, u, t) L(x, u, λ 0, λ, µ, ν, t) = H(x, u, λ 0, λ, t) + µg(x, u, t) + νh 1 (x, u, t) Control region: Ω(x, t) = { } u E m g(x, u, t) 0, h 1 (x, u, t) 0 if h(x, t) = 0

11 Indirect Adjoining approach, Theorem Part 1 {x (.), u (.)} an optimal pair for the problem on slide 2 such that x (.) has only finitely many junction times strong constraint qualification holds Then there exist a constant λ 0 0 a piecewise absolutely continuous xostate trajectory λ mapping [0, T ] into E n piecewise continuous multiplyer functions µ(.) and ν(.) mapping [0, T ] into E s and E q, respectively a vector η(τ i ) E q for each point τ i of discontinuity of λ(.) α E l and β E l, not all zero, such that the following conditions hold almost everywhere:

12 Indirect Adjoining approach, Theorem Part 2 Hamiltonian Maximization u (t) = arg max H(x (t), u, λ 0, λ(t), t) u Ω(x (t),t) L u [t] = 0 λ(t) = L x [t] µ(t) 0, µ(t)g [t] = 0 ν i is nondecreasing on boundary intervals of h i, i = 1, 2,, q with ν(t) 0, ν(t) 0, ν(t)h [t] = 0 and dh [t] /dt = dl [t] /dt = L t [t], whenever these derivatives exist.

13 Indirect Adjoining approach, Theorem Part 3 At the terminal time T, the transversality conditions λ(t ) = λ 0 S x [T ] + αa x [T ] + βb x [T ] + γh x [T ] α 0, γ 0, αa [T ] = γh [T ] = 0 hold. At each entry or contace time, the costate trajectory λ may have a discontinuouty of the form: λ(τ ) = λ(τ + ) + η(τ)h x [τ] H [ τ ] = H [ τ +] η(τ)h t [τ] η(τ) 0, η(τ)h [τ] = 0 and η(τ 1 ) ν(τ + 1 ) for entry times τ 1.

14 Example: Double Integrator T minimize x T Rx + u T Qu dt 0 ( ) 0 1 subject to ẋ(t) = x(t) u(t) 1 ( ) 0 u(t) 1 x 2 (t) c ( x(0) = x i T 0) x(1) = 0 2 1

15 Numerical Solution No of discretization points: 100 ( ) 1 0 Q = 0.25, R = 0 2 ( ) 0.17 c = 0.24, x I = 0 xv u t (sec) t (sec)

16 Direct Approach: Parameters, Hamiltonian and Lagrangian F (x(t), u(t), t) = x T Rx + u T Qu S(T ) = 0 f 1 (x(t), u(t), t) = x 2 (t) f 2 (x(t), u(t), t) = u(t) H = λ 0 (r 1 x 1 (t) 2 + r 2 x 2 (t) 2 + qu(t) 2 ) + λ 1 (t)x 2 (t) + λ 2 (t)u(t) L = H + µ 1 (t)(1 u(t)) + µ 2 (t)(1 + u(t)) + ν 1 (t)(c x 2 (t)) + ν 2 (t)(c + x 2 (t))

17 Direct Approach: Constraints h(x(t)) = ( ) c x2 (t) g(u(t)) = c + x 2 (t) ( ) 1 u(t) 1 + u(t) b(x(t)) = ( ) x1 (t) x 2 (t)

18 Direct Approach: Hamiltonian Maximization Without constraints, the Hamiltonian is maximized for: û(t) = q λ 2 (t) λ 0 Considering the constraints, the optimal solution is: 1 if λ 2 (t) < 2q u 1 1 λ (t) = 2 (t) 2 q λ 0 if 2q < λ 2 (t) < 2q 1 if λ 2 (t) > 2q Looking at the numerical solution time dependent u : 1 for t < τ λ 2 (t) u 2 q λ 0 for τ 1 < t < τ 2 (t) = 0 for τ 2 < t < τ λ 2 (t) 2 q λ 0 for τ 3 < t < τ 4 1 for τ 4 < t

19 Direct Approach: The Conditions L u[t] = H u[t] + µg u[t] = 0 2qu(t) + λ 2 (t) µ 1 (t) + µ 2 (t) = 0 (1) λ(t) = L x[t] { λ1 (t) = 2λ 0 r 1 x 1 (t) λ 2 (t) = 2λ 0 r 2 x 2 (t) λ 1 (t) + ν 1 (t) ν 2 (t) (2) µ(t) = ( µ 1 (t) µ 2 (t)) T 0 µ(t)g [t] = 0 (µ 1 (t) + µ 2 (t)) (µ 1 (t) µ 2 (t))u (t) = 0 (3) ν(t) = ( ν 1 (t) ν 2 (t)) T 0, ν(t) 0, ν(t)h (t) = 0 (ν 1 (t) + ν 2 (t))c (ν 1 (t) ν 2 (t))x 2 (t) = 0 (4)

20 Direct Approach: The Conditions dh [t] = dl = L t [t] dt dt 2r 1 x 1 (t)x 2 (t) 2r 2 x 2 (t)u(t) 2qu(t) u(t) + λ 1 (t)u(t) + λ 1 (t)x 2 (t) + λ 2 (t) u(t) + λ 2 (t)u(t) = 0 (5) u(t)(µ 1 (t) µ 2 (t)) + ( µ 1 (t) µ 2 (t))u(t) ( µ 1 (t) + µ 2 (t)) + (ν 1 (t) ν 2 (t))u(t) + ( ν 1 (t) ν 2 (t))x 2 (t) c( ν 1 (t) + ν 2 (t)) = 0 (6)

21 Direct Approach: The Conditions Transversality conditions: λ(t ) = βb x[t ] + γh x[t ] ) ( ) β1 = I β 2 ( λ1 [1 ] λ 2 [1 ] ( ) ( ) γ1 γ 0, γh[t ] = 0 (γ 1 + γ 2 )c (γ 1 γ 2 )x 2 (T ) = 0 γ 2 (7) Since x 2 (T ) = 0, we conclude γ 1 = γ 2 = 0. (8)

22 Direct Approach: u (t) = 1, t < τ 1 Assuming that x i (0) > 0 x 1 (t) = 1 2 t2 + x i x 2 (t) = t (9) From (1) follows: 2q + λ 2 (t) µ 1 (t) + µ 2 (t) = 0 (10) From (3) follows: From (4) follows: From (6) follows: µ 1 (t) = 0, µ 2 (t) free (11) ν 1 (t) = t c t + c ν 2(t) (12) 2 µ 1 + (t + c) ν 1 (t c) ν 2 + (ν 1 ν 2 ) = 0 (13)

23 Direct Approach: u (t) = 1, t < τ 1 From (2) follows: { λ1 (t) = r 1 t 2 + 2r 1 x i λ 2 (t) = 2r 2 t λ 1 (t) + ν 1 (t) ν 2 (t) (14) Combined with (5) follows: ν 1 (t) = ν 2 (t) (15) From (12) and (15) follows: ν 1 (t) = ν 2 (t) = 0 From (14) follows: { λ1 (t) = 1 3 r 1t 3 r 1 x i t K 1 λ 2 (t) = 1 12 r 1t 4 (r 1 x i + r 2 )t 2 (16) + tk 1 + K 2

24 Direct Approach: u (t) = 0, τ 2 < t < τ 3 x 1 (t) = ct + K 6 x 2 (t) = c (17) From (1) follows: From (3) follows: From (4) follows: λ 2 (t) µ 1 (t) + µ 2 (t) = 0 (18) µ 1 (t) = µ 2 (t) = 0 (19) ν 1 (t) = 0, ν 2 (t), free (20) (6) provides no new information.

25 Direct Approach: u (t) = 0, τ 2 < t < τ 3 From (2) follows: λ 1 (t) = 2r 1 ct + 2r 1 K 6 (5) gives the same equation for λ 1 (t) λ 2 (t) = λ 1 (t) 2r 2 c ν 2 (t) (21) From (18) and (19) we conclude λ 2 (t) = 0. Considering this, (21) simplifies to: ν 2 (t) = λ 1 (t) 2r 2 c (22) λ 1 (t) = r 1 ct 2 + K 6 t + K 7 (23)

26 Direct Approach: u (t) = 1, t > τ 4 x 1 (t) = 1 2 t2 + K 9 t + K 8 x 2 (t) = t + K 9 (24) From (1) follows: 2q + λ 2 (t) µ 1 (t) + µ 2 (t) = 0 (25) From (3) follows: µ 1 (t) free, µ 2 (t) = 0 (26) From (4) follows: (c t)ν 1 (t) + (c + t)ν 2 (t) (ν 1 (t) ν 2 (t))k 9 = 0 (27)

27 Direct Approach: u (t) = 1, t > τ 4 From (6) follows: ν 1 (t) ν 2 (t) + ( ν 1 (t) ν 2 (t))(t c + K 9 ) = 0 (28) From (2) follows: { λ1 (t) = 2r 1 ( 1 2 t2 + K 9 t + K 8 ) λ 2 (t) = 2r 2 (t + K 9 ) λ 1 (t) + ν 1 (t) ν 2 (t) (29) Combined with (5) follows: ν 1 (t) = ν 2 (t) (30) From (27) and (30) follows ν 1 (t) = ν 2 (t) = 0. From (29) follows: λ 1 (t) = 1 3 r 1t 3 + r 1 K 9 t 2 + 2r 1 K 8 t + K 10 λ 2 (t) = 1 12 r 1t r 1K 9 t 3 + (r 2 r 1 K 8 )t 2 (31) +(2r 2 K 9 K 10 )t + K 11

28 Direct Approach: u (t) = 1 2q λ 2(t), τ 1 < t < τ 2, τ 3 < t < τ 4 From (1) follows: From (3) follows: u(t) = λ 2(t) µ 1 (t) + µ 2 (t) 2q (32) µ 1 (t) = µ 2 (t) (33) µ 1 (t) + µ 2 (t) = 0 (34) Therefore, µ 1 (t) = µ 2 (t) = 0. From (4) follows: From (6) follows: c(ν 1 (t) + ν 2 (t)) (ν 1 (t) ν 2 (t))x 2 (t) = 0 (35) (ν 1 (t) ν 2 (t)) λ 2(t) 2q +( ν 1(t) ν 2 (t))x 2 (t) c( ν 1 (t)+ ν 2 (t)) = 0 (36)

29 Direct Approach: u (t) = 1 2q λ 2(t), τ 1 < t < τ 2, τ 3 < t < τ 4 From (5) follows: ( 2r 2 x 2 (t) + λ 1 (t) + λ ) 2 (t) λ 2 (t) = 0 (37) With λ 2 (t) 0, 2r 2 x 2 (t) + λ 1 (t) + λ 2 (t) = 0. (38) Comparing with (2) and using (4), we conclude that ν 1 (t) = ν 2 (t) = 0. Using (38), system dynamics and u (t) = 1 2q λ 2(t), we can conclude: λ (4) 2 (t) = 1 q (r 2 λ 2 (t) r 1 λ 2 (t)) (39)

30 Direct Approach: u (t) = 1 2q λ 2(t), τ 1 < t < τ 2, τ 3 < t < τ 4 From this follows: λ 2 (t) = C 1 e σ 1t + C 2 e σ 1t + C 3 e σ 2t + C 4 e σ 2t (40) with r 2 + r2 2 σ 1 = 4qr 1 2q r 2 s r2 2 σ 2 = 4qr 1 2q

31 Direct Approach: u (t) = 1 2q λ 2(t), τ 1 < t < τ 2, τ 3 < t < τ 4 From system equations: ẋ 2 (t) =u(t) x 2 (t) = 1 ( C 1 e σ1t + C 2 e σ1t C 3 e σ2t + C ) 4 e σ 2t + κ 1 2q σ 1 σ 1 σ 2 σ 2 (41) ẋ 1 (t) =x 2 (t) x 1 (t) = 1 2q ( C1 σ κ 1 t + κ 2 e σ 1t + C 2 σ 2 1 e σ 1t + C 3 σ 2 2 e σ2t + C ) 4 σ2 2 e σ 2t (42)

32 Direct Approach: u (t) = 1 2q λ 2(t), τ 1 < t < τ 2, τ 3 < t < τ 4 With (38) it follows: ( λ 1 (t) = σ 1 r ) ( 2 ) C 1 e σ1t C 2 e σ 1t σ 1 q ( + σ 2 r ) ( 2 ) C 3 e σ2t C 4 e σ 2t + 2r 2 K 12 (43) σ 2 q

33 Direct Approach: Initial and Final Conditions Initial condition on x used earlier. Final conditions for x: From system equations when u = 1 follows: Continuity u: u(τ + 1 ) = 1 λ 2(τ + 1 ) = 2q x 1 (1) = 0, x 2 (1) = 0 (44) K 8 = 1 2, K 9 = 1 (45) C 1 e σ 1τ 1 + C 2 e σ 1τ 1 + C 3 e σ 2τ 1 + C 4 e σ 2τ 1 = 2q (46) u(τ 2 ) = 0 λ 2(τ 2 ) = 0 C 1 e σ 1τ 2 + C 2 e σ 1τ 2 + C 3 e σ 2τ 2 + C 4 e σ 2τ 2 = 0 (47)

34 Direct Approach: Initial and Final Conditions u(τ + 3 ) = 0 λ 2(τ + 3 ) = 0 D 1 e σ 1τ 3 + D 2 e σ 1τ 3 + D 3 e σ 2τ 3 + D 4 e σ 2τ 3 = 0 u(τ 4 ) = 1 λ 2(τ 4 ) = 2q Continuity of x: x 1 (τ 1 ) = x 1(τ + 1 ) 1 2 τ x i = 1 2q D 1 e σ 1τ 4 + D 2 e σ 1τ 4 + D 3 e σ 2τ 4 + D 4 e σ 2τ 4 = 2q ( C1 σ K 12 τ 1 + K 13 e σ 1τ 1 + C 2 σ 2 1 e σ 1τ 1 + C 3 σ 2 2 e σ 2τ 1 + C ) 4 σ2 2 e σ 2τ 1

35 Direct Approach: Initial and Final Conditions x 2 (τ1 ) = x 2(τ 1 + ) τ 1 = 1 ( C 1 e σ 1τ 1 + C 2 e σ 1τ 1 C 3 e σ 2τ 1 + C ) 4 e σ 2τ 1 + K 12 2q σ 1 σ 1 σ 2 σ 2 x 1 (τ 2 ) = x 1(τ + 2 ) 1 2q ( C1 σ 2 1 = cτ 2 + K 6 e σ 1τ 2 + C 2 σ 2 1 e σ 1τ 2 + C 3 σ 2 2 e σ 2τ 2 + C ) 4 σ2 2 e σ 2τ 2 + K 12 τ 1 + K 13 x 2 (τ2 ) = x 2(τ 2 + ( ) 1 C 1 e σ 1τ 2 + C 2 e σ 1τ 2 C 3 e σ 2τ 2 + C ) 4 e σ 2τ 2 + K 12 = c 2q σ 1 σ 1 σ 2 σ 2

36 Direct Approach: Initial and Final Conditions x 1 (τ 3 ) = x 1(τ + 3 ) cτ 3 + K 6 = 1 2q + K 14 τ 3 + K 15 ( D1 σ 2 1 e σ 1τ 3 + D 2 σ 2 1 e σ 1τ 3 + D 3 σ 2 2 e σ 2τ 3 + D ) 4 σ2 2 e σ 2τ 3 x 2 (τ3 ) = x 2(τ 3 + ) c = 1 ( D 1 e σ 1τ 3 + D 2 e σ 1τ 3 D 3 e σ 2τ 3 + D ) 4 e σ 2τ 3 + K 14 2q σ 1 σ 1 σ 2 σ 2

37 Direct Approach: Initial and Final Conditions x 1 (τ 4 ) = x 1(τ + 4 ) 1 2q ( D1 σ 2 1 e σ 1τ 4 + D 2 σ 2 1 = 1 2 τ τ 4 e σ 1τ 4 + D 3 σ 2 2 e σ 2τ 4 + D ) 4 σ2 2 e σ 2τ 4 + K 14 τ 4 + K 15 x 2 (τ4 ) = x 2(τ 4 + ( ) 1 D 1 e σ 1τ 4 + D 2 e σ 1τ 4 D 3 e σ 2τ 4 + D ) 4 e σ 2τ 4 + K 14 = τ 4 1 2q σ 1 σ 1 σ 2 σ 2

38 Direct Approach: Continuity of λ λ 1 (τ1 ) = λ 1(τ 1 + ) 1 ( 3 r 1τ1 3 r 1 x i τ 1 K 1 = σ 1 r ) 2 (C1 e σ 1τ 1 C 2 e σ 1τ 1 ) σ 1 q ( + σ 2 r ) 2 (C3 e σ 2τ 1 C 4 e σ 2τ 1 ) + 2r2 K 12 σ 2 q λ 2 (τ 1 ) = λ 2(τ + 1 ) 1 12 r 1τ 4 1 (r 1 x i + r 2 )τ τ 1 K 1 + K 2 = C 1 e σ 1τ 1 + C 2 e σ 1τ 1 + C 3 e σ 2τ 1 + C 4 e σ 2τ 1

39 Direct Approach: Continuity of λ λ 1 (τ2 ) = λ 1(τ 2 + ( ) σ 1 r ) 2 (C1 e σ 1τ 2 C 2 e σ 1τ 2 ) σ 1 q ( + σ 2 r ) 2 (C3 e σ 2τ 2 C 4 e σ 2τ 2 ) + 2r2 K 12 σ 2 q = r 1 cτ2 2 + K 6 τ 2 + K 7 λ 2 (τ 2 ) = λ 2(τ + 2 ) C 1 e σ 1τ 2 + C 2 e σ 1τ 2 + C 3 e σ 2τ 2 + C 4 e σ 2τ 2 = 0

40 Direct Approach: Continuity of λ λ 1 (τ3 ) = λ 1(τ 3 + ) ( r 1 cτ3 2 + K 6 τ 3 + K 7 = σ 1 r ) 2 (D1 e σ 1τ 3 D 2 e σ 1τ 3 ) σ 1 q ( + σ 2 r ) 2 (D3 e σ 2τ 3 D 4 e σ 2τ 3 ) + 2r2 K 14 σ 2 q λ 2 (τ 3 ) = λ 2(τ + 3 ) 0 = D 1 e σ 1τ 2 + D 2 e σ 1τ 3 + D 3 e σ 2τ 3 + D 4 e σ 2τ 3

41 Direct Approach: Continuity of λ λ 1 (τ4 ) = λ 1(τ 4 + ( ) σ 1 r ) 2 (D1 e σ 1τ 4 D 2 e σ 1τ 4 ) σ 1 q ( + σ 2 r ) 2 (D3 e σ 2τ 4 D 4 e σ 2τ 4 ) σ 2 q + 2r 2 K 14 = 1 3 r 1τ 3 4 r 1 τ K 10 + r 1 τ 4 λ 2 (τ 4 ) = λ 2(τ + 4 ) D 1 e σ 1τ 2 + D 2 e σ 1τ 4 + D 3 e σ 2τ 4 + D 4 e σ 2τ 4 = 1 12 r 1τ r 1τ (r r 1)τ ( 2r 2 K 10 )τ 4 + K 11

42 Direct Approach: Results These conditions result in 24 unkowns and 20 equations, most of them nonlinear. To determine a solution, we need four more equations. Hence, the solution is calculated by measuring values at the following four points: u(0.2) = , x 2 (0.2) = u(0.8) = , x 2 (0.8) =

43 Direct Approach: Results x t (sec) u t (sec)

44 Conclusion Since H is concave, we can conclude that the solution to the example found by the direct approach is optimal, according to the Mangasarian-Type sufficient condition. The necessary condition by itself does not provide enough information to calculate the solution for the example.

45 References This work is based on the following references: Richard F. Hartl, Suresh P. Sethi and Raymond G. Vickson, "A Survey of the Maximum Principles for Optimal Control Problems with State Constraints," SIAM Review, Vol. 37, No. 2 (Jun., 1995), pp Seierstad, Atle, and Knut Sydsæter. Optimal Control Theory with Economic Applications. Amsterdam: North-Holland, 1987.

CHAPTER 3 THE MAXIMUM PRINCIPLE: MIXED INEQUALITY CONSTRAINTS. p. 1/73

CHAPTER 3 THE MAXIMUM PRINCIPLE: MIXED INEQUALITY CONSTRAINTS. p. 1/73 CHAPTER 3 THE MAXIMUM PRINCIPLE: MIXED INEQUALITY CONSTRAINTS p. 1/73 THE MAXIMUM PRINCIPLE: MIXED INEQUALITY CONSTRAINTS Mixed Inequality Constraints: Inequality constraints involving control and possibly

More information

Deterministic Dynamic Programming

Deterministic Dynamic Programming Deterministic Dynamic Programming 1 Value Function Consider the following optimal control problem in Mayer s form: V (t 0, x 0 ) = inf u U J(t 1, x(t 1 )) (1) subject to ẋ(t) = f(t, x(t), u(t)), x(t 0

More information

Advanced Mechatronics Engineering

Advanced Mechatronics Engineering Advanced Mechatronics Engineering German University in Cairo 21 December, 2013 Outline Necessary conditions for optimal input Example Linear regulator problem Example Necessary conditions for optimal input

More information

Direct optimization methods for solving a complex state constrained optimal control problem in microeconomics

Direct optimization methods for solving a complex state constrained optimal control problem in microeconomics Direct optimization methods for solving a complex state constrained optimal control problem in microeconomics Helmut Maurer a Hans Josef Pesch b a Universität Münster, Institut für Numerische und Angewandte

More information

Tutorial on Control and State Constrained Optimal Control Pro. Control Problems and Applications Part 3 : Pure State Constraints

Tutorial on Control and State Constrained Optimal Control Pro. Control Problems and Applications Part 3 : Pure State Constraints Tutorial on Control and State Constrained Optimal Control Problems and Applications Part 3 : Pure State Constraints University of Münster Institute of Computational and Applied Mathematics SADCO Summer

More information

Mathematical Economics. Lecture Notes (in extracts)

Mathematical Economics. Lecture Notes (in extracts) Prof. Dr. Frank Werner Faculty of Mathematics Institute of Mathematical Optimization (IMO) http://math.uni-magdeburg.de/ werner/math-ec-new.html Mathematical Economics Lecture Notes (in extracts) Winter

More information

Theory and Applications of Optimal Control Problems with Time-Delays

Theory and Applications of Optimal Control Problems with Time-Delays Theory and Applications of Optimal Control Problems with Time-Delays University of Münster Institute of Computational and Applied Mathematics South Pacific Optimization Meeting (SPOM) Newcastle, CARMA,

More information

ECON 582: An Introduction to the Theory of Optimal Control (Chapter 7, Acemoglu) Instructor: Dmytro Hryshko

ECON 582: An Introduction to the Theory of Optimal Control (Chapter 7, Acemoglu) Instructor: Dmytro Hryshko ECON 582: An Introduction to the Theory of Optimal Control (Chapter 7, Acemoglu) Instructor: Dmytro Hryshko Continuous-time optimization involves maximization wrt to an innite dimensional object, an entire

More information

CHAPTER 2 THE MAXIMUM PRINCIPLE: CONTINUOUS TIME. Chapter2 p. 1/67

CHAPTER 2 THE MAXIMUM PRINCIPLE: CONTINUOUS TIME. Chapter2 p. 1/67 CHAPTER 2 THE MAXIMUM PRINCIPLE: CONTINUOUS TIME Chapter2 p. 1/67 THE MAXIMUM PRINCIPLE: CONTINUOUS TIME Main Purpose: Introduce the maximum principle as a necessary condition to be satisfied by any optimal

More information

Formula Sheet for Optimal Control

Formula Sheet for Optimal Control Formula Sheet for Optimal Control Division of Optimization and Systems Theory Royal Institute of Technology 144 Stockholm, Sweden 23 December 1, 29 1 Dynamic Programming 11 Discrete Dynamic Programming

More information

EN Applied Optimal Control Lecture 8: Dynamic Programming October 10, 2018

EN Applied Optimal Control Lecture 8: Dynamic Programming October 10, 2018 EN530.603 Applied Optimal Control Lecture 8: Dynamic Programming October 0, 08 Lecturer: Marin Kobilarov Dynamic Programming (DP) is conerned with the computation of an optimal policy, i.e. an optimal

More information

Theory and Applications of Constrained Optimal Control Proble

Theory and Applications of Constrained Optimal Control Proble Theory and Applications of Constrained Optimal Control Problems with Delays PART 1 : Mixed Control State Constraints Helmut Maurer 1, Laurenz Göllmann 2 1 Institut für Numerische und Angewandte Mathematik,

More information

Optimal control theory with applications to resource and environmental economics

Optimal control theory with applications to resource and environmental economics Optimal control theory with applications to resource and environmental economics Michael Hoel, August 10, 2015 (Preliminary and incomplete) 1 Introduction This note gives a brief, non-rigorous sketch of

More information

Lecture Note 13:Continuous Time Switched Optimal Control: Embedding Principle and Numerical Algorithms

Lecture Note 13:Continuous Time Switched Optimal Control: Embedding Principle and Numerical Algorithms ECE785: Hybrid Systems:Theory and Applications Lecture Note 13:Continuous Time Switched Optimal Control: Embedding Principle and Numerical Algorithms Wei Zhang Assistant Professor Department of Electrical

More information

Problem 1 Cost of an Infinite Horizon LQR

Problem 1 Cost of an Infinite Horizon LQR THE UNIVERSITY OF TEXAS AT SAN ANTONIO EE 5243 INTRODUCTION TO CYBER-PHYSICAL SYSTEMS H O M E W O R K # 5 Ahmad F. Taha October 12, 215 Homework Instructions: 1. Type your solutions in the LATEX homework

More information

Numerical Optimal Control Overview. Moritz Diehl

Numerical Optimal Control Overview. Moritz Diehl Numerical Optimal Control Overview Moritz Diehl Simplified Optimal Control Problem in ODE path constraints h(x, u) 0 initial value x0 states x(t) terminal constraint r(x(t )) 0 controls u(t) 0 t T minimize

More information

8. Constrained Optimization

8. Constrained Optimization 8. Constrained Optimization Daisuke Oyama Mathematics II May 11, 2018 Unconstrained Maximization Problem Let X R N be a nonempty set. Definition 8.1 For a function f : X R, x X is a (strict) local maximizer

More information

Differential Games, Distributed Systems, and Impulse Control

Differential Games, Distributed Systems, and Impulse Control Chapter 12 Differential Games, Distributed Systems, and Impulse Control In previous chapters, we were mainly concerned with the optimal control problems formulated in Chapters 3 and 4 and their applications

More information

OPTIMAL CONTROL SYSTEMS

OPTIMAL CONTROL SYSTEMS SYSTEMS MIN-MAX Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University OUTLINE MIN-MAX CONTROL Problem Definition HJB Equation Example GAME THEORY Differential Games Isaacs

More information

Optimal Control. Macroeconomics II SMU. Ömer Özak (SMU) Economic Growth Macroeconomics II 1 / 112

Optimal Control. Macroeconomics II SMU. Ömer Özak (SMU) Economic Growth Macroeconomics II 1 / 112 Optimal Control Ömer Özak SMU Macroeconomics II Ömer Özak (SMU) Economic Growth Macroeconomics II 1 / 112 Review of the Theory of Optimal Control Section 1 Review of the Theory of Optimal Control Ömer

More information

An Application of Pontryagin s Maximum Principle in a Linear Quadratic Differential Game

An Application of Pontryagin s Maximum Principle in a Linear Quadratic Differential Game An Application of Pontryagin s Maximum Principle in a Linear Quadratic Differential Game Marzieh Khakestari (Corresponding author) Institute For Mathematical Research, Universiti Putra Malaysia, 43400

More information

Convex Optimization M2

Convex Optimization M2 Convex Optimization M2 Lecture 3 A. d Aspremont. Convex Optimization M2. 1/49 Duality A. d Aspremont. Convex Optimization M2. 2/49 DMs DM par email: dm.daspremont@gmail.com A. d Aspremont. Convex Optimization

More information

Pontryagin s maximum principle

Pontryagin s maximum principle Pontryagin s maximum principle Emo Todorov Applied Mathematics and Computer Science & Engineering University of Washington Winter 2012 Emo Todorov (UW) AMATH/CSE 579, Winter 2012 Lecture 5 1 / 9 Pontryagin

More information

Direct Optimal Control and Costate Estimation Using Least Square Method

Direct Optimal Control and Costate Estimation Using Least Square Method 21 American Control Conference Marriott Waterfront, Baltimore, MD, USA June 3-July 2, 21 WeB22.1 Direct Optimal Control and Costate Estimation Using Least Square Method Baljeet Singh and Raktim Bhattacharya

More information

Random and Deterministic perturbations of dynamical systems. Leonid Koralov

Random and Deterministic perturbations of dynamical systems. Leonid Koralov Random and Deterministic perturbations of dynamical systems Leonid Koralov - M. Freidlin, L. Koralov Metastability for Nonlinear Random Perturbations of Dynamical Systems, Stochastic Processes and Applications

More information

Tonelli Full-Regularity in the Calculus of Variations and Optimal Control

Tonelli Full-Regularity in the Calculus of Variations and Optimal Control Tonelli Full-Regularity in the Calculus of Variations and Optimal Control Delfim F. M. Torres delfim@mat.ua.pt Department of Mathematics University of Aveiro 3810 193 Aveiro, Portugal http://www.mat.ua.pt/delfim

More information

Numerical Methods for Constrained Optimal Control Problems

Numerical Methods for Constrained Optimal Control Problems Numerical Methods for Constrained Optimal Control Problems Hartono Hartono A Thesis submitted for the degree of Doctor of Philosophy School of Mathematics and Statistics University of Western Australia

More information

Tutorial on Control and State Constrained Optimal Control Problems

Tutorial on Control and State Constrained Optimal Control Problems Tutorial on Control and State Constrained Optimal Control Problems To cite this version:. blems. SADCO Summer School 211 - Optimal Control, Sep 211, London, United Kingdom. HAL Id: inria-629518

More information

Optimal Control of Differential Equations with Pure State Constraints

Optimal Control of Differential Equations with Pure State Constraints University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange Masters Theses Graduate School 8-2013 Optimal Control of Differential Equations with Pure State Constraints Steven Lee

More information

ON THE SUSTAINABLE PROGRAM IN SOLOW S MODEL. 1. Introduction

ON THE SUSTAINABLE PROGRAM IN SOLOW S MODEL. 1. Introduction ON THE SUSTAINABLE PROGRAM IN SOLOW S MODEL CEES WITHAGEN, GEIR B. ASHEIM, AND WOLFGANG BUCHHOLZ Abstract. We show that our general result (Withagen and Asheim [8]) on the converse of Hartwick s rule also

More information

Weak convergence and large deviation theory

Weak convergence and large deviation theory First Prev Next Go To Go Back Full Screen Close Quit 1 Weak convergence and large deviation theory Large deviation principle Convergence in distribution The Bryc-Varadhan theorem Tightness and Prohorov

More information

Learning parameters in ODEs

Learning parameters in ODEs Learning parameters in ODEs Application to biological networks Florence d Alché-Buc Joint work with Minh Quach and Nicolas Brunel IBISC FRE 3190 CNRS, Université d Évry-Val d Essonne, France /14 Florence

More information

HJB equations. Seminar in Stochastic Modelling in Economics and Finance January 10, 2011

HJB equations. Seminar in Stochastic Modelling in Economics and Finance January 10, 2011 Department of Probability and Mathematical Statistics Faculty of Mathematics and Physics, Charles University in Prague petrasek@karlin.mff.cuni.cz Seminar in Stochastic Modelling in Economics and Finance

More information

Optimal Control and Applications

Optimal Control and Applications V. M. Becerra - Session 1-2nd AstroNet-II Summer School Optimal Control and Applications Session 1 2nd AstroNet-II Summer School Victor M. Becerra School of Systems Engineering University of Reading 5-6

More information

Joint work with Nguyen Hoang (Univ. Concepción, Chile) Padova, Italy, May 2018

Joint work with Nguyen Hoang (Univ. Concepción, Chile) Padova, Italy, May 2018 EXTENDED EULER-LAGRANGE AND HAMILTONIAN CONDITIONS IN OPTIMAL CONTROL OF SWEEPING PROCESSES WITH CONTROLLED MOVING SETS BORIS MORDUKHOVICH Wayne State University Talk given at the conference Optimization,

More information

Legendre Pseudospectral Approximations of Optimal Control Problems

Legendre Pseudospectral Approximations of Optimal Control Problems Legendre Pseudospectral Approximations of Optimal Control Problems I. Michael Ross 1 and Fariba Fahroo 1 Department of Aeronautics and Astronautics, Code AA/Ro, Naval Postgraduate School, Monterey, CA

More information

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything. UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in MAT2440 Differential equations and optimal control theory Day of examination: 11 June 2015 Examination hours: 0900 1300 This

More information

Solution Methods. Richard Lusby. Department of Management Engineering Technical University of Denmark

Solution Methods. Richard Lusby. Department of Management Engineering Technical University of Denmark Solution Methods Richard Lusby Department of Management Engineering Technical University of Denmark Lecture Overview (jg Unconstrained Several Variables Quadratic Programming Separable Programming SUMT

More information

A Gauss Lobatto quadrature method for solving optimal control problems

A Gauss Lobatto quadrature method for solving optimal control problems ANZIAM J. 47 (EMAC2005) pp.c101 C115, 2006 C101 A Gauss Lobatto quadrature method for solving optimal control problems P. Williams (Received 29 August 2005; revised 13 July 2006) Abstract This paper proposes

More information

Free Convolution with A Free Multiplicative Analogue of The Normal Distribution

Free Convolution with A Free Multiplicative Analogue of The Normal Distribution Free Convolution with A Free Multiplicative Analogue of The Normal Distribution Ping Zhong Indiana University Bloomington July 23, 2013 Fields Institute, Toronto Ping Zhong free multiplicative analogue

More information

Optimal control theory with applications to resource and environmental economics

Optimal control theory with applications to resource and environmental economics Optimal control theory with applications to resource and environmental economics Michael Hoel University of Oslo July 15, 2016 Abstract This note gives a brief, non-rigorous sketch of basic optimal control

More information

Input to state Stability

Input to state Stability Input to state Stability Mini course, Universität Stuttgart, November 2004 Lars Grüne, Mathematisches Institut, Universität Bayreuth Part IV: Applications ISS Consider with solutions ϕ(t, x, w) ẋ(t) =

More information

OPTIMAL CONTROL CHAPTER INTRODUCTION

OPTIMAL CONTROL CHAPTER INTRODUCTION CHAPTER 3 OPTIMAL CONTROL What is now proved was once only imagined. William Blake. 3.1 INTRODUCTION After more than three hundred years of evolution, optimal control theory has been formulated as an extension

More information

A Remark on IVP and TVP Non-Smooth Viscosity Solutions to Hamilton-Jacobi Equations

A Remark on IVP and TVP Non-Smooth Viscosity Solutions to Hamilton-Jacobi Equations 2005 American Control Conference June 8-10, 2005. Portland, OR, USA WeB10.3 A Remark on IVP and TVP Non-Smooth Viscosity Solutions to Hamilton-Jacobi Equations Arik Melikyan, Andrei Akhmetzhanov and Naira

More information

Conservation Laws and Finite Volume Methods

Conservation Laws and Finite Volume Methods Conservation Laws and Finite Volume Methods AMath 574 Winter Quarter, 2011 Randall J. LeVeque Applied Mathematics University of Washington January 3, 2011 R.J. LeVeque, University of Washington AMath 574,

More information

Deterministic Optimal Control

Deterministic Optimal Control page A1 Online Appendix A Deterministic Optimal Control As far as the laws of mathematics refer to reality, they are not certain; and as far as they are certain, they do not refer to reality. Albert Einstein

More information

An efficient approach to stochastic optimal control. Bert Kappen SNN Radboud University Nijmegen the Netherlands

An efficient approach to stochastic optimal control. Bert Kappen SNN Radboud University Nijmegen the Netherlands An efficient approach to stochastic optimal control Bert Kappen SNN Radboud University Nijmegen the Netherlands Bert Kappen Examples of control tasks Motor control Bert Kappen Pascal workshop, 27-29 May

More information

Lecture 10: Singular Perturbations and Averaging 1

Lecture 10: Singular Perturbations and Averaging 1 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 10: Singular Perturbations and

More information

Non-Differentiable Embedding of Lagrangian structures

Non-Differentiable Embedding of Lagrangian structures Non-Differentiable Embedding of Lagrangian structures Isabelle Greff Joint work with J. Cresson Université de Pau et des Pays de l Adour CNAM, Paris, April, 22nd 2010 Position of the problem 1. Example

More information

Disturbance Decoupling Problem

Disturbance Decoupling Problem DISC Systems and Control Theory of Nonlinear Systems, 21 1 Disturbance Decoupling Problem Lecture 4 Nonlinear Dynamical Control Systems, Chapter 7 The disturbance decoupling problem is a typical example

More information

Trajectory Smoothing as a Linear Optimal Control Problem

Trajectory Smoothing as a Linear Optimal Control Problem Trajectory Smoothing as a Linear Optimal Control Problem Biswadip Dey & P. S. Krishnaprasad Allerton Conference - 212 Monticello, IL, USA. October 4, 212 Background and Motivation 1 Background and Motivation

More information

Mechanical Systems II. Method of Lagrange Multipliers

Mechanical Systems II. Method of Lagrange Multipliers Mechanical Systems II. Method of Lagrange Multipliers Rafael Wisniewski Aalborg University Abstract. So far our approach to classical mechanics was limited to finding a critical point of a certain functional.

More information

Deterministic Optimal Control

Deterministic Optimal Control Online Appendix A Deterministic Optimal Control As far as the laws of mathematics refer to reality, they are not certain; and as far as they are certain, they do not refer to reality. Albert Einstein (1879

More information

Strong and Weak Augmentability in Calculus of Variations

Strong and Weak Augmentability in Calculus of Variations Strong and Weak Augmentability in Calculus of Variations JAVIER F ROSENBLUETH National Autonomous University of Mexico Applied Mathematics and Systems Research Institute Apartado Postal 20-126, Mexico

More information

Module 05 Introduction to Optimal Control

Module 05 Introduction to Optimal Control Module 05 Introduction to Optimal Control Ahmad F. Taha EE 5243: Introduction to Cyber-Physical Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ taha/index.html October 8, 2015

More information

Duality and dynamics in Hamilton-Jacobi theory for fully convex problems of control

Duality and dynamics in Hamilton-Jacobi theory for fully convex problems of control Duality and dynamics in Hamilton-Jacobi theory for fully convex problems of control RTyrrell Rockafellar and Peter R Wolenski Abstract This paper describes some recent results in Hamilton- Jacobi theory

More information

OPTIMAL CONTROL. Sadegh Bolouki. Lecture slides for ECE 515. University of Illinois, Urbana-Champaign. Fall S. Bolouki (UIUC) 1 / 28

OPTIMAL CONTROL. Sadegh Bolouki. Lecture slides for ECE 515. University of Illinois, Urbana-Champaign. Fall S. Bolouki (UIUC) 1 / 28 OPTIMAL CONTROL Sadegh Bolouki Lecture slides for ECE 515 University of Illinois, Urbana-Champaign Fall 2016 S. Bolouki (UIUC) 1 / 28 (Example from Optimal Control Theory, Kirk) Objective: To get from

More information

LECTURES ON OPTIMAL CONTROL THEORY

LECTURES ON OPTIMAL CONTROL THEORY LECTURES ON OPTIMAL CONTROL THEORY Terje Sund May 24, 2016 CONTENTS 1. INTRODUCTION 2. FUNCTIONS OF SEVERAL VARIABLES 3. CALCULUS OF VARIATIONS 4. OPTIMAL CONTROL THEORY 1 INTRODUCTION In the theory of

More information

Weak Convergence of Numerical Methods for Dynamical Systems and Optimal Control, and a relation with Large Deviations for Stochastic Equations

Weak Convergence of Numerical Methods for Dynamical Systems and Optimal Control, and a relation with Large Deviations for Stochastic Equations Weak Convergence of Numerical Methods for Dynamical Systems and, and a relation with Large Deviations for Stochastic Equations Mattias Sandberg KTH CSC 2010-10-21 Outline The error representation for weak

More information

Mathematical Economics: Lecture 16

Mathematical Economics: Lecture 16 Mathematical Economics: Lecture 16 Yu Ren WISE, Xiamen University November 26, 2012 Outline 1 Chapter 21: Concave and Quasiconcave Functions New Section Chapter 21: Concave and Quasiconcave Functions Concave

More information

Optimality Conditions for Constrained Optimization

Optimality Conditions for Constrained Optimization 72 CHAPTER 7 Optimality Conditions for Constrained Optimization 1. First Order Conditions In this section we consider first order optimality conditions for the constrained problem P : minimize f 0 (x)

More information

LMI Methods in Optimal and Robust Control

LMI Methods in Optimal and Robust Control LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 15: Nonlinear Systems and Lyapunov Functions Overview Our next goal is to extend LMI s and optimization to nonlinear

More information

arxiv: v1 [math.oc] 1 Jan 2019

arxiv: v1 [math.oc] 1 Jan 2019 Optimal Control of Double Integrator with Minimum Total Variation C. Yalçın Kaya January 4, 209 arxiv:90.0049v [math.oc] Jan 209 Abstract We study the well-known minimum-energy control of double integrator,

More information

Are thermodynamical systems port-hamiltonian?

Are thermodynamical systems port-hamiltonian? Are thermodynamical systems port-hamiltonian? Siep Weiland Department of Electrical Engineering Eindhoven University of Technology February 13, 2019 Siep Weiland (TUE) Are thermodynamical systems port-hamiltonian?

More information

minimize x subject to (x 2)(x 4) u,

minimize x subject to (x 2)(x 4) u, Math 6366/6367: Optimization and Variational Methods Sample Preliminary Exam Questions 1. Suppose that f : [, L] R is a C 2 -function with f () on (, L) and that you have explicit formulae for

More information

Optimal Control and Its Application to the Life- Cycle Savings Problem

Optimal Control and Its Application to the Life- Cycle Savings Problem Virginia Commonwealth University VCU Scholars Compass Theses and Dissertations Graduate School 216 Optimal Control and Its Application to the Life- Cycle Savings Problem Tracy A. Taylor Virginia Commonwealth

More information

14. Duality. ˆ Upper and lower bounds. ˆ General duality. ˆ Constraint qualifications. ˆ Counterexample. ˆ Complementary slackness.

14. Duality. ˆ Upper and lower bounds. ˆ General duality. ˆ Constraint qualifications. ˆ Counterexample. ˆ Complementary slackness. CS/ECE/ISyE 524 Introduction to Optimization Spring 2016 17 14. Duality ˆ Upper and lower bounds ˆ General duality ˆ Constraint qualifications ˆ Counterexample ˆ Complementary slackness ˆ Examples ˆ Sensitivity

More information

Static and Dynamic Optimization (42111)

Static and Dynamic Optimization (42111) Static and Dynamic Optimization (421) Niels Kjølstad Poulsen Build. 0b, room 01 Section for Dynamical Systems Dept. of Applied Mathematics and Computer Science The Technical University of Denmark Email:

More information

Optimal Control Theory - Module 3 - Maximum Principle

Optimal Control Theory - Module 3 - Maximum Principle Optimal Control Theory - Module 3 - Maximum Principle Fall, 215 - University of Notre Dame 7.1 - Statement of Maximum Principle Consider the problem of minimizing J(u, t f ) = f t L(x, u)dt subject to

More information

Game Theory Extra Lecture 1 (BoB)

Game Theory Extra Lecture 1 (BoB) Game Theory 2014 Extra Lecture 1 (BoB) Differential games Tools from optimal control Dynamic programming Hamilton-Jacobi-Bellman-Isaacs equation Zerosum linear quadratic games and H control Baser/Olsder,

More information

Lecture 6. Foundations of LMIs in System and Control Theory

Lecture 6. Foundations of LMIs in System and Control Theory Lecture 6. Foundations of LMIs in System and Control Theory Ivan Papusha CDS270 2: Mathematical Methods in Control and System Engineering May 4, 2015 1 / 22 Logistics hw5 due this Wed, May 6 do an easy

More information

Principles of Optimal Control Spring 2008

Principles of Optimal Control Spring 2008 MIT OpenCourseWare http://ocw.mit.edu 16.323 Principles of Optimal Control Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 16.323 Lecture

More information

Nonlinear Control Systems

Nonlinear Control Systems Nonlinear Control Systems António Pedro Aguiar pedro@isr.ist.utl.pt 3. Fundamental properties IST-DEEC PhD Course http://users.isr.ist.utl.pt/%7epedro/ncs2012/ 2012 1 Example Consider the system ẋ = f

More information

Homework Solution # 3

Homework Solution # 3 ECSE 644 Optimal Control Feb, 4 Due: Feb 17, 4 (Tuesday) Homework Solution # 3 1 (5%) Consider the discrete nonlinear control system in Homework # For the optimal control and trajectory that you have found

More information

Hamiltonian Systems of Negative Curvature are Hyperbolic

Hamiltonian Systems of Negative Curvature are Hyperbolic Hamiltonian Systems of Negative Curvature are Hyperbolic A. A. Agrachev N. N. Chtcherbakova Abstract The curvature and the reduced curvature are basic differential invariants of the pair: Hamiltonian system,

More information

On continuous time contract theory

On continuous time contract theory Ecole Polytechnique, France Journée de rentrée du CMAP, 3 octobre, 218 Outline 1 2 Semimartingale measures on the canonical space Random horizon 2nd order backward SDEs (Static) Principal-Agent Problem

More information

Pontryagin s Minimum Principle 1

Pontryagin s Minimum Principle 1 ECE 680 Fall 2013 Pontryagin s Minimum Principle 1 In this handout, we provide a derivation of the minimum principle of Pontryagin, which is a generalization of the Euler-Lagrange equations that also includes

More information

A SIMPLE PARALLEL ALGORITHM WITH AN O(1/T ) CONVERGENCE RATE FOR GENERAL CONVEX PROGRAMS

A SIMPLE PARALLEL ALGORITHM WITH AN O(1/T ) CONVERGENCE RATE FOR GENERAL CONVEX PROGRAMS A SIMPLE PARALLEL ALGORITHM WITH AN O(/T ) CONVERGENCE RATE FOR GENERAL CONVEX PROGRAMS HAO YU AND MICHAEL J. NEELY Abstract. This paper considers convex programs with a general (possibly non-differentiable)

More information

5. Duality. Lagrangian

5. Duality. Lagrangian 5. Duality Convex Optimization Boyd & Vandenberghe Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized

More information

Notes on Control Theory

Notes on Control Theory Notes on Control Theory max t 1 f t, x t, u t dt # ẋ g t, x t, u t # t 0, t 1, x t 0 x 0 fixed, t 1 can be. x t 1 maybefreeorfixed The choice variable is a function u t which is piecewise continuous, that

More information

Leveraging Dynamical System Theory to Incorporate Design Constraints in Multidisciplinary Design

Leveraging Dynamical System Theory to Incorporate Design Constraints in Multidisciplinary Design Leveraging Dynamical System Theory to Incorporate Design Constraints in Multidisciplinary Design Bradley A. Steinfeldt and Robert D. Braun Georgia Institute of Technology, Atlanta, GA 3332-15 This work

More information

c 2018 Society for Industrial and Applied Mathematics

c 2018 Society for Industrial and Applied Mathematics SIAM J. CONTROL OPTIM. Vol. 56, No. 2, pp. 1386 1411 c 2018 Society for Industrial and Applied Mathematics CONVERGENCE RATE FOR A GAUSS COLLOCATION METHOD APPLIED TO CONSTRAINED OPTIMAL CONTROL WILLIAM

More information

Lecture Note 7: Switching Stabilization via Control-Lyapunov Function

Lecture Note 7: Switching Stabilization via Control-Lyapunov Function ECE7850: Hybrid Systems:Theory and Applications Lecture Note 7: Switching Stabilization via Control-Lyapunov Function Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio

More information

Kalman Filter and Parameter Identification. Florian Herzog

Kalman Filter and Parameter Identification. Florian Herzog Kalman Filter and Parameter Identification Florian Herzog 2013 Continuous-time Kalman Filter In this chapter, we shall use stochastic processes with independent increments w 1 (.) and w 2 (.) at the input

More information

Optimal Control of Autonomous Vehicles Approaching A Traffic Light

Optimal Control of Autonomous Vehicles Approaching A Traffic Light 1 Optimal Control of Autonomous Vehicles Approaching A Traffic Light Xiangyu Meng Christos G Cassras arxiv:1896v1 [eesssp] 6 Feb 18 Abstract This paper devotes to the development of an optimal acceleration/speed

More information

DYNAMIC LECTURE 5: DISCRETE TIME INTERTEMPORAL OPTIMIZATION

DYNAMIC LECTURE 5: DISCRETE TIME INTERTEMPORAL OPTIMIZATION DYNAMIC LECTURE 5: DISCRETE TIME INTERTEMPORAL OPTIMIZATION UNIVERSITY OF MARYLAND: ECON 600. Alternative Methods of Discrete Time Intertemporal Optimization We will start by solving a discrete time intertemporal

More information

Observability. Dynamic Systems. Lecture 2 Observability. Observability, continuous time: Observability, discrete time: = h (2) (x, u, u)

Observability. Dynamic Systems. Lecture 2 Observability. Observability, continuous time: Observability, discrete time: = h (2) (x, u, u) Observability Dynamic Systems Lecture 2 Observability Continuous time model: Discrete time model: ẋ(t) = f (x(t), u(t)), y(t) = h(x(t), u(t)) x(t + 1) = f (x(t), u(t)), y(t) = h(x(t)) Reglerteknik, ISY,

More information

Cyber-Physical Systems Modeling and Simulation of Continuous Systems

Cyber-Physical Systems Modeling and Simulation of Continuous Systems Cyber-Physical Systems Modeling and Simulation of Continuous Systems Matthias Althoff TU München 29. May 2015 Matthias Althoff Modeling and Simulation of Cont. Systems 29. May 2015 1 / 38 Ordinary Differential

More information

Lecture 1: Overview, Hamiltonians and Phase Diagrams. ECO 521: Advanced Macroeconomics I. Benjamin Moll. Princeton University, Fall

Lecture 1: Overview, Hamiltonians and Phase Diagrams. ECO 521: Advanced Macroeconomics I. Benjamin Moll. Princeton University, Fall Lecture 1: Overview, Hamiltonians and Phase Diagrams ECO 521: Advanced Macroeconomics I Benjamin Moll Princeton University, Fall 2016 1 Course Overview Two Parts: (1) Substance: income and wealth distribution

More information

Complicated behavior of dynamical systems. Mathematical methods and computer experiments.

Complicated behavior of dynamical systems. Mathematical methods and computer experiments. Complicated behavior of dynamical systems. Mathematical methods and computer experiments. Kuznetsov N.V. 1, Leonov G.A. 1, and Seledzhi S.M. 1 St.Petersburg State University Universitetsky pr. 28 198504

More information

Lecture: Duality.

Lecture: Duality. Lecture: Duality http://bicmr.pku.edu.cn/~wenzw/opt-2016-fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghe s lecture notes Introduction 2/35 Lagrange dual problem weak and strong

More information

Principles of Optimal Control Spring 2008

Principles of Optimal Control Spring 2008 MIT OpenCourseWare http://ocw.mit.edu 16.323 Principles of Optimal Control Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 16.323 Lecture

More information

Nonlinear Control Lecture # 14 Input-Output Stability. Nonlinear Control

Nonlinear Control Lecture # 14 Input-Output Stability. Nonlinear Control Nonlinear Control Lecture # 14 Input-Output Stability L Stability Input-Output Models: y = Hu u(t) is a piecewise continuous function of t and belongs to a linear space of signals The space of bounded

More information

Continuation from a flat to a round Earth model in the coplanar orbit transfer problem

Continuation from a flat to a round Earth model in the coplanar orbit transfer problem Continuation from a flat to a round Earth model in the coplanar orbit transfer problem M. Cerf 1, T. Haberkorn, Emmanuel Trélat 1 1 EADS Astrium, les Mureaux 2 MAPMO, Université d Orléans First Industrial

More information

Finite Element Clifford Algebra: A New Toolkit for Evolution Problems

Finite Element Clifford Algebra: A New Toolkit for Evolution Problems Finite Element Clifford Algebra: A New Toolkit for Evolution Problems Andrew Gillette joint work with Michael Holst Department of Mathematics University of California, San Diego http://ccom.ucsd.edu/ agillette/

More information

Exponential Integrators

Exponential Integrators Exponential Integrators John C. Bowman (University of Alberta) May 22, 2007 www.math.ualberta.ca/ bowman/talks 1 Exponential Integrators Outline Exponential Euler History Generalizations Stationary Green

More information

Lecture 11 Optimal Control

Lecture 11 Optimal Control Lecture 11 Optimal Control The Maximum Principle Revisited Examples Numerical methods/optimica Examples, Lab 3 Material Lecture slides, including material by J. Åkesson, Automatic Control LTH Glad & Ljung,

More information

MEAN FIELD GAMES WITH MAJOR AND MINOR PLAYERS

MEAN FIELD GAMES WITH MAJOR AND MINOR PLAYERS MEAN FIELD GAMES WITH MAJOR AND MINOR PLAYERS René Carmona Department of Operations Research & Financial Engineering PACM Princeton University CEMRACS - Luminy, July 17, 217 MFG WITH MAJOR AND MINOR PLAYERS

More information

Inexact Newton Methods and Nonlinear Constrained Optimization

Inexact Newton Methods and Nonlinear Constrained Optimization Inexact Newton Methods and Nonlinear Constrained Optimization Frank E. Curtis EPSRC Symposium Capstone Conference Warwick Mathematics Institute July 2, 2009 Outline PDE-Constrained Optimization Newton

More information

LINEAR-CONVEX CONTROL AND DUALITY

LINEAR-CONVEX CONTROL AND DUALITY 1 LINEAR-CONVEX CONTROL AND DUALITY R.T. Rockafellar Department of Mathematics, University of Washington Seattle, WA 98195-4350, USA Email: rtr@math.washington.edu R. Goebel 3518 NE 42 St., Seattle, WA

More information