Non-linear MPC Robert Platt Northeastern University NonLinear Model - - PowerPoint PPT Presentation

non linear mpc
SMART_READER_LITE
LIVE PREVIEW

Non-linear MPC Robert Platt Northeastern University NonLinear Model - - PowerPoint PPT Presentation

Non-linear MPC Robert Platt Northeastern University NonLinear Model Predictive Control Given: System: Cost function: where: Initial state: Calculate: U that minimizes J( X,U ) NonLinear Model Predictive Control Given: System: Cost


slide-1
SLIDE 1

Non-linear MPC

Robert Platt Northeastern University

slide-2
SLIDE 2

NonLinear Model Predictive Control

Given:

System: Cost function: where:

Calculate:

Initial state: U that minimizes J(X,U)

slide-3
SLIDE 3

NonLinear Model Predictive Control

Given:

System: Cost function: where:

Calculate:

Initial state: U that minimizes J(X,U)

slide-4
SLIDE 4

NonLinear Model Predictive Control

Given:

System: Cost function: where:

Calculate:

Initial state: U that minimizes J(X,U)

slide-5
SLIDE 5

Minimize: Subject to:

NonLinear Model Predictive Control

But, this is a nonlinear constraint – so how do we solve it now?

slide-6
SLIDE 6

LTV (linear time varying) problem

Given: a nonlinear system: A quadratic cost fn A nominal trajectory: Find: a controller that works nearby nominal trajectory

slide-7
SLIDE 7

Idea: time varying linear system

Linear Time Invariant (LTI): Linear Time Variant (LTV):

Notice time time dependence – each time step is linearized differently

slide-8
SLIDE 8

Linear Time Varying LQR (LTV)

Similar first order taylor series expansion as before:

slide-9
SLIDE 9

Linear Time Varying LQR (LTV)

Similar first order taylor series expansion as before: Solution: solve LQR for this TV system: Resulting controller is linearized about nominal trajectory:

slide-10
SLIDE 10

Linear Time Varying LQR (LTV)

Similar first order taylor series expansion as before: Solution: solve LQR for this TV system: Resulting controller is linearized about nominal trajectory:

Key points: – point linearized about changes on each time step – nominal trajectory does not even need to be feasible! – you DO NEED to know what time step you’re at throughout

slide-11
SLIDE 11

Question

Think about cart-pole We have shown that you can use linearize LQR about an arbitrary trajectory. Can you just linearize about the current operating point on each time step?

slide-12
SLIDE 12

Back to nonlinear control problem...

Minimize: Subject to: LTV LQR only works if you have a nominal trajectory How do you get the nominal trajectory???

slide-13
SLIDE 13

Iterative LQR

Key observation: If: you start with a bad nominal trajectory, run LTV LQR linearized about it, and then integrate forward the resulting locally optimal policy… Then: the resulting trajectory will be better (lower cost) than the nominal trajectory you started with

slide-14
SLIDE 14

Iterative LQR

slide-15
SLIDE 15

Iterative LQR

slide-16
SLIDE 16

Iterative LQR

slide-17
SLIDE 17

Iterative LQR

Why is this not zero? When can we skip these terms?

slide-18
SLIDE 18

Iterative LQR

Why is this not zero? When can we skip these terms? How does this fix problem?

slide-19
SLIDE 19

Iterative LQR

slide-20
SLIDE 20

Iterative LQR

slide-21
SLIDE 21

Iterative LQR

iLQR works well in the MPC context – stabilization to the trajectory will handle most small deviations from nominal – can iterate the process to handle larger deviations