Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization algorithm”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS1992

A conjugate gradients/trust regions algorithms for training multilayer perceptrons for nonlinear mapping

This paper addresses the issue of applying a globally convergent optimization algorithm to the training of multilayer perceptrons, a class of Artificial Neural Networks. The multilayer perceptrons are trained towards the solution of two highly nonlinear problems: (1) signal detection in a multi-user communication network, and (2) solving the inverse kinematics for a robotic manipulator. The research is motivated by the fact that a multilayer perceptron is theoretically capable of approximating any nonlinear function to within a specified accuracy. The algorithm that has been employed in this study combines the merits of two well known optimization algorithms, the Conjugate Gradients and the Trust Regions Algorithms. The performance is compared to a widely used algorithm, the Backpropagation Algorithm, that is basically a gradient-based algorithm, and hence, slow in converging. The performances of the two algorithms are compared with the convergence rate. Furthermore, in the case of the signal detection problem, performances are also benchmarked by the decision boundaries drawn as well as the probability of error obtained in either case.

Madyastha, Raghavendra K.↗
NASA NTRS1993

Applications of wavelet-based compression to multidimensional Earth science data

A data compression algorithm involving vector quantization (VQ) and the discrete wavelet transform (DWT) is applied to two different types of multidimensional digital earth-science data. The algorithms (WVQ) is optimized for each particular application through an optimization procedure that assigns VQ parameters to the wavelet transform subbands subject to constraints on compression ratio and encoding complexity. Preliminary results of compressing global ocean model data generated on a Thinking Machines CM-200 supercomputer are presented. The WVQ scheme is used in both a predictive and nonpredictive mode. Parameters generated by the optimization algorithm are reported, as are signal-to-noise (SNR) measurements of actual quantized data. The problem of extrapolating hydrodynamic variables across the continental landmasses in order to compute the DWT on a rectangular grid is discussed. Results are also presented for compressing Landsat TM 7-band data using the WVQ scheme. The formulation of the optimization problem is presented along with SNR measurements of actual quantized data. Postprocessing applications are considered in which the seven spectral bands are clustered into 256 clusters using a k-means algorithm and analyzed using the Los Alamos multispectral data analysis program, SPECTRUM, both before and after being compressed using the WVQ program.

Bradley, Jonathan N.↗
DOE OSTI2025

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

Optimization Methodology for Unconventional Rocket Nozzle Design

Several current rocket engine concepts such as the bell-annular tripropellant engine, and the linear aerospike being proposed for the X-33, require unconventional three-dimensional rocket nozzles which must conform to rectangular or sector-shaped envelopes to meet integration constraints. These types of nozzles exist outside the current experience database, therefore, development of efficient design methods for these propulsion concepts is critical to the success of launch vehicle programs. Several approaches for optimizing rocket nozzles, including streamline tracing techniques, and the coupling of CFD analysis to optimization algorithms are described. The relative strengths and weaknesses of four classes of optimization algorithms are discussed: Gradient based methods, genetic algorithms, simplex methods, and surface response methods. Additionally, a streamline tracing technique, which provides a very computationally efficient means of defining a three-dimensional contour, is discussed. The performance of the various optimization methods on thrust optimization problems for tripropellant and aerospike concepts is assessed and recommendations are made for future development efforts.

Follett, W.↗
NASA NTRS1995

TRACON Aircraft Arrival Planning and Optimization Through Spatial Constraint Satisfaction

A new aircraft arrival planning and optimization algorithm has been incorporated into the Final Approach Spacing Tool (FAST) in the Center-TRACON Automation System (CTAS) developed at NASA-Ames Research Center. FAST simulations have been conducted over three years involving full-proficiency, level five air traffic controllers from around the United States. From these simulations an algorithm, called Spatial Constraint Satisfaction, has been designed, coded, undergone testing, and soon will begin field evaluation at the Dallas-Fort Worth and Denver International airport facilities. The purpose of this new design is an attempt to show that the generation of efficient and conflict free aircraft arrival plans at the runway does not guarantee an operationally acceptable arrival plan upstream from the runway -information encompassing the entire arrival airspace must be used in order to create an acceptable aircraft arrival plan. This new design includes functions available previously but additionally includes necessary representations of controller preferences and workload, operationally required amounts of extra separation, and integrates aircraft conflict resolution. As a result, the Spatial Constraint Satisfaction algorithm produces an optimized aircraft arrival plan that is more acceptable in terms of arrival procedures and air traffic controller workload. This paper discusses the current Air Traffic Control arrival planning procedures, previous work in this field, the design of the Spatial Constraint Satisfaction algorithm, and the results of recent evaluations of the algorithm.

Bergh, Christopher P.↗
NASA NTRS2018

XY vs X Mixer in Quantum Alternating Operator Ansatz for Optimization Problems with Constraints

Quantum Approximate Optimization Algorithm, further generalized as Quantum Alternating Operator Ansatz (QAOA), is a family of algorithms for combinatorial optimization problems. It is a leading candidate to run on emerging universal quantum computers to gain insight into quantum heuristics. In constrained optimization, penalties are often introduced so that the ground state of the cost Hamiltonian encodes the solution (a standard practice in quantum annealing). An alternative is to choose a mixing Hamiltonian such that the constraint corresponds to a constant of motion and the quantum evolution stays in the feasible subspace. Better performance of the algorithm is speculated due to a much smaller search space. We consider problems with a constant Hamming weight as the constraint. We also compare different methods of generating the generalized W-state, which serves as a natural initial state for the Hamming-weight constraint. Using graph-coloring as an example, we compare the performance of using XY model as a mixer that preserves the Hamming weight with the performance of adding a penalty term in the cost Hamiltonian.

quantum computing↗
DOE OSTI2023

Structure optimization with stochastic density functional theory

Linear-scaling techniques for Kohn–Sham density functional theory are essential to describe the ground state properties of extended systems. Still, these techniques often rely on the localization of the density matrix or accurate embedding approaches, limiting their applicability. In contrast, stochastic density functional theory (sDFT) achieves linear- and sub-linear scaling by statistically sampling the ground state density without relying on embedding or imposing localization. In return, ground state observables, such as the forces on the nuclei, fluctuate in sDFT, making optimizing the nuclear structure a highly non-trivial problem. In this work, we combine the most recent noise-reduction schemes for sDFT with stochastic optimization algorithms to perform structure optimization within sDFT. We compare the performance of the stochastic gradient descent approach and its variations (stochastic gradient descent with momentum) with stochastic optimization techniques that rely on the Hessian, such as the stochastic Broyden–Fletcher–Goldfarb–Shanno algorithm. In conclusion, we further provide a detailed assessment of the computational efficiency and its dependence on the optimization parameters of each method for determining the ground state structure of bulk silicon with varying supercell dimensions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Development of novel dynamic machine learning-based optimization of a coal-fired power plant

The increasing fraction of intermittent renewable energy in the electrical grid is resulting in coal-fired boilers now routinely ramp up and down. The current state-of-the-art operation for such boilers is to apply steady-state, neural network-based optimization to make control decisions in real-time, and this report demonstrates the feasibility of extending this to dynamic, neural network-based optimization using a long short-term memory neural network. A simplified numerical simulation of a t-fired coal boiler and supporting equipment is used to represent a real plant subjected to both steady-state, neural network-based optimization and dynamic, neural network-based optimization. Using the same intervals and a particle swarm optimization algorithm, the dynamic optimization outperforms the steady-state optimization and realizes up to 4.58% improvement in thermal efficiency. Dynamic optimization with a long short-term memory neural network is shown to both be feasible and beneficial for operation of a coal-fired boiler under changing load.

42 ENGINEERING↗
DOE OSTI2024

Optimizing and Exploring Untapped Micro-Hydro Hybrid Systems: a Multi-Objective Approach for Crystal Lake as a Large-Scale Energy Storage Solution

Increasing electricity demand and concerns about climate change and fossil fuel consumption have highlighted the importance of renewable energy resources and storage systems. This paper proposes a method for exploring untapped pumped hydro storage potentials to accommodate intermittent renewable energy generation profiles. Hourly measured data from 2022 in Benzie County, Michigan, United States, were gathered for system sizing and a thorough, realistic analysis. By employing the multi-objective grey wolf optimization algorithm, we formulated optimal sizing and energy-management strategies for three different scenarios. Unlike similar studies, the 3rd with triple objective functions (OFs) scenario aims to maximize both reliability and ecological OFs while minimizing the cost OF. It has shown promising results with multiple solutions, considering economic, environmental, and reliability factors. A case study conducted in Crystal Lake, Michigan, revealed that although Crystal Lake would function only as a micro-hydro power facility, it is a promising and huge storage unit with a substantial storage capacity of around 14.9734GWh. The system investigated is significant in the USA due to its rapid deployment capabilities, minimal construction requirements, and ease of integration with the distribution grid. The fuzzy logic method was employed to identify the best non-dominant solution among the other solutions. Furthermore, these outcomes include a notably low levelized cost of energy at 0.046147$/kWh, a robust index of reliability of 99.705%, and a significant reduction in CO₂ emissions amounting to 7.9142×10 3 tons/year, when considering the triple OFs. The paper’s methodology provides valuable insights for regions aiming to utilize renewable energy from untapped storage sources.

13 HYDRO ENERGY↗
DOE OSTI2021

Quantifying particle-scale 3D granular dynamics during rapid compaction from time-resolved in situ 2D x-ray images

Understanding the particle-scale dynamics of granular materials during rapid compaction and flow is of fundamental importance for manufacturing, planetary science, geology, and defense applications. Time-resolved 2D radiography and static 3D x-ray tomography are powerful in situ tools for studying particle-scale dynamics but provide detail only in 2D or with significant time-scale limitations, respectively. Here, we introduce a new method that uses 2D in situ x-ray imaging for determining time-resolved 3D particle-scale dynamics in rapidly compressed granular materials. The method employs initial particle packing structures obtained from x-ray tomography, a 2D x-ray image generation algorithm, and an optimization algorithm. We first describe and validate the method using finite element simulations. Furthermore, we then apply the technique to x-ray phase-contrast images obtained during rapid compaction of granular materials with varying particle morphology and sample thickness. The depth-resolved particle-scale dynamics reveal complex velocity and porosity fields evolving heterogeneously along and perpendicular to the compaction direction. We characterize these features, their fluctuations near the compaction front, and the compaction front thickness. Our technique can be applied to understanding granular dynamics during rapid compaction events, and rearrangements during slower, but non-quasi-static, flows.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Cost Drivers for a Tokamak-Based Compact Pilot Plant

A comprehensive systems code that includes a range of physics and engineering considerations along with a simplified costing model has been utilized to evaluate the primary cost drivers for a compact tokamak pilot plant. The systems code has been benchmarked against several tokamak reactor designs and is utilized with sophisticated optimization algorithms to develop optimal solutions for a set of user-specified assumptions and design constraints. Here, in contrast to previous models that have focused on the cost of electricity as the key cost metric, this study uses the estimated capital cost of the facility. The analysis suggests that a pilot plant with the following features may offer potential for a cost-attractive pilot plant: A ~ 3, H 98y2 > 1.5, P net = 200 MW, 𝜏 𝑝⁢𝑢⁢𝑙⁢𝑠⁢𝑒 ~ 1 to 2 h utilizing rare-earth barium copper oxide (REBCO) magnet technology and a plug-bucked central solenoid/toroidal field (CS/TF) magnet support structure. While REBCO magnets offer some advantages relative to Nb 3 Sn magnets in all cases, the most gain is obtained when combined with the plug-bucked CS/TF bucking solution. Pulsed operation reduces capital cost requirements relative to steady-state operation, especially at low confinement. Cost sensitivity studies indicate that there are significant cost uncertainties associated with the achievable confinement quality, tritium breeding capability, attainable thermal efficiency, and achievable neutron wall loading, suggesting that these areas are the most critical areas in reducing the cost risk for a compact tokamak pilot plant. Further cost sensitivity studies indicate that the estimated cost is most sensitive to the underlying cost of the magnetic coils, providing further impetus to better establish cost-effective means for producing fusion magnets.

Compact pilot plant↗
DOE OSTI2022

Reaction Rover

Reaction Rover is a software application designed to enable reaction optimization with little or no human intervention and to provide a flexible platform to facilitate rapid testing, automation, and implementation of new reaction optimization algorithms. Toward these goals, Reaction Rover is designed to be modular, allowing the optimization algorithm, analyzer, and reactor components to be changed for any given process using easily integrated plugins. The Reaction Rover platform is a key development that enables the testing, use, and automation of machine learning (ML) and non-ML optimizers in a variety of laboratory situations.

Windus, Theresa↗
NASA NTRS1981

Three-axis attitude determination from vector observations

Two computationally efficient algorithms are presented for determining three-axis attitude from two or more vector observations. The first of these, the TRIAD algorithm, provides a deterministic (i.e., nonoptimal) solution for the attitude based on two vector observations. The second, the QUEST algorithm, is an optimal algorithm which determines the attitude that achieves the best weighted overlap of an arbitrary number of reference and observation vectors. Analytical expressions are given for the covariance matrices for the two algorithms using a fairly realistic model for the measurement errors. The mathematical relationship of the two algorithms and their relative merits are discussed and numerical examples are given. The advantage of computing the covariance matrix in the body frame rather than in the inertial frame (e.g., in terms of Euler angles) is emphasized. These results are valuable when a single-frame attitude must be computed frequently. They will also be useful to the mission analyst or spacecraft engineer for the evaluation of launch-window constraints or of attitude accuracies for different attitude sensor configurations.

Shuster, M. D.↗
NASA NTRS1988

Aeroelastic optimization of a helicopter rotor

Structural optimization of a hingeless rotor is investigated to reduce oscillatory hub loads while maintaining aeroelastic stability in forward flight. Design variables include spanwise distribution of nonstructural mass, chordwise location of blade center of gravity and blade bending stiffnesses (flap, lag and torsion). A comprehensive aeroelastic analysis of rotors, based on a finite element method in space and time, is linked with optimization algorithms to perform optimization of rotor blades. Sensitivity derivatives of blade response, hub loads, and eigenvalues with respect to the design variables are derived using a direct analytical approach, and constitute an integral part of the basic blade response and stability analyses. This approach reduces the computation time substantially; an 80 percent reduction of CPU time to achieve an optimum solution, as compared to the widely adopted finite difference approach. Through stiffness and nonstructural mass distributions, a 60-90 percent reduction in all six 4/rev hub loads is achieved for a four-bladed soft-inplane rotor.

Lim, Joon W.↗
NASA NTRS1990

Aeroelastic optimization of a helicopter rotor using an efficient sensitivity analysis

To reduce oscillatory hub loads in forward flight, a structural optimization analysis of a hingeless helicopter rotor has been developed and applied. The aeroelastic analysis of the rotor is based on a finite element method in space and time, and linked with automated optimization algorithms. For the optimization analysis two types of structural representation are used: a generic stiffness-distribution and a single-cell thin-walled beam. For the first type, the design variables are nonstructural mass and its placement, chordwise center of gravity offset from the elastic axis, and stiffness. For the second type, width, height and thickness of spar are used as design variables. For the behavior constraints, frequency placement, autorotational inertia and aeroelastic stability of the blade are included. The required sensitivity derivatives are obtained using a direct analytical approach. An optimum oscillatory hub load shows a 25-77 percent reduction for the generic blade, and 30-50 percent reduction for the box-beam.

Lim, Joon W.↗
NASA NTRS1992

Aeroelastic optimization of an advanced geometry helicopter rotor

Sensitivity derivatives of blade loads and aeroelastic stability of a helicopter rotor in forward flight are calculated as an integral part of a basic aeroelastic analysis using a direct analytical approach. Design variables include nonstructural mass and its placement, chordwise offset of blade center of gravity and aerodynamic center from the elastic axis, blade bending stiffnesses (flap, lag, torsion), and tip geometry (sweep, anhedral, pretwist and planform taper). By means of a sensitivity study, the importance of different design variables on oscillatory hub loads and damping of blade modes is examined. Aeroelastic and sensitivity analyses of the rotor based on a finite element method in space and time are linked with automated optimization algorithms to perform optimization studies of rotor blades. Optimum design solutions, calculated for a four-bladed, soft-inplane hingeless rotor achieved a reduction of 25-60 percent of all 4/rev loads.

Ganguli, Ranjan↗
NASA NTRS2016

Trajectory Design Employing Convex Optimization for Landing on Irregularly Shaped Asteroids

Mission proposals that land on asteroids are becoming popular. However, in order to have a successful mission the spacecraft must reliably and softly land at the intended landing site. The problem under investigation is how to design a fuel-optimal powered descent trajectory that can be quickly computed on- board the spacecraft, without interaction from ground control. An optimal trajectory designed immediately prior to the descent burn has many advantages. These advantages include the ability to use the actual vehicle starting state as the initial condition in the trajectory design and the ease of updating the landing target site if the original landing site is no longer viable. For long trajectories, the trajectory can be updated periodically by a redesign of the optimal trajectory based on current vehicle conditions to improve the guidance performance. One of the key drivers for being completely autonomous is the infrequent and delayed communication between ground control and the vehicle. Challenges that arise from designing an asteroid powered descent trajectory include complicated nonlinear gravity fields, small rotating bodies and low thrust vehicles. There are two previous studies that form the background to the current investigation. The first set looked in-depth at applying convex optimization to a powered descent trajectory on Mars with promising results.1, 2 This showed that the powered descent equations of motion can be relaxed and formed into a convex optimization problem and that the optimal solution of the relaxed problem is indeed a feasible solution to the original problem. This analysis used a constant gravity field. The second area applied a successive solution process to formulate a second order cone program that designs rendezvous and proximity operations trajectories.3, 4 These trajectories included a Newtonian gravity model. The equivalence of the solutions between the relaxed and the original problem is theoretically established. The proposed solution for designing the asteroid powered descent trajectory is to use convex optimization, a gravity model with higher fidelity than Newtonian, and an iterative solution process to design the fuel optimal trajectory. The solution to the convex optimization problem is the thrust profile, magnitude and direction, that will yield the minimum fuel trajectory for a soft landing at the target site, subject to various mission and operational constraints. The equations of motion are formulated in a rotating coordinate system and includes a high fidelity gravity model. The vehicle's thrust magnitude can vary between maximum and minimum bounds during the burn. Also, constraints are included to ensure that the vehicle does not run out of propellant, or go below the asteroid's surface, and any vehicle pointing requirements. The equations of motion are discretized and propagated with the trapezoidal rule in order to produce equality constraints for the optimization problem. These equality constraints allow the optimization algorithm to solve the entire problem, without including a propagator inside the optimization algorithm.

Pinson, Robin M.↗
NASA NTRSDate not supplied

Implementation of Combinatorial Optimization Techniques for Automated Fiber Placement Through Thickness Defect Stack-Up Minimization

The Computer Aided Process Planning (CAPP) module was developed to facilitate and accelerate the process planning workflow for Automated Fiber Placement (AFP). CAPP assists process planners in identifying optimal starting point locations and layup strategies for each ply of a laminate. Ply optimization operates on measurement and scoring of geometry-based defects such as gaps, overlaps, angle deviation, and steering. This paper expands on the established framework for analyzing defect stack-up through thickness of a laminate. Four different combinatorial optimization algorithms are implemented and evaluated: (1) genetic algorithm, (2) differential evolution, (3) particle swarm, and (4) greedy search. The algorithms identify the optimal combination of ply-level layup strategies, by scoring potential laminates on defect stacking, using two different objective functions. A final optimization approach is also presented which trades some performance for a large gain in efficiency. These approaches are compared to a randomized combination using a complex tool surface in a virtual case study. The result is a streamlined methodology for comparing different laminate-level manufacturing strategies and minimizing the through thickness defect stack up.

CAPP↗