Search NASA⌕ Search

SEARCH · Search NASA

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 NTRS2002

Particle Swarm Optimization

The purpose of this paper is to show how the search algorithm known as particle swarm optimization performs. Here, particle swarm optimization is applied to structural design problems, but the method has a much wider range of possible applications. The paper's new contributions are improvements to the particle swarm optimization algorithm and conclusions and recommendations as to the utility of the algorithm, Results of numerical experiments for both continuous and discrete applications are presented in the paper. The results indicate that the particle swarm optimization algorithm does locate the constrained minimum design in continuous applications with very good precision, albeit at a much higher computational cost than that of a typical gradient based optimizer. However, the true potential of particle swarm optimization is primarily in applications with discrete and/or discontinuous functions and variables. Additionally, particle swarm optimization has the potential of efficient computation with very large numbers of concurrently operating processors.

Venter, Gerhard↗
DOE OSTI2022

Hybrid Particle Swarm-Interpolation Algorithm for Improved Critical Experiment Design

The typical goal of designing a critical experiment is twofold: a system that is both critical and optimized for some other value. This value could be an energy-integrated sensitivity, percent fissions in a certain energy range, or some other value that can be calculated by a transport code. By simulating different combinations of reflector, moderator, and fuel thicknesses a designer can identify such a desirable configuration. The domain of all possible combinations of these thicknesses is referred to as the experiment search space. As more dimensions are added, the search space increases in size exponentially. For a three-dimensional case, which includes three thickness values between zero and ten centimeters to the nearest tenth of a millimeter, a total of 1,000 3 , configurations exists. Rather than check each configuration individually, which would be extremely computationally expensive, it has been shown to be more efficient to use a conventional particle swarm optimization (PSO) algorithm to identify critical and optimal configurations. This work presents the theory and implementation of a novel hybrid PSO interpolation algorithm to perform these optimizations faster than a conventional PSO algorithm. To demonstrate this, an example optimization will be carried out by the conventional and hybrid PSO algorithms and their performances will be compared.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1992

Systematic Disturbance Of Optimal Rotational Trajectory

Algorithm introduces systematic disturbance into otherwise optimal rotation of body from prescribed initial to prescribed final orientation. Disturbance introduced as deviation of actual axis of rotation from optimal one, like wobble of top. Algorithm effects rotational transformations and solves differential equations necessary to compute disturbed trajectory. Devised for use with motion-control program and three-dimensional computer-graphical display to study ability of observers to distinguish between optimal and suboptimal rotational trajectories.

Grunwald, Arthur J.↗
DOE OSTI2018

Optimal Coordination of Building Loads and Energy Storage for Power Grid and End User Services

Demand response and energy storage play a profound role in the smart grid. The focus of this paper is to evaluate benefits of coordination of flexible loads and energy storage for power grid and end user services. We present a Generalized Battery Model (GBM) to describe the flexibility of building loads and energy storage. A Model Predictive Control (MPC) approach is proposed to characterize the GBM parameters (power and energy limits) for flexible building loads. Moreover, we develop optimal coordination algorithms for them to provide ancillary and end user services such as energy arbitrage, frequency regulation, spinning reserve, as well as energy and demand charge reduction. Several case studies have been performed to demonstrate the efficacy of the GBM and coordination algorithms, and evaluate the benefits of using their flexibility to provide grid and end user services. We show that optimal coordination yields significant cost saving and revenue. Moreover, the best option for grid services is to provide energy arbitrage and frequency regulation, because spinning reserve cannot compete with regulation service. Furthermore, when coordinating flexible loads with energy storage to provide end user services, it is recommended to consider both the time-of-use (TOU) price and demand charge rather than the TOU price only in order to flat the aggregate power profile.

Hao, He↗
DOE OSTI2018

Optimization methodology for the global 10 Hz orbit feedback in RHIC

To combat beam oscillations induced by triplet vibrations at the Relativistic Heavy Ion Collider (RHIC), a global orbit feedback system was developed and applied at injection and top energy in 2011, and during beam acceleration in 2012. Singular Value Decomposition (SVD) was employed to determine the strengths and currents of the applied corrections. The feedback algorithm was optimized for different magnetic configurations (lattices) at fixed beam energies and during beam acceleration. While the orbit feedback performed well since its inception, corrector current transients and feedback-induced beam oscillations were observed during the polarized proton program in 2015. In this paper, we present the feedback algorithm, the optimization of the algorithm for various lattices and the solution adopted to mitigate the observed current transients during beam acceleration.

43 PARTICLE ACCELERATORS↗
NASA NTRS2018

Optimal Estimation-Based Algorithm to Retrieve Aerosol Optical Properties for GEMS Measurements Over Asia

The Geostationary Environment Monitoring Spectrometer (GEMS) is scheduled to be in orbit in 2019 onboard the GEO-KOMPSAT 2B satellite and will continuously monitor air quality over Asia. The GEMS will make measurements in the UV spectrum (300-500 nm) with 0.6 nm resolution. In this study, an algorithm is developed to retrieve aerosol optical properties from UV-visible measurements for the future satellite instrument and is tested using 3 years of existing OMI L1B data. This algorithm provides aerosol optical depth (AOD), single scattering albedo (SSA) and aerosol layer height (ALH) using an optimized estimation method. The retrieved AOD shows good correlation with Aerosol Robotic Network (AERONET) AOD with correlation coefficients of 0.83, 0.73 and 0.80 for heavy-absorbing fine (HAF) particles, dust and non-absorbing (NA) particles, respectively. However, regression tests indicate underestimation and overestimation of HAF and NA AOD, respectively. In comparison with AOD from the OMI/Aura Near-UV Aerosol Optical Depth and Single Scattering Albedo 1-orbit L2 Swath 13 km x 24 km V003 (OMAERUV) algorithm, the retrieved AOD has a correlation coefficient of 0.86 and linear regression equation, AOD(sub GEMS) = 1.18AOD(sub OMAERUV) + 0.09. An uncertainty test based on a reference method, which estimates retrieval error by applying the algorithm to simulated radiance data, revealed that assumptions in the spectral dependency of aerosol absorptivity in the UV cause significant errors in aerosol property retrieval, particularly the SSA retrieval. Consequently, retrieved SSAs did not show good correlation with AERONET values. The ALH results were qualitatively compared with the Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) products and were found to be well correlated for highly absorbing aerosols. The difference between the attenuated-backscatter-weighted height from CALIOP and retrieved ALH were mostly closed to zero when the retrieved AOD is higher than 0.8 and SSA is lower than 0.93. Although retrieval accuracy was not significantly improved, the simultaneous consistent retrieval of AOD, SSA and ALH alone demonstrates the value of this stand-alone algorithm, given their nature for error using other methods. The use of these properties as input parameters for the air mass factor calculation is expected to improve the retrieval of other trace gases over Asia.

Geostationary Environment Monitoring Spectrometer ↗
DOE OSTI2016

SU-F-T-377: Monte Carlo Re-Evaluation of Volumetric-Modulated Arc Plans of Advanced Stage Nasopharygeal Cancers Optimized with Convolution-Superposition Algorithm

Background: Commercial treatment planning system Pinnacle3 (Philips, Fitchburg, WI, USA) employs a convolution-superposition algorithm for volumetric-modulated arc radiotherapy (VMAT) optimization and dose calculation. Study of Monte Carlo (MC) dose recalculation of VMAT plans for advanced-stage nasopharyngeal cancers (NPC) is currently limited. Methods: Twenty-nine VMAT prescribed 70Gy, 60Gy, and 54Gy to the planning target volumes (PTVs) were included. These clinical plans achieved with a CS dose engine on Pinnacle3 v9.0 were recalculated by the Monaco TPS v5.0 (Elekta, Maryland Heights, MO, USA) with a XVMC-based MC dose engine. The MC virtual source model was built using the same measurement beam dataset as for the Pinnacle beam model. All MC recalculation were based on absorbed dose to medium in medium (Dm,m). Differences in dose constraint parameters per our institution protocol (Supplementary Table 1) were analyzed. Results: Only differences in maximum dose to left brachial plexus, left temporal lobe and PTV54Gy were found to be statistically insignificant (p> 0.05). Dosimetric differences of other tumor targets and normal organs are found in supplementary Table 1. Generally, doses outside the PTV in the normal organs are lower with MC than with CS. This is also true in the PTV54-70Gy doses but higher dose in the nasal cavity near the bone interfaces is consistently predicted by MC, possibly due to the increased backscattering of short-range scattered photons and the secondary electrons that is not properly modeled by the CS. The straight shoulders of the PTV dose volume histograms (DVH) initially resulted from the CS optimization are merely preserved after MC recalculation. Conclusion: Significant dosimetric differences in VMAT NPC plans were observed between CS and MC calculations. Adjustments of the planning dose constraints to incorporate the physics differences from conventional CS algorithm should be made when VMAT optimization is carried out directly with MC dose engine.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2020

Multiobjective Optimal Controlled Variable Selection for a Gas Turbine–Solid Oxide Fuel Cell System Using a Multiagent Optimization Platform

Hybrid gas turbine–fuel cell systems have immense potential for high efficiency in electrical power generation with cleaner emissions compared with fossil-fueled power generation. We report a systematic controlled variable (CV) selection method is deployed for a hybrid gas turbine–fuel cell system in the HyPer (hybrid performance) facility at the U.S. Department of Energy’s National Energy Technology Laboratory (NETL) for maximizing its economic and control performance. A three-stage approach is used for the CV selection comprising a priori analysis, multiobjective optimization, and a posteriori analysis. The a priori analysis helps to screen off several candidate CVs, thus reducing the size of the combinatorial optimization problem for multiobjective CV selection. For optimal CV selection, a transfer function model of the HyPer facility is identified. By considering several candidate models, the final transfer function model is selected using Akaike’s Final Prediction Error criterion. Experimental data from the HyPer facility are used to estimate the noise in the measurement data. For solving the combinatorial multiobjective optimization problem for CV selection, a multiagent optimization platform comprising simulated annealing, genetic algorithm, and efficient ant colony optimization algorithms is used. Pareto-optimal CV sets exhibit a high trade-off between the economic and control objective. The a posteriori analysis is undertaken for several top Pareto-optimal CV sets. An optimal CV set is selected that shows the best compromise between process economics and controllability under both nominal and off-design conditions.

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

Comparison of Optimal Energy Management Strategies Using Dynamic Programming, Model Predictive Control, and Constant Velocity Prediction

Due to the recent advancements in autonomous vehicle technology, future vehicle velocity predictions are becoming more robust which allows fuel economy (FE) improvements in hybrid electric vehicles through optimal energy management strategies (EMS). A real- world highway drive cycle (DC) and a controls-oriented 2017 Toyota Prius Prime model are used to study potential FE improvements. We proposed three important metrics for comparison: (1) perfect full drive cycle prediction using dynamic programming, (2) 10-second prediction horizon model predictive control (MPC), and (3) 10-second constant velocity prediction. These different velocity predictions are put into an optimal EMS derivation algorithm to derive optimal engine torque and engine speed. The results show that the constant velocity prediction algorithm outperformed the baseline control strategy but underperformed the MPC strategy with an average 1.58% and 2.45% of FE improvement with highway and city-highway DC. Also, using a 10-second prediction window MPC strategy provided FE improvement results close to the full drive cycle prediction case. MPC has the potential to achieve 60%-65% and 70% - 80% of global FE improvement over highway and city-highway DC respectively.

Patel, Amol Arvind↗
DOE OSTI2020

Comparison of Optimal Energy Management Strategies Using Dynamic Programming, Model Predictive Control, and Constant Velocity Prediction

Due to the recent advancements in autonomous vehicle technology, future vehicle velocity predictions are becoming more robust which allows fuel economy (FE) improvements in hybrid electric vehicles through optimal energy management strategies (EMS). A realworld highway drive cycle (DC) and a controls-oriented 2017 Toyota Prius Prime model are used to study potential FE improvements. We proposed three important metrics for comparison: (1) perfect full drive cycle prediction using dynamic programming, (2) 10-second prediction horizon model predictive control (MPC), and (3) 10-second constant velocity prediction. These different velocity predictions are put into an optimal EMS derivation algorithm to derive optimal engine torque and engine speed. The results show that the constant velocity prediction algorithm outperformed the baseline control strategy but underperformed the MPC strategy with an average 1.58% and 2.45% of FE improvement with highway and city-highway DC. Also, using a 10-second prediction window MPC strategy provided FE improvement results close to the full drive cycle prediction case. MPC has the potential to achieve 60%-65% and 70% - 80% of global FE improvement over highway and city-highway DC respectively.

Patel, Amol Arvind↗
NASA NTRS1991

Reliable numerical computation in an optimal output-feedback design

This paper presents a reliable algorithm for the evaluation of a quadratic performance index and its gradients with respect to the controller design parameters. The algorithm is part of a design algorithm for optimal linear dynamic output-feedback controller that minimizes a finite-time quadratic performance index. The numerical scheme is particularly robust when it is applied to the control-law synthesis for systems with densely packed modes and where there is a high likelihood of encountering degeneracies in the closed-loop eigensystem. The algorithm has been included in a control design package for optimal robust low-order controllers. Usefulness of the proposed numerical algorithm has been demonstrated using numerous practical design cases where degeneracies occur frequently in the closed-loop system under an arbitrary controller design initialization and during the numerical search.

Vansteenwyk, Brett↗
DOE OSTI2026

Refractory-based thermal energy storage for industrial process heat: one-dimensional modeling, control, and optimization

The variable and weather-dependent output of wind and solar power plants present a substantial challenge for planning and operating electricity-systems, particularly in the absence of cost-effective and dispatchable energy storage technologies. This study investigates a high-temperature, electrically heated, refractory-based thermal energy storage (RTES) system that stores electrical energy as sensible heat in dense ceramic bricks over the 950–1800 °C range. The stored heat can be discharged as a controlled hot-gas stream for industrial heating, fuel substitution in high-temperature processes, or electricity generation. The main novelty is a comprehensive modelling, control, mapping, and optimization framework that integrates one-dimensional transient gas–solid heat transfer, fan-assisted discharge, bypass-flow regulation, reheating logic, fan-power evaluation, insulation-loss assessment, and genetic-algorithm-based design optimization. The model uses feedback from outlet temperature and delivered power to regulate discharge, while a two-stage genetic algorithm optimizes brick-channel geometry, gas-flow operation, and multilayer insulation thicknesses. Storage capacities below 50 MWh and discharge powers of 5–30 MW are analyzed to evaluate hold time, thermal delivery, fan-power penalty, heat loss, state-of-charge evolution, and indicative capital cost. Results demonstrate that optimized and well-insulated refractory-based thermal energy storage units can provide stable, efficient, and repeatable heat delivery over multiple discharge cycles. The generated performance and cost maps support modular refractory thermal energy storage as a practical option for large-scale integration of wind and solar generation and for high-temperature industrial process heat.

25 ENERGY STORAGE↗
DOE OSTI2017

An enhanced artificial neural network with a shuffled complex evolutionary global optimization with principal component analysis

The classical Back-Propagation (BP) scheme with gradient-based optimization in training Artificial Neural Networks (ANNs) suffers from many drawbacks, such as the premature convergence, and the tendency of being trapped in local optimums. Therefore, as an alternative for the BP and gradient-based optimization schemes, various Evolutionary Algorithms (EAs), i.e., Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Simulated Annealing (SA), and Differential Evolution (DE), have gained popularity in the field of ANN weight training. This study applied a new efficient and effective Shuffled Complex Evolutionary Global Optimization Algorithm with Principal Component Analysis – University of California Irvine (SP-UCI) to the weight training process of a three-layer feed-forward ANN. A large-scale numerical comparison is conducted among the SP-UCI-, PSO-, GA-, SA-, and DE-based ANNs on 17 benchmark, complex, and real-world datasets. Here the results show that SP-UCI-based ANN outperforms other EA-based ANNs in the context of convergence and generalization. Results suggest that the SP-UCI algorithm possesses good potential in support of the weight training of ANN in real-word problems. In addition, the suitability of different kinds of EAs on training ANN is discussed. The large-scale comparison experiments conducted in this paper are fundamental references for selecting proper ANN weight training algorithms in practice.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
NASA NTRS2007

Scope of Gradient and Genetic Algorithms in Multivariable Function Optimization

Global optimization of a multivariable function - constrained by bounds specified on each variable and also unconstrained - is an important problem with several real world applications. Deterministic methods such as the gradient algorithms as well as the randomized methods such as the genetic algorithms may be employed to solve these problems. In fact, there are optimization problems where a genetic algorithm/an evolutionary approach is preferable at least from the quality (accuracy) of the results point of view. From cost (complexity) point of view, both gradient and genetic approaches are usually polynomial-time; there are no serious differences in this regard, i.e., the computational complexity point of view. However, for certain types of problems, such as those with unacceptably erroneous numerical partial derivatives and those with physically amplified analytical partial derivatives whose numerical evaluation involves undesirable errors and/or is messy, a genetic (stochastic) approach should be a better choice. We have presented here the pros and cons of both the approaches so that the concerned reader/user can decide which approach is most suited for the problem at hand. Also for the function which is known in a tabular form, instead of an analytical form, as is often the case in an experimental environment, we attempt to provide an insight into the approaches focusing our attention toward accuracy. Such an insight will help one to decide which method, out of several available methods, should be employed to obtain the best (least error) output. *

Shaykhian, Gholam Ali↗
NASA NTRS1989

A Doppler centroid estimation algorithm for SAR systems optimized for the quasi-homogeneous source

Radar signal processing applications frequently require an estimate of the Doppler centroid of a received signal. The Doppler centroid estimate is required for synthetic aperture radar (SAR) processing. It is also required for some applications involving target motion estimation and antenna pointing direction estimation. In some cases, the Doppler centroid can be accurately estimated based on available information regarding the terrain topography, the relative motion between the sensor and the terrain, and the antenna pointing direction. Often, the accuracy of the Doppler centroid estimate can be improved by analyzing the characteristics of the received SAR signal. This kind of signal processing is also referred to as clutterlock processing. A Doppler centroid estimation (DCE) algorithm is described which contains a linear estimator optimized for the type of terrain surface that can be modeled by a quasi-homogeneous source (QHS). Information on the following topics is presented: (1) an introduction to the theory of Doppler centroid estimation; (2) analysis of the performance characteristics of previously reported DCE algorithms; (3) comparison of these analysis results with experimental results; (4) a description and performance analysis of a Doppler centroid estimator which is optimized for a QHS; and (5) comparison of the performance of the optimal QHS Doppler centroid estimator with that of previously reported methods.

Jin, Michael Y.↗
NASA NTRS1984

Investigation and appreciation of optimal output feedback. Volume 1: A convergent algorithm for the stochastic infinite-time discrete optimal output feedback problem

The stochastic, infinite time, discrete output feedback problem for time invariant linear systems is examined. Two sets of sufficient conditions for the existence of a stable, globally optimal solution are presented. An expression for the total change in the cost function due to a change in the feedback gain is obtained. This expression is used to show that a sequence of gains can be obtained by an algorithm, so that the corresponding cost sequence is monotonically decreasing and the corresponding sequence of the cost gradient converges to zero. The algorithm is guaranteed to obtain a critical point of the cost function. The computational steps necessary to implement the algorithm on a computer are presented. The results are applied to a digital outer loop flight control problem. The numerical results for this 13th order problem indicate a rate of convergence considerably faster than two other algorithms used for comparison.

Halyo, N.↗