Online Feedback Optimization with Applications to Power Systems - - PowerPoint PPT Presentation

online feedback optimization with applications to power
SMART_READER_LITE
LIVE PREVIEW

Online Feedback Optimization with Applications to Power Systems - - PowerPoint PPT Presentation

Online Feedback Optimization with Applications to Power Systems Florian Drfler ETH Zrich European Control Conference 2020 Acknowledgements Lukas Adrian Hauswirth Saverio Bolognani Ortmann Irina Suboti Gabriela Hug Miguel


slide-1
SLIDE 1

Online Feedback Optimization with Applications to Power Systems

Florian Dörfler

ETH Zürich European Control Conference 2020

slide-2
SLIDE 2

Acknowledgements

Adrian Hauswirth Saverio Bolognani

Lukas Ortmann ć “Life Activities Advancement Center”

  • for patients’ electronic cards
  • “Vuk Karadžić diploma“
  • The “Dositeja” reward for studying abroad in the year of
  • The “Dositeja” reward for the extraordinary success in the year of 2009 and 2010
  • Irina Subotić

Gabriela Hug Miguel Picallo Verena Häberle

1 / 31

slide-3
SLIDE 3

feedforward

  • ptimization

Optimization System d estimate u w y

complex specifications & decision

  • ptimal, constrained, & multivariable

strong requirements precise model, full state, disturbance estimate, & computationally intensive

vs. feedback control

Controller System r + u y w −

simple feedback policies suboptimal, unconstrained, & SISO forgiving nature of feedback measurement driven, robust to uncertainty, fast & agile response → typically complementary methods are combined via time-scale separation

Optimization Controller System r + u y −

  • ffline & feedforward
  • real-time & feedback

2 / 31

slide-4
SLIDE 4

Example: power system balancing

  • ffline optimization: dispatch based
  • n forecasts of loads & renewables

50 100 150 200 10 20 30 40 50 60 70 80 90 100 marginal costs in €/MWh Capacity in GW Renewables Nuclear energy Lignite Hard coal Natural gas Fuel oil

  • nline control based on frequency

Frequency Control Power System 50Hz + u y frequency measurement −

re-schedule set-point to mitigate severe forecasting errors (redispatch, reserve, etc.) more uncertainty & fluctuations → infeasible & inefficient to separate optimization & control

50 Hz 51 49 generation load control

[Milano, 2018]

Re-scheduling costs Germany [mio. €]

!!" #$% !&' !&( %%(# %%"& %!() %!*! !"## !"#! !"#$ !"#% !"#& !"#' !"#( !"#) [Bundesnetzagentur, Monitoringbericht 2011-2019] 3 / 31

slide-5
SLIDE 5

Synopsis & proposal for control architecture

power grid: separate decision layers hit limits under increasing uncertainty similar observations in other large-scale & uncertain control systems: process control systems & queuing/routing/infrastructure networks proposal: open

with inputs & outputs

and

  • nline

iterative & non-batch

  • ptimization algorithm as feedback
  • real-time interconnected

control

  • ptimization

algorithm e.g., ˙ u = −∇φ(y, u) dynamical system ˙ x = f(x, u, w) y = h(x, u, w) actuation u measurement y

  • perational

constraints u ∈ U disturbance w

4 / 31

slide-6
SLIDE 6

Historical roots & conceptually related work

process control: reducing the effect of uncertainty in sucessive optimization

Optimizing Control [Garcia & Morari, 1981/84], Self-Optimizing Control [Skogestad, 2000], Modifier Adaptation [Marchetti et. al, 2009], Real-Time Optimization [Bonvin, ed., 2017], ...

extremum-seeking: derivative-free but hard for high dimensions & constraints

[Leblanc, 1922], ...[Wittenmark & Urquhart, 1995], ...[Krstić & Wang, 2000], ..., [Feiling et al., 2018]

MPC with anytime guarantees (though for dynamic optimization): real-time MPC

[Zeilinger et al. 2009], real-time iteration [Diel et al. 2005], [Feller & Ebenbauer 2017], etc.

  • ptimal routing, queuing, & congestion control in communication networks:

e.g., TCP/IP [Kelly et al., 1998/2001], [Low, Paganini, & Doyle 2002], [Srikant 2012], [Low 2017], ...

  • ptimization algorithms as dynamic systems: much early work [Arrow et al., 1958],

[Brockett, 1991], [Bloch et al., 1992], [Helmke & Moore, 1994], ... & recent revival [Holding & Lestas, 2014], [Cherukuri et al., 2017], [Lessard et al., 2016], [Wilson et al., 2016], [Wibisono et al, 2016], ...

recent system theory approaches inspired by output regulation [Lawrence et al. 2018] & robust control methods [Nelson et al. 2017], [Colombino et al. 2018]

5 / 31

slide-7
SLIDE 7

Theory literature inspired by power systems

lots of recent theory development stimulated by power systems problems

[Simpson-Porco et al., 2013], [Bolognani et al, 2015], [Dall’Anese & Simmonetto, 2016], [Hauswirth et al., 2016], [Gan & Low, 2016], [Tang & Low, 2017], ...

A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems

Daniel K. Molzahn,∗ Member, IEEE, Florian D¨

  • rfler,† Member, IEEE, Henrik Sandberg,‡ Member, IEEE,

Steven H. Low,§ Fellow, IEEE, Sambuddha Chakrabarti,¶ Student Member, IEEE, Ross Baldick,¶ Fellow, IEEE, and Javad Lavaei,∗∗ Member, IEEE

Steven Low Enrique Mallada John Simpson-Porco Changhong Zhao Claudio De Persis Nima Monshizadeh Arjan Van der Schaft Marcello Colombino Emiliano Dall’Anese Sairaj Dhople Andrey Bernstein Krishnamurthy Dvijotham Andrea Simonetto Na Li Sergio Grammatico Yue Chen Florian Dörfler Saverio Bolognani Sandro Zampieri Jorge Cortez Henrik Sandberg Karl Johansson Ioannis Lestas Andre Jokic

early adoption: KKT control [Jokic et al, 2009] literature kick-started ∼ 2013 by groups from Caltech, UCSB, UMN, Padova, KTH, & Groningen changing focus: distributed & simple → centralized & complex models/methods implemented in microgrids (NREL, DTU, EPFL, ...) & conceptually also in transactive control pilots (PNNL)

6 / 31

slide-8
SLIDE 8

Overview

algorithms & closed-loop stability analysis projected gradient flows on manifolds robust implementation aspects power system case studies throughout

7 / 31

slide-9
SLIDE 9

ALGORITHMS & CLOSED-LOOP STABILITY ANALYSIS

slide-10
SLIDE 10

Stylized optimization problem & algorithm

simple optimization problem minimize

y,u

φ(y, u) subject to y = h(u) u ∈ U cont.-time projected gradient flow ˙ u = Πg

U

  • −∇φ
  • h(u), u
  • = Πg

U

∂h

∂u I

  • ∇φ(y, u)
  • y=h(u)

Fact: a regular† solution u:[0, ∞]→X converges to critical points if φ has Lip- schitz gradient & compact sublevel sets. projected dynamical system ˙ x ∈ Πg

X [f](x) arg min v∈TxX

v − f(x)g(x)

◮ domain X ◮ vector field f ◮ metric g ◮ tangent cone TX

all sufficiently regular†

† regularity conditions made precise later

8 / 31

slide-11
SLIDE 11

Algorithm in closed-loop with LTI dynamics

  • ptimization problem

minimize

y,u

φ(y, u) subject to y = Hiou + Riow u ∈ U → open & scaled projected gradient flow ˙ u = ΠU

  • −ǫ
  • HT

io I

  • ∇φ(y, u)
  • LTI dynamics

˙ x = Ax + Bu + Ew y = Cx + Du + Fw

  • const. disturbance w & steady-state maps

x = −A−1B

  • His

u −A−1E

  • Rds

w y =

  • D − CA−1B
  • Hio

u +

  • F − CA−1E
  • Rdo

w

ǫ

  • U

u B

  • w

E A ∇u φ D F HT

io∇y φ

y C + x + + + + + − + + −

9 / 31

slide-12
SLIDE 12

Stability, feasibility, & asymptotic optimality

Theorem: Assume that regularity of cost function φ: compact sublevel sets & ℓ-Lipschitz gradient LTI system asymptotically stable: ∃ τ > 0 , ∃ P ≻ 0 : PA + AT P −2τP sufficient time-scale separation (small gain): 0 < ǫ < ǫ⋆

2τ cond(P ) · 1 ℓHio

Then the closed-loop system is stable and globally converges to the critical points of the optimization problem while remaining feasible at all times. Proof: LaSalle/Lyapunov analysis via singular perturbation [Saberi & Khalil ’84] Ψδ(u, e) = δ · eT P e

LTI Lyapunov function

+ (1 − δ) · φ

  • h(u), u
  • bjective function

with parameter δ ∈(0, 1) & steady-state error coordinate e=x − Hisu − Rdsw → derivative ˙ Ψδ(u, e) is non-increasing if ǫ ≤ ǫ⋆ and for optimal choice of δ

10 / 31

slide-13
SLIDE 13

Example: optimal frequency control

dynamic LTI power system model power balancing objective control generation set-points unmeasured load disturbances measurements: frequency + constraint variables (injections & flows)

◮ linearized swing dynamics ◮ 1st-order turbine-governor ◮ primary frequency droop ◮ DC power flow approximation

  • ptimization problem

→ objective: φ(y, u) =cost(u)

economic generation

+ 1

2 max{0, y − y}2 Ξ + 1 2 max{0, y − y}2 Ξ

  • perational limits (line flows, frequency, ...)

→ constraints: actuation u ∈ U & steady-state map y = Hiou + Rdow → control ˙ u = ΠU (. . . ∇φ) ≡ super-charged Automatic Generation Control

11 / 31

slide-14
SLIDE 14

Test case: contingencies in IEEE 118 system

events: generator outage at 100 s & double line tripping at 200 s

50 100 150 200 250 300 2 4 6 Time [s] Power Generation (Gen 37) [p.u.] Setpoint Output 12 / 31

slide-15
SLIDE 15

How conservative is ǫ < ǫ⋆ ?

still stable for ǫ = 2 ǫ⋆

−5 5 ·10−2 Frequency Deviation from f0 [Hz] System Frequency 5 10 15 20 1 2 3 Time [s] Line Power Flow Magnitudes [p.u.] 23→26 90→26 flow limit

  • ther lines

unstable for ǫ = 10 ǫ⋆

−2 2 4 Frequency Deviation from f0 [Hz] System Frequency 5 10 15 20 2 4 Time [s] Line Power Flow Magnitudes [p.u.] 23→26 90→26 flow limit

  • ther lines

Note: conservativeness problem dependent & depends, e.g., on penalty scalings

13 / 31

slide-16
SLIDE 16

Highlights & comparison of approach

Weak assumptions on plant internal stability → no observability / controllability → no passivity or primal-dual structure measurements & steady-state I / O map → no knowledge of disturbances → no full state measurement → no dynamic model Weak assumptions on cost Lipschitz gradient + properness → no (strict/strong) convexity required Parsimonious but powerful setup potentially conservative bound, but → minimal assumptions on

  • ptimization problem & plant

robust & extendable proof → nonlinear dynamics → time-varying disturbances → general algorithms take-away: open online optimization algorithms can be applied in feedback

→ Hauswirth, Bolognani, Hug & Dörfler (2020)

“Timescale Separation in Autonomous Optimization”

→ Menta, Hauswirth, Bolognani, Hug & Dörfler (2018)

“Stability of Dynamic Feedback Optimization with Applications to Power Systems” 14 / 31

slide-17
SLIDE 17

Nonlinear systems & general algorithms

general system dynamics ˙ x = f(x, u) with steady-state map x = h(u) incremental Lyapunov function W(x, u) w.r.t error coordinate x − h(u) ˙ W(x, u) ≤ −γ x − h(u)2 ∇uW(x, u) ≤ ζ x − h(u) variable-metric Q(u) ∈ Sn

+ gradient flow

˙ u = − Q(u)−1 ∇φ(u) examples: Newton method Q(u)=∇2φ(u)

  • r mirror descent Q(u)=∇2ψ(∇ψ(u)

−1)

stability condition: ζℓ

γ ·supuQ(u) −1 < 1

Similar results for algorithms with memory: momentum methods (e.g., heavy-ball) (exp. stable) primal-dual saddle flows

non-examples: bounded-metric

  • r Lipschitz assumption violated

10 20 30 40 50 5 10 15 20 Cost Value Dynamic IC Algebraic IC 20 40 60 80 100 10-10 10-5 100 105 1010 Cost Value Dynamic IC Algebraic IC

cost value

algebraic plant dynamic plant algebraic plant dynamic plant

discontinuous subgradient Nesterov acceleration 15 / 31

slide-18
SLIDE 18

Highly nonlinear & dynamic test case

Nordic system: case study known for voltage collapse (South Sweden ’83) (static) voltage collapse: sequence

  • f events → saddle-node bifurcation

high-fidelity model of Nordic system

◮ RAMSES + Python + MATLAB ◮ state: heavily loaded system & large

power transfers: north → central

◮ load buses with Load Tap Changers ◮ generators equipped with Automatic

Voltage Regulators, Over Excitation Limiters, & speed governor control

g15 g11 g20 g19 g16 g17 g18 g2 g6 g7 g14 g13 g8 g12 g4 g5 g10 g3 g1 g9 4011 4012 1011 1012 1014 1013 1022 1021 2031

cs

4046 4043 4044 4032 4031 4022 4021 4071 4072 4041 1042 1045 1041 4063 4061 1043 1044 4047 4051 4045 4062 400 kV 220 kV 130 kV synchronous condenser CS

NORTH CENTRAL EQUIV. SOUTH

4042 2032 41 1 5 3 2 51 47 42 61 62 63 4 43 46 31 32 22 11 13 12 72 71

16 / 31

slide-19
SLIDE 19

Voltage collapse

event: 250 MW load ramp from t = 500 s to t = 800 s unfortunate control response: non-coordinated + saturation

◮ extra demand is balanced by

primary frequency control

◮ cascade of activation of

  • ver-excitation limiters

◮ load tap changers increase

power demand at load buses

bifurcation: voltage collapse very hard to mitigate via conventional controllers → apply feedback optimization to coordinate set-points

  • f Automatic Voltage Controllers

17 / 31

slide-20
SLIDE 20

Voltage collapse averted !

distance-to-collapse objective : φ = −log det

  • power flow Jacobian
  • 18 / 31
slide-21
SLIDE 21

PROJECTED GRADIENT FLOWS ON MANIFOLDS

slide-22
SLIDE 22

Motivation: steady-state AC power flow

stationary model Ohm’s Law Current Law AC power AC power flow equations

(all variables and parameters are -valued)

imagine constraints slicing this set ⇒ nonlinear, non-convex, disconnected additionally the parameters are ±20% uncertain ...this is only the steady state! graphical illustration of AC power flow

[Hiskens, 2001] [Molzahn, 2016] 19 / 31

slide-23
SLIDE 23

Key insights on physical equality constraint

1.5 1 0.5 q2

  • 0.5
  • 1

1.5 1 0.5 p2

  • 0.5
  • 1

1.2 1 1.4 0.8 0.6 v 2

vdc idc m iI v LI CI GI RI τm θ, ω vf v if τe is Lθ M rf rs rs v iT LT C G Gq C v RT iI

AC power flow is complex but takes the form of a smooth manifold → local tangent plane approximations, local invertibility, & generic LICQ → regularity (algorithmic flexibility)

→ Hauswirth, Bolognani, Hug, & Dörfler (2015)

“Fast power system analysis via implicit linearization of the power flow manifold”

→ Bolognani & Dörfler (2018)

“Generic Existence of Unique Lagrange Multipliers in AC Optimal Power Flow”

AC power flow is attractive steady state for ambient physical dynamics → physics enforce feasibility even for non-exact (e.g., discrete) updates → robustness (algorithm & model)

→ Gross, Arghir, & Dörfler (2018)

“On the steady-state behavior of a nonlinear power system model” 20 / 31

slide-24
SLIDE 24

Feedback optimization on the manifold

challenging specifications

  • n closed-loop trajectories:
  • 1. stay on manifold at all times
  • 2. satisfy constraints at all times
  • 3. converge to optimal solution

feedback

  • ptimization

algorithm ˙ x = Πg

X (−gradφ(x))

physical steady-state power system (AC power flow) Sk + wk =

ℓ 1 zkℓ ∗Vk(V ∗ k − V ∗ ℓ )

renewables loads w generation setpoints measurements

prototypical optimal power flow minimize φ(x) subject to x ∈ X = M ∩ K φ : Rn → R

  • bjective function

M ⊂ Rn AC power flow manifold K ⊂ Rn

  • perational constraints

v

TxX X

projection of trajectory on feasible cone

21 / 31

slide-25
SLIDE 25

Simple low-dimensional case studies ...

...can have simple feasible sets ...or can have really complex sets

v0 = 1 slack bus generator qG ∈ [q, q] vref = 1 load pL(t) pG 1j θ0 = 0

  • 2

0.5 3

v

1 2

pG-pL qG

1 2

  • 1

application demands sophisticated level of generality !

22 / 31

slide-26
SLIDE 26

Projected dynamical systems on irregular domains

Theorem: Consider a Carathéodory solution x : [0, ∞) → X of the initial value problem ˙ x = Πg

X (−gradφ(x)) ,

x(0) = x0 ∈ X . If φ has compact sublevel sets on X, then x(t) converges to the set of critical points of φ on X. Hidden assumption: existence, uniqueness, & completeness of Carathéodory solution x(t) ∈ X in absence of convexity, Euclidean space, ...? X =

  • x : x2

2 = 1 , x1 ≤

√ 2

  • regularity conditions

constraint set vector field metric manifold existence of Krasovski

  • loc. compact
  • loc. bounded

bounded C1 existence of Carathéodory Clarke regular C0 C0 C1 uniqueness of solutions prox regular C0,1 C0,1 C1,1

→ Hauswirth, Bolognani, & Dörfler (2018)

“Projected Dynamical Systems on Irregular Non-Euclidean Domains for Nonlinear Optimization”

→ Hauswirth, Bolognani, Hug, & Dörfler (2016)

“Projected gradient descent on Riemanniann manifolds with applications to online power system optimization” 23 / 31

slide-27
SLIDE 27

ROBUST IMPLEMENTATION ASPECTS

slide-28
SLIDE 28

Robust implementation of projections

projection & integrator → windup → robust anti-windup approximation → saturation often “for free” by physics

K

  • PU

k(·, u) ˙ x = f(x, ·) + − u PU(u) − +

˙ u = ΠU[k(x, ·)](u) K → ∞ disturbance → time-varying domain

f(x) Πt

X f(x)

X(t) X(t + δ)

◮ temporal tangent

cone & vector field

◮ ensure suff. regularity

& tracking certificates

→ Hauswirth, Dörfler, & Teel (2020)

“Anti-Windup Approximations of Oblique Projected Dynamical Systems for Feedback-based Optimization”

handling uncertainty when enforcing non-input constraints : x ∈ X or y ∈ Y

◮ cannot measure state x directly

→ Kalman filtering: estimation & separation

◮ cannot enforce constraints on y =h(u)

by projection (not actuated & h(·) unknown) → soft penalty or dualization + grad flows

(inaccurate, violations, & strong assumptions)

→ project on 1

st order prediction of y =h(u)

y+ ≈ h(u)

  • measured

+ ǫ

∂h ∂u

  • steady-state

I/O sensitivity

w

  • feasible descent

direction

⇒ global convergence to critical points

→ Häberle, Hauswirth, Ortmann, Bolognani, & Dörfler (2020)

“Enforcing Output Constraints in Feedback-based Optimization”

→ Hauswirth, Subotić, Bolognani, Hug, & Dörfler (2018)

“Time-varying Projected Dynamical Systems with Applications...” 24 / 31

slide-29
SLIDE 29

Tracking performance under disturbances

G1 G2 C1 C3 C2 W S Generator Synchronous Condensor Solar Wind

G C S W

  • 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

70 80 90 100 110 120

net demand: load, wind, & solar (discontinuous)

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 20 40 60 80 100 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 0.95 1 1.05 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 0.1 0.2 0.3 25 / 31

slide-30
SLIDE 30

Optimality despite disturbances & uncertainty

transient trajectory feasibility practically exact tracking of ground-truth optimizer

(omniscient & no computation delay)

robustness to model mismatch

(asymptotic optimality under wrong model)

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 100 200 300

  • ffline optimization

feedback optimization model uncertainty feasible ? φ − φ∗ v − v∗ feasible ? φ − φ∗ v − v∗ loads ±40% no 94.6 0.03 yes 0.0 0.0 line params ±20% yes 0.19 0.01 yes 0.01 0.003 2 line failures no

  • 0.12

0.06 yes 0.19 0.007

conclusion: simple algorithm performs extremely well & robust

26 / 31

slide-31
SLIDE 31

EXPERIMENTS

slide-32
SLIDE 32

Experimental case study @ DTU

EVSE 1 EVSE 2 EVSE 3 EVSE 4 EVSE 5 EVSE 6 EVSE 7 EVSE 8

Busbar A Busbar B Busbar A Busbar B 630 kVA 100 kVA

Battery

  • Ext. 117-5

Cable C2 Cable C1 CEE

  • Ext. 117-2
  • Chg. post

Cable D1 PV NEVIC

Busbar A Busbar B Busbar C 150 kVA 100 kVA

Gaia Flexhouse PV Cable B1 Cable B2

Busbar B Busbar B Busbar A 200 kVA

Static load Diesel CEE Aircon Cable A1 Cable A2 PV

Busbar B Busbar A Busbar B

Cable F1 Flexhouse 2 Flexhouse 3 Cable E1 Cable E2 CEE CHP Heatpump 1 Booster Heater Cable F1

Crossbar switch

Load conv.

SYSLAB

breaker overview Building 716 Building 715 Building 319 Building 117

Ship Shore Mach. set

Container 1 Container 2 Container 3

I I I

PCC v1 v2 v3 R1, L1 R2, L2 R3, L3 p1, q1 p2, q2 p3, q3 PV1 PV2 Battery

±8 kVAr

Static load

±6 kVAr ±6 kVAr 0 kVAr 10 kW 0 kVAr 0 kW −15 kW

Voltage [p.u.] 1 0.99 1.06 1.05 0.95

21 min experiment with events

◮ t = 3 min: control turned ON ◮ t ∈ [11, 14] min: Pbatt = 0 kW

base-line controllers decentralized nonlinear proportional droop control

(IEEE 1547.2018)

vi qi

qmax

i

qmin

i

vmin vmax 1

comparison of three controllers

◮ decentralized control ◮ feedforward optimization ◮ feedback optimization → Ortmann, Hauswirth, Caduff, Dörfler, & Bolognani (2020)

“Experimental Validation of Feedback Optimization in Power Distribution Grids” 27 / 31

slide-33
SLIDE 33

Decentralized feedback control

decentralized nonlinear proportional droop control

0.97 1 1.03 1.05 1.07 −5 5 5 10 15 20 0.97 0.98 0.99 1 Time [min] 5 10 15 20 1 2 0.97 0.98 0.99 1 Voltage [p.u.] 1 2 Reactive Power [kVAr] Battery PV2 PV1 constraint violations due to local control saturation & lack of coordination

28 / 31

slide-34
SLIDE 34

Successive feedforward optimization

centralized, omniscient, & successively updated at high sampling rate

0.97 1 1.03 1.05 1.07 −5 5 5 10 15 20 0.97 0.98 0.99 1 Time [min] 5 10 15 20 −2 −1 0.97 0.98 0.99 1 Voltage [p.u.] −2 −1 Reactive Power [kVAr] Battery PV2 PV1 performs well but persistent constraint violation due to model uncertainty

29 / 31

slide-35
SLIDE 35

Feedback optimization

primal-dual flow with 10 s sampling time requiring only model I/O sensitivity ∇h (or an estimate)

0.97 1 1.03 1.05 1.07 −5 5 5 10 15 20 0.97 0.98 0.99 1 Time [min] 5 10 15 20 −6 −4 −2 0.97 0.98 0.99 1 Voltage [p.u.] −4 −2 Reactive Power [kVAr] Battery PV2 PV1 excellent performance & model-free(!) since ∇h(u) approximated by 1 1 1

1 1 1 1 1 1

  • 30 / 31
slide-36
SLIDE 36

CONCLUSIONS

slide-37
SLIDE 37

Conclusions

Summary

  • pen & online feedback optimization algorithms as controllers

approach: projected dynamical systems & time-scale separation unified framework: broad class of systems, algorithms, & programs illustrated throughout with non-trivial power systems case studies Ongoing work & open directions analysis: robustness, performance, stochasticity, sampled-data algorithms: 0th-order, sensitivity estimation, distributed, minmax power systems: more experiments, virtual power plant extensions further app’s: seeking optimality in uncertain & constrained systems It works much better than it should ! We still need to fully grasp why ?

31 / 31

slide-38
SLIDE 38

Thanks !

Florian Dörfler

http://control.ee.ethz.ch/~floriand [link] to related publications