TY - GEN
T1 - Game-theoretic robust energy coordination for a neighbourhood of smart homes
AU - Zou, Suli
AU - Warrington, Joseph
AU - Lygeros, John
N1 - Publisher Copyright:
© 2019 EUCA.
PY - 2019/6
Y1 - 2019/6
N2 - Scalable coordination algorithms for neighbourhoods of households featuring electric vehicles (EVs) and embedded renewable generation are required in order to achieve safe and efficient operation of local distribution networks without excessive centralization of control decisions. This paper presents a non-cooperative algorithm to coordinate multi-period EV charging amidst uncertainty affecting both the charging dynamics and the intermittent renewable energy supply. The strategy space includes not only nominal EV charging plans, but also a causal system of linear responses to the forecast errors of renewable infeeds. In a setting where the price of electricity from the main grid has a fixed component and a component that depends on the aggregate purchase requirements of the neighbourhood, we prove a condition under which convergence to the unique Nash equilibrium of the associated game is guaranteed. The algorithm relies on an update rule known as the Krasnoselskij iteration, and the convergence proof is based on the non-expansivity property of an associated operator. We demonstrate the algorithm for a group of 100 households.
AB - Scalable coordination algorithms for neighbourhoods of households featuring electric vehicles (EVs) and embedded renewable generation are required in order to achieve safe and efficient operation of local distribution networks without excessive centralization of control decisions. This paper presents a non-cooperative algorithm to coordinate multi-period EV charging amidst uncertainty affecting both the charging dynamics and the intermittent renewable energy supply. The strategy space includes not only nominal EV charging plans, but also a causal system of linear responses to the forecast errors of renewable infeeds. In a setting where the price of electricity from the main grid has a fixed component and a component that depends on the aggregate purchase requirements of the neighbourhood, we prove a condition under which convergence to the unique Nash equilibrium of the associated game is guaranteed. The algorithm relies on an update rule known as the Krasnoselskij iteration, and the convergence proof is based on the non-expansivity property of an associated operator. We demonstrate the algorithm for a group of 100 households.
UR - http://www.scopus.com/inward/record.url?scp=85071538501&partnerID=8YFLogxK
U2 - 10.23919/ECC.2019.8795743
DO - 10.23919/ECC.2019.8795743
M3 - Conference contribution
AN - SCOPUS:85071538501
T3 - 2019 18th European Control Conference, ECC 2019
SP - 3402
EP - 3407
BT - 2019 18th European Control Conference, ECC 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 18th European Control Conference, ECC 2019
Y2 - 25 June 2019 through 28 June 2019
ER -