Top Banner
Vehicle Propulsion Systems Lecture 7 Non Electric Hybrid Propulsion Systems Lars Eriksson Professor Vehicular Systems Link ¨ oping University May 3, 2016 2 / 48 Outline Repetition Short Term Storage Hybrid-Inertial Propulsion Systems Basic principles Design principles Modeling Continuously Variable Transmission Hybrid-Hydraulic Propulsion Systems Basics Modeling Hydraulic Pumps and Motors Pneumatic Hybrid Engine Systems Case studies 3 / 48 Hybrid Electrical Vehicles – Parallel I Two parallel energy paths I One state in QSS framework, state of charge 4 / 48 Hybrid Electrical Vehicles – Serial I Two paths working in parallel I Decoupled through the battery I Two states in QSS framework, state of charge & Engine speed 5 / 48 Optimization, Optimal Control, Dynamic Programming What gear ratios give the lowest fuel consumption for a given drivingcycle? –Problem presented in appendix 8.1 Problem characteristics I Countable number of free variables, i g,j , j [1, 5] I A “computable” cost, m f (··· ) I A “computable” set of constraints, model and cycle I The formulated problem min i g,j , j [1,5] m f (i g,1 , i g,2 , i g,3 , i g,4 , i g,5 ) s.t. model and cycle is fulfilled 6 / 48 Optimal Control – Problem Motivation Car with gas pedal u(t ) as control input: How to drive from A to B on a given time with minimum fuel consumption? I Infinite dimensional decision variable u(t ). I Cost function R t f 0 ˙ m f (t )dt I Constraints: I Model of the car (the vehicle motion equation) m v d dt v (t ) = F t (v (t ), u(t )) -(F a (v (t )) + F r (v (t )) + F g (x (t ))) d dt x (t ) = v (t ) ˙ m f = f (v (t ), u(t )) I Starting point x (0)= A I End point x (t f )= B I Speed limits v (t ) g(x (t ) I Limited control action 0 u(t ) 1 7 / 48 General problem formulation I Performance index J (u)= φ(x (t b ), t b )+ Z t b ta L(x (t ), u(t ), t )dt I System model (constraints) d dt x = f (x (t ), u(t ), t ), x (t a )= x a I State and control constraints u(t ) U(t ) x (t ) X (t ) 8 / 48 Dynamic programming – Problem Formulation I Optimal control problem min J (u)= φ(x (t b ), t b )+ Z t b ta L(x (t ), u(t ), t )dt s.t . d dt x = f (x (t ), u(t ), t ) x (t a )= x a u(t ) U(t ) x (t ) X (t ) I x (t ), u(t ) functions on t [t a , t b ] I Search an approximation to the solution by discretizing I the state space x (t ) I and maybe the control signal u(t ) in both amplitude and time. I The result is a combinatorial (network) problem 9 / 48
6

Deterministic Dynamic Programming – BasicDeterministic Dynamic Programming – Basic algorithm J(x0) = gN(xN) + NX1 k=0 gk(xk;uk) xk+1 = fk(xk;uk) Algorithm idea: Start at the end

May 24, 2020

Download

Documents

dariahiddleston
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Deterministic Dynamic Programming – BasicDeterministic Dynamic Programming – Basic algorithm J(x0) = gN(xN) + NX1 k=0 gk(xk;uk) xk+1 = fk(xk;uk) Algorithm idea: Start at the end

Vehicle Propulsion SystemsLecture 7

Non Electric Hybrid Propulsion Systems

Lars ErikssonProfessor

Vehicular SystemsLinkoping University

May 3, 2016

2 / 48

OutlineRepetition

Short Term Storage

Hybrid-Inertial Propulsion SystemsBasic principlesDesign principlesModelingContinuously Variable Transmission

Hybrid-Hydraulic Propulsion SystemsBasicsModeling

Hydraulic Pumps and Motors

Pneumatic Hybrid Engine Systems

Case studies

3 / 48

Hybrid Electrical Vehicles – Parallel

I Two parallel energy pathsI One state in QSS framework, state of charge

4 / 48

Hybrid Electrical Vehicles – Serial

I Two paths working in parallelI Decoupled through the batteryI Two states in QSS framework, state of charge & Engine

speed

5 / 48

Optimization, Optimal Control, Dynamic ProgrammingWhat gear ratios give the lowest fuel consumption for a givendrivingcycle?–Problem presented in appendix 8.1

Problem characteristicsI Countable number of free variables, ig,j , j ∈ [1,5]I A “computable” cost, mf (· · · )I A “computable” set of constraints, model and cycleI The formulated problem

minig,j , j∈[1,5]

mf (ig,1, ig,2, ig,3, ig,4, ig,5)

s.t. model and cycle is fulfilled

6 / 48

Optimal Control – Problem Motivation

Car with gas pedal u(t) as control input:How to drive from A to B on a given time with minimum fuelconsumption?

I Infinite dimensional decision variable u(t).I Cost function

∫ tf0 mf (t)dt

I Constraints:I Model of the car (the vehicle motion equation)

mvddt v(t) = Ft (v(t),u(t)) −(Fa(v(t)) + Fr (v(t)) + Fg(x(t)))

ddt x(t) = v(t)

mf = f (v(t),u(t))

I Starting point x(0) = AI End point x(tf ) = BI Speed limits v(t) ≤ g(x(t)I Limited control action 0 ≤ u(t) ≤ 1

7 / 48

General problem formulation

I Performance index

J(u) = φ(x(tb), tb) +

∫ tb

taL(x(t),u(t), t)dt

I System model (constraints)

ddt

x = f (x(t),u(t), t), x(ta) = xa

I State and control constraints

u(t) ∈ U(t)

x(t) ∈ X (t)

8 / 48

Dynamic programming – Problem FormulationI Optimal control problem

min J(u) = φ(x(tb), tb) +

∫ tb

taL(x(t),u(t), t)dt

s.t .ddt

x = f (x(t),u(t), t)

x(ta) = xa

u(t) ∈ U(t)x(t) ∈ X (t)

I x(t), u(t) functions on t ∈ [ta, tb]I Search an approximation to the solution by discretizing

I the state space x(t)I and maybe the control signal u(t)

in both amplitude and time.I The result is a combinatorial (network) problem

9 / 48

Page 2: Deterministic Dynamic Programming – BasicDeterministic Dynamic Programming – Basic algorithm J(x0) = gN(xN) + NX1 k=0 gk(xk;uk) xk+1 = fk(xk;uk) Algorithm idea: Start at the end

Deterministic Dynamic Programming – Basic algorithm

J(x0) = gN(xN) +N−1∑k=0

gk (xk ,uk )

xk+1 = fk (xk ,uk )

Algorithm idea:Start at the end and proceed backwards in time to evaluate theoptimal cost-to-go and the corresponding control signal.

0 1 2 t

x

k =

ta tb

N − 1 N

10 / 48

Deterministic Dynamic Programming – BasicAlgorithm

Graphical illustration of the solution procedure

2

3

2

1

2

0

1

0 1 N2

1

2

3

2

1

0

0

2

4

x

k =

ta tb

N − 1 t

JN(xN)

11 / 48

Arc Cost Calculations

There are two ways for calculating the arc costsI Calculate the exact control signal and cost for each arc.

–Quasi-static approachI Make a grid over the control signal and interpolate the cost

for each arc.–Forward calculation approach

Matlab implementation – it is important to utilize matrixcalculations

I Calculate the whole bundle of arcs in one stepI Add boundary and constraint checks

2D and 3D grid examples on whiteboard

12 / 48

Parallel Hybrid Example

I Fuel-optimal torque split factor u(SOC, t) = Te−motorTgearbox

I ECE cycleI Constraints SOC(t = tf ) ≥ 0.6, SOC ∈ [0.5,0.7]

13 / 48

OutlineRepetition

Short Term Storage

Hybrid-Inertial Propulsion SystemsBasic principlesDesign principlesModelingContinuously Variable Transmission

Hybrid-Hydraulic Propulsion SystemsBasicsModeling

Hydraulic Pumps and Motors

Pneumatic Hybrid Engine Systems

Case studies

14 / 48

Examples of Short Term Storage Systems

15 / 48

Short Term Storage – F1

2009 FIA allowed the usage of 60 kW, KERS (Kinetic EnergyRecovery System) in F1.Technologies:

I FlywheelI Super-Caps, Ultra-CapsI Batteries

2014, will allow KERS units with 120 kilowatts (160 bhp).–To balance the sport’s move from 2.4 l V8 engines to 1.6 l V6engines.

16 / 48

Basic Principles for Hybrid SystemsI Kinetic energy recoveryI Use “best” points – Duty cycle.

I Run engine (fuel converter) at its optimal point.I Shut-off the engine.

Engine Speed [rpm]

Eng

ine

Tor

que

[Nm

]

Engine efficiency map

0 1000 2000 3000 4000 5000 60000

50

100

150

200

250

300

350

17 / 48

Page 3: Deterministic Dynamic Programming – BasicDeterministic Dynamic Programming – Basic algorithm J(x0) = gN(xN) + NX1 k=0 gk(xk;uk) xk+1 = fk(xk;uk) Algorithm idea: Start at the end

Power and Energy Densities

Asymptotic power and energy density – The Principle

18 / 48

OutlineRepetition

Short Term Storage

Hybrid-Inertial Propulsion SystemsBasic principlesDesign principlesModelingContinuously Variable Transmission

Hybrid-Hydraulic Propulsion SystemsBasicsModeling

Hydraulic Pumps and Motors

Pneumatic Hybrid Engine Systems

Case studies

19 / 48

Causality for a hybrid-inertial propulsion system

20 / 48

Flywheel accumulator

I Energy stored (Θf = Jf ):

Ef =12

Θf ω2f

I Wheel inertia

Θf = ρb∫

Arear2 2π r dr = . . . =

π

2ρb

d4

16(1− q4)

21 / 48

Flywheel accumulator – Design principle

I Energy stored (SOC):

Ef =12

Θf ω2f

I Wheel inertia

Θf = ρb∫

Arear2 2π r dr = . . . =

π

2ρb

d4

16(1− q4)

I Wheel Massmf = π ρb d2 (1− q2)

I Energy to mass ratio

Ef

mf=

d2

16(1 + q2)ω2

f =u2

4(1 + q2)

22 / 48

Quasistatic Modeling of FW Accumulators

Flywheel speed (SOC) P2(t) – power out, Pl(t) – power loss

Θf ω2(t)ddtω2(t) = −P2(t)− Pl(t)

23 / 48

Power losses as a function of speedAir resistance and bearing losses

24 / 48

Continuously Variable Transmission (CVT)

25 / 48

Page 4: Deterministic Dynamic Programming – BasicDeterministic Dynamic Programming – Basic algorithm J(x0) = gN(xN) + NX1 k=0 gk(xk;uk) xk+1 = fk(xk;uk) Algorithm idea: Start at the end

CVT Principle

26 / 48

CVT ModelingI Transmission (gear) ratio ν, speeds and transmitted

torques

ω1(t) =ν(t)ω2(t)Tt1(t) =ν (Tt2(t)− Tl(t))

I Newtons second law for the two pulleys

Θ1ddtω1(t) =T1(t)− Tt1(t)

Θ2ddtω2(t) =T2(t)− Tt2(t)

I System of equations give

T1(t) = Tl(t) +T2(t)ν(t)

+ΘCVT (t)ν(t)

ddtω2(t) + Θ1

ddtν(t)ω2(t)

27 / 48

CVT ModelingI Transmission (gear) ratio ν, speeds and transmitted

torques

ω1(t) =ν(t)ω2(t)Tt1(t) =ν (Tt2(t)− Tl(t))

I An alternative to model the losses, is to use an efficiencydefinition.

28 / 48

Efficiencies for a Push-Belt CVT

29 / 48

OutlineRepetition

Short Term Storage

Hybrid-Inertial Propulsion SystemsBasic principlesDesign principlesModelingContinuously Variable Transmission

Hybrid-Hydraulic Propulsion SystemsBasicsModeling

Hydraulic Pumps and Motors

Pneumatic Hybrid Engine Systems

Case studies

30 / 48

Examples of Short Term Storage Systems

31 / 48

Causality for a hybrid-hydraulic propulsion system

32 / 48

Modeling of a Hydraulic Accumulator

Modeling principle–Energy balance

mg cvddtθg(t) = −p

ddt

Vg(t)−h Aw (θg(t)−θw )

–Mass balance(=volume for incompressible fluid)

ddt

Vg(t) = Q2(t)

–Ideal gas law

pg(t) =mg Rg θg(t)

Vg(t)

Power generation

P2(t) = p2(t) Q2(t)

33 / 48

Page 5: Deterministic Dynamic Programming – BasicDeterministic Dynamic Programming – Basic algorithm J(x0) = gN(xN) + NX1 k=0 gk(xk;uk) xk+1 = fk(xk;uk) Algorithm idea: Start at the end

Model SimplificationSimplifications made in thermodynamic equations to get asimple state equation.

I Assuming steady state conditions.–Eliminating θg and the volume change gives

p2(t) =h Aw θw mg Rg

Vg(t) h Aw + mg Rg Q2(t)

I Combining this with the power output gives

Q2(t) =Vg(t)mg

h Aw P2(t)Rg θw h Aw − Rg P2(t)

I Integrating Q2(t) gives Vg as the state in the model.I Modeling of the hydraulic systems efficiency, see the book.I A detail for the assignment

–This simplification can give problems in the simulation ifparameter values are off. (Division by zero.)

34 / 48

OutlineRepetition

Short Term Storage

Hybrid-Inertial Propulsion SystemsBasic principlesDesign principlesModelingContinuously Variable Transmission

Hybrid-Hydraulic Propulsion SystemsBasicsModeling

Hydraulic Pumps and Motors

Pneumatic Hybrid Engine Systems

Case studies

35 / 48

Hydraulic Pumps

36 / 48

Modeling of Hydraulic Motors

I Efficiency modeling

P1(t) =P2(t)

ηhm(ω2(t),T2(t)), P2(t) > 0

P1(t) =P2(t) ηhm(ω2(t),−|T2|(t)), P2(t) < 0

I Willans line modeling, describing the loss

P1(t) =P2(t) + P0

e

I Physical modelingWilson’s approach provided in the book.

37 / 48

OutlineRepetition

Short Term Storage

Hybrid-Inertial Propulsion SystemsBasic principlesDesign principlesModelingContinuously Variable Transmission

Hybrid-Hydraulic Propulsion SystemsBasicsModeling

Hydraulic Pumps and Motors

Pneumatic Hybrid Engine Systems

Case studies

38 / 48

Pneumatic Hybrid Engine System

39 / 48

Conventional SI Engine

Compression and expansion model

p(t) = c v(t)−γ ⇒ log(p(t)) = log(c)− γ log(v(t))

gives lines in the log-log diagram version of the pV-diagram

40 / 48

Super Charged Mode

41 / 48

Page 6: Deterministic Dynamic Programming – BasicDeterministic Dynamic Programming – Basic algorithm J(x0) = gN(xN) + NX1 k=0 gk(xk;uk) xk+1 = fk(xk;uk) Algorithm idea: Start at the end

Under Charged Mode

42 / 48

Pneumatic Brake System

43 / 48

OutlineRepetition

Short Term Storage

Hybrid-Inertial Propulsion SystemsBasic principlesDesign principlesModelingContinuously Variable Transmission

Hybrid-Hydraulic Propulsion SystemsBasicsModeling

Hydraulic Pumps and Motors

Pneumatic Hybrid Engine Systems

Case studies

44 / 48

Case Study 3: ICE and Flywheel Powertrain

I Control of a ICE and Flywheel PowertrainI Switching on and off engine

45 / 48

Problem description

For each constant vehicle speed find the optimal limits forstarting and stopping the engine–Minimize fuel consumption

–Solved through parameter optimization⇒ Map used forcontrol

46 / 48

Case Study 8: Hybrid Pneumatic Engine

I Local optimization of the engine thermodynamic cycleI Different modes to select betweenI Dynamic programming of the mode selection

47 / 48