Abstract
The system reconfiguration task is considered for existing power distribution systems and microgrids, in the presence of renewable-based generation and load foresting errors. The system topology is obtained by solving a chance-constrained optimization problem, where loss-of-load (LOL) constraints and Ampacity limits of the distribution lines are enforced. Similar to various distribution system reconfiguration renditions, solving the resultant problem is computationally prohibitive due to the presence of binary line selection variables. Further, lack of closed form expressions for the joint probability distribution of forecasting errors hinders tractability of LOL constraints. Nevertheless, a convex problem re-formulation is developed here by resorting to a scenario approximation technique, and by leveraging the underlying group-sparsity attribute of currents flowing on distribution lines equipped with tie and sectionalizing switches. The novel convex LOL-constrained reconfiguration scheme can also afford a distributed solution using the alternating direction method of multipliers, to address the case where multi-facilities are managed autonomously from the rest of the system.
Introduction
Modern microgrids are increasingly reliant on Distributed Energy Resources (DERs) like solar panels and wind turbines. However, these sources are stochastic; environmental factors like cloud cover or wind gusts cause power generation to fluctuate wildly from forecasted values. Traditional grid reconfiguration—the process of changing the network's topology to minimize power loss or operational costs—faces three major hurdles:
- Complexity: Deciding which lines to use involves binary "on/off" variables, making the problem NP-hard.
- Non-linearity: The physics of power flow (voltage and current relationships) are non-convex.
- Uncertainty: Ensuring a "Loss-of-Load" (LOL) probability of less than 1% is mathematically intractable without perfect closed-form equations for joint probability distributions.
Methodology
The authors propose a computationally tractable formulation using two primary mathematical innovations:
Group Sparsity and the "Group Lasso"
Instead of using binary variables to represent switches, the authors apply a penalty to the $\ell_2$-norm of the currents flowing through the lines. This "Group Lasso" penalty encourages entire groups of variables (the real and imaginary parts of the current on a specific line) to hit exactly zero. If the current is zero, the switch is effectively "open." This transforms a discrete, "jumpy" problem into a smooth, convex one.
Scenario-Based Convex Approximation
To handle the risk of blackouts without complex probability density functions, the authors use a sampling method. They take $K$ historical samples of forecasting errors and convert the probabilistic "chance constraint" into a set of linear constraints. They provide a rigorous lower bound on the number of samples ($K$) required to guarantee a specific reliability level.
Distributed ADMM
To allow different parts of a microgrid (e.g., different campus buildings) to be managed autonomously, the framework utilizes the Alternating Direction Method of Multipliers (ADMM). This allows local controllers to solve their own sub-problems and coordinate with a central manager only at the boundaries.
Experimental Evaluation
The study evaluates the algorithm using a modified IEEE 37-node test feeder. The authors added 8 additional three-phase lines to the standard radial model to create a "meshed" network with more reconfiguration options. Photovoltaic (PV) systems, wind turbines, and controllable diesel generators were added at various nodes.
Synthetic forecasting errors were generated using zero-mean truncated Gaussian distributions, accounting for spatial correlation (e.g., nearby solar panels are likely to be covered by the same cloud).
Key Results and Insights
- Current as a Connectivity Proxy: By forcing currents to be "group sparse," the optimizer naturally identifies the most efficient grid shape without checking every possible combination of switches.
- Reliability vs. Topology: As uncertainty increases, the optimal grid moves away from a radial (tree) structure toward a meshed structure. Meshed grids provide redundant paths, acting as a buffer against forecasting errors.
- Performance: The centralized convex problem was solved in approximately 0.8 seconds on a standard desktop, making it viable for near-real-time operational planning. The distributed ADMM algorithm converged significantly faster than standard sub-gradient methods.
- Risk Management: The model successfully identified configurations that satisfied Ampacity (thermal) limits and LOL constraints even when wind power errors were as high as 20%.
Limitations and Future Work
While the framework is robust, some areas remain for future exploration. The authors used an approximate current-power relationship to maintain convexity; very high-voltage systems might require more complex second-order cone programming (SOCP) relaxations. Additionally, the ADMM algorithm requires tuning a penalty parameter ($\kappa$), which currently benefits from global network knowledge. Finally, integrating fast-acting storage (like supercapacitors) alongside slow-acting reconfiguration remains an open area for refinement.
Summary updated