Akansha Singh
Prashant Shenoy
ABSTRACT
Since the electric grid was not designed to support large-scale solar generation, current policies place hard caps on the number of solar systems that connect to the grid. Unfortunately, users are starting to hit these caps, which is restricting solar's natural growth. Software-defined solar (SDS) systems address the problem by dynamically regulating the power they inject into the grid, similar to TCP, to maximize the grid's available solar capacity, maintain grid stability, and fairly share the grid's solar capacity among users. By dynamically regulating solar "flows," SDS systems remove the need for policies that artificially cap solar systems, enabling any SDS system to freely connect to the grid. Our prototype SDS system, called SunShade, includes two new mechanisms that enable programmatic solar flow control: one that enforces an absolute limit on solar output, and one that enforces a relative limit on solar output as a fraction of the current maximum power point. We have implemented both mechanisms, and conducted a preliminary evaluation with an emulated solar panel using real weather traces with different insolation and temperature levels.
- Solar Energy Industries Association, Solar Energy Facts: 2013 Year In Review, March 5th, 2014 2014.Google Scholar
- T. Esram and P. Chapman. Comparison of photovoltaic array maximum power point tracking techniques. IEEE Transactions on Energy Conversion, 22(2), June 2007.Google ScholarCross Ref
- V. Jacobson and M. Karels. Congestion Avoidance and Control. In SIGCOMM, August 1998. Google ScholarDigital Library
- K. Shallenberger. Utilitydive, massachusetts Gov. Baker signs bill lifting solar cap, lowering net metering rates, April 11th 2016.Google Scholar
Recommendations
SunShade: enabling software-defined solar-powered systems
ICCPS '17: Proceedings of the 8th International Conference on Cyber-Physical SystemsThe electric grid was not designed to support the large-scale penetration of intermittent solar generation. As a result, current policies place hard caps on the solar capacity that may connect to the grid. Unfortunately, users are increasingly hitting ...
The Maximization of a Quadratic Function of Variables Subject to Linear Inequalities
A simplex-type method for finding a local maximum of
Dynamic Programming and the Smoothing Problem
A problem in the study of production smoothing leads to the problem of minimizing a linear form \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $L(x) = \sum^{N}_{i=1}c_{i}x_{i}$ \end{document} subject to constraints of the type xi ≧ 0, \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $\sum^{k}_{i=1}x_{i}\geqq r_{k}$ \end{document}. A computational solution of this problem is given, using the methods of dynamic programming.
Comments