Linear MPC Robert Platt Northeastern University Linear Model - - PowerPoint PPT Presentation

linear mpc
SMART_READER_LITE
LIVE PREVIEW

Linear MPC Robert Platt Northeastern University Linear Model - - PowerPoint PPT Presentation

Linear MPC Robert Platt Northeastern University Linear Model Predictive Control Drawbacks to LQR: hard to encode constraints suppose you have a hard goal constraint? suppose you have piecewise linear state and action constraints?


slide-1
SLIDE 1

Linear MPC

Robert Platt Northeastern University

slide-2
SLIDE 2

Linear Model Predictive Control

Drawbacks to LQR: hard to encode constraints – suppose you have a hard goal constraint? – suppose you have piecewise linear state and action constraints? Answer: – solve control as a new optimization problem on every time step

slide-3
SLIDE 3

Linear Model Predictive Control

Given:

System: Cost function: where:

Calculate:

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

slide-4
SLIDE 4

Linear Model Predictive Control

Given:

System: Cost function: where:

Calculate:

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

We're going to solve this problem by expressing it explicitly as a quadratic program

slide-5
SLIDE 5

Quadratic program

Minimize: Subject to:

slide-6
SLIDE 6

Quadratic program

Minimize: Subject to: Constants are part of problem statement: x is the variable Problem: find the value of x that minimizes the objective subject to the constraints

slide-7
SLIDE 7

Quadratic program

Quadratic objective function Linear inequality constraints Linear equality constraints Minimize: Subject to:

slide-8
SLIDE 8

Quadratic program

Minimize: Subject to:

slide-9
SLIDE 9

Quadratic program

Minimize: Subject to:

Why?

slide-10
SLIDE 10

Quadratic program

Quadratic objective function

slide-11
SLIDE 11

Quadratic program

Quadratic objective function Inequality constraints

slide-12
SLIDE 12

Quadratic program

Quadratic objective function equality constraints

slide-13
SLIDE 13

QP versus Unconstrained Optimization

Minimize: Subject to: Original QP

slide-14
SLIDE 14

QP versus Unconstrained Optimization

Minimize: Unconstrained version of original QP Subject to:

slide-15
SLIDE 15

QP versus Unconstrained Optimization

Minimize: Unconstrained version of original QP How do we minimize this expression?

slide-16
SLIDE 16

QP versus Unconstrained Optimization

Minimize: Unconstrained version of original QP How do we minimize this expression?

slide-17
SLIDE 17

Linear Model Predictive Control

Minimize: Subject to:

slide-18
SLIDE 18

Linear Model Predictive Control

Minimize: Subject to:

What are the variables?

slide-19
SLIDE 19

Linear Model Predictive Control

Minimize: Subject to: What other constraints might we want add?

slide-20
SLIDE 20

Linear Model Predictive Control

Minimize: Subject to:

slide-21
SLIDE 21

Linear Model Predictive Control

Minimize: Subject to: Can't express these constraints in standard LQR

slide-22
SLIDE 22

Linear MPC Receding Horizon Control

Minimize: Subject to: Re-solve the quadratic program on each time step: – always plan another T time steps into the future