Optimal control of the atmospheric re-entry of a space shuttle - - PowerPoint PPT Presentation

optimal control of the atmospheric re entry of a space
SMART_READER_LITE
LIVE PREVIEW

Optimal control of the atmospheric re-entry of a space shuttle - - PowerPoint PPT Presentation

Model Numerical methods System analysis Numerical results Open problems Optimal control of the atmospheric re-entry of a space shuttle Emmanuel Trlat 1 1 MAPMO Universit dOrlans EDF-CEA-INRIA School, 2007 E. Trlat Atmospheric


slide-1
SLIDE 1

Model Numerical methods System analysis Numerical results Open problems

Optimal control of the atmospheric re-entry of a space shuttle

Emmanuel Trélat1

1MAPMO

Université d’Orléans EDF-CEA-INRIA School, 2007

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-2
SLIDE 2

Model Numerical methods System analysis Numerical results Open problems

Optimal control of a space shuttle during its re-entry phase (CNES project) Motivations aeroassisted orbit transfers development of reusable launchers problems of atmospheric re-entry: Mars Sample Return (CNES) Coron-Praly: stabilization. Bonnard-Faubourg-T: optimal control Role of the atmospheric arc reduction of the kinetic energy by friction with the atmosphere steer the engine from an initial point (position + speed) to a final point take into account some state constraints (thermal flux, normal acceleration, dynamic pressure) Control Aerodynamic configuration. Range 30 km < altitude < 120 km.

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-3
SLIDE 3

Model Numerical methods System analysis Numerical results Open problems

Model

Forces Gravity force: −m g Aerodynamic force:

1

drag: 1

2ρSCDv2 2

lift:

1 2ρSCLv2(cos µ

  • j + sin µ

k) Control Bank angle µ (the shuttle is a glider). Optimization criterion Total thermal flux Φ = Z tf

t0

Cq√ρv3dt. ρ(r) = ρ0e−r: atmospheric density.

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-4
SLIDE 4

Model Numerical methods System analysis Numerical results Open problems

System

˙ r = v sin γ ˙ v = −g sin γ − ρ SCD 2m v2 + Ω2r cos L(sin γ cos L − cos γ sin L cos χ) ˙ γ = cos γ “ − g v + v r ” + ρ SCL 2m vcos µ + 2Ω cos L sin χ + Ω2 r cos L v (cos γ cos L + sin γ sin L cos χ) ˙ L = v r cos γ cos χ ˙ l = − v r cos γ sin χ cos L ˙ χ = ρ SCL 2m v cos γ sin µ + v r cos γ tan L sin χ + 2Ω(sin L − tan γ cos L cos χ) + Ω2 r v sin L cos L sin χ cos γ State x = (r, v, γ, L, l, χ) r radius, v relative speed, γ flight angle, L latitude, l longitude, χ azimuth. Control µ (bank angle) System of the form ˙ x = X(x) + u1Y1(x) + u2Y2(x), u2

1 + u2 2 = 1

(with u1 = cos µ, u2 = sin µ)

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-5
SLIDE 5

Model Numerical methods System analysis Numerical results Open problems

State constraints Thermal flux: Φ = Cq√ρv3 Φmax Normal acceleration: γn = γn0CDρv2 γmax

n

Dynamic pressure: P = 1

2ρv2 Pmax initial conditions final conditions altitude 119.82 km 15 km speed 7404.95 m/s 445 m/s flight angle

  • 1.84 deg

free azimuth free free latitude 0 deg 10.99 deg longitude free or fixed to 116.59 deg 166.73 deg

Harpold and Graves method (1979) Saturate the constraints on the state along the flight. → not optimal for the optimization criterion: Φ = Z tf

t0

Cq√ρv3 dt

normal acceleration dynamic pressure thermal flux

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-6
SLIDE 6

Model Numerical methods System analysis Numerical results Open problems

Modelization in the form of an optimal control problem

State: x(t) Control: u(t) Optimal control problem ˙ x(t) = f(x(t), u(t)), x(t) ∈ I Rn, u(t) ∈ Ω ⊂ I Rm, x(0) = x0, x(T) = x1, c(x(t)) 0, min C(T, u), where C(T, u) = Z T f 0(x(t), u(t))dt

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-7
SLIDE 7

Model Numerical methods System analysis Numerical results Open problems

Control system ˙ x(t) = f(x(t), u(t)) (1) Cost C(T, u) = Z T f 0(x(t), u(t))dt Optimal control problem Determine the trajectories x(·) solutions of (1), satisfying x(0) ∈ M0, x(T) ∈ M1, and c(x(t)) 0, and minimizing the cost C(T, u).

Numerical methods

1

direct methods

2

indirect methods

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-8
SLIDE 8

Model Numerical methods System analysis Numerical results Open problems

Direct methods

  • 1. Total discretization

Both state and control are discretized ⇒ finite dimensional nonlinear optimization problem min

g(Z)=0 h(Z)0

F(Z), where Z = (x1, . . . , xN, u1, . . . , un). → Numerical solving: Gradient methods, penalization, SQP (sequential quadratic programming), etc.

  • 2. Hamilton-Jacobi equation

∂S ∂t + H1(x, ∂S ∂x ) = 0, where H1(x, p) = maxu∈Up, f(x, u) − f 0(x, u). → Numerical solving: explicite methods, level set methods, ...

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-9
SLIDE 9

Model Numerical methods System analysis Numerical results Open problems

Indirect methods

Based on the Maximum Principle (Pontryagin, Maurer, Jacobson, etc): H(x, p, p0, u) = p, f(x, u) + p0f 0(x, u) + ηc(x). Maximum Principle Every minimizing trajectory x(·) is the projection of an extremal (x(·), p(·), p0, u(·)) solution of ˙ x = ∂H ∂p , ˙ p = − ∂H ∂x , H(x, p, p0, u) = max

v∈Ω H(x, p, p0, v).

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-10
SLIDE 10

Model Numerical methods System analysis Numerical results Open problems

Indirect methods

Based on the Maximum Principle (Pontryagin, Maurer, Jacobson, etc): H(x, p, p0, u) = p, f(x, u) + p0f 0(x, u) + ηc(x). Maximum Principle Every minimizing trajectory x(·) is the projection of an extremal (x(·), p(·), p0, u(·)) solution of ˙ x = ∂H ∂p , ˙ p = − ∂H ∂x , H(x, p, p0, u) = max

v∈Ω H(x, p, p0, v).

ւ

u(t) = u(x(t), p(t)) “ locally, e.g. under the strict Legendre assumption: ∂2H ∂u2 (x, p, u) negative definite ”

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-11
SLIDE 11

Model Numerical methods System analysis Numerical results Open problems

Indirect methods

Based on the Maximum Principle (Pontryagin, Maurer, Jacobson, etc): H(x, p, p0, u) = p, f(x, u) + p0f 0(x, u) + ηc(x). Maximum Principle Every minimizing trajectory x(·) is the projection of an extremal (x(·), p(·), p0, u(·)) solution of ˙ x = ∂H ∂p , ˙ p = − ∂H ∂x , H(x, p, p0, u) = max

v∈Ω H(x, p, p0, v).

տ ւ

u(t) = u(x(t), p(t)) “ locally, e.g. under the strict Legendre assumption: ∂2H ∂u2 (x, p, u) negative definite ”

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-12
SLIDE 12

Model Numerical methods System analysis Numerical results Open problems

Indirect methods

  • Simple shooting method

The extremals (x, p) are solutions of ˙ x = ∂H ∂p , x(0) = x0, x(T) = x1, ˙ p = − ∂H ∂x , p(0) = p0, where the optimal control maximizes the Hamiltonian. − → Shooting method: determine p0 s.t. x(T) = x1.

  • Multiple shooting method
  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-13
SLIDE 13

Model Numerical methods System analysis Numerical results Open problems

Software: COTCOT (Conditions of Order Two and COnjugate Times) http://www.n7.fr/apo/cotcot/ automatic generation in Fortran of the equations of the maximum principle (automatic differentiation, Adifor); automatic creation of mex files for Matlab; codes Fortran for numerical integration, shooting methods, and conjugate points computation, interfaced with Matlab.

  • B. Bonnard, J.-B. Caillau, E. Trélat, Second order optimality conditions in the smooth case and applications

in optimal control, ESAIM Control Optim. Calc. Var. (2007).

  • B. Bonnard, J.-B. Caillau, E. Trélat, Cotcot: short reference manual, Technical report RT/APO/05/1,

http://www.n7.fr/apo/cotcot.

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-14
SLIDE 14

Model Numerical methods System analysis Numerical results Open problems

Optimal control problem

ւց

Discretization Euler, Runge-Kutta, etc.

Dualization Kuhn-Tucker, then Newton method direct methods Dualization Maximum principle

Discretization Euler, Runge-Kutta, etc, then Newton (shooting method) indirect methods

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-15
SLIDE 15

Model Numerical methods System analysis Numerical results Open problems

Optimal control problem

ւց

Discretization Euler, Runge-Kutta, etc.

Dualization Kuhn-Tucker, then Newton method direct methods

?

← →

Dualization Maximum principle

Discretization Euler, Runge-Kutta, etc, then Newton (shooting method) indirect methods No commutation in general. Commutation for Runge-Kutta methods with positive coefficients (cf Hager, 2000).

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-16
SLIDE 16

Model Numerical methods System analysis Numerical results Open problems

Direct methods indirect methods simple implementation, without a priori knowledge a priori knowledge of the structure of the optimal trajectory not sensitive w.r.t. the initial condition very sensitive w.r.t. the initial condition easy to take into account state constraints difficult to take into account state constraints (globally) optimal controls in closed loop (locally) optimal controls in open loop low to average numerical precision high numerical precision efficient in low dimension efficient in every dimension memory demanding parallel computations local minima problem small domain of convergence hybrid methods continuation methods (homotopic methods) ...

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-17
SLIDE 17

Model Numerical methods System analysis Numerical results Open problems

In aeronautics, we use more frequently shooting methods, more precise but more difficult to make converge. Problem How to make the shooting method converge? Different tools:

1

a priori implementation of a direct method

2

continuation methods

3

geometric study (→ atmospheric re-entry)

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-18
SLIDE 18

Model Numerical methods System analysis Numerical results Open problems

Analysis of the system

˙ r = v sin γ ˙ v = −g sin γ − ρ SCD 2m v2+Ω2r cos L(sin γ cos L − cos γ sin L cos χ) ˙ γ = cos γ “ − g v + v r ” + ρ SCL 2m vcos µ+2Ω cos L sin χ +Ω2 r cos L v (cos γ cos L + sin γ sin L cos χ) ˙ L = v r cos γ cos χ ˙ l = − v r cos γ sin χ cos L ˙ χ = ρ SCL 2m v cos γ sin µ + v r cos γ tan L sin χ +2Ω(sin L − tan γ cos L cos χ) + Ω2 r v sin L cos L sin χ cos γ

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-19
SLIDE 19

Model Numerical methods System analysis Numerical results Open problems

Analysis of the system

System ˙ x = X(x) + u1Y1(x) + u2Y2(x), u2

1 + u2 2 = 1

If the rotation Ω of the planet is neglected: First subsystem (u1 = cos µ) ˙ r = v sin γ ˙ v = −g sin γ − ρ SCD 2m v2 ˙ γ = cos γ “ − g v + v r ” + ρ SCL 2m vu1 Second subsystem (u2 = sin µ) ˙ L = v r cos γ cos χ ˙ l = v r cos γ sin χ cos L ˙ χ = v r cos γ tan L sin χ + ρ SCL 2m v cos γ u2

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-20
SLIDE 20

Model Numerical methods System analysis Numerical results Open problems

Analysis of the system

System ˙ x = X(x) + u1Y1(x) + u2Y2(x), u2

1 + u2 2 = 1

If the rotation Ω of the planet is neglected: First subsystem (u1 = cos µ) ˙ r = v sin γ ˙ v = −g sin γ − ρ SCD 2m v2 ˙ γ = cos γ “ − g v + v r ” + ρ SCL 2m vu1 − → ˙ q = X(q) + u1Y1(q), |u1| 1 where q = @ r v γ 1 A ∈ I R3.

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-21
SLIDE 21

Model Numerical methods System analysis Numerical results Open problems

Recall on the structure of minimal time trajectories

System in I R3: ˙ q = X(q) + uY(q), |u| 1 Theorem

(Bressan, Krener-Schättler, Kupka, Sussmann, ...)

Under certain assumptions on the Lie Brackets: the small time accessible set is boundered by the surfaces formed by the arcs q+q− and q−q+. Every interior point is reached with q−q+q− or q+q−q+. Small time accessible set in I R3.

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-22
SLIDE 22

Model Numerical methods System analysis Numerical results Open problems

Attempt with such a strategy:

500 1000 1500 2 4 6 8 10 12 x 10

4

Altitude (m) 500 1000 1500 2000 4000 6000 8000 Velocity (m/s) 500 1000 1500 !0.5 0.5 Flight angle (rad) 500 1000 1500 0.05 0.1 0.15 0.2 0.25 Latitude (rad) 500 1000 1500 2 2.2 2.4 2.6 2.8 3 Longitude (rad) 500 1000 1500 1.28 1.3 1.32 1.34 1.36 1.38 1.4 1.42 Azimuth (rad)

→ State constraints violated.

200 400 600 800 1000 1200 1400 0.5 1 1.5 2 2.5 3 3.5 Bank angle (rad)

200 400 600 800 1000 1200 1400 1 2 3 x 10

6

Thermal flux (W/m2) 200 400 600 800 1000 1200 1400 50 100 Normal acceleration (m/s2) 200 400 600 800 1000 1200 1400 2 4 6 x 10

4

Dynamic pressure (kPa)

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-23
SLIDE 23

Model Numerical methods System analysis Numerical results Open problems

With state constraints:

System in I R3: ˙ q = X(q) + uY(q), |u| 1, State constraint: c(q) 0. Minimal time problem. Theorem

(Bonnard-Faubourg-T, 2003)

Let q0 ∈ {c = 0}. Assume:

1 At x0, X, Y et [X, Y] form a frame, and [X ± Y, [X, Y]](x0) = aX(x0) + bY(x0) + c[X, Y](x0), with a < 0. 2 The constraint is of order 2 and the boundary control is not saturating.

Then, the boundary arc passing through q0 is locally time minimizing if and only if the arc q− is contained in the nonadmissible domain c 0. In this case, the local minimal time synthesis is of the form q−q+qbq+q−.

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-24
SLIDE 24

Model Numerical methods System analysis Numerical results Open problems

Application to the atmospheric re-entry problem

Problem 1 : free initial longitude. Problem 2 : fixed initial longitude. initial conditions final conditions altitude 119.82 km 15 km speed 7404.95 m/s 445 m/s flight angle

  • 1.84 deg

free azimuth free free latitude 0 deg 10.99 deg longitude free or fixed to 116.59 deg 166.73 deg

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-25
SLIDE 25

Model Numerical methods System analysis Numerical results Open problems

Problem 1: free initial longitude.

500 1000 2 4 6 8 10 12 x 10

4

Altitude (m) 500 1000 2000 4000 6000 8000 Velocity (m/s) 500 1000 !0.3 !0.25 !0.2 !0.15 !0.1 !0.05 0.05 Flight angle (rad) 500 1000 0.05 0.1 0.15 0.2 0.25 Latitude (rad) 500 1000 2.2 2.3 2.4 2.5 2.6 2.7 2.8 2.9 Longitude (rad) 500 1000 0.5 1 1.5 2 Azimuth (rad)

100 200 300 400 500 600 700 800 900 1000 !2 !1 1 2 3 4 Bank angle (rad) seconds

100 200 300 400 500 600 700 800 900 1000 2 4 6 8 x 10

5

Thermal flux (W/m2) 100 200 300 400 500 600 700 800 900 1000 10 20 30 40 Normal acceleration (m/s2) 100 200 300 400 500 600 700 800 900 1000 1 2 3 x 10

4

Dynamic pressure (kPa) seconds

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-26
SLIDE 26

Model Numerical methods System analysis Numerical results Open problems

Problem 2: fixed initial longitude.

500 1000 1500 2 4 6 8 10 12 x 10

4

Altitude (m) 500 1000 1500 2000 4000 6000 8000 Velocity (m/s) 500 1000 1500 !0.5 !0.4 !0.3 !0.2 !0.1 0.1 Flight angle (rad) 500 1000 1500 0.05 0.1 0.15 0.2 0.25 Latitude (rad) 500 1000 1500 2 2.2 2.4 2.6 2.8 3 Longitude (rad) 500 1000 1500 1.5 Azimuth (rad)

200 400 600 800 1000 1200 1400 !1.5 !1 !0.5 0.5 1 1.5 2 2.5 3 3.5 Bank angle (rad) seconds

200 400 600 800 1000 1200 1400 2 4 6 8 x 10

5

Thermal flux (W/m2) 200 400 600 800 1000 1200 1400 10 20 30 Normal acceleration (m/s2) 200 400 600 800 1000 1200 1400 1 2 3 x 10

4

Dynamic pressure (kPa) seconds

  • E. Trélat

Atmospheric re-entry of a space shuttle

slide-27
SLIDE 27

Model Numerical methods System analysis Numerical results Open problems

Several open problems

  • ptimal syntheses in dimension > 3

general conjugate point theory, involving singular arcs and state constraints HJB method for aeronautics problems (study in the pole OPALE) commutation problem "discretization <–> dualization"

  • E. Trélat

Atmospheric re-entry of a space shuttle