Optimal net-load balancing in smart grids with high PV penetration

Sanmukh R. Kuppannagari, Rajgopal Kannan, Viktor K. Prasanna

TL;DR

This paper introduces a unified optimization framework to balance smart grids by simultaneously managing both power demand (load curtailment) and solar supply (solar curtailment). By treating these as discrete optimization problems, the authors develop fast approximation algorithms that provide near-optimal results with mathematical guarantees, ensuring grid stability even with high levels of volatile solar energy.

What Problem Does This Paper Address?

As solar PV (photovoltaic) installations skyrocket, power grids face a new headache: net-load balancing. Traditionally, grid operators only worried about "load curtailment"—asking customers to use less power when demand peaked. However, in grids with high solar penetration, the opposite problem occurs during sunny midday hours: a massive surplus of supply that causes over-voltages and equipment failure.

Existing solutions like Volt-Var Optimization (VVO) are computationally heavy and don't scale well. Furthermore, real-world curtailment isn't "smooth"; buildings and solar arrays usually have discrete settings (e.g., turning off specific sets of panels via micro-inverters). This makes the balancing act a "discrete optimization" problem, which is mathematically NP-hard—meaning it's nearly impossible to find the perfect solution quickly as the grid grows.

Methods

The authors propose a generalized framework that handles both load and supply curtailment across a "curtailment horizon." Their approach includes:

  1. Integer Linear Programming (ILP) Formulation: They first define the "perfect" mathematical solution, though it is too slow for real-time use.
  2. Bounded Approximation Algorithms (Algorithm 2): To solve the speed issue, they use Dynamic Programming combined with a scaling and rounding technique. By rounding curtailment values, they trade a tiny bit of accuracy for a massive boost in speed, providing a solution that is guaranteed to be within a factor of $(1 \pm \epsilon)$ of the optimal cost.
  3. Fairness-Aware Optimization (Algorithm 3): To prevent the system from unfairly penalizing the same nodes repeatedly, they incorporate "curtailment budgets" using Linear Programming (LP) relaxation and a novel rounding heuristic.
  4. Online Heuristic (Algorithm 4): A "myopic" version of the algorithm for scenarios where future weather or demand forecasts aren't available, making decisions interval-by-interval.

Datasets

The researchers evaluated their algorithms using a mix of real-world and simulated data:

  • Load Data: Real-world Demand Response data from the USC Campus Microgrid, consisting of 150 nodes (buildings), each with 6 discrete curtailment strategies.
  • Solar Data: Simulated solar curtailment based on Los Angeles County hourly solar radiance data. They modeled PV output for various areas ($10m^2$ to $20m^2$) and panel yields ($5\%$ to $15\%$), creating 6 discrete solar curtailment levels per node to simulate micro-inverter control.

Key Insights and Ideas

  • Proactive vs. Reactive: Unlike traditional methods that react after a voltage spike occurs, this framework is proactive. It uses forecasts to schedule curtailment in advance, preventing instability before it starts.
  • The Power of Micro-Inverters: The paper highlights a shift in hardware. Modern micro-inverters allow operators to disconnect individual panels or clusters, turning solar arrays into "segmented generators" with discrete output levels.
  • Complexity Management: By proving the problem is NP-hard (reducing it to the classic "Knapsack Problem"), the authors justify why simple heuristics aren't enough and why sophisticated approximation algorithms are necessary for the future grid.
  • Fairness is Functional: Incorporating fairness isn't just a social goal; it ensures long-term participation from consumers who might otherwise opt out of smart grid programs if they feel unfairly targeted for power cuts.

Key Results

  • Near-Optimal Performance: In practical tests, the approximation algorithms achieved costs within 2% of the theoretical optimum while running significantly faster than standard ILP solvers.
  • Scalability: The runtime increases near-quadratically with the number of nodes. Even a "naive" MATLAB implementation met the timing constraints of the California ISO (which requires generation changes 5 minutes ahead of an interval) for up to 40-70 nodes.
  • Fairness Success: Using the Gini coefficient (a standard measure of inequality), the authors showed that their fairness-aware algorithm successfully distributed the "burden" of curtailment across the grid as the fairness parameter ($\alpha$) increased.

Limitations and Future Work

  • Forecast Uncertainty: The current "offline" models assume perfect knowledge of future solar generation and demand. The authors acknowledge that prediction errors in weather forecasting could impact the actual performance.
  • Centralized Control: The framework assumes a centralized grid operator can remotely toggle nodes. In a more fragmented or privacy-conscious market, a decentralized approach might be required.
  • Observability: The model assumes the operator has complete visibility into every node's status, which may not be true for all municipal distribution grids.

The authors plan to address these uncertainties and explore decentralized control in future iterations of the work.

Summary updated

Abstract

Mitigating mismatches in supply demand curve is critical for smooth power grid operation. Traditionally, load curtailment techniques such as Demand Response (DR) have been used for this purpose. However, smart grids with high PV penetration sometimes exhibit supply surplus causing over-voltages. Thus, load curtailment techniques cannot be the only component of a net-load balancing framework. Supply curtailment techniques such as Volt-Var Optimizations are complex and computationally expensive. This increases the complexity of net-load balancing systems used by the grid operator and limits their scalability. Recently, new technologies have been developed that enable the rapid and selective connection of PV modules of an installation to the grid. Taking advantage of these advancements, we develop a unified optimal net-load balancing framework which performs both load and solar curtailment. We show that when the available curtailment values are discrete, this problem is NP-hard and develop bounded approximation algorithms for minimizing the curtailment cost. Our algorithms produce fast solutions, given the tight timing constraints required for grid operation. We also incorporate the notion of fairness to ensure that curtailment is evenly distributed among all the nodes. Finally, we develop an online algorithm which performs net-load balancing using only data available for the current interval. Using both theoretical analysis and practical evaluations, we show that our net-load balancing algorithms provide solutions which are close to optimal in a small amount of time.
BibTeX
@inproceedings{kuppannagari2017optimal,
  author = {Sanmukh R. Kuppannagari and Rajgopal Kannan and Viktor K. Prasanna},
  title = {{Optimal net-load balancing in smart grids with high PV penetration}},
  booktitle = {BuildSys},
  year = {2017},
  url = {https://openreview.net/forum?id=NadfdX8VZd},
}

Loading related content...

Figure