Abstract

Peak load shaving is one of the applications of energy storage systems (ESS) that will play a key role in the future of smart grid. Peak shaving is done to prevent the increase of network capacity to the amount of peak demand and also increase its reliability. Although the development of diverse ESS with high round-trip efficiency is very important and is considered a necessary condition for optimal peak load shaving, its sufficient condition is to follow an appropriate control algorithm. In this study, a new control algorithm called ultimate peak load shaving (UPLS) is developed for the optimal use of ESS for the peak shaving and valley filling purposes. The UPLS control algorithm is not only able to guarantee peak load shaving in any condition considering any load profile but also can ingeniously control ESS charging and discharging rates. This feature distinguishes it from other algorithms developed in the field.In this study, first, the UPLS control algorithm was explained in detail. Then, by comparing it with two other common control algorithms, its four unique features were investigated. After that, by applying these three control algorithms on different hypothetical load demand profiles A, B, C, and D, these features were demonstrated. Through sensitivity analysis and changing the allowed range for ESS charging and discharging rates (other parameters are assumed constant), how to design the grid power, Pg(t) by the UPLS control algorithm is described. It was found that the mentioned parameters are completely under the control of this algorithm. The optimization results show that peak demand can be reduced by 28.12 % and 27.82 % for load profiles B and C, respectively and the ESS discharging rate is significantly reduced to 55.28 % and 77.93 %, respectively compared to their corresponding values in basic design.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.