Competitive prediction-aware online algorithms for energy generation scheduling in microgrids

Abstract

Online decision-making in the presence of uncertain future information is abundant in many problem domains. In the critical problem of energy generation scheduling for microgrids, one needs to decide when to switch energy supply between a cheaper local generator with startup cost and the costlier on-demand external grid, considering intermittent renewable generation and fluctuating demands. Without knowledge of future input, competitive online algorithms are appealing as they provide optimality guarantees against the optimal offline solution. In practice, however, future input, e.g., wind generation, is often predictable within a limited time window, and can be exploited to further improve the competitiveness of online algorithms. In this paper, we exploit the structure of information in the prediction window to design a novel prediction-aware online algorithm for energy generation scheduling in microgrids. Our algorithm achieves the best competitive ratio to date for this important problem, which is at most 3, where 𝑤 is the prediction window size. We also characterize a non-trivial lower bound of the competitive ratio and show that the competitive ratio of our algorithm is only 9% away from the lower bound, when a few hours of prediction is available. Simulation results based on real-world traces corroborate our theoretical analysis and highlight the advantage of our new prediction-aware design.

Blockchain-enabled decentralized privacy-preserving group purchasing for retail energy plans

“…For a general setting with 𝑛 discrete states, the MTS problem is known to have a competitive ratio of 2𝑛 − 1 [2]. An instance of MTS is the energy generation scheduling in microgrids [25,29,31]. [1,28] proposed online algorithms for OCO.…”