Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithmic 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 1,459 records · Page 81
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

AN AUTOMATED MACHINE LEARNING-GENETIC ALGORITHM FRAMEWORK WITH ACTIVE LEARNING FOR DESIGN OPTIMIZATION

The use of machine learning (ML)-based surrogate models is a promising technique to significantly accelerate simulation-driven design optimization of internal combustion (IC) engines, due to the high computational cost of running computational fluid dynamics (CFD) simulations. However, training the ML models requires hyperparameter selection, which is often done using trial-and-error and domain expertise. Another challenge is that the data required to train these models are often unknown a priori. In this work, we present an automated hyperparameter selection technique coupled with an active learning approach to address these challenges. The technique presented in this study involves the use of a Bayesian approach to optimize the hyperparameters of the base learners that make up a super learner model. In addition to performing hyperparameter optimization (HPO), an active learning approach is employed, where the process of data generation using simulations, ML training, and surrogate optimization is performed repeatedly to refine the solution in the vicinity of the predicted optimum. The proposed approach is applied to the optimization of a compression ignition engine with control parameters relating to fuel injection, in-cylinder flow, and thermodynamic conditions. It is demonstrated that by automatically selecting the best values of the hyperparameters, a 1.6% improvement in merit value is obtained, compared to an improvement of 1.0% with default hyperparameters. Overall, the framework introduced in this study reduces the need for technical expertise in training ML models for optimization while also reducing the number of simulations needed for performing surrogate-based design optimization.

Owoyele, Opeoluwa↗
DOE OSTI2019

Multi-scale topology optimization of multi-material structures with controllable geometric complexity — Applications to heat transfer problems

This study presents a topology optimization method to design assemblies of periodic cellular materials with controllable geometric complexity. The framework is based on a novel multi-scale and multi-material design model in which the structure, the layout of the material subdomains, and their micro-structures are optimized concurrently. To allow a tight control over its geometrical complexity, the layout at the macro-scale is described by level-set fields, parameterized by geometric primitives. The micro-scale geometry is represented through a density approach. A nonlinear programming algorithm drives the optimization process using design sensitivities computed by the discrete adjoint method. The proposed design framework is studied with heat transfer problems. Practical design problems, such as a heat sink and a thermal storage unit with phase change are discussed. The macro-scale analysis model relies on a generalized transient diffusion equation. At the micro-scale, homogenization is used to compute equivalent material properties. The numerical examples in this study show that the optimized multi-scale multi-material layouts outperform the corresponding mono-scale structures while maintaining geometric simplicity at the macro-scale level.

42 ENGINEERING↗
DOE OSTI2022

Real Time Predictive and Adaptive Hybrid Powertrain Control Development via Neuroevolution

The real-time application of powertrain-based predictive energy management (PrEM) brings the prospect of additional energy savings for hybrid powertrains. Torque split optimal control methodologies have been a focus in the automotive industry and academia for many years. Their real-time application in modern vehicles is, however, still lagging behind. While conventional exact and non-exact optimal control techniques such as Dynamic Programming and Model Predictive Control have been demonstrated, they suffer from the curse of dimensionality and quickly display limitations with high system complexity and highly stochastic environment operation. This paper demonstrates that Neuroevolution associated drive cycle classification algorithms can infer optimal control strategies for any system complexity and environment, hence streamlining and speeding up the control development process. Neuroevolution also circumvents the integration of low fidelity online plant models, further avoiding prohibitive embedded computing requirements and fidelity loss. This brings the prospect of optimal control to complex multi-physics system applications. The methodology presented here covers the development of the drive cycles used to train and validate the neurocontrollers and classifiers, as well as the application of the Neuroevolution process.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

Innovating the next generation of commercial smart building software

Nearly 30% of commercial building energy use is wasted due to equipment faults and HVAC controls problems. The result is increased emissions, compromised comfort and productivity, and less reliable coordination of building power needs with a clean grid. The energy impact alone represents $17 billion in potential savings. Today’s smart building software provides a robust solution to address these operational deficiencies. Energy management and information systems (EMIS) are saving up to 9% on average, with two-year paybacks. They are being incorporated into energy management processes, commissioning services, and utility programs. As effective as they are, two barriers prevent even deeper benefits; limited personnel to fix problems once they are identified, and the expense and time to manually implement changes in control systems. In partnership with the research community, the EMIS industry is developing new capabilities to overcome these barriers. Moving beyond siloed products for either fault detection and diagnostics, or optimal control, these new capabilities empower users to not only automatically identify faults, but also to push corrective action, and control improvements to their buildings. In this paper, several areas for enhancements are documented: ‘one-time’ correction of faults such as setpoints, schedules, and economizer lockouts; short-term active testing for automated proportional integral derivative (PID) loop tuning and functional testing; and continuous supervisory control for demand flexibility and year-round efficiency. Results are presented from a pair of partner implementations out of a dozen providers integrating these enhancements into their products, including field tests from across the country, and insights into operator acceptance and integration into operations and maintenance practices.

Casillas, Armando↗
DOE OSTI2020

Formal methods approach to the charging facility location problem for battery electric vehicles

Battery electric vehicles (BEVs) are becoming more prevalent as improvements in battery technology and energy management continue to be made. As the number of electric vehicles grows, the demand for fast-charging stations is expected to increase dramatically. Thus, building new charging station infrastructure efficiently will be key to reducing upfront costs while meeting consumer demands. In this work, we propose a method for choosing a set of charging station locations that are optimized based on a set of given common vehicle demand points. As part of this solution, we also offer a novel abstraction of the road network on which energy-efficient paths that account for charge-time delays may be found. The current algorithm chooses the optimal charging locations for a single agent which has a route objective specified using temporal logic. To demonstrate the proposed method, the running example shows how a charging station could be chosen for an electric delivery vehicle. Simulations were run on sample road networks with a given set of demand points to service and potential charging station locations to compare. The method is shown to successfully rank potential charging stations in terms of their expected average charging time cost.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2015

SPITZER IRAC PHOTOMETRY FOR TIME SERIES IN CROWDED FIELDS

We develop a new photometry algorithm that is optimized for the Infrared Array Camera (IRAC) Spitzer time series in crowded fields and that is particularly adapted to faint or heavily blended targets. We apply this to the 170 targets from the 2015 Spitzer microlensing campaign and present the results of three variants of this algorithm in an online catalog. We present detailed accounts of the application of this algorithm to two difficult cases, one very faint and the other very crowded. Several of Spitzer's instrumental characteristics that drive the specific features of this algorithm are shared by Kepler and WFIRST, implying that these features may prove to be a useful starting point for algorithms designed for microlensing campaigns by these other missions.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2016

Denoising of polychromatic CT images based on their own noise properties

Purpose: Because of high diagnostic accuracy and fast scan time, computed tomography (CT) has been widely used in various clinical applications. Since the CT scan introduces radiation exposure to patients, however, dose reduction has recently been recognized as an important issue in CT imaging. However, low-dose CT causes an increase of noise in the image and thereby deteriorates the accuracy of diagnosis. In this paper, the authors develop an efficient denoising algorithm for low-dose CT images obtained using a polychromatic x-ray source. The algorithm is based on two steps: (i) estimation of space variant noise statistics, which are uniquely determined according to the system geometry and scanned object, and (ii) subsequent novel conversion of the estimated noise to Gaussian noise so that an existing high performance Gaussian noise filtering algorithm can be directly applied to CT images with non-Gaussian noise. Methods: For efficient polychromatic CT image denoising, the authors first reconstruct an image with the iterative maximum-likelihood polychromatic algorithm for CT to alleviate the beam-hardening problem. We then estimate the space-variant noise variance distribution on the image domain. Since there are many high performance denoising algorithms available for the Gaussian noise, image denoising can become much more efficient if they can be used. Hence, the authors propose a novel conversion scheme to transform the estimated space-variant noise to near Gaussian noise. In the suggested scheme, the authors first convert the image so that its mean and variance can have a linear relationship, and then produce a Gaussian image via variance stabilizing transform. The authors then apply a block matching 4D algorithm that is optimized for noise reduction of the Gaussian image, and reconvert the result to obtain a final denoised image. To examine the performance of the proposed method, an XCAT phantom simulation and a physical phantom experiment were conducted. Results: Both simulation and experimental results show that, unlike the existing denoising algorithms, the proposed algorithm can effectively reduce the noise over the whole region of CT images while preventing degradation of image resolution. Conclusions: To effectively denoise polychromatic low-dose CT images, a novel denoising algorithm is proposed. Because this algorithm is based on the noise statistics of a reconstructed polychromatic CT image, the spatially varying noise on the image is effectively reduced so that the denoised image will have homogeneous quality over the image domain. Through a simulation and a real experiment, it is verified that the proposed algorithm can deliver considerably better performance compared to the existing denoising algorithms.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

Accelerated Constrained Sparse Tensor Factorization on Massively Parallel Architectures

This study presents the first constrained sparse tensor factorization (cSTF) framework that optimizes and fully offloads computation to massively parallel GPU architectures, and the first performance characterization of cSTF on GPU architectures. In contrast to prior work on tensor factorization, where the matricized tensor times Khatri-Rao product (MTTKRP) is the primary performance bottleneck, our systematic analysis of the cSTF algorithm on GPUs reveals that adding constraints creates an additional bottleneck in the update operation for many real-world sparse tensors. While executing the update operation on the GPU brings significant speedup over its CPU counterpart, it remains a significant bottleneck. To further accelerate the update operation, we propose cuADMM, a new update algorithm that leverages algorithmic and code optimization strategies to minimize both computation and data movement on GPUs. As a result, our framework delivers significantly improved performance compared to prior state-of-the-art. On 10 real-world sparse tensors, our framework achieves geometric mean speedup of 5.1 × (max 41.59 ×) and 7.01 × (max 58.05 ×) on the NIVIDA A100 and H100 GPUs, respectively, over the state-of-the-art SPLATT library running on a 26-core Intel Ice Lake Xeon CPU.

Soh, Yongseok↗
DOE OSTI2026

Use of Digital Real-Time Simulation and Optimization to Identify Maximum Real Power Injection on Banshee Distribution Network

This study investigates the hosting capacity of the Banshee Distribution Network by optimizing the real power injection at carefully selected Distributed Energy Resource (DER) locations. The analysis is conducted within the framework of power system operational constraints, including bus voltage ranges, thermal line ratings, and transformer loading limits. A Python-based Genetic Algorithm (GA), implemented using the PyGAD library, is employed to iteratively identify the optimal power injection configuration that maximizes network utilization while preserving system reliability. The methodology integrates a real-time simulation environment using the Real-Time Digital Simulator (RTDS), allowing high-fidelity evaluation of power flow and voltage behavior under each proposed injection scenario. By coupling the optimization algorithm with real-time simulation feedback, this approach ensures that both static and dynamic constraints are enforced during the evaluation process. The GA leverages evolutionary operators such as selection, crossover, and mutation to navigate the nonlinear search space efficiently. The results of the study delineate the feasible hosting capacity at three targeted buses, reflecting maximum real power levels that can be injected without causing voltage violations, transformer overloading, or line congestion. These findings provide a decision- support tool for distribution planners and utilities aiming to integrate higher penetrations of DERs in existing infrastructure. Additionally, the work lays the foundation for extending such optimization techniques to multi-objective formulations, including economic dispatch and reactive power coordination, in future studies.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Use of Digital Real-Time Simulation and Optimization to Identify Maximum Real Power Injection on the Banshee Distribution Network: Preprint

This study investigates the hosting capacity of the Banshee Distribution Network by optimizing the real power injection at carefully selected Distributed Energy Resource (DER) locations. The analysis is conducted within the framework of power system operational constraints, including bus voltage ranges, thermal line ratings, and transformer loading limits. A Python-based Genetic Algorithm (GA), implemented using the PyGAD library, is employed to iteratively identify the optimal power injection configuration that maximizes network utilization while preserving system reliability. The methodology integrates a real-time simulation environment using the Real-Time Digital Simulator (RTDS), allowing high-fidelity evaluation of power flow and voltage behavior under each proposed injection scenario. By coupling the optimization algorithm with real-time simulation feedback, this approach ensures that both static and dynamic constraints are enforced during the evaluation process. The GA leverages evolutionary operators such as selection, crossover, and mutation to navigate the nonlinear search space efficiently. The results of the study delineate the feasible hosting capacity at three targeted buses, reflecting maximum real power levels that can be injected without causing voltage violations, transformer overloading, or line congestion. These findings provide a decision- support tool for distribution planners and utilities aiming to integrate higher penetrations of DERs in existing infrastructure. Additionally, the work lays the foundation for extending such optimization techniques to multi-objective formulations, including economic dispatch and reactive power coordination, in future studies.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2018

New approach based on group technology for the consolidation problem in cloud computing-mathematical model and genetic algorithm

Resource management is a hotspot issue in distributed systems like cloud computing (CC). It means how to prepare the computational resources, i.e., servers and virtual machines (VMS), to execute the tasks. This paper offers a new approach based on Group Technology (GT)—known as a powerful philosophy for the resource management in cellular manufacturing systems—to deal with the resource management problem in CC. We develop a mathematical model to optimally consolidate the VMs, servers and tasks simultaneously to control several important factors such as task migrations and server load variation, as well as the number of VMs. To test the validity of our proposed model, several small problems are generated randomly and solved by LINGO 9 software. Furthermore, to cope with larger problems, which cannot be solved optimally, a genetic algorithm is proposed. We, finally, compare our methods with the most well-known algorithms in this context, round robin (RR) and first-come, first-served (FCFS) algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Development of an integrated core–edge scenario using the super H-mode

An optimized pedestal regime called the super-H (SH) mode is leveraged to couple a fusion relevant core plasma with a high density scrape-off layer appropriate for realistic reactor power exhaust solutions. Recent DIII-D experiments have expanded the operating space of the SH regime using advanced control algorithms and investigated optimization of impurity seeding, deuterium gas puffing, and 3D magnetic perturbations. Simultaneous real-time control of the pedestal density and radiated power with in-vessel coils and nitrogen seeding enable optimal coupled divertor and pedestal conditions. Four case studies are analysed with varied levels of radiated power in the divertor volume ranging from 0 (no seeding) to 8.5 MW radiated from carbon and nitrogen emission. Plasmas with a 4.5 MW radiated power target establish a radiative mantle, leading to divertor temperatures of ~16 eV while maintaining SH-mode, and with only marginal impact on the pedestal and core performance. Increased levels of N 2 seeding with a 7.5 MW radiated power target facilitate detachment onset and divertor temperatures <5 eV, with no degradation in stored energy and the operational point remaining inside the SH-mode channel for $ > 2.5{\tau }_{\text{E}}$. Finally, a 8.5 MW radiated power target leads to partial detachment, which is so far associated with the loss of access to SH-mode pedestal conditions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2015

Optimizing deep learning hyper-parameters through an evolutionary algorithm. In: MLHPC '15 Proceedings of the Workshop on Machine Learning in High-Performance Computing Environments, Article No. 4

There has been a recent surge of success in utilizing Deep Learning (DL) in imaging and speech applications for its relatively automatic feature generation and, in particular for convolutional neural networks (CNNs), high accuracy classification abilities. While these models learn their parameters through data-driven methods, model selection (as architecture construction) through hyper-parameter choices remains a tedious and highly intuition driven task. To address this, Multi-node Evolutionary Neural Networks for Deep Learning (MENNDL) is proposed as a method for automating network selection on computational clusters through hyper-parameter optimization performed via genetic algorithms.

Young, Steven R.↗
DOE OSTI2017

Model-based optimization of near-field binary-pixelated beam shapers

The optimization of components that rely on spatially dithered distributions of transparent or opaque pixels and an imaging system with far-field filtering for transmission control is demonstrated. The binary-pixel distribution can be iteratively optimized to lower an error function that takes into account the design transmission and the characteristics of the required far-field filter. Simulations using a design transmission chosen in the context of high-energy lasers show that the beam-fluence modulation at an image plane can be reduced by a factor of 2, leading to performance similar to using a non-optimized spatial-dithering algorithm with pixels of size reduced by a factor of 2 without the additional fabrication complexity or cost. The optimization process preserves the pixel distribution statistical properties. Analysis shows that the optimized pixel distribution starting from a high-noise distribution defined by a random-draw algorithm should be more resilient to fabrication errors than the optimized pixel distributions starting from a low-noise, error-diffusion algorithm, while leading to similar beamshaping performance. Furthermore, this is confirmed by experimental results obtained with various pixel distributions and induced fabrication errors.

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

Exactness of OPF Relaxation on Three-phase Radial Networks with Delta Connections

Simulations have shown that while semi-definite relaxations of AC optimal power flow (AC-OPF) on three-phase radial networks with only wye connections tend to be exact, the presence of delta connections seem to render them inexact. This paper shows that such inexactness originates from the non-uniqueness of relaxation solutions and numerical errors amplified by the non-uniqueness. This finding motivates two algorithms to recover the exact solution of AC-OPF in unbalanced distribution networks featuring both wye and delta connections. In simulations using IEEE 13, 37 and 123-bus systems, the proposed algorithms provide exact optimal solutions up to numerical precision.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Nonlinear control of safety factor gradient in tokamaks using spatially variable electron cyclotron current drives

Active control of plasma properties may be necessary to achieve stable operation of next-generation tokamaks over large time scales. Such control algorithms can regulate the plasma properties to avoid the onset of magnetohydrodynamic (MHD) instabilities. For instance, the global and local properties of the safety factor profile are linked to the onset of neoclassical tearing modes (NTMs). This work proposes a model-based control approach for deterring/delaying NTMs through active modulation of one of the safety factor properties - the gradient of the safety factor profile at a particular rational safety factor surface. In particular, a novel control-oriented model for the local safety factor gradient is developed. The nonlinear control model is governed by a nonautonomous ordinary differential equation that accounts for a given rational safety factor surface’s spatial variation over time. Further, to improve the controllability of the spatially evolving parameter, the control model treats ECH&CD positions, along with noninductive powers, as controllable variables. A nonlinear control algorithm based on feedback linearization with optimization is synthesized to achieve the objective of regulating the safety factor gradient around a given target. The proposed algorithm allocates optimal ECH&CD positions, in addition to auxiliary powers, at each time instant as the rational safety factor surface drifts to locations with a low control authority. Stability guarantees of the proposed control law are also discussed in this work. The proposed algorithm is tested for a DIII-D tokamak scenario in nonlinear simulations carried out using the Control Oriented Transport SIMulator (COTSIM). Both fixed and moving ECH&CD cases are studied, and their outcomes are compared. Simulation results demonstrate that enthusiastic regulation of the safety factor gradient can be achieved during the ramp-up and flat-top phases of tokamak operation in both fixed and moving ECH&CD cases. However, real-time updates of ECH&CD positions can prevent the saturation of auxiliary powers.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗