Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adaptive algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 919 records · Page 51
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Manifold projection image segmentation for nano-XANES imaging

As spectral imaging techniques are becoming more prominent in science, advanced image segmentation algorithms are required to identify appropriate domains in these images. We present a version of image segmentation called manifold projection image segmentation (MPIS) that is generally applicable to a broad range of systems without the need for training because MPIS uses unsupervised machine learning with a few physically motivated hyperparameters. We apply MPIS to nanoscale x-ray absorption near edge structure (XANES) imaging, where XANES spectra are collected with nanometer spatial resolution. We show the superiority of manifold projection over linear transformations, such as the commonly used principal component analysis (PCA). Moreover, MPIS maintains accuracy while reducing computation time and sensitivity to noise compared to the standard nano-XANES imaging analysis procedure. Finally, we demonstrate how multimodal information, such as x-ray fluorescence data and spatial location of pixels, can be incorporated into the MPIS framework. We propose that MPIS is adaptable for any spectral imaging technique, including scanning transmission x-ray microscopy, where the length scale of domains is larger than the resolution of the experiment.

36 MATERIALS SCIENCE↗
DOE OSTI2024

CIRCLES: Congestion Impacts Reduction via CAV-in-the-loop Lagrangian Energy Smoothing

The energy efficiency of today’s vehicular mobility relies on the un-integrated combination of i) control via static assets (traffic lights, metering, variable speed limits, etc.); and ii) onboard vehicle automation (adaptive cruise control (ACC), ecodriving, etc.). These two families of control were not co-designed and are not engineered to work in coordination. Recent studies have shown i) limitations of controls, and even ii) negative impacts of ACC. This project focused on the technology development, implementation and prototyping, and validation of Mobile Traffic Control (MTC). MTC can be viewed as an extension of classical traffic control (in which static infrastructure actuates traffic flow). In the MTC paradigm, automated vehicles actuate the entire flow via their behavior, offering enhanced possibilities to optimize the energy footprint of traffic, if designed correctly. We set out to demonstrate for the first time that considerably reduced fuel consumption of all vehicles in traffic can be achieved via distributed control of a small proportion of CAVs. Compared to baseline vehicular technologies, our work offers a significant design departure: control algorithms for the CAVs consider the impact one vehicle can have on overall traffic, improving resulting overall fuel consumption. We focus on using a few vehicles (as traffic controllers via CAV technology) to improve the energy efficiency of traffic flow to further optimize energy efficiency. A live-traffic demonstration in November 2022 featured the deployment of 100 specially-equipped CAVs, constituting an approximate local penetration rate upwards of 2%.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2026

Reference floating wind array designs for three representative regions

This work presents the systematic development of three open-source reference floating wind array designs. The designs are tailored to representative site conditions for three regions of the United States: Humboldt Bay off the coast of California, the Gulf of Maine, and the Gulf of America. We adopted existing reference designs for the individual 15 MW turbines, semisubmersible floating platforms, substations, mooring systems, and power cables – integrating and adapting them as needed for each location. We adapted existing dynamic cable designs to use larger conductor sizes to meet the arrays' power transmission requirements, and we set up redundant mooring systems for each substation. The layout of each array is a uniform-grid design optimized to approximately minimize the levelized cost of energy (LCOE) within a square lease area while satisfying spatial constraints. These constraints ensure adequate clearances between adjacent turbines and between underwater components during the layout optimization to prevent clashing and ensure that all components reside within the lease boundaries. Substations are included to allow accounting for intra-array cable costs. They are placed within the uniform grid to maintain the navigability of the arrays. For each feasible layout considered, annual energy production and cable routing costs are calculated and updated in the LCOE objective function. After the optimization, we refined the cable routing with a mix of algorithmic and manual methods to ensure that the cables avoid mooring system components and approach the substation with adequate clearances. We confirmed the suitability of each reference array's layout by comparing the wake losses at each wind heading angle to the wind rose, observing that the optimized layouts largely avoid wake losses in the predominant wind directions. These reference arrays provide open-source baseline designs to enable future research and innovation of floating wind technology at the array scale.

17 WIND ENERGY↗
DOE OSTI2025

Predicting interface structure using the minima hopping method

Here, we adapt the minima hopping method (MHM) to the problem of interfacial structure prediction and apply it to study a canonical problem, the tilt grain boundaries in SrTiO 3 . Our method employs a hybrid approach by first exploring the potential energy surface (PES) of different grain boundary samplings with an empirical force field, among which the fifteen candidates with lower energies are then refined using ab initio density functional theory (DFT) calculations. During the exploratory stage, we bias the search using a local order parameter to primarily sample various reconstructions in the vicinity of the interface, while preserving the crystallinity of the bulk regions. We further enhance the search by incorporating initial structures with rigid body displacements to account for translational variations between bulk phases, enabling the MHM to effectively generate both stoichiometric and nonstoichiometric SrTiO 3 Σ⁢3(111)[110] and Σ⁢3(112)[110] grain boundaries. From an algorithmic standpoint, MHM outperforms earlier studies based on genetic algorithms (GA) by identifying more stable interfacial structures of several SrTiO 3 grain boundaries. The performance of the present implementation of the MHM approach is primarily limited by exploring an approximate description of the PES with a rather simple Buckingham potential. This limitation leads to variations in performance when compared to approaches utilizing more advanced surrogate PES models, such as direct DFT-PES sampling or GA with the embedded atom method (EAM). Despite the present limitations, the MHM approach is able to yield interfacial structures with comparable or lower interfacial energies in specific cases, such as Σ⁢3(111)[110] Γ=1, ±0.5 and Σ⁢3(112)[110] Γ= ±1, −2, underscoring the robustness of the MHM approach even with a simple approximation of the DFT PES. The MHM interfacial structure prediction method thus offers an efficient approach to understanding the grain boundaries and heterointerfaces at the atomic scale, providing an important prerequisite for effective materials design.

density functional theory↗
DOE OSTI2024

Experimental Safe Extremum Seeking for Accelerators

Here, we demonstrate the recent designs of safe extremum seeking (Safe ES) on the 1-km-long charged particle accelerator at the Los Alamos Neutron Science Center (LANSCE). Safe ES is a modification of extremum seeking (ES) which, in addition to minimizing an analytically unknown cost, also employs a safety filter based on an analytically unknown control barrier function (CBF) safety metric. Tuning is necessitated by accelerators being large complex systems, with many drifting parameters due to thermal effects and degradation. At the same time, safe operation (the maintenance of state constraints) is crucial, as damage brings astronomical costs, both financially and in operation downtime. Our measured (but analytically unknown) safety metric is the beam current. We perform multivariable Safe ES on three accelerator applications, in which we adapt 4, 6, and 3 magnet strength parameters, respectively. Two of the three applications are for validated simulation models of beamlines at LANSCE: the first for the proton radiography (pRad) beamline of 800-MeV protons for spot size tuning; the second on a high-performance code, HPSim, for tuning the low-energy beam transport (LEBT) region that contains a beam of 750-keV protons. The third is an experimental tuning of the steering magnets in the LEBT at LANSCE.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Optimization of a High Pressure Turbine Blade and Sector-Based Annular Rig Design for Supercritical CO2 Power Cycle Representative Testing

Abstract As part of the ongoing research into the design of hardware for zero emission cycles, a first-stage high-pressure turbine (HPT) blade is optimized for a 300 MWe supercritical CO2 (sCO2) power cycle using the surrogate-assisted genetic algorithm optimizer in Numeca FINE/Design three-dimensional with objectives of increasing efficiency and decreasing heat load to the blade. Supercritical CO2 property tables are constructed from NIST REFPROP data for the condensable gas simulation in FINE/Turbo. A detailed mesh sensitivity study is performed for a baseline design to identify the proper-grid refinement and efficiently allocate resources for the optimization. Seventy design variables are selected for the initial population generation. Self-organizing maps are then used to focus the design variables on the most important ones affecting the objective functions. The optimization results in approximately 3000 three-dimensional Reynolds Averaged Navier Stokes simulations of different blade shapes with increases in efficiency of up to 0.85% and decreases in heat load of 14%. Families of blade shapes are identified for experimental testing in an annular rig at the Purdue Experimental Turbine Aerothermal Laboratory. A design to adapt the annular cascade for testing optimized geometries is introduced, which features eccentric radius sectors allowing for scaled-up geometries of sCO2 optimized blade profiles to be tested at design cycle representative conditions at high Reynolds numbers in dry air. Analysis into the effects of Reynolds number, working fluid, and geometric relations are presented to prove the efficacy of the test method.

Engineering↗
DOE OSTI2024

Proof-of-Concept for Sensor Modeling in MOOSE for the Design of Autonomous Nuclear Reactor Control

Autonomous operation is essential for the deployment of microreactors and fission batteries, both in terrestrial and space applications. For this reason, recent studies have investigated autonomous control by using adaptive model predictive control and multi-objective optimization for heat pipe–cooled microreactors under normal and heat pipe failure conditions. However, prototypes of microreactors and fission batteries do not exist yet, and even the design space has not been narrowed down conclusively, making the instrumentation and control system design difficult. For this reason, there is a need for flexible computational capabilities to create a numerical stand-in of potential microreactor and fission battery designs. The latter can be used to design and test control strategies to support autonomous operations. In this poster, we describe the initial implementation of a pluggable sensor system for the easy implementation of realistic sensor models in the multiphysics object-oriented simulation environment (MOOSE) framework. This new capability will enable MOOSE users to create a numerical stand-in of microreactors and fission batteries, ultimately allowing them to easily test new control algorithms, and instrumentation strategies for advanced systems in the design phase.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Explaining machine-learning models for gamma-ray detection and identification

As more complex predictive models are used for gamma-ray spectral analysis, methods are needed to probe and understand their predictions and behavior. Recent work has begun to bring the latest techniques from the field of Explainable Artificial Intelligence (XAI) into the applications of gamma-ray spectroscopy, including the introduction of gradient-based methods like saliency mapping and Gradient-weighted Class Activation Mapping (Grad-CAM), and black box methods like Local Interpretable Model-agnostic Explanations (LIME) and SHapley Additive exPlanations (SHAP). In addition, new sources of synthetic radiological data are becoming available, and these new data sets present opportunities to train models using more data than ever before. In this work, we use a neural network model trained on synthetic NaI(Tl) urban search data to compare some of these explanation methods and identify modifications that need to be applied to adapt the methods to gamma-ray spectral data. We find that the black box methods LIME and SHAP are especially accurate in their results, and recommend SHAP since it requires little hyperparameter tuning. We also propose and demonstrate a technique for generating counterfactual explanations using orthogonal projections of LIME and SHAP explanations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Hybrid learning techniques for scientific data reduction with performance guarantees

The research initiatives supported by the U.S. Department of Energy (DOE) Grant DE-SC0022265 are fundamentally aimed at pioneering advanced machine learning (ML) techniques for scientific data compression within high-performance computing (HPC) environments. This comprehensive body of work addresses the critical challenge posed by the exponential growth of data generated by scientific simulations in domains such as fusion energy, climate modeling, and computational fluid dynamics (CFD). A core objective is to develop compression algorithms that achieve substantial data reduction—often by orders of magnitude—while rigorously ensuring the fidelity of both the primary data (PD) and scientifically crucial derived quantities of interest (QoI). The methodologies deployed under this grant integrate sophisticated deep learning architectures, prominently featuring autoencoders, advanced generative models like conditional diffusion, and hybrid learning techniques. Key innovations include the development of Guaranteed Autoencoders (GAE) and the Guaranteed Conditional Diffusion with Tensor Correction (GCDTC) framework, which provide explicit, instance-level error bounds on reconstructed data. Furthermore, specialized strategies such as nonlinear constraint satisfaction are employed to preserve the integrity of QoI, a vital requirement for the trustworthiness of downstream scientific analyses. This research also focuses on the design and implementation of scalable, GPU-accelerated software pipelines that seamlessly integrate into existing HPC workflows, ensuring both computational efficiency and practical applicability. The CAESAR framework, for example, unifies foundation and generative models to create an adaptive and efficient compression solution for spatio-temporal scientific data. Collectively, these efforts represent a significant advancement in mitigating the scientific data deluge, enabling more effective data management, accelerated scientific discovery, and optimized utilization of HPC resources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Final report- UFL - RAPIDS2: A SciDAC Institute for Computer Science, Data, and Artificial Intelligence

The research initiatives supported by the U.S. Department of Energy (DOE) Grant DE-SC0022265 are fundamentally aimed at pioneering advanced machine learning (ML) techniques for scientific data compression within high-performance computing (HPC) environments. This comprehensive body of work addresses the critical challenge posed by the exponential growth of data generated by scientific simulations in domains such as fusion energy, climate modeling, and computational fluid dynamics (CFD). A core objective is to develop compression algorithms that achieve substantial data reduction—often by orders of magnitude—while rigorously ensuring the fidelity of both the primary data (PD) and scientifically crucial derived quantities of interest (QoI). The methodologies deployed under this grant integrate sophisticated deep learning architectures, prominently featuring autoencoders, advanced generative models like conditional diffusion, and hybrid learning techniques. Key innovations include the development of Guaranteed Autoencoders (GAE) and the Guaranteed Conditional Diffusion with Tensor Correction (GCDTC) framework, which provide explicit, instance-level error bounds on reconstructed data. Furthermore, specialized strategies such as nonlinear constraint satisfaction are employed to preserve the integrity of QoI, a vital requirement for the trustworthiness of downstream scientific analyses. This research also focuses on the design and implementation of scalable, GPU-accelerated software pipelines that seamlessly integrate into existing HPC workflows, ensuring both computational efficiency and practical applicability. The CAESAR framework, for example, unifies foundation and generative models to create an adaptive and efficient compression solution for spatio-temporal scientific data. Collectively, these efforts represent a significant advancement in mitigating the scientific data deluge, enabling more effective data management, accelerated scientific discovery, and optimized utilization of HPC resources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Knowledge graph-aided Bayesian active learning for top- K genetic interaction discovery

In silico methods for predicting the effects of multi-gene perturbations hold great promise for advancing functional genomics, computational drug discovery, and disease modeling. However, the development of these predictive algorithms for mammalian systems has been hampered by limited datasets and high experimental costs. In this study, we present a Bayesian active learning framework designed to discover pairwise host gene knockdowns that effectively inhibit viral proliferation in an in vitro HIV-1 infection model. Our method leverages a biological knowledge graph as side information and employs a computationally efficient batch diversification approach. We evaluated this framework using a dataset of viral load measurements obtained from multi-day dual-gene depletion experiments, encompassing all possible pairwise knockdowns of over 350 host genes associated with HIV infection. We demonstrate that our framework rapidly identifies the most effective gene knockdown pairs for reducing viral load. Furthermore, we show that incorporating side information enhances performance during the early stages of active learning (low data regime), while our batch diversification strategy significantly boosts performance in later stages (high data regime). This framework is general and can be adapted to explore gene interactions in other contexts, such as synthetic lethality prediction and mapping epistatic effects across quantitative trait loci.

Computational biology and bioinformatics↗
DOE OSTI2022

The Application of a Genetic Algorithm to the Optimization of a Mesoscale Model for Emergency Response

Besides solving the equations of momentum, heat, and moisture transport on the model grid, mesoscale weather models must account for subgrid-scale processes that affect the resolved model variables. These are simulated with model parameterizations, which often rely on values preset by the user. Such “free” model parameters, along with others set to initialize the model, are often poorly constrained, requiring that a user select each from a range of plausible values. Finding the values to optimize any forecasting tool can be accomplished with a search algorithm, and one such process—the genetic algorithm (GA)—has become especially popular. As applied to modeling, GAs represent a Darwinian process: an ensemble of simulations is run with a different set of parameter values for each member, and the members subsequently judged to be most accurate are selected as “parents” who pass their parameters onto a new generation. At the U.S. Department of Energy’s Savannah River Site in South Carolina, we are applying a GA to the Regional Atmospheric Modeling System (RAMS) mesoscale weather model, which supplies input to a model to simulate the dispersion of an airborne contaminant as part of the site’s emergency response preparations. An ensemble of forecasts is run each day, weather data are used to “score” the individual members of the ensemble, and the parameters from the best members are used for the next day’s forecasts. As meteorological conditions change, the parameters change as well, maintaining a model configuration that is best adapted to atmospheric conditions. Significance Statement We wanted to develop a forecasting system by which a weather model is run over the Savannah River Site each day and repeatedly adjusted according to how well it performed the previous day. To run the model, a series of values (parameters) must be set to control how the model will calculate winds, temperatures, and other desired variables. Each day the model was run several times using different combinations of these parameters and later compared with observed meteorological conditions. Parameters that produced the most accurate forecasts were preferentially reused to create the forecasts for the next day. The process was tested for the summer of 2020 and exhibited lower errors than forecasts produced by the model using default values of the parameters.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Implicit–explicit multirate infinitesimal stage-restart methods

Implicit–Explicit (IMEX) methods are flexible numerical time integration methods which solve an initial-value problem (IVP) that is split into stiff and nonstiff processes with the goal of lower computational costs than a purely implicit or explicit approach. A complementary form of flexible IVP solvers are multirate infinitesimal methods for problems split into fast- and slow-changing dynamics, that solve a multirate IVP by evolving a sequence of “fast” IVPs using any suitably accurate algorithm. This article introduces a new class of high-order implicit–explicit multirate methods that are designed for multirate IVPs in which the slow-changing dynamics are further split in an IMEX fashion. This new class, which we call implicit–explicit multirate infinitesimal stage-restart (IMEX-MRI-SR), both improves upon the previous implicit–explicit multirate infinitesimal generalized-structure additive Runge Kutta (IMEX-MRI-GARK) methods by allowing for far easier creation of new embedded methods, and extends multirate exponential Runge Kutta (MERK) methods by allowing the fast-changing dynamics to be nonlinear and the methods to be implicit. We leverage GARK theory to derive conditions for orders of accuracy up to four, and we provide second- and third-order accurate example methods, which are the first known embedded MRI methods with IMEX structure. We then perform numerical simulations demonstrating convergence rates and computational performance in both fixed-step and adaptive-step settings.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2024

Accelerating data acquisition with FPGA-based edge machine learning: a case study with LCLS-II

New scientific experiments and instruments generate vast amounts of data that need to be transferred for storage or further processing, often overwhelming traditional systems. Edge machine learning (EdgeML) addresses this challenge by integrating machine learning (ML) algorithms with edge computing, enabling real-time data processing directly at the point of data generation. EdgeML is particularly beneficial for environments where immediate decisions are required, or where bandwidth and storage are limited. In this paper, we demonstrate a high-speed configurable ML model in a fully customizable EdgeML system using a field programmable gate array (FPGA). Our demonstration focuses on an angular array of electron spectrometers, referred to as the ‘CookieBox,’ developed for the Linac Coherent Light Source II project. The EdgeML system captures 51.2 Gbps from a 6.4 GS s −1 analog to digital converter and is designed to integrate data pre-processing and ML inside an FPGA. Our implementation achieves an inference latency of 0.2 µs for the ML model, and a total latency of 0.4 µs for the complete EdgeML system, which includes pre-processing, data transmission, digitization, and ML inference. The modular design of the system allows it to be adapted for other instrumentation applications requiring low-latency data processing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Randomized Preconditioned Solvers for Strong Constraint 4D-Var Data Assimilation

The Strong Constraint 4D Variational (SC-4DVAR) data assimilation method is widely used in climate and weather applications. SC-4DVAR involves solving a minimization problem to compute the maximum a posteriori estimate, which we tackle using the Gauss-Newton method. The computation of the descent direction is expensive since it involves the solution of a large-scale and potentially ill-conditioned linear system, solved using the preconditioned conjugate gradient (PCG) method. Here, to address this cost, we efficiently construct scalable preconditioners using three different randomization techniques, which all rely on a certain low-rank structure involving the Gauss-Newton Hessian. The proposed techniques come with theoretical guarantees on the condition number, and at the same time, are amenable to parallelization. We also develop an adaptive approach to estimate the sketch size and choose between the reuse or recomputation of the preconditioner. We demonstrate the performance and effectiveness of our methodology on two representative model problems—the Burgers and barotropic vorticity equation—showing a drastic reduction in both the number of PCG iterations and the number of Gauss-Newton Hessian products after including the preconditioner construction cost.

Gauss-Newton↗
DOE OSTI2023

Integrated deep learning framework for unstable event identification and disruption prediction of tokamak plasmas

Abstract The ability to identify underlying disruption precursors is key to disruption avoidance. In this paper, we present an integrated deep learning (DL) based model that combines disruption prediction with the identification of several disruption precursors like rotating modes, locked modes, H-to-L back transitions and radiative collapses. The first part of our study demonstrates that the DL-based unstable event identifier trained on 160 manually labeled DIII-D shots can achieve, on average, 84% event identification rate of various frequent unstable events (like H-L back transition, locked mode, radiative collapse, rotating MHD mode, large sawtooth crash), and the trained identifier can be adapted to label unseen discharges, thus expanding the original manually labeled database. Based on these results, the integrated DL-based framework is developed using a combined database of manually labeled and automatically labeled DIII-D data, and it shows state-of-the-art (AUC = 0.940) disruption prediction and event identification abilities on DIII-D. Through cross-machine numerical disruption prediction studies using this new integrated model and leveraging the C-Mod, DIII-D, and EAST disruption warning databases, we demonstrate the improved cross-machine disruption prediction ability and extended warning time of the new model compared with a baseline predictor. In addition, the trained integrated model shows qualitatively good cross-machine event identification ability. Given a labeled dataset, the strategy presented in this paper, i.e. one that combines a disruption predictor with an event identifier module, can be applied to upgrade any neural network based disruption predictor. The results presented here inform possible development strategies of machine learning based disruption avoidance algorithms for future tokamaks and highlight the importance of building comprehensive databases with unstable event information on current machines.

plasma instabilities↗
DOE OSTI2021

The picasso map-making code: application to a simulation of the QUIJOTE northern sky survey

ABSTRACT Map-making is an important step for the data analysis of cosmic microwave background (CMB) experiments. It consists of converting the data, which are typically a long, complex, and noisy collection of measurements, into a map, which is an image of the observed sky. We present in this paper a new map-making code named picasso (Polarization and Intensity CArtographer for Scanned Sky Observations), which was implemented to construct intensity and polarization maps from the Multi Frequency Instrument (MFI) of the QUIJOTE (Q-U-I Joint TEnerife) CMB polarization experiment. picasso is based on the destriping algorithm, and is suited to address specific issues of ground-based microwave observations, with a technique that allows the fit of a template function in the time domain, during the map-making step. This paper describes the picasso code, validating it with simulations and assessing its performance. For this purpose, we produced realistic simulations of the QUIJOTE-MFI survey of the northern sky (approximately ∼20 000 deg2), and analysed the reconstructed maps with picasso, using real and harmonic space statistics. We show that, for this sky area, picasso is able to reconstruct, with high fidelity, the injected signal, recovering all the scales with ℓ > 10 in TT, EE, and BB. The signal error is better than 0.001 per cent at 20 < ℓ < 200. Finally, we validated some of the methods that will be applied to the real wide-survey data, like the detection of the CMB anisotropies via cross-correlation analyses. Despite that the implementation of picasso is specific for QUIJOTE-MFI data, it could be adapted to other experiments.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Data-Driven PMU Noise Emulation Framework using Gradient-Penalty-Based Wasserstein GAN

Availability of phasor measurement unit (PMUs) data has led to research on data-driven algorithms for event monitoring, control and ensuring stability of the grid. Unavailability of infrequent critical event field PMU data with component failures is driving the need to generate realistic synthetic PMU data for research. The synthetic data from power system simulation software often neglect noise profiles of received phasors, thus creating some discrepancies between real PMU data and synthetic ones. To address this issue, this work presents an initial study on the noise characteristics of PMUs, as well as presenting models for recreating their unique noise signatures. The proposed method, utilizing the Wasserstein generative adversarial network with gradient penalty (WGAN-GP) architecture, provides an excellent benchmark for matching the noise distribution. One can use a well-learned GAN model to draw noise signatures from a distribution that seemingly mirrors the real PMU noise distribution, while also being able to be detached from the PMU data once the training is done. Based on the observed results and employed data-driven methodology, it is expected that the proposed methods can be adapted to replicate the behavior of other sensors, providing research and other applications with a tool for data synthesis and sensor characterization.

PMU↗