SearcharxivSearch

arXiv · 2409.05086

Exploring the Optimal Size of Grid-forming Energy Storage in an Off-grid Renewable P2H System under Multi-timescale Energy Management

Abstract

Utility-scale off-grid renewable power-to-hydrogen systems (OReP2HS), typically comprising photovoltaic plants, wind turbines, electrolyzers (ELs), and battery energy storage system (BESS), requires at least one component, generally the BESS, working with grid-forming ability to provide frequency and voltage references and regulate them through transient power support. However, existing designs of OReP2HS based on the energy management strategies (EMSs) with 5-min or hourly resolution fail to capture fast transients and may underestimate the BESS size required to ensure adequate grid-forming ability. This paper first proposes a framework of multi-timescale EMS covers from those for power system transient behaviors to second-level EL load adjustments and minute-level intra-day scheduling to coordinate renewable power, BESS, and ELs. Then, an iterative search procedure based on high-fidelity simulation is employed to determine the cost-effective BESS size that satisfies grid-forming, long-term energy balancing over 8760 hours, and emergency support requirements. Case studies based on a planned OReP2HS project in Inner Mongolia, China, show that the proposed EMS yields a base-case LCOH of 33.212 CNY/kg, with CAPEX of BESS accounting for 17.83% of total investment. The optimal BESS capacity represents 13.6% of the rated hourly renewable output and shows a yearly degradation of 4.87%. Sensitivity analysis reveals that reducing the electrolytic load adjustment time step from 90 to 5 seconds and increasing its ramping limit from 1% to 10% rated power per second, the BESS size decreases by 53.57%, and the LCOH decreases to 25.458 CNY/kg. Considering the cost of designing and manufacturing utility-scale ELs with fast load regulation capability, a load adjustment time step of 5 to 10 seconds and a ramping limit of 4-6% rated power per second are recommended.

Explore related subjects

Keep this discovery

BibTeXRIS

Jie Zhu, Yiwei Qiu, Yangjun Zeng, Yi Zhou, Shi Chen, Tianlei Zang, Buxiang Zhou, Zhipeng Yu, Jin Lin. 2024-09-08. Exploring the Optimal Size of Grid-forming Energy Storage in an Off-grid Renewable P2H System under Multi-timescale Energy Management. https://arxiv.org/abs/2409.05086

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC