SEARCH · Engineering Papers

Results for “optimization methods”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 865 records · Page 48

All sources NASA NTRS DOE OSTI

NASA NTRS2002

NASA Overview

This viewgraph presentation provides information on computer programs for the application of probabilistics in aerospace design. The presentation defines risk, and lists probabilistic tools which can take risk into account. It then lists current and future examples of NASA aerospace technology program support which utilize probabilistic methods. Current examples include turbofan engines, combustor liners, life estimation, the analysis of rotors and blades, and shuttle ground operations. The 2nd Generation Reusable Launch Vehicle is one of the future areas of support. The presentation also suggests other future uses of probabilistic tools in aerospace design, and optimal methods for their implementation.

Rusick, Jeff↗

DOE OSTI2024

Enhancing Camera Calibration for Traffic Surveillance with an Integrated Approach of Genetic Algorithm and Particle Swarm Optimization

Recent advancements in sensor technologies, coupled with signal processing and machine learning, have enabled real-time traffic control systems to effectively adapt to changing traffic conditions. Cameras, as sensors, offer a cost-effective means to determine the number, location, type, and speed of vehicles, aiding decision-making at traffic intersections. However, the effective use of cameras for traffic surveillance requires proper calibration. This paper proposes a new optimization-based method for camera calibration. In this approach, initial calibration parameters are established using the Direct Linear Transformation (DLT) method. Then, optimization algorithms are applied to further refine the calibration parameters for the correction of nonlinear lens distortions. A significant enhancement in the optimization process is achieved through the integration of the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) into a combined Integrated GA and PSO (IGAPSO) technique. The effectiveness of this method is demonstrated through the calibration of eleven roadside cameras at three different intersections. The experimental results show that when compared to the baseline DLT method, the vehicle localization error is reduced by 22.30% with GA, 22.31% with PSO, and 25.51% with IGAPSO.

47 OTHER INSTRUMENTATION↗

DOE OSTI2021

The impacts of convex piecewise linear cost formulations on AC optimal power flow

Despite strong connections through shared application areas, research efforts on power market optimization (e.g., unit commitment) and power network optimization (e.g., optimal power flow) remain largely independent. A notable illustration of this is the treatment of power generation cost functions, where nonlinear network optimization has largely used polynomial representations and market optimization has adopted piecewise linear encodings. This work combines state-of-the-art results from both lines of research to understand the best mathematical formulations of the nonlinear AC optimal power flow problem with piecewise linear generation cost functions. An extensive numerical analysis of non-convex models, linear approximations, and convex relaxations across fifty-four realistic test cases illustrates that nonlinear optimization methods are surprisingly sensitive to the mathematical formulation of piecewise linear functions. The results indicate that a poor formulation choice can slow down algorithm performance by a factor of ten, increasing the runtime from seconds to minutes. Furthermore, these results provide valuable insights into the best formulations of nonlinear optimal power flow problems with piecewise linear cost functions, an important step towards building a new generation of energy markets that incorporate the nonlinear AC power flow model.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

NASA NTRS2011

Autorotation flight control system

The present invention provides computer implemented methodology that permits the safe landing and recovery of rotorcraft following engine failure. With this invention successful autorotations may be performed from well within the unsafe operating area of the height-velocity profile of a helicopter by employing the fast and robust real-time trajectory optimization algorithm that commands control motion through an intuitive pilot display, or directly in the case of autonomous rotorcraft. The algorithm generates optimal trajectories and control commands via the direct-collocation optimization method, solved using a nonlinear programming problem solver. The control inputs computed are collective pitch and aircraft pitch, which are easily tracked and manipulated by the pilot or converted to control actuator commands for automated operation during autorotation in the case of an autonomous rotorcraft. The formulation of the optimal control problem has been carefully tailored so the solutions resemble those of an expert pilot, accounting for the performance limitations of the rotorcraft and safety concerns.

Bachelder, Edward N.↗

NASA NTRS2018

A Markov Decision Process Framework for Optimal Airport Reconfiguration

The airport runway configuration is defined as a combination set of runways for arrivals and departures used at a point during operation of the airport. An optimal configuration of these runways depends on a number of factors, including traffic demand, wind magnitude and direction, other adverse weather conditions, and noise restrictions, among others. Based on the current state of these factors and predictions of traffic demand and weather conditions, runway configuration changes are made and coordinated between tower controller, other air traffic control facilities, pilots, and ground personnel. Reconfigurations can be quite disruptive to airport operations; minimizing their frequency and scheduling them well in advance is essential for mitigating some of the added workload for controllers and pilots. Unfortunately, deciding on an appropriate time to change is challenging for human decision makers. Not only do multiple factors need to be evaluated, but the uncertainty in their forecasts must also be considered. Previous optimization methods, such as mixed linear integer programming, have been proposed. Although these methods can reason over a large set of variables, they do not systematically handle the uncertainty associated with weather movement, traffic demands, and other variables. In this work, we introduce a Markov Decision Process (MDP)-based decision making framework which can reason effectively over the inherent uncertainties and make optimal decisions on if/when to change the airport configuration. In a prototype implementation, we present a single runway with three aircraft and utilize knowledge of the forecasted wind speed and direction to determine whether to keep or change the current runway configuration. Our aim through this work is to present a framework for airport reconfiguration which can be scalable to additional aircraft, multiple runways, and various input parameters. This technique will optimize the airport reconfiguration procedure by providing a proactive approach, optimizing not just at the next optimal opportunity for a reconfiguration based on varying atmospheric and traffic conditions in the terminal airspace, but also anticipating future necessary reconfigurations. This will eliminate the inefficiencies of frequent changes currently associated with runway reconfiguration procedures.

runway reconfiguration↗

DOE OSTI2025

Quantum annealing for combinatorial optimization: a benchmarking study

Quantum annealing (QA) has the potential to significantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods. However, due to the limited number of qubits and their connectivity, the QA hardware did not show such an advantage over classical methods in past benchmarking studies. Recent advancements in QA with more than 5000 qubits, enhanced qubit connectivity, and the hybrid architecture promise to realize the quantum advantage. Here, we use a quantum annealer with state-of-the-art techniques and benchmark its performance against classical solvers. To compare their performance, we solve over 50 optimization problem instances represented by large and dense Hamiltonian matrices using quantum and classical solvers. The results demonstrate that a state-of-the-art quantum solver has higher accuracy (~0.013%) and a significantly faster problem-solving time (~6561×) than the best classical solver. Our results highlight the advantages of leveraging QA over classical counterparts, particularly in hybrid configurations, for achieving high accuracy and substantially reduced problem solving time in large-scale real-world optimization problems.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1988

A Method for Producing a Shaped Contour Radiation Pattern Using a Single Shaped Reflector and a Single Feed

Eliminating the corporate feed network in shaped contour beam antennas will reduce the expense, weight, and RF loss of the antenna system. One way of producing a shaped contour beam without using a feed network is to use a single shaped reflector with a single feed element. For a prescribed contour beam and feed, an optimization method for designing the reflector shape is given. As a design example, a shaped reflector is designed to produce a continental U.S. coverage (CONUS) beam. The RF performance of the shaped reflector is then verified by physical optics.

Cherrette, A. R.↗

NASA NTRS1989

A method for producing a shaped contour radiation pattern using a single shaped reflector and a single feed

Cherrette, Alan R.↗

NASA NTRS2001

Additive Runge-Kutta Schemes for Convection-Diffusion-Reaction Equations

Additive Runge-Kutta (ARK) methods are investigated for application to the spatially discretized one-dimensional convection-diffusion-reaction (CDR) equations. First, accuracy, stability, conservation, and dense output are considered for the general case when N different Runge-Kutta methods are grouped into a single composite method. Then, implicit-explicit, N = 2, additive Runge-Kutta ARK2 methods from third- to fifth-order are presented that allow for integration of stiff terms by an L-stable, stiffly-accurate explicit, singly diagonally implicit Runge-Kutta (ESDIRK) method while the nonstiff terms are integrated with a traditional explicit Runge-Kutta method (ERK). Coupling error terms are of equal order to those of the elemental methods. Derived ARK2 methods have vanishing stability functions for very large values of the stiff scaled eigenvalue, z(exp [I]) goes to infinity, and retain high stability efficiency in the absence of stiffness, z(exp [I]) goes to zero. Extrapolation-type stage-value predictors are provided based on dense-output formulae. Optimized methods minimize both leading order ARK2 error terms and Butcher coefficient magnitudes as well as maximize conservation properties. Numerical tests of the new schemes on a CDR problem show negligible stiffness leakage and near classical order convergence rates. However, tests on three simple singular-perturbation problems reveal generally predictable order reduction. Error control is best managed with a PID-controller. While results for the fifth-order method are disappointing, both the new third- and fourth-order methods are at least as efficient as existing ARK2 methods while offering error control and stage-value predictors.

Kennedy, Christopher A.↗

NASA NTRS2005

An Ensemble Approach to Building Mercer Kernels with Prior Information

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly dimensional feature space. we describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using pre-defined kernels. These data adaptive kernels can encode prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. Specifically, we demonstrate the use of the algorithm in situations with extremely small samples of data. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS) and demonstrate the method's superior performance against standard methods. The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains templates for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic-algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code.

Srivastava, Ashok N.↗

DOE OSTI2021

Development of a separation method for rare earth elements using LN resin

The lanthanide elements and isotopes are analytes of significant interest for several nuclear-related fields. Chemical separation among these elements is uniquely challenging due to their nearly identical chemical properties. This difficulty in interelement separation can create obstacles for quantitative radiometric analysis, specifically for isotopes without distinct energy emissions easily measured by gamma spectroscopy, for example Tb-161. Presented in this work is an optimized method for the isolation of individual rare earth elements using Eichrom’s LN resin.

Arrigo, Leah M.↗

DOE OSTI2015

Robust and effective methodologies for cryopreservation and DNA extraction from anaerobic gut fungi

Cell storage and DNA isolation are essential to developing an expanded suite of microorganisms for biotechnology. However, many features of non-model microbes, such as an anaerobic lifestyle and rigid cell wall, present formidable challenges to creating strain repositories and extracting high quality genomic DNA. We establish accessible, high efficiency, and robust techniques to store lignocellulolytic anaerobic gut fungi long term without specialized equipment. Using glycerol as a cryoprotectant, gut fungal isolates were preserved for a minimum of 23 months at -80 °C. Unlike previously reported approaches, this improved protocol is non-toxic and rapid, with samples surviving twice as long with negligible growth impact. Genomic DNA extraction for these isolates was optimized to yield samples compatible with next generation sequencing platforms (e.g. Illumina, PacBio). Popular DNA isolation kits and precipitation protocols yielded preps that were unsuitable for sequencing due to carbohydrate contaminants from the chitin-rich cell wall and extensive energy reserves of gut fungi. To address this, we identified a proprietary method optimized for hardy plant samples that rapidly yielded DNA fragments in excess of 10 kb with minimal RNA, protein or carbohydrate contamination. Collectively, these techniques serve as fundamental tools to manipulate powerful biomass-degrading gut fungi and improve their accessibility among researchers.

59 BASIC BIOLOGICAL SCIENCES↗

NASA NTRS1991

A look-ahead variant of the Lanczos algorithm and its application to the quasi-minimal residual method for non-Hermitian linear systems

The Lanczos algorithm can be used both for eigenvalue problems and to solve linear systems. However, when applied to non-Hermitian matrices, the classical Lanczos algorithm is susceptible to breakdowns and potential instabilities. In addition, the biconjugate gradient (BCG) algorithm, which is the natural generalization of the conjugate gradient algorithm to non-Hermitian linear systems, has a second source of breakdowns, independent of the Lanczos breakdowns. Here, we present two new results. We propose an implementation of a look-ahead variant of the Lanczos algorithm which overcomes the breakdowns by skipping over those steps where a breakdown or a near-breakdown would occur. The new algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products per step as the classical Lanczos algorithm without look-ahead. Based on the proposed look-ahead Lanczos algorithm, we then present a novel BCG-like approach, the quasi-minimal residual (QMR) method, which avoids the second source of breakdowns in the BCG algorithm. We present details of the new method and discuss some of its properties. In particular, we discuss the relationship between QMR and BCG, showing how one can recover the BCG iterates, when they exist, from the QMR iterates. We also present convergence results for QMR, showing the connection between QMR and the generalized minimal residual (GMRES) algorithm, the optimal method in this class of methods. Finally, we give some numerical examples, both for eigenvalue computations and for non-Hermitian linear systems.

Nachtigal, Noel M.↗

DOE OSTI2013

Challenges when performing economic optimization of waste treatment: A review

Highlights: • Review of main optimization tools in the field of waste management. • Different optimization methods are applied. • Different fractions are analyzed. • There is focus on different parameters in different geographical regions. • More research is needed which encompasses both recycling and energy solutions. - Abstract: Strategic and operational decisions in waste management, in particular with respect to investments in new treatment facilities, are needed due to a number of factors, including continuously increasing amounts of waste, political demands for efficient utilization of waste resources, and the decommissioning of existing waste treatment facilities. Optimization models can assist in ensuring that these investment strategies are economically feasible. Various economic optimization models for waste treatment have been developed which focus on different parameters. Models focusing on transport are one example, but models focusing on energy production have also been developed, as well as models which take into account a plant’s economies of scale, environmental impact, material recovery and social costs. Finally, models combining different criteria for the selection of waste treatment methods in multi-criteria analysis have been developed. A thorough updated review of the existing models is presented, and the main challenges and crucial parameters that need to be taken into account when assessing the economic performance of waste treatment alternatives are identified. The review article will assist both policy-makers and model-developers involved in assessing the economic performance of waste treatment alternatives.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

NASA NTRS2002

Probabilistic Study of Fluid Structure Interaction

Probabilistic CFD design is needed because we are asked to do more with less. To cost effectively accomplish the design task, we need to formally quantify the effect of uncertainties (variables) in the design. Probabilistic design is one effective method to formally quantify the effect of uncertainties. Our objective is to establish a revolutionary new early design process, by developing non-deterministic physics-based probabilistic design tools, which will include all the life cycle processes. Breakthroughs will be sought in speed, accuracy, intelligence, and usability of the system. This paper is concerned with the usefulness of parametric optimization method coupled with a Navier-Stokes analysis code for the aero-thermodynamic design of turbomachinery combustor liner. The interconnection between the CFD code and NESSUS codes facilitated the coupling between the thermal profiles and structural design. We have developed new concepts for reducing the computational cost of unsteady, three-dimensional, compressible aerodynamic analyses for multistage turbomachinery flows. The flow was modeled by the three-dimensional Favre-Reynolds-averaged Navier-Stokes equations using the k-epsilon turbulence closure, which was integrated using an implicit third-order upwind solver. The methodology developed in this paper is expected to lead to the design optimization of turbomachinery blades.

Gorla, Rama S. R.↗

DOE OSTI2021

HAM: Hotspot-Aware Manager for Improving Communications with 3D-Stacked Memory

merging High-Performance Computing (HPC) workloads, such as graph analytics, machine learning, and big data science, are data-intensive. Data-intensive workloads usually present fine-grained memory accesses with limited or no data locality, and thus incur frequent cache misses and low utilization of memory bandwidth. 3D-stacked memory devices such as Hybrid Memory Cube (HMC) and High Bandwidth Memory (HBM) can provide significantly higher bandwidth than conventional memory modules. However, the traditional interfaces and optimization methods for JEDEC DDR devices do not allow to fully exploit the potential performance of 3D-stacked memory with the massive amount of irregular memory accesses of data-intensive applications. In this paper, we propose a novel Hotspot-Aware Manager (HAM) infrastructure for 3D-stacked memory devices capable of optimizing memory access streams via request aggregation, hotspot detection, and in-memory prefetching. %and an associated hotspot-aware page policy. We present the HAM design and implementation, and simulate it on a system using RISC-V embedded cores with attached HMC devices. We extensively evaluate HAM with over 12 benchmarks and applications representing diverse irregular memory access patterns. The results show that, on average, HAM reduces redundant requests by 37.51\% and increases the prefetch buffer hit rate by 4.2 times, compared to a baseline streaming prefetcher. On the selected benchmark set, HAM provides performance gains of 21.81\% in average (up to 34.28\%) and power savings of 35.07\% over a standard 3D-stacked memory.

Wang, Xi↗

DOE OSTI2023

Comparative Analysis of TRGBs (CATs) from Unsupervised, Multi-halo-field Measurements: Contrast is Key

The tip of the red giant branch (TRGB) is an apparent discontinuity of the luminosity function (LF) due to the end of the red giant evolutionary phase and is used to measure distances in the local universe. In practice, tip localization via edge detection response (EDR) relies on several methods applied on a case-by-case basis. It is hard to evaluate how individual choices affect a distance estimation using only a single host field while also avoiding confirmation bias. To devise a standardized approach, we compare unsupervised, algorithmic analyses of the TRGB in multiple halo fields per galaxy. We first optimize methods for the lowest field-to-field dispersion, including spatial filtering, smoothing, and weighting of LF, color band selection, and tip selection based on the number of likely RGB stars and the ratio of stars below versus above the tip (R). We find R, which we call the tip contrast, to be the most important indicator of the quality of EDR measurements; higher R selection can decrease field-to-field dispersion. Further, since R is found to correlate with the age or metallicity of the stellar population based on theoretical modeling, it might result in a displacement of the detected tip magnitude. We find a tip-contrast relation with a slope of -0.023 ± 0.0046 mag/ratio, an ~5σ result that can be used to correct these variations in the detections. When using TRGB to establish a distance ladder, consistent TRGB standardization using tip-contrast relation across rungs is vital to make robust cosmological measurements.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2019

A BI-LEVEL APPROACH TO FUTURE POWER SYSTEM CO-OPTIMIZATION WITH HIGH PENETRATION OF RENEWABLE ENERGY AND RESPONSIVE DEMAND

Electricity generation accounts for nearly half of the total CO2 emissions in the United States. For this reason, the development and integration of renewable resources will play an essential role in achieving the societal objective of mitigating climate change through reduction of greenhouse gas emissions. In conjunction with the environmental benefits of renewable energy, the most common renewable sources, such as wind and solar, also increase the uncertainties surrounding generation in power systems, which adds significant challenges to the system operation and planning. The uncertainties and forecasting errors surrounding renewable generation are normally addressed through the use of reserves from traditional generators. At greater levels of renewable penetration, sufficient generator reserves may not be available or economically viable. In contrast, the promise of demand-side resources in this arena lies in the spatially widespread availability, rapid response potential, and lower cost of features that already exist in the system. However, the challenge of responsive demand arises from the need to understand, manage, and incentivize a very large number of resources to participate effectively in efficient operation of the complex power system. Since demand response comes from the distribution system, microgrids as the basic building blocks of future distribution systems will be a critical environment for the study of demand response. To support integration of microgrids with flexible loads in future power systems, the operational mode of power systems will need to evolve. Therefore, it is going to be critical to have new and efficient co-optimization methods for coordination of the various power market participants and the scheduling of resources in the power systems of the future. Motivated by the rapid increase in renewable penetration, the need for effective demand response programs, and a changing system structure, this dissertation seeks to define a new strategy that supports co-optimization of various participants in power systems with emphasis on high renewable penetration and demand response. This strategy has three components; 1) an exploration of the capabilities of different types of demand response programs in a microgrid, 2) development and implementation of a bi-level framework for co-optimization of the main grid with high renewable penetration and a microgrid with demand response capabilities, and 3) expansion of the bi-level framework from a microgrid to a general distribution system to explore the advantages of the bi-level co-optimization approach over the traditional optimization approach. Conclusions of this work illustrate that the stochastic rolling horizon approach could effectively manage the operation of a microgrid with various demand response programs. In addition, the bi-level approach is a promising co-optimization framework for the transmission and distribution levels that could increase system renewable penetration and reduce operation costs. Compared to the traditional framework, the bi-level framework yields more equitable cost sharing patterns among the market participants as well as better support for the power system evolution.

24 POWER TRANSMISSION AND DISTRIBUTION↗