Search NASA⌕ Search

DOE OSTI · 1669500

Estimation of Large-Scale Wind Field Characteristics Using Supervisory Control and Data: Preprint

Abstract

As the wind energy industry continues to pushfor increased power production and lower cost of energy, thefocus of research has expanded from individual turbines toentire wind farms. Among a host of interesting problems to besolved when considering the wind farm as a whole, we considerthe challenge of scalar field estimation, based on informationalready collected at the individual turbine level. We aim toestimate the large-scale, low-frequency characteristics of thewind field, such as the mean wind direction and the overalldecrease in wind speed across the farm, and employ a Kalmanfilter that models the wind field using a polynomial function.We compare the proposed method’s performance to both asimple averaging technique and filtering of individual turbinemeasurements. The method presented is not limited to windturbines and is applicable in other situations where multipleremote agents are used to estimate a scalar field.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sinner, Michael (ORCID:0000000187660711), Pao, Lucy Y., King, Jennifer (ORCID:0000000162190098). 2020-08-24. Estimation of Large-Scale Wind Field Characteristics Using Supervisory Control and Data: Preprint. https://www.osti.gov/biblio/1669500

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems

This work presents methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices play a critical role in many power system applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.

large scale↗