×

Distributed bandit online optimisation for energy management in smart grids. (English) Zbl 1534.93155

Summary: This paper presents a distributed optimisation algorithm based on one-point bandit feedback (OPBF) which enables the solving of energy management problems (EMPs) over directed networks. Unlike existing EMPs with known cost functions, the proposed online energy management approach considers a time-varying and unknown cost function, which creates sampling difficulty. To tackle this challenge, a random gradient-free oracle is constructed, allowing for the facilitation of output generation updates. This construction significantly mitigates the need for explicit expressions of the cost function. Furthermore, the proposed algorithm successfully enforces both the supply-demand balance constraint and the generation constraint in EMPs. In order to evaluate performance, this study introduces a performance index referred to as regret, which exhibits sublinear convergence. This finding provides additional evidence that the algorithm can achieve optimal output generation at a rapid convergence rate, subject to certain step-size conditions. Finally, the performance of the algorithm is verified on both a modified 6-bus system and an IEEE 162-bus system. The results demonstrate the effectiveness and efficiency of the proposed algorithm in solving EMPs over directed networks.

MSC:

93B52 Feedback control
93B70 Networked control
Full Text: DOI

References:

[1] Cao, X., & Baar, T. (2022). Decentralized online convex optimization with feedback delays. IEEE Transactions on Automatic Control, 67(6), 2889-2904. · Zbl 1537.93022
[2] Chang, X., Xu, Y., & Sun, H. (2022). A distributed online learning approach for energy management with communication noises. IEEE Transactions on Sustainable Energy, 13(1), 551-566.
[3] Chen, G., & Yang, Q. (2018). An ADMM-based distributed algorithm for economic dispatch in islanded microgrids. IEEE Transactions on Industrial Informatics/A Publication of the IEEE Industrial Electronics Society, 14(9), 3892-3903.
[4] Chen, T., & Giannakis, G. B. (2019). Bandit convex optimization for scalable and dynamic IoT management. IEEE Internet of Things Journal, 6(1), 1276-1286.
[5] Duvvuru, N., & Swarup, K. S. (2011). A hybrid interior point assisted differential evolution algorithm for economic dispatch. IEEE Transactions on Power Systems, 26(2), 541-549.
[6] Fan, Y., Zhang, C., & Song, C. (2018). Sampling-based self-triggered coordination control for multi-agent systems with application to distributed generators. International Journal of Systems Science, 49(15), 3048-3062. · Zbl 1482.93360
[7] Flaxman, A. D., Kalai, A. T., & Mcmahan, H. B. (2004). Online convex optimization in the bandit setting: gradient descent without a gradient (pp. 385-394). Society for Industrial and Applied Mathematics. · Zbl 1297.90117
[8] Guo, F., Li, G., Wen, C., Wang, L., & Meng, Z. (2021). An accelerated distributed gradient-based algorithm for constrained optimization with application to economic dispatch in a large-scale power system. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 51(4), 2041-2053.
[9] Hu, J., Chen, M. Z. Q., Cao, J., & Guerrero, J. M. (2017). Coordinated active power dispatch for a microgrid via distributed lambda iteration. IEEE Journal on Emerging and Selected Topics in Circuits and Systems, 7(2), 250-261.
[10] Huang, H., Shi, M., & Xu, Q. (2020). Consensus-based economic dispatch algorithm in a microgrid via distributed event-triggered control. International Journal of Systems Science, 51(15), 3044-3054. · Zbl 1483.93575
[11] Li, C., Yu, X., Huang, T., & He, X. (2018). Distributed optimal consensus over resource allocation network and its application to dynamical economic dispatch. IEEE Transactions on Neural Networks and Learning Systems, 29(6), 2407-2418.
[12] Li, J., Gu, C., Wu, Z., & Huang, T. (2020). Online learning algorithm for distributed convex optimization with time-varying coupled constraints and bandit feedback. IEEE Transactions on Cybernetics, 52(2), 1009-1020.
[13] Li, J., Li, C., Yu, W., Zhu, X., & Yu, X. (2021). Distributed online bandit learning in dynamic environments over unbalanced digraphs. IEEE Transactions on Network Science and Engineering, 8(4), 3034-3047.
[14] Li, Z., Guo, Q., Sun, H., & Wang, J. (2016). Sufficient conditions for exact relaxation of complementarity constraints for storage-concerned economic dispatch. IEEE Transactions on Power Systems, 31(2), 1653-1654.
[15] Liu, Y., Qu, Z., Xin, H., & Gan, D. (2017). Distributed real-time optimal power flow control in smart grid. IEEE Transactions on Power Systems, 32(5), 3403-3414.
[16] Lu, L., Tu, J., Chau, C.-K., Chen, M., & Lin, X. (2013). Online energy generation scheduling for microgrids with intermittent energy sources and co-generation. ACM SIGMETRICS Performance Evaluation Review, 41(1), 53-66.
[17] Ma, W., Wang, J., Gupta, V., & Chen, C. (2018). Distributed energy management for networked microgrids using online ADMM with regret. IEEE Transactions on Smart Grid, 9(2), 847-856.
[18] Mohseni-Bonab, S. M., Rabiee, A., Mohammadi-Ivatloo, B., Jalilzadeh, S., & Nojavan, S. (2016). A two-point estimate method for uncertainty modeling in multi-objective optimal reactive power dispatch problem. International Transactions on Electrical Energy Systems, 75, 194-204.
[19] Nedic, A., Ozdaglar, A., & Parrilo, P. A. (2010). Constrained consensus and optimization in multi-agent networks. IEEE Transactions on Automatic Control, 55(4), 922-938. · Zbl 1368.90143
[20] Pang, Y., & Hu, G. (2020). Randomized gradient-free distributed optimization methods for a multiagent system with unknown cost function. IEEE Transactions on Automatic Control, 65(1), 333-340. · Zbl 1483.90181
[21] Qiu, Q., Yang, F., & Zhu, Y. (2021). Cyber-attack localisation and tolerant control for microgrid energy management system based on set-membership estimation. International Journal of Systems Science, 52(6), 1206-1222. · Zbl 1483.93238
[22] Radhakrishnan, B. M., & Srinivasan, D. (2016). A multi-agent based distributed energy management scheme for smart grid applications. Energy, 103, 192-204.
[23] Wang, C., Xu, S., Yuan, D., Zhang, B., & Zhang, Z. (2022). Push-sum distributed online optimization with bandit feedback. IEEE Transactions on Cybernetics, 52(4), 2263-2273.
[24] Xi, C., & Khan, U. A. (2017). Distributed subgradient projection algorithm over directed graphs. IEEE Transactions on Automatic Control, 62(8), 3986-3992. · Zbl 1373.90110
[25] Xie, J., & Cao, C. (2017). Non-convex economic dispatch of a virtual power plant via a distributed randomized gradient-free algorithm. Energies, 10(7), 1051.
[26] Xie, J., Yu, Q., & Cao, C. (2018). A distributed randomized gradient-free algorithm for the non-convex economic dispatch problem. Energies, 11(1), 244.
[27] Xiong, M., Zhang, B., Yuan, D., Zhang, Y., & Chen, J. (2023). Event-triggered distributed online convex optimization with delayed bandit feedback. Applied Mathematics and Computation, 445, 127865. · Zbl 1511.90327
[28] Yang, Z., Xiang, J., & Li, Y. (2017). Distributed consensus based supply-demand balance algorithm for economic dispatch problem in a smart grid with switching graph. IEEE Transactions on Industrial Electronics, 64(2), 1600-1610.
[29] Yu, J., Li, J., & Chen, G. (2023). Online bandit convex optimisation with stochastic constraints via two-point feedback. International Journal of Systems Science, 54(10), 2089-2105. · Zbl 1522.90110
[30] Zhao, C., Chen, J., He, J., & Cheng, P. (2018). Privacy-preserving consensus-based energy management in smart grids. IEEE Transactions on Signal Processing, 66(23), 6162-6176. · Zbl 1415.94472
[31] Zhao, C., Topcu, U., Li, N., & Low, S. (2014). Design and stability of load-side primary frequency control in power systems. IEEE Transactions on Automatic Control, 59(5), 1177-1189. · Zbl 1360.90057
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.