Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithms optimization”

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 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

Technical report series on global modeling and data assimilation. Volume 4: Documentation of the Goddard Earth Observing System (GEOS) data assimilation system, version 1

This report describes the analysis component of the Goddard Earth Observing System, Data Assimilation System, Version 1 (GEOS-1 DAS). The general features of the data assimilation system are outlined, followed by a thorough description of the statistical interpolation algorithm, including specification of error covariances and quality control of observations. We conclude with a discussion of the current status of development of the GEOS data assimilation system. The main components of GEOS-1 DAS are an atmospheric general circulation model and an Optimal Interpolation algorithm. The system is cycled using the Incremental Analysis Update (IAU) technique in which analysis increments are introduced as time independent forcing terms in a forecast model integration. The system is capable of producing dynamically balanced states without the explicit use of initialization, as well as a time-continuous representation of non- observables such as precipitation and radiational fluxes. This version of the data assimilation system was used in the five-year reanalysis project completed in April 1994 by Goddard's Data Assimilation Office (DAO) Data from this reanalysis are available from the Goddard Distributed Active Center (DAAC), which is part of NASA's Earth Observing System Data and Information System (EOSDIS). For information on how to obtain these data sets, contact the Goddard DAAC at (301) 286-3209, EMAIL daac@gsfc.nasa.gov.

Suarez, Max J.↗
DOE OSTI2026

Degenerate coupled-cluster theory

A size-extensive, converging, black-box, ab initio coupled-cluster (ΔCC) ansatz is introduced that computes the energies and wave functions of states from any degenerate or nondegenerate Slater-determinant references with any numbers of α- and β-spin electrons, any patterns of orbital occupancy, any spin multiplicities, and any spatial symmetries. For a nondegenerate reference, it reduces to the single-reference coupled-cluster ansatz. For a degenerate multireference, it is a natural coupled-cluster extension of degenerate Møller–Plesset perturbation (ΔMP) theory. For ionized and electron-attached references, it is a coupled-cluster Green’s function, although the present theory is convergent toward the full-configuration-interaction limits, while the Feynman–Dyson many-body Green’s function (MBGF) theory generally is not. Its single-excitation instance is a projection Hartree–Fock theory as per the Thouless theorem, which may be useful for core ionizations, high-spin states, and possibly electron affinities. Additionally, a new multireference coupled-cluster theory for a general model space is developed. This quasidegenerate coupled-cluster (QCC) theory is exactly converging, but not black-box, and intended for strong correlation. Determinant-based, general-order algorithms of ΔCC and QCC theories are implemented and compared with configuration-interaction (CI) and equation-of-motion coupled-cluster (EOM-CC) theories through octuple excitations and with ΔMP and MBGF theories up to the nineteenth order. An algebraic, optimal-scaling algorithm of the ΔCC theory is computer-synthesized at the levels of single excitations (ΔCCS) and of single and double excitations (ΔCCSD). As a result, the order of performance is QCC ≈ ΔCC > EOM-CC > CI at the same order or QCC ≈ ΔCC > ΔMP > MBGF at the same cost scaling.

Hirata, So [University of Illinois at Urbana-Champ↗
NASA NTRS2004

A Most Probable Point-Based Method for Reliability Analysis, Sensitivity Analysis and Design Optimization

A major step in a most probable point (MPP)-based method for reliability analysis is to determine the MPP. This is usually accomplished by using an optimization search algorithm. The minimum distance associated with the MPP provides a measurement of safety probability, which can be obtained by approximate probability integration methods such as FORM or SORM. The reliability sensitivity equations are derived first in this paper, based on the derivatives of the optimal solution. Examples are provided later to demonstrate the use of these derivatives for better reliability analysis and reliability-based design optimization (RBDO).

Hou, Gene J.-W↗
DOE OSTI2026

Optimized Gear Selection to Maximize Energy Savings in Electric Traction Drives for Medium and Heavy Duty Vehicles

Multi‑gear transmission systems are commonly used in electric traction drives for medium and heavy‑duty vehicles, while most passenger‑vehicle electric drivetrains rely on a single fixed ratio to reduce cost, weight, and complexity. Using multiple gear ratios can enable downsizing of the motor and inverter while still meeting performance requirements. Additionally, appropriately chosen ratios allow the motor to operate more frequently in high‑efficiency regions, improving overall energy usage and reducing operating costs over the drive cycle. This paper presents a systematic approach for selecting optimal gear ratios for electric drive systems. A neural‑network model is first developed to represent motor losses across the full torque–speed range using data generated from finite element analysis. This model enables fast, accurate evaluation of motor efficiency under varying operating conditions. A genetic‑algorithm‑based optimization framework is then applied to identify gear ratios that maximize energy cost savings over the drive cycle, with the resulting optimal ratios stored for real‑time implementation.

Gadiyar, Nishanth [ORNL] (ORCID:0000000348267524)↗
NASA NTRS1979

Evaluating and minimizing noise impact due to aircraft flyover

Existing techniques were used to assess the noise impact on a community due to aircraft operation and to optimize the flight paths of an approaching aircraft with respect to the annoyance produced. Major achievements are: (1) the development of a population model suitable for determining the noise impact, (2) generation of a numerical computer code which uses this population model along with the steepest descent algorithm to optimize approach/landing trajectories, (3) implementation of this optimization code in several fictitious cases as well as for the community surrounding Patrick Henry International Airport, Virginia.

Jacobson, I. D.↗
DOE OSTI2024

A Generation-Storage Coordination Dispatch Strategy for Power System Based on Causal Reinforcement Learning

In the backdrop of global energy transformation, power systems integrating high proportions of renewable energy sources are facing unprecedented challenges in operational stability and dispatch efficiency. To address these challenges, this study introduces a generation-storage coordination real-time dispatch strategy based on Causal Power System Dynamic Reinforcement Learning (CPSDRL). Diverging from traditional reinforcement learning approaches, CPSDRL innovatively incorporates causal inference within the state prediction model - the crux of model-based reinforcement learning - thereby establishing the Power Causal Dynamic Model (PCDM). Assisted by the prior knowledge of power systems, the model significantly enhances prediction accuracy and reliability through a two-stage training process. Utilizing PCDM, this study further applies a direct policy search algorithm to optimize the real-time dispatch strategy. Experimental results indicate that the proposed method improves the stability of generation-storage coordination real-time dispatch and exhibits competitive advantages in sample efficiency and computational speed, compared to traditional model-based and model-free reinforcement learning algorithms. This method is expected to enhance the practicality and adaptability of causal reinforcement learning techniques in power system scheduling and control.

causal reinforcement learning↗
NASA NTRS1992

Tracing the efficient curve for multi-objective control-structure optimization

A recently developed active set algorithm for tracing parameterized optima is adapted to multiobjective optimization. The algorithm traces a path of Kuhn-Tucker points using homotopy curve tracking techniques, and is based on identifying and maintaining the set of active constraints. Second order necessary optimality conditions are used to determine nonoptimal stationary points on the path. In the bi-objective optimization case the algorithm is used to trace the curve of efficient solution (Pareto optima). As an example, the algorithm is applied to the simultaneous minimization of the weight and control force of a ten-bar truss with two collocated sensors and actuators, with some interesting results.

Rakowska, J.↗
NASA NTRS2000

Algorithmic Perspectives on Problem Formulations in MDO

This work is concerned with an approach to formulating the multidisciplinary optimization (MDO) problem that reflects an algorithmic perspective on MDO problem solution. The algorithmic perspective focuses on formulating the problem in light of the abilities and inabilities of optimization algorithms, so that the resulting nonlinear programming problem can be solved reliably and efficiently by conventional optimization techniques. We propose a modular approach to formulating MDO problems that takes advantage of the problem structure, maximizes the autonomy of implementation, and allows for multiple easily interchangeable problem statements to be used depending on the available resources and the characteristics of the application problem.

Alexandrov, Natalia M.↗
NASA NTRS1990

Active rejection of persistent disturbances in flexible space structures

A dynamic compensator for active rejection of persistent disturbances in flexible space structures is designed on the principle of the H(infinity)-optimization of the sensitivity transfer function matrix. A general state space solution is formulated to the multiinput multioutput H(infinity)-optimal control problem, allowing the use of the H(infinity)-optimal synthesis algorithm for the state-space models of space structures that result from model order reduction. Disturbances encountered in flexible space structures, such as shuttle docking, are investigated using the high-mode and the reduced-order models of a cantilevered two-bay truss, demonstrating the applicability of the H(infinity)-optimal approach.

Hwang, Cheng-Neng↗
NASA NTRS2019

Understanding Machine Learning in Earth Science: A Natural Language Processing Approach

Machine learning (ML) is being increasingly utilized in Earth science research. Benefits of ML include efficiency, reduction of human error, and ability to extract hidden patterns within data. However, the mutual lack of each other’s domain knowledge by ML and Earth science stands as a barrier to timely and effective implementation. Earth science, in particular, faces challenges in generating sample data, compared to those of traditional ML problems such as face recognition or stock predictions, where data is abundant and not lacking in ground truth, which is necessary for labeling. Earth science data are more varying in formats, such as HDF5 and image resolutions, and are not standardized across instruments, even within a given Earth science discipline. Previous studies have been done to outline the specific challenges that Earth science faces with ML, while others have focused on using existing publications to mine information efficiently. Other resources such as Scikit-Learn have developed decision trees for choosing appropriate machine learning algorithms, but application within Earth science subjects becomes much more complex. For the current study, we propose a methodology and tool that aids in implementation of ML in Earth science using natural language processing (NLP). Our work comprises three main parts: (1) analyzing existing publications related to ML and Earth science, using natural language processing: (2) extracting from the publications information on ML models subjects in Earth Science: and (3) visualizing the extracted relationships as a network graph. The resulting network graph should aid the Earth science communities in applying optimal ML algorithms and guiding data preparation through visualization of similar studies. The network graph and analysis of document similarity will be the basis of our next step, which is to develop a decision tree for selecting optimal machine learning methodologies for specified Earth science applications.

Zheng, Laura↗
DOE OSTI2024

SNNVis: Visualizing Graph Embedding of Evolutionary Optimization for Spiking Neural Networks

While Spiking Neural Networks (SNNs) show a lot of promise, it is difficult to optimize them because applying traditional gradient-based optimization techniques is difficult. Even though evolutionary algorithms (EAs) have been shown to promise to optimize SNNs, understanding the relationship between evolving the characteristics of SNNs and their performance to improve the optimization algorithm is challenging because of the complex characteristics and huge population size. We propose visual analytics with novel graph embedding for evolutionary SNNs to address the challenges. While existing graph embedding techniques have limitations in preserving the specific features of the nodes and edges, our approach maintains them. Also, we develop visual analytics for understanding the relationship between the network performance and the features of nodes and edges and exploring and analyzing the evolving SNNs to build insights into improving the EA.

Chae, Junghoon [ORNL] (ORCID:0000000206016746)↗
DOE OSTI2025

Data-Enabled Fusion Technology (Final Scientific/Technical Report)

Advancing Scientific Understanding in Fusion Energy and Machine Learning This research represented a significant step forward in machine learning (ML) applications for fusion energy experiments. The project integrated advanced data-driven modeling, optimization techniques, and artificial intelligence to enhance the predictive capabilities and operational efficiency of plasma-based fusion systems. Specifically, tasks focused on ML-enhanced diagnostics, operator guidance tools, and predictive modeling helped improve the ability to interpret complex fusion experiments. Key areas of advancement included: 1) data-driven plasma control, i.e., using ML algorithms to optimize experimental conditions and classify plasma behaviors based on historical data; 2) spectroscopy and diagnostics, i.e., applying AI models to extract previously inaccessible insights from experimental spectroscopy data; and 3) configuration mapping and operator guidance, i.e., developing a predictive framework to assist scientists in identifying the most effective experimental parameters, reducing reliance on manual adjustments. By refining these ML-driven techniques, the project contributed to the broader scientific community’s understanding of plasma dynamics and fusion energy viability. Technical Effectiveness and Economic Feasibility The methods investigated demonstrated high technical effectiveness, as reflected in milestones assessing the predictive accuracy, performance, and optimization of fusion configurations. The development of an Operator Guidance Tool (OGT), for example, led to more precise control of plasma conditions by learning from experimental data and offering real-time adjustments. From an economic standpoint, DeFT provided: 1) the ability to reduce trial-and-error experimentation, which lowered operational costs; 2) improved data interpretation methods, which enabled more efficient resource allocation in large-scale fusion research projects; and 3) the automation of key diagnostic tasks, which reduced manual labor and human error, increasing overall efficiency. 13 The final assessments of predictive models and optimization strategies demonstrated that these approaches were scalable and could be implemented across multiple fusion energy research programs. Public Benefit and Societal Impact This project contributed directly to the broader goal of achieving sustainable and commercially viable fusion energy, which had profound implications for clean energy production and climate change mitigation. The integration of AI-driven solutions into fusion research: 1) sped up scientific discovery, accelerating progress towards achieving energy breakthroughs; 2) reduced the cost of experimentation, making fusion research more accessible; and 3) provided a framework for future AI applications in high-energy physics, benefiting adjacent fields like space exploration, material science, and renewable energy. Additionally, by fostering collaborations between AI researchers and plasma physicists, this project promoted interdisciplinary innovation that could lead to broader applications beyond fusion research.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
NASA NTRS2002

Multidisciplinary Optimization of a Transport Aircraft Wing using Particle Swarm Optimization

The purpose of this paper is to demonstrate the application of particle swarm optimization to a realistic multidisciplinary optimization test problem. The paper's new contributions to multidisciplinary optimization is the application of a new algorithm for dealing with the unique challenges associated with multidisciplinary optimization problems, and recommendations as to the utility of the algorithm in future multidisciplinary optimization applications. The selected example is a bi-level optimization problem that demonstrates severe numerical noise and has a combination of continuous and truly discrete design variables. The use of traditional gradient-based optimization algorithms is thus not practical. The numerical results presented indicate that the particle swarm optimization algorithm is able to reliably find the optimum design for the problem presented here. The algorithm is capable of dealing with the unique challenges posed by multidisciplinary optimization as well as the numerical noise and truly discrete variables present in the current example problem.

Sobieszczanski-Sobieski, Jaroslaw↗
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↗
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 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↗