# American Institute of Mathematical Sciences

February  2019, 2(1): 55-71. doi: 10.3934/mfc.2019005

## Online optimization for residential PV-ESS energy system scheduling

 1 1400 Washington Ave, Mathematics and Statistics Department, Albany, NY 12222, USA 2 251 Fuller Road, Atmospheric Sciences Research Center, Albany, NY 12203, USA

* Corresponding author: Yiming Ying

Published  March 2019

Fund Project: The second author is supported by NSF grant 1816227

This paper studies a residential PV-ESS energy system scheduling problem with electricity purchase cost, storage degradation cost and surplus PV generated cost [2]. This problem can be viewed as an online optimization problem in time $t \in [1, T]$ with switching costs between decision at $t-1$ and $t$. We reformulate the problem into a single variable problem with ${\bf{s}} = (s_1, ..., s_T)^T$, which denotes the storage energy content. We then propose a new algorithm, named Average Receding Horizon Control (ARHC) to solve the PV-ESS energy system scheduling problem. ARHC is an online control algorithm exploiting the prediction information with $W$-steps look-ahead. We proved an upper bound on the dynamic regret for ARHC of order $O(nT/W)$, where $n$ is the dimension of decision space. This bound can be converted to a competitive ratio of order $1+O(1/W)$. This result overcomes the drawback of the classical algorithm Receding Horizon Control (RHC), which has been proved [11] that it may perform bad even with large look ahead $W$. We also provide a lower bound for ARHC of order $O(nT/W^2)$ on the dynamic regret. ARHC is then used to study a real world case in residential PV-ESS energy system scheduling.

Citation: Zhenhuan Yang, Yiming Ying, Qilong Min. Online optimization for residential PV-ESS energy system scheduling. Mathematical Foundations of Computing, 2019, 2 (1) : 55-71. doi: 10.3934/mfc.2019005
##### References:

show all references

##### References:
48 hours experimental setup
Performance of ARHC
48 hours solution comparison of ARHC and offline optimal
Storage size vs cost
 [1] Behzad Azmi, Karl Kunisch. Receding horizon control for the stabilization of the wave equation. Discrete & Continuous Dynamical Systems - A, 2018, 38 (2) : 449-484. doi: 10.3934/dcds.2018021 [2] Fabio Bagagiolo. Optimal control of finite horizon type for a multidimensional delayed switching system. Discrete & Continuous Dynamical Systems - B, 2005, 5 (2) : 239-264. doi: 10.3934/dcdsb.2005.5.239 [3] Fabio Bagagiolo. An infinite horizon optimal control problem for some switching systems. Discrete & Continuous Dynamical Systems - B, 2001, 1 (4) : 443-462. doi: 10.3934/dcdsb.2001.1.443 [4] Jiping Tao, Ronghuan Huang, Tundong Liu. A $2.28$-competitive algorithm for online scheduling on identical machines. Journal of Industrial & Management Optimization, 2015, 11 (1) : 185-198. doi: 10.3934/jimo.2015.11.185 [5] Donglei Du, Tianping Shuai. Errata to:''Optimal preemptive online scheduling to minimize $l_{p}$ norm on two processors''[Journal of Industrial and Management Optimization, 1(3) (2005), 345-351.]. Journal of Industrial & Management Optimization, 2008, 4 (2) : 339-341. doi: 10.3934/jimo.2008.4.339 [6] Weidong Bao, Wenhua Xiao, Haoran Ji, Chao Chen, Xiaomin Zhu, Jianhong Wu. Towards big data processing in clouds: An online cost-minimization approach. Big Data & Information Analytics, 2016, 1 (1) : 15-29. doi: 10.3934/bdia.2016.1.15 [7] Tao Pang, Azmat Hussain. An infinite time horizon portfolio optimization model with delays. Mathematical Control & Related Fields, 2016, 6 (4) : 629-651. doi: 10.3934/mcrf.2016018 [8] Joon Kwon, Panayotis Mertikopoulos. A continuous-time approach to online optimization. Journal of Dynamics & Games, 2017, 4 (2) : 125-148. doi: 10.3934/jdg.2017008 [9] P. Liu, Xiwen Lu. Online scheduling of two uniform machines to minimize total completion times. Journal of Industrial & Management Optimization, 2009, 5 (1) : 95-102. doi: 10.3934/jimo.2009.5.95 [10] Donglei Du, Xiaoyue Jiang, Guochuan Zhang. Optimal preemptive online scheduling to minimize lp norm on two processors. Journal of Industrial & Management Optimization, 2005, 1 (3) : 345-351. doi: 10.3934/jimo.2005.1.345 [11] Lihui Zhang, Xin Zou, Jianxun Qi. A trade-off between time and cost in scheduling repetitive construction projects. Journal of Industrial & Management Optimization, 2015, 11 (4) : 1423-1434. doi: 10.3934/jimo.2015.11.1423 [12] Lars Grüne, Marleen Stieler. Multiobjective model predictive control for stabilizing cost criteria. Discrete & Continuous Dynamical Systems - B, 2019, 24 (8) : 3905-3928. doi: 10.3934/dcdsb.2018336 [13] Jiping Tao, Zhijun Chao, Yugeng Xi. A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times. Journal of Industrial & Management Optimization, 2010, 6 (2) : 269-282. doi: 10.3934/jimo.2010.6.269 [14] Ran Ma, Jiping Tao. An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time. Journal of Industrial & Management Optimization, 2018, 14 (2) : 497-510. doi: 10.3934/jimo.2017057 [15] Luca Schenato, Sandro Zampieri. On rendezvous control with randomly switching communication graphs. Networks & Heterogeneous Media, 2007, 2 (4) : 627-646. doi: 10.3934/nhm.2007.2.627 [16] Thomas I. Seidman. Optimal control of a diffusion/reaction/switching system. Evolution Equations & Control Theory, 2013, 2 (4) : 723-731. doi: 10.3934/eect.2013.2.723 [17] Shahlar F. Maharramov. Necessary optimality conditions for switching control problems. Journal of Industrial & Management Optimization, 2010, 6 (1) : 47-55. doi: 10.3934/jimo.2010.6.47 [18] Naïla Hayek. Infinite-horizon multiobjective optimal control problems for bounded processes. Discrete & Continuous Dynamical Systems - S, 2018, 11 (6) : 1121-1141. doi: 10.3934/dcdss.2018064 [19] Vincenzo Basco, Piermarco Cannarsa, Hélène Frankowska. Necessary conditions for infinite horizon optimal control problems with state constraints. Mathematical Control & Related Fields, 2018, 8 (3&4) : 535-555. doi: 10.3934/mcrf.2018022 [20] Yujing Wang, Changjun Yu, Kok Lay Teo. A new computational strategy for optimal control problem with a cost on changing control. Numerical Algebra, Control & Optimization, 2016, 6 (3) : 339-364. doi: 10.3934/naco.2016016

Impact Factor: