Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithm testing”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Sensitivity analysis of an automated fault detection algorithm for residential air-conditioning systems

The state of the art of fault detection and diagnosis (FDD) for residential air-conditioning systems is expensive and not yet amenable to widespread implementation. FDD for homes can significantly reduce utility costs, and increase the lifespan of the equipment. The cost barriers currently, however, make FDD for homes economically unviable for large scale implementation. In prior work, we offered a solution to reduce FDD costs by proposing an automated fault detection algorithm to serve as a screening step before more expensive FDD tests can be conducted. The algorithm uses only the home thermostat and local weather information to identify thermodynamic parameters and detect high-impact air-conditioning faults, including those that occur during equipment installation. We had tested the algorithm on a single EnergyPlus™ model of a home in Orlando, Florida. The thermodynamic parameter identification process is highly nonconvex involving several local optimal solutions. In this paper we propose a novel method to select the best model for fault detection from among the list of local optimal solutions to make the algorithm more robust to homes of different construction, without which the fault detection process would be infeasible. Another unique contribution of the paper is implementing the solution on real-world data. We also bring the algorithm closer to market by testing it on real-world data. We implement the algorithm on data obtained from experiments conducted by the Florida Solar Energy Center (FSEC) on a laboratory home equipped with a heat pump where faults were intentionally added for a period of seven months. The algorithm successfully detected an undercharge fault with 70.6% accuracy, concurrent duct leakage and undercharge faults with 85.2% accuracy, and duct leakage faults with 69.1% accuracy. A sensitivity analysis is also performed on EnergyPlus models of nine types of homes that vary in construction to demonstrate the robustness of the algorithm. Finally, the algorithm achieves an average accuracy of 71% for no-fault condition, 77% for 40% undercharge fault, and 76% for duct-leak fault.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

"Reinforcement Learning Based Oscillation Dampening: Scaling up Single-Agent RL algorithms to a 100 AV highway field operational test"

In this article, we explore the technical details of the reinforcement learning (RL) algorithms that were deployed in the largest field test of automated vehicles designed to smooth traffic flow in history as of 2023, uncovering the challenges and breakthroughs that come with developing RL controllers for automated vehicles. We delve into the fundamental concepts behind RL algorithms and their application in the context of self-driving cars, discussing the developmental process from simulation to deployment in detail, from designing simulators to reward function shaping. We present the results in both simulation and deployment, discussing the flow-smoothing benefits of the RL controller. From understanding the basics of Markov decision processes to exploring advanced techniques such as deep RL, our article offers a comprehensive overview and deep dive of the theoretical foundations and practical implementations driving this rapidly evolving field. We also showcase real-world case studies and alternative research projects that highlight the impact of RL controllers in revolutionizing autonomous driving. From tackling complex urban environments to dealing with unpredictable traffic scenarios, these intelligent controllers are pushing the boundaries of what automated vehicles can achieve. Furthermore, we examine the safety considerations and hardware-focused technical details surrounding deployment of RL controllers into automated vehicles. As these algorithms learn and evolve through interactions with the environment, ensuring their behavior aligns with safety standards becomes crucial. We explore the methodologies and frameworks being developed to address these challenges, emphasizing the importance of building reliable control systems for automated vehicles.

Jang, Kathy↗
DOE OSTI2023

Quantum multi-programming for Grover’s search

Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size quantum algorithms without correlation. In this paper, we propose a quantum multi-programming (QMP algorithm for Grover's search. Our algorithm decomposes Grover's algorithm by the partial diffusion operator and executes the decomposed circuits in parallel by QMP. We proved that this new algorithm increases the rotation angle of the Grover operator which, as a result, increases the success probability. The new algorithm is implemented on IBM quantum computers and compared with the canonical Grover's algorithm and other variations of Grover's algorithms. So, the empirical tests validate that our new algorithm outperforms other variations of Grover's algorithms as well as the canonical Grover's algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Toward Higher-order Accuracy in Self-gravitating Hydrodynamics

High-order algorithms have emerged in numerical astrophysics as a promising avenue to reduce truncation error (proportional to a power of the linear resolution Δ x ) with only a moderate increase to computational expense. Significant effort has been placed in the development of finite-volume algorithms for (magneto)hydrodynamics; however, state-of-the-art astrophysical simulations tightly couple a plenitude of physics, additionally including gravity, photon transport, cosmic-ray transport, chemistry, and/or diffusion, to name a few. Algorithms frequently operator-split this additional physics (often a first-order error in time) and/or adopt a model wherein their evaluation is limited to second-order accuracy in space. In this work, we present a fourth-order-accurate finite-volume scheme for self-gravitating hydrodynamics on a uniform Cartesian grid. The method supplies source terms for the gravitational acceleration ( ρ g ) and gravitational energy release ( ρ v · g ) associated with fourth-order-accurate solutions to the Poisson equation. Our scheme (1) guarantees the conservation of total linear momentum while (2) decreasing (in proportion to Δ x 4 ) the effects of spurious heating and/or cooling associated with truncation error in the gravity. We demonstrate expected convergence rates for the algorithm by measuring errors in test problems evolving self-gravity modified linear waves and 3D polytropic equilibria. We test robustness of the algorithm by integrating an induced “inside-out” adiabatic collapse. We also discuss a method to smoothly downgrade the solution to second-order spatial accuracy to avoid spurious overshoots near steep density and/or pressure gradients.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

A Local Macroscopic Conservative (LoMaC) Low Rank Tensor Method for the Vlasov Dynamics

Abstract In this paper, we propose a novel Local Macroscopic Conservative (LoMaC) low rank tensor method for simulating the Vlasov-Poisson (VP) system. The LoMaC property refers to the exact local conservation of macroscopic mass, momentum and energy at the discrete level. This is a follow-up work of our previous development of a conservative low rank tensor approach for Vlasov dynamics ( arXiv:2201.10397 ). In that work, we applied a low rank tensor method with a conservative singular value decomposition to the high dimensional VP system to mitigate the curse of dimensionality, while maintaining the local conservation of mass and momentum. However, energy conservation is not guaranteed, which is a critical property to avoid unphysical plasma self-heating or cooling. The new ingredient in the LoMaC low rank tensor algorithm is that we simultaneously evolve the macroscopic conservation laws of mass, momentum and energy using a flux-difference form with kinetic flux vector splitting; then the LoMaC property is realized by projecting the low rank kinetic solution onto a subspace that shares the same macroscopic observables by a conservative orthogonal projection. The algorithm is extended to the high dimensional problems by hierarchical Tuck decomposition of solution tensors and a corresponding conservative projection algorithm. Extensive numerical tests on the VP system are showcased for the algorithm’s efficacy.

Guo, Wei↗
DOE OSTI2020

Hybrid geological modeling: Combining machine learning and multiple-point statistics

Accurately modeling and constructing a geologically realistic subsurface model remains an outstanding problem as the morphology controls the flow behaviors. Particularly, one of the pattern-based methods, namely cross-correlation based simulation, has been proved to be an effective way to reconstruct a realistic model, at both small and large scales. However, conditioning to point data in the large-scale problems is still a crucial issue in these algorithms, since there is always a trade-off between the quality of the realizations and the degree of point data reproduction. Specifically, it is not practical to build a training image (TI) which includes all the possibilities and variabilities. Therefore, finding a pattern that can represent the point data and, at the same time, preserving the connectivities is difficult. This leads to producing highly-connected realizations with a significant mismatch or poor models with a reasonable degree of point data reproduction. To accurately reproduce the densely distributed hard data, pixel-based methods can also produce some unrealistic artifacts around the hard data. In this paper, to overcome this challenge, however, we use pattern-based methods as they often produce more disconnected geobodies when dealing with dense hard data, and proposed a hybrid algorithm using the pattern-based methods and convolutional neural network (CNN). The trained CNN model is utilized to improve the quality of conditioning to point data for the original realizations generated by the pattern-based algorithm. As such, the mismatch locations are identified, and the same regions are used in the training of CNN to mimic the procedure through which a missing region can be filled. To evaluate the performance of the proposed hybrid algorithm, it is tested on cases with different dimensions and different numbers of facies. Then, the newly improved realizations are compared with the initial realizations generated by the pattern-based algorithm. The comparison is also conducted by the flow simulation test. And it indicates that the proposed hybrid algorithm can better reproduce the point data, while the connectivities are better preserved.

58 GEOSCIENCES↗
DOE OSTI2022

Internship Report - Andrew Beathard

This summer, I had the opportunity to work as an intern under Ryan Goldhahn at Lawrence Livermore National Laboratory. Alongside another intern, I was tasked with implementing perception and autonomy algorithms on unmanned aerial systems (UAS) for multiagent cooperative missions and testing their effectiveness at the OS-150 UAS test facility at LLNL. We aimed to engineer a collaborative reaction to a single agent’s identification of an object of interest and test various multiagent algorithms.

42 ENGINEERING↗
DOE OSTI2023

Sparse Symmetric Format for Tucker Decomposition

Tensor-based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making them an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTM c ) in general sparse tensors, the $\underline{S}$ parse $\underline{S}$ ymmetric $\underline{T}$ ensor $\underline{T}$ imes $\underline{S}$ ame $\underline{M}$ atrix $\underline{c}$ hain (S 3 TTM c ) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. We present the novel Compressed Sparse Symmetric (CSS) format for sparse symmetric tensors, along with an efficient parallel algorithm for the S 3 TTM c operation. We theoretically establish that S 3 TTM c on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations, and visualize the variation of the performance gap over the parameter space. We demonstrate experimental findings that confirm these results and achieve up to 2.72× speedup on synthetic and real datasets. The scaling of the algorithm on different test architectures is also showcased to highlight the effect of machine characteristics on algorithm performance.

42 ENGINEERING↗
DOE OSTI2024

Model-Based Detection of Coordinated Attacks (DCA) in Distribution Systems

The fast-paced growth in digitization of smart grid components enhances system observability and remote-control capabilities through efficient communication. However, enhanced connectivity results in heightened system vulnerability towards cybersecurity risks in the cyber-physical power system. Coordinated cyber-attacks (CCA), when undetected, lead to system-wide impact in terms of large disturbances or widespread outages. Detecting CCA in the cyber layer is critical to thwart cyber-attacks in real-time before the attack impacts the physical system. The challenge of locating CCA stems from the complex grid dynamics, making it difficult to distinguish between normal operational variations and cyber-attack impact. CCA often employs multiple attack vectors targeting geographically distributed components, further complicating CCA identification. Existing research in intrusion detection is primarily focused on the transmission network and limited to detecting individual attacks. In this paper, a novel proactive DCA strategy is proposed for early detection of CCA by establishing correlations among distinct attack events through model-based reinforcement learning that utilizes abductive reasoning to conclude the attacker goal. The solution includes understanding the system model, learning the system dynamics, and correlating individual cyber-attacks to extract the attacker’s objective. The developed learning algorithm identifies the most probable attack path to reach the attacker’s objective by predicting the next attack steps. A DNP3-based cyber-physical co-simulation testbed is developed to test the proposed algorithm using the IEEE 13-node test feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

A Heterogeneous System for Eagle Detection, Deterrent, and Wildlife Collision Detection for Wind Turbines (Final Technical Report)

This report summarizes the design, implementation, and test of an integrated system for automated detection and deterrence of eagles, with included wind turbine blade strike detection and imaging functionality. A machine learning approach was used in conjunction with a 360° camera system for automated detection and classification of golden eagles. This was developed using footage obtained from trained golden eagles and other raptors, in collaboration with wildlife biologists and professional bird handlers. Oregon State University developed a visual deterrent system, which uses inflatable anthropomorphic sculptures with random, kinetic motion to deter eagles, and conducted limited field testing on live eagles; the deterrent can be triggered by the visual detection of eagles using the vision system. Finally, a multi-sensor module was developed that is mounted at the turbine blade root. This module measures vibration and other motions to detect blade strikes, and an integrated on-blade camera captures an image of any impacting objects. Long-term, this blade strike detection system is intended to support an automatic monitoring and certification system for the eagle detection and deterent system. Independent field testing of each system component is described. Testing of the integrated system on an operational wind turbine was conducted across three separate field tests. This includes multi-day fields tests on a General Electric 1.5MW wind turbine at the National Renewable Energy Laboratory (NREL) National Wind Technology Center (NWTC) in Boulder, CO in October 2018 and July 2019; installation procedures, test procedures, and a summary of collected data are presented. A third multi-day on-turbine field test is also presented, which was performed using a General Electric 1.5MW wind turbine at the North American Wind Research and Training Center (NAWRTC) at Mesalands Community College, Tucumcari, NM in April 2019. Across these field tests, the vision system was demonstrated using unmanned aerial vehicles (UAV), and the eagle classification algorithm was not tested; the visual deterrent system was demonstrated, including automatic, remote deployment following surrogate visual detections; and, multi-sensor on-blade data was recorded across multiple wind turbine operational conditions and through more than 100 surrogate blade strikes using soft projectiles, including the successful demonstration of automatic image capture of striking objects. This data set was also used for offline development and validation of enhanced collision detection algorithms. As summarized in this report, the development and field validation of an integrated detection, deterrent, and blade collision detection system represents a critical proof of concept for future technology development of related detection and deterrent technologies, where both deterrent as well as collision detection recording devices are needed for future siting, monitoring, and operation of wind turbine installations, both onshore and offshore.

17 WIND ENERGY↗
DOE OSTI2020

A conservative phase-space moving-grid strategy for a 1D-2V Vlasov–Fokker–Planck Solver

In this work, we develop a conservative configuration- and velocity-space (i.e., phase-space) moving-grid strategy for the Vlasov–Fokker–Planck (VFP) equation in a planar geometry. The velocity-space grid is normalized and shifted in terms of the thermal speed and the bulk-fluid velocity, respectively. The configuration-space grid is moved according to a mesh-motion-partial-differential equation (MMPDE), which equidistributes a monitor function that is inversely proportional to the gradient-length scales of the macroscopic plasma quantities. The resulting inertial terms in the transformed VFP equations are discretized to ensure the discrete conservation of mass, momentum, and energy. To satisfy the discrete conservation theorems in the presence of phase-space mesh motion, we employ the method of discrete nonlinear constraints – explored in previous studies – but the underlying symmetries are determined in a much more efficient manner than before. The conservative grid-adaptivity strategy provides an efficient scheme that resolves important physical structures in the phase-space while controlling the computational complexity at all times. We demonstrate the favorable features of the proposed algorithm through a set of test cases of increasing complexity. The problems test independent components of the algorithms, as well as the integrated capability on settings relevant to inertial confinement fusion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Dimensionally Aligned Signal Projection Algorithms Library

Dimensionally aligned signal projection (DASP) algorithms are used to analyze fast Fourier transforms (FFTs) and generate visualizations that help focus on the harmonics for specific signals. At a high level, these algorithms extract the FFT segments around each harmonic frequency center, and then align them in equally sized arrays ordered by increasing distance from the base frequency. This allows for a focused view of the harmonic frequencies, which, among other use cases, can enable machine learning algorithms to more easily identify salient patterns. This work seeks to provide an effective open-source implementation of the DASP algorithms proposed by Vann et al. (2018) as well as functionality to help explore and test how these algorithms work with an interactive dashboard and signal-generation tool. The DASP library is implemented in Python and contains four types of algorithms for implementing these feature engineering techniques: fixed harmonically aligned signal projection (HASP), decimating HASP, interpolating HASP, and frequency aligned signal projection (FASP). Each algorithm returns a numerical array, which can be visualized as an image. The HASP algorithms are variations of the algorithms originally presented by Vann et al. (2018). For consistency, FASP, which is the terminology used for the short-time Fourier transform (STFT), has been implemented as part of the library to provide a similar interface to the STFT of the raw signal. Additionally, the library contains an algorithm to generate artificial signals with basic customizations such as the base frequency, sample rate, duration, number of harmonics, noise, and number of signals. Finally, the library provides multiple interactive visualizations, each of which is implemented using IPyWidgets and works in a Jupyter environment. A dashboard-style visualization is provided, which contains some common signal-processing visual components (signal, FFT, spectogram) updating in unison with the HASP functions (see Figure 1 below). Separate from the dashboard, an independent visualization is provided for each of the DASP algorithms as well as for the artifical signal generator. These visualizations are included in the library to aid in developing an intuitive understanding how the algorithms are affected by different input signals and parameter selections.

harmonics↗
DOE OSTI2023

Implementation and test of an automated control hunting fault correction algorithm in a fault detection and diagnostics tool

Control hunting due to improper proportional–integral–derivative (PID) parameters in the building automation system (BAS) is one of the most common faults identified in commercial buildings. It can cause suboptimal performance and early failure of heating, ventilation, and air conditioning (HVAC) equipment. Commercial fault detection and diagnostics (FDD) software represents one of the fastest growing market segments in smart building technologies in the United States. Implementation of PID retuning procedures as an auto-correction algorithm and integration into FDD software has the potential to mitigate control hunting across a heterogeneous portfolio of buildings with different BAS in a scalable way. This paper presents the development, implementation, and field testing of an automated control hunting fault correction algorithm based on lambda tuning open-loop rules. The algorithm was developed in a commercial FDD software and successfully tested among nine variable air volume boxes in an office building in the United States. The paper shows the feasibility of using FDD tools to automatically correct control hunting faults, discusses scalability considerations, and proposes a path forward for the HVAC industry and academia to further improve this technology.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

Reinforcement Learning-Based Oscillation Dampening: Scaling Up Single-Agent Reinforcement Learning Algorithms to a 100-Autonomous-Vehicle Highway Field Operational Test

In this article, we explore the technical details of the reinforcement learning (RL) algorithms that were deployed in the largest field test of automated vehicles designed to smooth traffic flow in history as of 2023, uncovering the challenges and breakthroughs that come with developing RL controllers for automated vehicles. We delve into the fundamental concepts behind RL algorithms and their application in the context of self-driving cars, discussing the developmental process from simulation to deployment in detail, from designing simulators to reward function shaping. We present the results in both simulation and deployment, discussing the flow-smoothing benefits of the RL controller. From understanding the basics of Markov decision processes to exploring advanced techniques such as deep RL, our article offers a comprehensive overview and deep dive of the theoretical foundations and practical implementations driving this rapidly evolving field. We also showcase real-world case studies and alternative research projects that highlight the impact of RL controllers in revolutionizing autonomous driving. From tackling complex urban environments to dealing with unpredictable traffic scenarios, these intelligent controllers are pushing the boundaries of what automated vehicles can achieve. Furthermore, we examine the safety considerations and hardware-focused technical details surrounding deployment of RL controllers into automated vehicles. As these algorithms learn and evolve through interactions with the environment, ensuring their behavior aligns with safety standards becomes crucial. Here, we explore the methodologies and frameworks being developed to address these challenges, emphasizing the importance of building reliable control systems for automated vehicles.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

Development of an FGPA-Based Cavity Simulator for Testing RF Controls

LLRF is used to precisely control the amplitude and phase of the RF field in cavities. Often times, access to test the control algorithms with RF equipment, especially in the presence of beam, is limited or beyond reach. In such cases, testing must be done through computer modeling or simulations. Computer modeling is often too slow and difficult to interface with the LLRF hardware. Analog or digital cavity simulators are preferred as they allow for interaction with the LLRF controls platform in real-time, and compared to their analog counterparts, FPGA-based digital cavity simulators allow for a more adjustable and sophisticated implementation. The newly developed FPGA-based cavity simulator includes the cavity electrical model, the cavity mechanical model including Lorentz Force Detuning and microphonics, an amplifier model which can simulate real amplifier nonlinearities, and a beam model. The simulator has been validated using measurements from BNL’s CeC 704 MHz 5-cell SRF cryomodule.

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

Application of the Approximate Bayesian Computation Algorithm to Gamma-Ray Spectroscopy

Radioisotope identification (RIID) algorithms for gamma-ray spectroscopy aim to infer what isotopes are present and in what amounts in test items. RIID algorithms either use all energy channels in the analysis region or only energy channels in and near identified peaks. Because many RIID algorithms rely on locating peaks and estimating each peak’s net area, peak location and peak area estimation algorithms continue to be developed for gamma-ray spectroscopy. This paper shows that approximate Bayesian computation (ABC) can be effective for peak location and area estimation. Algorithms to locate peaks can be applied to raw or smoothed data, and among several smoothing options, the iterative bias reduction algorithm (IBR) is recommended; the use of IBR with ABC is shown to potentially reduce uncertainty in peak location estimation. Extracted peak locations and areas can then be used as summary statistics in a new ABC-based RIID. ABC allows for easy experimentation with candidate summary statistics such as goodness-of-fit scores and peak areas that are extracted from relatively high dimensional gamma spectra with photopeaks (1024 or more energy channels) consisting of count rates versus energy for a large number of gamma energies.

Burr, Tom↗
DOE OSTI2026

CVEVOLVE

CVEvolve is an agentic AI system for autonomous algorithm discovery for scientific data processing. It creates workflows where large language model agents freely set up and configure development environments and evaluation harnesses, develop and improve data processing algorithms with designed exploration-exploitation balancing mechanisms, log history and findings in a structured database, and run holdout testing to ensure algorithm generalizability. CVEvolve offers a zero-code interface and does not require users to provide structured data and evaluation scripts.

Cherukara, MatthewJoseph [Argonne National Laborat↗
DOE OSTI2022

NISQ Benchmarking

Test suite of quantum algorithms for Noisy Intermediate Scale Quantum (NISQ) computers. The test suite includes benchmark-style code for quantum volume circuits (QV), fairness sampling circuits, quantum telecloning circuits, and other NISQ benchmark style algorithms on small problems (i.e., up to 100 qubits), such as Variational Quantum Eigensolver (VQE), Hamiltonian Simulation, and Grover unstructured search example circuits. These benchmark-style applications are implemented in quantum software packages, mostly IBM's QISKIT, but may include vendor-specific frameworks, such as PyQuil (for Rigetti) or Q\# for Microsoft, or CirQ (for Google) as the test suite grows with the vendor sample. The test suite also includes numerical simulation code for Quantum Alternating Operator Ansatz (QAOA) algorithms, VQE, Hamiltonian Simulation and search examples. Numerical simulation code simulates quantum computers on classical computers, which is only possible for small problem instances; the implementation framework of choice is typically within Python, using the numpy/scipy libraries as well as extensions to the Julia language.

Pelofske, Elijah↗