Engineering Papers⌕ Search

Engineering topics

Graf, Peter A

Publications and source records attributed to Graf, Peter A.

Wind Turbine Rotor Design Optimization Using Importance Sampling: Preprint

Probabilistic methods are commonly adopted to estimate both ultimate and fatigue loads in wind turbines, and multiple papers have presented a variety of approaches. In contrast, system-level, integrated design optimization methods for wind turbines have so far relied on deterministic methods to estimate loads and deflections. This work aims at addressing this gap by adopting importance sampling to estimate ultimate blade deflection for use within a rotor design optimization. A comparison between the results of this approach against traditional approaches using deterministic load evaluations show that the probabilistic approach is more conservative and that the solutions found with deterministic approaches violate the probabilistic constraint on tip deflection between 13% and 17%. This highlights the importance of accurate load and deflection estimates and demonstrates that probabilistic approaches can be successfully integrated within a wind turbine design process despite the higher computational costs.

17 WIND ENERGY↗

Cooperative Load Scheduling for Multiple Aggregators Using Hierarchical ADMM: Preprint

Demand response (DR) serves an important role in improving the efficiency and stability of power systems. In recent years, with advances in communication and smart device technologies, many aggregators have emerged to facilitate end customer participation in DR programs. These aggregators, equipped with customized optimal control algorithms, are capable of providing various grid services. Among them is load scheduling during DR events, namely following a load signal provided by the utility company while minimizing overall customer discomfort. However, as the number of aggregators keeps increasing, it becomes challenging for utility companies to conduct load scheduling for multiple aggregators and generate reference signals for each of them. This paper proposes an optimization framework using hierarchical alternating direction method of multipliers (H-ADMM) to optimally generate load following signals for multiple aggregators. Under this framework, utility and multiple aggregators work in a cooperative manner, aiming at minimizing an overall system cost from different levels of the power system hierarchy, while protecting user privacy. A case study has been conducted in a system with multiple aggregators, based on control of HVAC loads. Experimental results validate the effectiveness of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

Cooperative Load Scheduling for Multiple Aggregators Using Hierarchical ADMM

Demand response (DR) serves an important role in improving the efficiency and stability of power systems. In recent years, with advances in communication and smart device technologies, many aggregators have emerged to facilitate end customer participation in DR programs. These aggregators, equipped with customized optimal control algorithms, are capable of providing various grid services. Among them is load scheduling during DR events, namely following a load signal provided by the utility company while minimizing overall customer discomfort. However, as the number of aggregators keeps increasing, it becomes challenging for utility companies to conduct load scheduling for multiple aggregators and generate reference signals for each of them. This paper proposes an optimization framework using hierarchical alternating direction method of multipliers (H-ADMM) to optimally generate load following signals for multiple aggregators. Under this framework, utility and multiple aggregators work in a cooperative manner, aiming at minimizing an overall system cost from different levels of the power system hierarchy, while protecting user privacy. A case study has been conducted in a system with multiple aggregators, based on control of HVAC loads. Experimental results validate the effectiveness of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗