Optimal Sizing and Placement of Distributed Storage in Low Voltage Networks
Philipp Fortenbacher, Martin Zellner, G\"oran Andersson

TL;DR
This paper introduces a new linearized optimal power flow algorithm for efficiently sizing and placing distributed storage in low voltage networks, demonstrating its effectiveness in reducing PV curtailment and improving economic viability.
Contribution
The paper presents a novel FBS-OPF algorithm that improves tractability and convergence for storage optimization in LV networks with high PV penetration.
Findings
Distributed storage reduces PV curtailment in LV grids.
FBS-OPF provides near-optimal solutions with good convergence.
Distributed storage is more economically viable than centralized options.
Abstract
This paper proposes a novel algorithm to optimally size and place storage in low voltage (LV) networks based on a linearized multiperiod optimal power flow method which we call forward backward sweep optimal power flow (FBS-OPF). We show that this method has good convergence properties, its solution deviates slightly from the optimum and makes the storage sizing and placement problem tractable for longer investment horizons. We demonstrate the usefulness of our method by assessing the economic viability of distributed and centralized storage in LV grids with a high photovoltaic penetration (PV). As a main result, we quantify that for the CIGRE LV test grid distributed storage configurations are preferable, since they allow for less PV curtailment due to grid constraints.
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.
