Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Optimization 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 1,333 records · Page 74
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

ISRU Pilot Excavator - Development of Autonomous Excavation Algorithms

The ISRU Pilot Excavator (IPEx) is a Space Technology Mission Directorate (STMD) Game Changing Development (GCD) project to develop a robotic excavator to demonstrate excavation of up to 10 metric tons of lunar regolith. IPEx is based on the Regolith Advanced Surface Systems Operations Robot (RASSOR) excavator developed at NASA Kennedy Space Center (KSC) and utilizes a counter rotating bucket drum concept to balance excavation forces for use on reduced gravity planetary bodies. To take advantage of the counter rotating bucket drum mechanism, work is being done to develop new autonomous excavation strategies and algorithms. Referred to as “Auto-dig”, these algorithms will allow IPEx to excavate, drive, and deliver its target mass of 10 metric tons of lunar regolith during an 11-day mission semi-autonomously. Due to bandwidth and latency constraints teleoperation will be kept to a minimum, with operators periodically confirming and verifying the excavator’s high-level tasks and operations. While the work to develop optimized autodig solutions is ongoing at KSC, early tests have yielded interesting results that have led to the discovery of additional risks that need to be mitigated in autonomous excavation. Testing has also encouraged the development of new software and visualization tools that provide real-time insight into excavation loads during operation, allowing faster development and helping build better intuition to the excavation process. These tools will help in the pursuit to develop fully optimized digging algorithms that are robust enough to handle hazards such as rocks or irregular terrain.

B. C. Buckles↗
NASA NTRS1997

Biweekly Maps of Wind Stress for the North Pacific from the ERS-1 Scatterometer

The European Remote-sensing Satellite (ERS-1) was launched in July 1991 and contained several instruments for observing the Earth's ocean including a wind scatterometer. The scatterometer measurements were processed by the European Space Agency (ESA) and the Jet Propulsion Laboratory (JPL). JPL reprocessed (Freilich and Dunbar, 1992) the ERS-1 backscatter measurements to produced a 'value added' data set that contained the ESA wind vector as well as a set of up to four ambiguities. These ambiguities were further processed using a maximum-likelihood estimation (MLE) and a median filter to produce a 'selected vector.' This report describes a technique developed to produce time-averaged wind field estimates with their expected errors using only scatterometer wind vectors. The processing described in this report involved extracting regions of interest from the data tapes, checking the quality and creating the wind field estimate. This analysis also includes the derivation of biweekly average wind vectors over the North Pacific Ocean at a resolution of 0.50 x 0.50. This was done with an optimal average algorithm temporally and an over-determined biharmonic spline spatially. There have been other attempts at creating gridded wind files from ERS-1 winds, e.g., kriging techniques (Bentamy et al., 1996) and successive corrections schemes (Tang and Liu, 1996). There are several inherent problems with the ERS-1 scatterometer. Since this is a multidisciplinary mission, the satellite is flown in different orbits optimized for each phase of the mission. The scatterometer also shares several sub-systems with the Synthetic Aperture Radar (SAR) and cannot be operated while the SAR is in operation. The scatterometer is also a single-sided instrument and only measures backscatter along the right side of the satellite. The processing described here generates biweekly wind maps during the wktwo years analysis period regardless of the satellite orbit or missing data.

SYNTHETIC APERTURE RADAR↗
DOE OSTI2022

Critical Analysis of Replacements for R-410A in Heat Pump Applications

Using low-GWP refrigerants can reduce the Green House Gas (GHG) emission of HVAC systems. Research has shown that using heat exchangers with small diameter tubes is a promising solution to meet the performance goals of heat pump using low-GWP refrigerants due to reduced refrigerant charge, reduced flammable impact and environmental impact. However, application of small diameter tube requires in-depth component design optimization to make the new system adapt to low-GWP refrigerants.In this paper, multi-objective optimizations using Particle Swarm Optimization (PSO) algorithm on a R-410A residential 5-ton air source heat pump is performed for improved system performance and reduced material cost. Five R-410A alternatives, i.e., R-32, R-454A, R-454B, R-454C and R-455A are investigated. R-455A and R-454C have GWP lower than 150. As a result of optimization, 12.4%-19.1% Energy Efficiency Ratio (EER) improvement and up to 71% HXs material cost saving is achieved. Life Cycle Climate Performance (LCCP) analysis shows that optimized systems reduce total CO2 emission by 13%-33% depending on the choice of refrigerant and climate zone.The optimal heat exchangers resulting from this research can fit into the original R-410A fan-coil units. The proposed heat pump design method establishes a production and installation path to produce cost-effective low-GWP heat pumps easily accepted by end users.

Li, Zhenning↗
NASA NTRS2012

SBUV version 8.6 Retrieval Algorithm: Error Analysis and Validation Technique

SBUV version 8.6 algorithm was used to reprocess data from the Back Scattered Ultra Violet (BUV), the Solar Back Scattered Ultra Violet (SBUV) and a number of SBUV/2 instruments, which 'span a 41-year period from 1970 to 2011 (except a 5-year gap in the 1970s)[see Bhartia et al, 2012]. In the new version Daumont et al. [1992] ozone cross section were used, and new ozone [McPeters et ai, 2007] and cloud climatologies Doiner and Bhartia, 1995] were implemented. The algorithm uses the Optimum Estimation technique [Rodgers, 2000] to retrieve ozone profiles as ozone layer (partial column, DU) on 21 pressure layers. The corresponding total ozone values are calculated by summing ozone columns at individual layers. The algorithm is optimized to accurately retrieve monthly zonal mean (mzm) profiles rather than an individual profile, since it uses monthly zonal mean ozone climatology as the A Priori. Thus, the SBUV version 8.6 ozone dataset is better suited for long-term trend analysis and monitoring ozone changes rather than for studying short-term ozone variability. Here we discuss some characteristics of the SBUV algorithm and sources of error in the SBUV profile and total ozone retrievals. For the first time the Averaging Kernels, smoothing errors and weighting functions (or Jacobians) are included in the SBUV metadata. The Averaging Kernels (AK) represent the sensitivity of the retrieved profile to the true state and contain valuable information about the retrieval algorithm, such as Vertical Resolution, Degrees of Freedom for Signals (DFS) and Retrieval Efficiency [Rodgers, 2000]. Analysis of AK for mzm ozone profiles shows that the total number of DFS for ozone profiles varies from 4.4 to 5.5 out of 6-9 wavelengths used for retrieval. The number of wavelengths in turn depends on solar zenith angles. Between 25 and 0.5 hPa, where SBUV vertical resolution is the highest, DFS for individual layers are about 0.5.

Kramarova, N. A.↗
NASA NTRS2004

Evolutionary computing for the design search and optimization of space vehicle power subsystems

Evolutionary computing has proven to be a straightforward and robust approach for optimizing a wide range of difficult analysis and design problems. This paper discusses the application of these techniques to an existing space vehicle power subsystem resource and performance analysis simulation in a parallel processing environment.

evolutionary computing genetic algorithms optimiza↗
DOE OSTI2020

Classical Optimizers for Noisy Intermediate-Scale Quantum Devices

We present a collection of optimizers tuned for usage on Noisy Inter-mediate-Scale Quantum (NISQ) devices. Optimizers have a range of applications in quantum computing, including the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization (QAOA) algorithms. They have further uses in calibration, hyperparameter tuning, machine learning, etc. We employ the VQE algorithm as a case study. VQE is a hybrid algorithm, with a classical minimizer step driving the next evaluation on the quantum processor. While most results to date concentrated on tuning the quantum VQE circuit, our study indicates that in the presence of quantum noise the classical minimizer step is a weak link and a careful choice combined with tuning is required for correct results. We explore state-of-the-art gradient-free optimizers capable of handling noisy, black-box, cost functions and stress-test them using a quantum circuit simulation environment with noise injection capabilities on individual gates. Our results indicate that specifically tuned optimizers are crucial to obtaining valid science results on NISQ hardware, as well as projecting forward on fault tolerant circuits.

Lavrijsen, Wim↗
DOE OSTI2025

Practical Implementation of GPU-based Computing at the Grid Edge for Resilience Scenarios

This paper presents a practical implementation of GPU-accelerated computing at the grid edge to enhance power system resilience through next-generation smart meters. Advanced Metering Infrastructure (AMI) systems rely predominantly on centralized processing architectures, which limit real-time response capabilities during grid disturbances. This work proposes the integration of GPU-enabled computational platforms directly within smart meter to enable local execution support for power system analytics, fault detection algorithms, and optimization routines. The proposed framework uses the Julia programming language to leverage highperformance parallel computing capabilities while maintaining code portability and development efficiency. We use two experimental scenarios to benchmark the computational feasibility of this approach: sparse linear system solutions representative of power flow analyses, and multi-stage production cost simulations incorporating unit commitment and economic dispatch operations. Results demonstrate that computationally intensive power system algorithms, such as those supporting resilience scenario calculations, can be effectively executed at the distribution edge using commercially available embedded GPU hardware. Keywords—GPU acceleration, edge computing, smart meters, grid resilience, AMI, resilience.

De Souza, Reubun [School of Electrical Engineering↗
DOE OSTI2025

Traffic Control via Connected and Automated Vehicles (CAVs): An Open-Road Field Experiment with 100 CAVs

The CIRCLES project aims to reduce instabilities in traffic flow, which are naturally occurring phenomena due to human driving behavior. Also called “phantom jams” or “stop-and-go waves,” these instabilities are a significant source of wasted energy. Toward this goal, the CIRCLES project designed a control system, referred to as the MegaController by the CIRCLES team, that could be deployed in real traffic. Our field experiment, the MegaVanderTest (MVT), leveraged a heterogeneous fleet of 100 longitudinally controlled vehicles as Lagrangian traffic actuators, each of which ran a controller with the architecture described in this article. The MegaController is a hierarchical control architecture that consists of two main layers. The upper layer is called the Speed Planner and is a centralized optimal control algorithm. It assigns speed targets to the vehicles, conveyed through the LTE cellular network. The lower layer is a control layer, running on each vehicle. It performs local actuation by overriding the stock adaptive cruise controller, using the stock onboard sensors. The Speed Planner ingests live data feeds provided by third parties as well as data from our own control vehicles and uses both to perform the speed assignment. The architecture of the Speed Planner allows for the modular use of standard control techniques, such as optimal control, model predictive control (MPC), kernel methods, and others. The architecture of the local controller allows for the flexible implementation of local controllers. Corresponding techniques include deep reinforcement learning (RL), MPC, and explicit controllers. Depending on the vehicle architecture, all onboard sensing data can be accessed by the local controllers or only some. Likewise, control inputs vary across different automakers, with inputs ranging from torque or acceleration requests for some cars to electronic selection of adaptive cruise control (ACC) setpoints in others. The proposed architecture technically allows for the combination of all possible settings proposed previously, that is {Speed Planner algorithms} × {local Vehicle Controller algorithms} × {full or partial sensing} × {torque or speed control}. As a result, most configurations were tested throughout the ramp up to the MegaVandertest (MVT).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

State Estimation-Based Distributed Energy Resource Optimization for Distribution Voltage Regulation in Telemetry-Sparse Environments Using a Real-Time Digital Twin

Real-time state estimation using a digital twin can overcome the lack of in-field measurements inside an electric feeder to optimize grid services provided by distributed energy resources (DERs). Optimal reactive power control of DERs can be used to mitigate distribution system voltage violations caused by increased penetrations of photovoltaic (PV) systems. In this work, a new technology called the Programmable Distribution Resource Open Management Optimization System (ProDROMOS) issued optimized DER reactive power setpoints based-on results from a particle swarm optimization (PSO) algorithm wrapped around OpenDSS time-series feeder simulations. This paper demonstrates the use of the ProDROMOS in a RT simulated environment using a power hardware-in-the-loop PV inverter and in a field demonstration, using a 678 kW PV system in Grafton (MA, USA). The primary contribution of the work is demonstrating a RT digital twin effectively provides state estimation pseudo-measurements that can be used to optimize DER operations for distribution voltage regulation.

Darbali-Zamora, Rachid↗
DOE OSTI2022

Online peak-aware energy scheduling with untrusted advice

This paper studies the online energy scheduling problem in a hybrid model where the cost of energy is proportional to both the volume and peak usage, and where energy can be either locally generated or drawn from the grid. Inspired by recent advances in online algorithms with Machine Learned (ML) advice, we develop parameterized deterministic and randomized algorithms for this problem such that the level of reliance on the advice can be adjusted by a trust parameter. We then analyze the performance of the proposed algorithms using two performance metrics: robustness that measures the competitive ratio as a function of the trust parameter when the advice is inaccurate, and consistency for competitive ratio when the advice is accurate. Since the competitive ratio is analyzed in two different regimes, we further investigate the Pareto optimality of the proposed algorithms. Our results show that the proposed deterministic algorithm is Pareto-optimal, in the sense that no other online deterministic algorithms can dominate the robustness and consistency of our algorithm. Furthermore, we show that the proposed randomized algorithm dominates the Pareto-optimal deterministic algorithm. Our large-scale empirical evaluations using real traces of energy demand, energy prices, and renewable energy generations highlight that the proposed algorithms outperform worst-case optimized algorithms and fully data-driven algorithms.

Lee, Russell↗
DOE OSTI2022

A Framework for Closed-Loop Optimization of an Automated Mechanical Serial-Sectioning System via Run-to-Run Control as Applied to a Robo-Met.3D

Optimization of automated data collection is gaining increased interest for the purposes of enabling closed-loop self-correcting systems that inherently maximize operational efficiencies and reduce waste. Many data collection systems have several variables which influence data accuracy or consistency and which can require frequent user interaction to be monitored and maintained. Operating upon a Robo-MET.3D™ automated mechanical serial-sectioning system, a run-to-run control algorithm has been developed to accelerate data collection and reduce data inconsistency. Here, using historical data amassed over a decade of experiments, a linear regression model of the deterministic system dynamics is created and used to employ a run-to-run control algorithm that optimizes selected system inputs to reduce operator intervention and increase efficacy while reducing variance of system output.

42 ENGINEERING↗
NASA NTRS1993

A multi-level solution algorithm for steady-state Markov chains

A new iterative algorithm, the multi-level algorithm, for the numerical solution of steady state Markov chains is presented. The method utilizes a set of recursively coarsened representations of the original system to achieve accelerated convergence. It is motivated by multigrid methods, which are widely used for fast solution of partial differential equations. Initial results of numerical experiments are reported, showing significant reductions in computation time, often an order of magnitude or more, relative to the Gauss-Seidel and optimal SOR algorithms for a variety of test problems. The multi-level method is compared and contrasted with the iterative aggregation-disaggregation algorithm of Takahashi.

Horton, Graham↗
NASA NTRS2011

Scheduling Results for the THEMIS Observation Scheduling Tool

We describe a scheduling system intended to assist in the development of instrument data acquisitions for the THEMIS instrument, onboard the Mars Odyssey spacecraft, and compare results from multiple scheduling algorithms. This tool creates observations of both (a) targeted geographical regions of interest and (b) general mapping observations, while respecting spacecraft constraints such as data volume, observation timing, visibility, lighting, season, and science priorities. This tool therefore must address both geometric and state/timing/resource constraints. We describe a tool that maps geometric polygon overlap constraints to set covering constraints using a grid-based approach. These set covering constraints are then incorporated into a greedy optimization scheduling algorithm incorporating operations constraints to generate feasible schedules. The resultant tool generates schedules of hundreds of observations per week out of potential thousands of observations. This tool is currently under evaluation by the THEMIS observation planning team at Arizona State University.

Thermal Emission Imaging System (THEMIS)↗
NASA NTRS1992

A balanced submatrix merging algorithm for multiprocessor architectures

In this article, a parallel algorithm which applies Givens rotations to selectively annihilate k(k + 1)/2 nonzero elements from two k x n(k not more than n) upper trapezoidal submatrices is described. The new algorithm is suitable for implementation on either a pair of directly connected local-memory processors or two clusters of multiple tightly-coupled processors. Analyses show that in both cases the proposed algorithms achieve optimal speed-up by balancing the work load distribution and masking interprocessor or intercluster communication by computation if k is much small than n. In the context of solving large scale least squares problems, this submatrix merging step is repetitively needed during the entire computation and, furthermore, there are usually many pairs of such submatrices to be merged with each submatrix stored in the memory of a processor or a cluster of processors. The proposed algorithm can be applied to each pair of submatrices concurrently, and thus parallelizes an important step in solving the least squares problems.

Chu, Eleanor↗
DOE OSTI2023

Integrated path planning and control through proximal policy optimization for a marine current turbine

This paper presents an integrated path planning and tracking control framework for a marine current turbine (MCT), where the MCT is treated as an energy-harvesting autonomous underwater vehicle (AUV). Considering the ocean (space of action) is continuous, the proposed framework employs two modules to address path planning and path tracking enabled by the proximal policy optimization (PPO) algorithm, which is a policy gradient deep reinforcement learning (RL) method. Further, to enable fully autonomous operation in a stochastic oceanic environment, the proposed path planning seeks a primary objective of maximizing the harvested energy; then, the path tracking module is designed to minimize the tracking error and avoid collisions with static and dynamic obstacles. Using field-collected acoustic Doppler current profiler (ADCP) data, the performance of the proposed framework is evaluated. Comparative studies with baseline algorithms in three different scenarios of path planning, path tracking without an obstacle, and path tracking with collision avoidance verify the effectiveness of our proposed approach.

16 TIDAL AND WAVE POWER↗
DOE OSTI2024

Investigation of fast and efficient lossless compression algorithms for macromolecular crystallography experiments

Structural biology experiments benefit significantly from state-of-the-art synchrotron data collection. One can acquire macromolecular crystallography (MX) diffraction data on large-area photon-counting pixel-array detectors at framing rates exceeding 1000 frames per second, using 200 Gbps network connectivity, or higher when available. In extreme cases this represents a raw data throughput of about 25 GB s −1 , which is nearly impossible to deliver at reasonable cost without compression. Our field has used lossless compression for decades to make such data collection manageable. Many MX beamlines are now fitted with DECTRIS Eiger detectors, all of which are delivered with optimized compression algorithms by default, and they perform well with current framing rates and typical diffraction data. However, better lossless compression algorithms have been developed and are now available to the research community. Here one of the latest and most promising lossless compression algorithms is investigated on a variety of diffraction data like those routinely acquired at state-of-the-art MX beamlines.

36 MATERIALS SCIENCE↗
NASA NTRS2011

Optimal Padding for the Two-Dimensional Fast Fourier Transform

One-dimensional Fast Fourier Transform (FFT) operations work fastest on grids whose size is divisible by a power of two. Because of this, padding grids (that are not already sized to a power of two) so that their size is the next highest power of two can speed up operations. While this works well for one-dimensional grids, it does not work well for two-dimensional grids. For a two-dimensional grid, there are certain pad sizes that work better than others. Therefore, the need exists to generalize a strategy for determining optimal pad sizes. There are three steps in the FFT algorithm. The first is to perform a one-dimensional transform on each row in the grid. The second step is to transpose the resulting matrix. The third step is to perform a one-dimensional transform on each row in the resulting grid. Steps one and three both benefit from padding the row to the next highest power of two, but the second step needs a novel approach. An algorithm was developed that struck a balance between optimizing the grid pad size with prime factors that are small (which are optimal for one-dimensional operations), and with prime factors that are large (which are optimal for two-dimensional operations). This algorithm optimizes based on average run times, and is not fine-tuned for any specific application. It increases the amount of times that processor-requested data is found in the set-associative processor cache. Cache retrievals are 4-10 times faster than conventional memory retrievals. The tested implementation of the algorithm resulted in faster execution times on all platforms tested, but with varying sized grids. This is because various computer architectures process commands differently. The test grid was 512 512. Using a 540 540 grid on a Pentium V processor, the code ran 30 percent faster. On a PowerPC, a 256x256 grid worked best. A Core2Duo computer preferred either a 1040x1040 (15 percent faster) or a 1008x1008 (30 percent faster) grid. There are many industries that can benefit from this algorithm, including optics, image-processing, signal-processing, and engineering applications.

Dean, Bruce H.↗
DOE OSTI2023

Optimizing Fast Charging and Wetting in Lithium-Ion Batteries with Optimal Microstructure Patterns Identified by Genetic Algorithm

To sustain the high-rate current required for fast charging electric vehicle batteries, electrodes must exhibit sufficiently high effective ionic diffusion. Additionally, to reduce battery manufacturing costs, wetting time must decrease. Both of these issues can be addressed by structuring the electrodes with mesoscale pore channels. However, their optimal spatial distribution, or patterns, is unknown. Herein, a genetic algorithm has been developed to identify these optimal patterns using a CPU-cheap proxy distance-based model to evaluate the impact of the added pore networks. Both coin-cell and pouch cell form factors have been considered for the wetting analysis, with their respective electrolyte infiltration mode. Regular hexagonal and mud-crack-like patterns, respectively, for fast charging and fast wetting were found to be optimal and have been compared with pre-determined, easier to manufacture, patterns. The model predicts that using cylindrical channels arranged in a regular hexagonal pattern is ∼6.25 times more efficient for fast charging as compared to grooved lines with both structuring strategies being restricted to a 5% electrode total volume loss. The model also shows that only a very limited electrode volume loss (1%–2%) is required to dramatically improve the wetting (5–20 times) compared to an unstructured electrode.

25 ENERGY STORAGE↗