Online Convex Optimization for Coordinated Long-Term and Short-Term Isolated Microgrid Dispatch
Ning Qi, Yousuf Baker, Bolun Xu

TL;DR
This paper introduces a novel online convex optimization framework for coordinated long-term and short-term dispatch in isolated microgrids with hybrid energy storage, achieving significant cost reductions and robustness.
Contribution
It develops a convex hull approximation for nonconvex storage dynamics, an offline training method for SoC trajectories, and an adaptive online algorithm with proven sublinear regret bounds.
Findings
Reduces microgrid costs by 73.4% compared to existing methods.
Eliminates load loss through reference tracking.
Achieves an additional 2.4% cost saving with the OCO algorithm.
Abstract
This paper proposes a novel non-anticipatory long-short-term coordinated dispatch framework for isolated microgrid with hybrid short-long-duration energy storages (LDES). We introduce a convex hull approximation model for nonconvex LDES electrochemical dynamics, facilitating computational tractability and accuracy. To address temporal coupling in SoC dynamics and long-term contracts, we generate hindsight-optimal state-of-charge (SoC) trajectories of LDES and netloads for offline training. In the online stage, we employ kernel regression to dynamically update the SoC reference and propose an adaptive online convex optimization (OCO) algorithm with SoC reference tracking and expert tracking to mitigate myopia and enable adaptive step-size optimization. We rigorously prove that both long-term and short-term policies achieve sublinear regret bounds over time, which improves with more…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
