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

Local design optimization for composite transport fuselage crown panels

Composite transport fuselage crown panel design and manufacturing plans were optimized to have projected cost and weight savings of 18 percent and 45 percent, respectively. These savings are close to those quoted as overall NASA ACT program goals. Three local optimization tasks were found to influence the cost and weight of fuselage crown panels. This paper summarizes the effect of each task and describes in detail the task associated with a design cost model. Studies were performed to evaluate the relationship between manufacturing cost and design details. A design tool was developed to aid in these investigations. The development of the design tool included combining cost and performance constraints with a random search optimization algorithm. The resulting software was used in a series of optimization studies that evaluated the sensitivity of design variables, guidelines, criteria, and material selection on cost. The effect of blending adjacent design points in a full scale panel subjected to changing load distributions and local variations was shown to be important. Technical issues and directions for future work were identified.

Swanson, G. D.↗
NASA NTRS1996

A Cascade Optimization Strategy for Solution of Difficult Multidisciplinary Design Problems

A research project to comparatively evaluate 10 nonlinear optimization algorithms was recently completed. A conclusion was that no single optimizer could successfully solve all 40 problems in the test bed, even though most optimizers successfully solved at least one-third of the problems. We realized that improved search directions and step lengths, available in the 10 optimizers compared, were not likely to alleviate the convergence difficulties. For the solution of those difficult problems we have devised an alternative approach called cascade optimization strategy. The cascade strategy uses several optimizers, one followed by another in a specified sequence, to solve a problem. A pseudorandom scheme perturbs design variables between the optimizers. The cascade strategy has been tested successfully in the design of supersonic and subsonic aircraft configurations and air-breathing engines for high-speed civil transport applications. These problems could not be successfully solved by an individual optimizer. The cascade optimization strategy, however, generated feasible optimum solutions for both aircraft and engine problems. This paper presents the cascade strategy and solutions to a number of these problems.

Patnaik, Surya N.↗
NASA NTRS2010

Reducing the Volume of NASA Earth-Science Data

A computer program reduces data generated by NASA Earth-science missions into representative clusters characterized by centroids and membership information, thereby reducing the large volume of data to a level more amenable to analysis. The program effects an autonomous data-reduction/clustering process to produce a representative distribution and joint relationships of the data, without assuming a specific type of distribution and relationship and without resorting to domain-specific knowledge about the data. The program implements a combination of a data-reduction algorithm known as the entropy-constrained vector quantization (ECVQ) and an optimization algorithm known as the differential evolution (DE). The combination of algorithms generates the Pareto front of clustering solutions that presents the compromise between the quality of the reduced data and the degree of reduction. Similar prior data-reduction computer programs utilize only a clustering algorithm, the parameters of which are tuned manually by users. In the present program, autonomous optimization of the parameters by means of the DE supplants the manual tuning of the parameters. Thus, the program determines the best set of clustering solutions without human intervention.

Lee, Seungwon↗
NASA NTRS2016

Deconflicting Wind-Optimal Aircraft Trajectories in North Atlantic Oceanic Airspace

North Atlantic oceanic airspace accommodates more than 1000 flights daily, and is subjected to very strong winds. Flying wind-optimal trajectories yields time and fuel savings for each individual flight. However, when taken together, these trajectories induce a large amount of potential en-route conflicts. This paper analyses the detected conflicts, figuring out conflict distribution in time and space. It further describes an optimization algorithm aimed at reducing the number of conflicts for a daily set of flights on strategic level. Several trajectory modification strategies are discussed, followed with simulation results. Finally, an algorithm improvement is presented aiming at better preserving the trajectory optimality.

wind-optimal trajectories↗
NASA NTRSDate not supplied

Robust Trajectory Optimization and GN&C Performance Analysis for NRHO Rendezvous

This paper evaluates several candidate Near-Rectilinear Halo Orbits (NRHO) rendezvous trajectory designs using linear covariance (LinCov) analysis and determines the optimal locations for NRHO rendezvous translational maneuver locations. The performance of several candidate relative trajectory designs are determined as a function of relative navigation accuracy (angles only), inertial optical navigation (OpNav), range observability maneuvers, maneuver execution errors, relative maneuver targeting, and environment uncertainties. Further, the optimal locations of rendezvous maneuvers are determined for each of the candidate reference trajectories. The long-term goal of this research is to utilize LinCov and a genetic optimization algorithm (GA) to determine a complete end-to-end optimal NRHO trajectory design that is robust to navigation errors, maneuver execution errors, and environment uncertainties. This paper represents a first step toward this goal. Three candidate rendezvous trajectories with varying numbers of range-observability maneuvers are evaluated for their robustness to uncertainties, errors, and total trajectory correction delta-v performance. Some key elements of this analysis include relative navigation performance in an NRHO, relative trajectory dispersion performance, and total 3-sigma delta-v performance. This development provides the foundation to then determine an optimal and robust end-to-end NRHO rendezvous trajectory, including the determination of the optimal locations of range observability maneuvers, if needed.

Linear Covariance Analysis↗
DOE OSTI2021

Design Optimization of A-Type Heat Exchangers based on High Performance, Non-Round Tubes

Air-to-refrigerant heat exchangers (HXs) have been the topic of considerable research as they are the fundamental heat transfer components of HVAC&R systems. For residential and commercial applications, indoor heat exchangers are often in A-type configurations to reduce air-conditioner system footprint while still delivering the required cooling or heating. Classical HX design practices typically assume a uniform frontal air velocity profile to facilitate the use of conventional tube-fin airside heat transfer and pressure drop correlations for performance prediction. However, it is well-reported throughout the literature that A-type HXs experience significant airflow maldistribution which can severely degrade HX performance. Additionally, recent advancements in simulation software such as Computational Fluid Dynamics (CFD), Finite Element Analysis (FEA) and optimization algorithms have led researchers to consider primary heat transfer surface optimization to achieve highly compact HXs which do not require fins. In this paper, an A-type HX which utilizes shape-optimized non-round tubes is optimized for minimum duct size and airside pressure drop. This is achieved through coupling of an experimentally validated finite volume HX model with automated 2D CFD simulations of airflow through the HX for airside thermal-hydraulic performance evaluation. Preliminary results show that the optimal designs deliver similar capacity while achieving 20% reductions in airside pressure drop and duct cross-section area. Additionally, the optimal design apex angles in this study were similar to those from previous A-Type HX optimization studies for conventional tube-fin HX geometries, suggesting that the apex angle for optimal A-Type configuration performance may be independent of tube geometry.

42 ENGINEERING↗
DOE OSTI2018

Optimization of stepwise clustering algorithm in backward trajectory analysis

In recent years, the backward trajectory model has been widely used in the research of meteorological and atmospheric environmental quality. This paper presents a comprehensive study on a stepwise clustering analysis algorithm in the clustering process of backward trajectory model and an application of the clustering analysis of single-particle backward trajectory in 2016 in Changchun City. This study starts with an analysis of the original stepwise clustering algorithm and its application to a clustering process of 8784 backward trajectories during 48 h in Changchun City as a benchmark test case. Then, two improvements are made in the algorithm: First, in the process of finding the optimal classification, the algorithm complexity is improved from original O(n 3 ) to O(log(n)*n 2 ) through algorithm improvement. The algorithm performance is enhanced by log(n) times. Next, in the process of re-establishing the classification, the algorithm complexity is improved from the original O(m*n 2 ) to O(m*log(n)*n), that is another algorithm performance improvement by a factor of log(n). Therefore, the accumulative execution efficiency improvement through the algorithm optimization is 2*log(n) times, which has been further verified in the practical application in Changchun City.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Energy Storage Sizing and Operation of an Integrated Utility-Scale PV+ESS Power Plant

Integration of an energy storage system (ESS) into a large-scale grid-connected photovoltaic (PV) power plant is highly desirable to improve performance of the system and overcome the stochastic nature of PV power generation. Algorithms to size ESS within an integrated PV and ESS ( PV+ESS) power plant, conventionally, require a large number of high-resolution samples of PV generation. These algorithms are computationally expensive. In this paper, a two-day optimization algorithm that utilizes n-step constant power output dispatch every day from the PV+ESS power plant is proposed to size the ESS. Additionally, an n-step power dispatch every day through the one-year timeframe based optimization of the size of ESS is also performed. The proposed methods are computationally cheaper and provide acceptable accuracy with respect to the conventional sizing methods. The economics identified from the proposed methods are compared with the typical day-ahead hourly dispatch-based power production from the PV+ESS power plant. This comparison has shown similar economic performance showcasing the accuracy of the proposed methods in sizing the ESS. It also shows the potential for operating PV+ESS power plant in n-step constant power generation mode.

Xia, Qian↗
DOE OSTI2020

Online accelerator optimization with a machine learning-based stochastic algorithm

Abstract Online optimization is critical for realizing the design performance of accelerators. Highly efficient stochastic optimization algorithms are needed for many online accelerator optimization problems in order to find the global optimum in the non-linear, coupled parameter space. In this study, we propose to use the multi-generation Gaussian process optimizer for online accelerator optimization and demonstrate that the algorithm is significantly more efficient than other stochastic algorithms that are commonly used in the accelerator community.

Zhang, Zhe (ORCID:0000000281430381)↗
NASA NTRS2000

Cascade Optimization for Aircraft Engines With Regression and Neural Network Analysis - Approximators

The NASA Engine Performance Program (NEPP) can configure and analyze almost any type of gas turbine engine that can be generated through the interconnection of a set of standard physical components. In addition, the code can optimize engine performance by changing adjustable variables under a set of constraints. However, for engine cycle problems at certain operating points, the NEPP code can encounter difficulties: nonconvergence in the currently implemented Powell's optimization algorithm and deficiencies in the Newton-Raphson solver during engine balancing. A project was undertaken to correct these deficiencies. Nonconvergence was avoided through a cascade optimization strategy, and deficiencies associated with engine balancing were eliminated through neural network and linear regression methods. An approximation-interspersed cascade strategy was used to optimize the engine's operation over its flight envelope. Replacement of Powell's algorithm by the cascade strategy improved the optimization segment of the NEPP code. The performance of the linear regression and neural network methods as alternative engine analyzers was found to be satisfactory. This report considers two examples-a supersonic mixed-flow turbofan engine and a subsonic waverotor-topped engine-to illustrate the results, and it discusses insights gained from the improved version of the NEPP code.

Patnaik, Surya N.↗
DOE OSTI2024

Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms

The computational capabilities of near-term quantum computers are limited by the noisy execution of gate operations and a limited number of physical qubits. Hybrid variational algorithms are well-suited to near-term quantum devices because they allow for a wide range of tradeoffs between the amount of quantum and classical resources used to solve a problem. This paper investigates tradeoffs available at both the algorithmic and hardware levels by studying a specific case – applying the Quantum Approximate Optimization Algorithm (QAOA) to instances of the Maximum Independent Set (MIS) problem. We consider three variants of the QAOA which offer different tradeoffs at the algorithmic level in terms of their required number of classical parameters, quantum gates, and iterations of classical optimization needed. Since MIS is a constrained combinatorial optimization problem, the QAOA must respect the problem constraints. This can be accomplished by using many multi-controlled gate operations which must be decomposed into gates executable by the target hardware. We study the tradeoffs available at this hardware level, combining the gate fidelities and decomposition efficiencies of different native gate sets into a single metric called the gate decomposition cost .

Tomesh, Teague↗
DOE OSTI2024

Efficient quantum circuits based on the quantum natural gradient

Efficient preparation of arbitrary entangled quantum states is crucial for quantum computation. This is particularly important for noisy intermediate-scale quantum simulators relying on variational hybrid quantum-classical algorithms. To that end, we propose symmetry-conserving modified quantum approximate optimization algorithm (SCom-QAOA) circuits. The depths of these circuits depend not only on the desired fidelity to the target state but also on the amount of entanglement the state contains. The parameters of the SCom-QAOA circuits are optimized using the quantum natural gradient method based on the Fubini-Study metric. The SCom-QAOA circuit transforms an unentangled state into a ground state of a gapped one-dimensional Hamiltonian with a circuit depth that depends not on the system size but rather on the finite correlation length. In contrast, the circuit depth grows proportionally to the system size for preparing low-lying states of critical one-dimensional systems. Even in the latter case, SCom-QAOA circuits with depth less than the system size were sufficient to generate states with fidelity in excess of 99%, which is relevant for near-term applications. The proposed scheme enlarges the set of the initial states accessible for variational quantum algorithms and widens the scope of investigation of nonequilibrium phenomena in quantum simulators. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

A Minimum Principle-Based Algorithm for Energy-Efficient Eco-Driving of Electric Vehicles in Various Traffic and Road Conditions

Our report presents an optimization algorithm for energy-efficient driving of electric vehicles. The algorithm is based on Pontryagin’s Minimum Principle by considering the driving mission as an optimal control problem. On a planned route, diverse application cases may occur due to various physical traits such as powertrain (e.g., switching between motor and generator operation), environmental variations (e.g., terrain grade change), traffic laws (e.g., speed limits), and safety concerns (e.g., headway to the leading vehicle). The proposed algorithm handles these real-world challenges by considering the perturbation to the system dynamics and the constraints to the control and state variables.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2017

Software defined network inference with evolutionary optimal observation matrices

A key requirement for network management is the accurate and reliable monitoring of relevant network characteristics. In today's large-scale networks, this is a challenging task due to the scarcity of network measurement resources and the hard constraints that this imposes. Here, this paper proposes a new framework, called SNIPER, which leverages the flexibility provided by Software-Defined Networking (SDN) to design the optimal observation or measurement matrix that can lead to the best achievable estimation accuracy using Matrix Completion (MC) techniques. To cope with the complexity of designing large-scale optimal observation matrices, we use the Evolutionary Optimization Algorithms (EOA) which directly target the ultimate estimation accuracy as the optimization objective function. We evaluate the performance of SNIPER using both synthetic and real network measurement traces from different network topologies and by considering two main applications for per-flow size and delay estimations. Our results show that SNIPER can be applied to a variety of network performance measurements under hard resource constraints. For example, by measuring only 8.8% of all per-flow path delays in Harvard network [1], congested paths can be detected with probability of 0.94. Finally, to demonstrate the feasibility of our framework, we also have implemented a prototype of SNIPER in Mininet.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Class of Sparse Johnson–Lindenstrauss Transforms and Analysis of their Extreme Singular Values

The Johnson–Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be projected into lower dimensions while approximately preserving pairwise Euclidean distances. Random matrices satisfying this lemma are called JL transforms (JLTs). Inspired by existing $s$-hashing JLTs with exactly $s$ nonzero elements on each column, the present work introduces an ensemble of sparse matrices encompassing so-called $s$-hashing-like matrices whose expected number of nonzero elements on each column is $s$. The independence of the sub-Gaussian entries of these matrices and the knowledge of their exact distribution play an important role in their analyses. Using properties of independent sub-Gaussian random variables, these matrices are demonstrated to be JLTs, and their smallest nontrivial singular values and largest singular values are estimated nonasymptotically using a technique from geometric functional analysis. As the dimensions of the matrix grow to infinity, these singular values are proved to converge almost surely to fixed quantities (by using the universal Bai–Yin law) and in distribution to the Gaussian orthogonal ensemble Tracy–Widom law after proper rescalings. Understanding the behaviors of extreme singular values is important in general because they are often used to define a measure of stability of matrix algorithms. For example, JLTs were recently used in derivative-free optimization algorithmic frameworks to select random subspaces in which are constructed random models or poll directions to achieve scalability, and hence estimating their smallest singular value in particular helps determine the dimension of these subspaces.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Testing of Strategies for the Acceleration of the Cost Optimization

The general problem addressed in the Nuclear-Renewable Hybrid Energy System (N-R HES) project is finding the optimum economical dispatch (ED) and capacity planning solutions for the hybrid energy systems. In the present test-problem configuration, the N-R HES unit is composed of three electrical power-generating components, i.e. the Balance of Plant (BOP), the Secondary Energy Source (SES), and the Energy Storage (ES). In addition, there is an Industrial Process (IP), which is devoted to hydrogen generation. At this preliminary stage, the goal is to find the power outputs of each one of the N-R HES unit components (BOP, SES, ES) and the IP hydrogen production level that maximizes the unit profit by simultaneously satisfying individual component operational constraints. The optimization problem is meant to be solved in the Risk Analysis Virtual Environment (RAVEN) framework. The dynamic response of the N-R HES unit components is simulated by using dedicated object-oriented models written in the Modelica modeling language. Though this code coupling provides for very accurate predictions, the ensuing optimization problem is characterized by a very large number of solution variables. To ease the computational burden and to improve the path to a converged solution, a method to better estimate the initial guess for the optimization problem solution was developed. The proposed approach led to the definition of a suitable Monte Carlo-based optimization algorithm (called the preconditioner), which provides an initial guess for the optimal N-R HES power dispatch and the optimal installed capacity for each one of the unit components. The preconditioner samples a set of stochastic power scenarios for each one of the N-R HES unit components, and then for each of them the corresponding value of a suitably defined cost function is evaluated. After having simulated a sufficient number of power histories, the configuration which ensures the highest profit is selected as the optimal one. The component physical dynamics are represented through suitable ramp constraints, which considerably simplify the numerical solving. In order to test the capabilities of the proposed approach, in the present report, the dispatch problem only is tackled, i.e. a reference unit configuration is assumed, and each one of the N-R HES unit components is assumed to have a fixed installed capacity. As for the next steps, the main improvement will concern the operation strategy of the ES facility. In particular, in order to describe a more realistic battery commitment strategy, the ES operation will be regulated according to the electricity price forecasts.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2019

Mass Optimization of Power System for Space Applications

A Brayton cycle coupled to a direct cooled nuclear reactor is being designed and optimized for a space surface power application. Robust models for the various Brayton cycle components were developed and integrated. Separately, a nuclear reactor model which provides an optimized reactor mass for given flow conditions was developed. Then mass correlations for the size of the recuperative heat exchanger and radiator panel, along with the reactor mass model, were integrated with the cycle model, and an optimization algorithm was developed to find the least massive power system. The optimization routine is being used to explore the effects of turbine inlet temperature, cycle pressures, and other various cycle parameters on the full system mass.

Sondelski, Becky↗
DOE OSTI2020

Microwave Cavity Simulation Using Ansys HFSS

The design of microwave cavity detectors for axion dark matter research is often accomplished using advanced full-wave electromagnetic simulation software tools. These tools provide a cost-effective approach to evaluate a wide variety of cavity configurations, frequency tuning mechanisms, and conductive or dielectric materials and coatings. One simulation software package used for this application is Ansys High Frequency Structure Simulator (HFSS), which is based upon the well-established finite element method. HFSS includes numerous features useful for microwave cavity design such as parametric geometry modeling, adaptive meshing algorithm, curvilinear mesh elements, driven modal and eigenmode matrix solvers, and optimization algorithms. This paper describes the use of the HFSS software to simulate microwave cavities for axion haloscope detectors, with an example tutorial for a cylindrical cavity. Excellent agreement between the simulated and analytical results is shown for the resonant frequency, quality factor, and form factor.

Ansys HFSS, Cavity simulation, finite element mode↗