Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 469 records · Page 26

A Novel Framework for Optimizing Ramping Capability of Hybrid Energy Storage Systems

Hybrid Energy Storage System has been widely applied in aerospace, electric vehicle, and microgrid applications. The advantages are that they include complimentary technologies with both high power and energy capabilities. HESS have the potential to be useful to the bulk power systems, for example to increase the value of energy produced by variable generation resource through enabling participation in ancillary service markets. Actualizing the benefits of HESSs requires optimizing the combined ramping capability of aggregated HESS resources. To provide quality ancillary service, source of HESSs locating at multiple sites of variable generation resource must be optimally sized and cohesively controlled. Optimizing aggregated resources can be formulated as an optimization problem. Successfully solving this problem not only requires using effective solution methods but also depends on accurately and rapidly setting the necessary parameters in the problem formula. This article proposes a novel framework with double-layer structure to solve the optimization problem of aggregating ramping capability. Program developed on the upper layer focuses on solving the optimization of aggregating ramping capability among multiple HESSs and is compatible with most existing optimization algorithms. Program on lower layer of the framework targets at optimizing the local control of a single HESS based on a thorough analytics of HESS operation strategy presented in this article. Result of local optimization is also provided to upper layer program for updating the parameters in formula of optimization problem. Real time hardware-in-the-loop test is conducted to verify the performance of the optimization framework developed. The work presented is expected to provide guidance for implementing this framework in practical operation.

Luo, Yushen↗

Compliant mechanism road bicycle brake: a rigid-body replacement case study

The design of high-performance bicycle brakes is complicated by the competing design objectives of increased performance and low weight. But this challenge also provides a good case study to demonstrate the design of compliant mechanisms to replace current rigid-link mechanisms. This paper briefly reviews current road brake designs, demonstrates the use of rigid-body replacement synthesis to design a compliant mechanism, and illustrates the combination of compliant mechanism design tools. The resulting concept was generated from the modified dual-pivot brake design and is a partially compliant mechanism where one pin has the dual role of a joint and a mounting pin. The pseudo-rigid-body model, finite element analysis, and optimization algorithms are used to generate design dimensions, and designs are considered for both titanium and E-glass flexures. The resulting design has the potential of reducing the part count and overall weight while maintaining a performance similar to the benchmark.

42 ENGINEERING↗

Use of Data Denial Experiments to Evaluate ESA Forecast Sensitivity Patterns

The overall goal of this multi-phased research project known as WindSENSE is to develop an observation system deployment strategy that would improve wind power generation forecasts. The objective of the deployment strategy is to produce the maximum benefit for 1- to 6-hour ahead forecasts of wind speed at hub-height ({approx}80 m). In this phase of the project the focus is on the Mid-Columbia Basin region which encompasses the Bonneville Power Administration (BPA) wind generation area shown in Figure 1 that includes Klondike, Stateline, and Hopkins Ridge wind plants. The Ensemble Sensitivity Analysis (ESA) approach uses data generated by a set (ensemble) of perturbed numerical weather prediction (NWP) simulations for a sample time period to statistically diagnose the sensitivity of a specified forecast variable (metric) for a target location to parameters at other locations and prior times referred to as the initial condition (IC) or state variables. The ESA approach was tested on the large-scale atmospheric prediction problem by Ancell and Hakim 2007 and Torn and Hakim 2008. ESA was adapted and applied at the mesoscale by Zack et al. (2010a, b, and c) to the Tehachapi Pass, CA (warm and cools seasons) and Mid-Colombia Basin (warm season only) wind generation regions. In order to apply the ESA approach at the resolution needed at the mesoscale, Zack et al. (2010a, b, and c) developed the Multiple Observation Optimization Algorithm (MOOA). MOOA uses a multivariate regression on a few select IC parameters at one location to determine the incremental improvement of measuring multiple variables (representative of the IC parameters) at various locations. MOOA also determines how much information from each IC parameter contributes to the change in the metric variable at the target location. The Zack et al. studies (2010a, b, and c), demonstrated that forecast sensitivity can be characterized by well-defined, localized patterns for a number of IC variables such as 80-m wind speed and vertical temperature difference. Ideally, the data assimilation scheme used in the experiments would have been based upon an ensemble Kalman filter (EnKF) that was similar to the ESA method used to diagnose the Mid-Colombia Basin sensitivity patterns in the previous studies. However, the use of an EnKF system at high resolution is impractical because of the very high computational cost. Thus, it was decided to use the three-dimensional variational analysis data assimilation that is less computationally intensive and more economically practical for generating operational forecasts. There are two tasks in the current project effort designed to validate the ESA observational system deployment approach in order to move closer to the overall goal: (1) Perform an Observing System Experiment (OSE) using a data denial approach which is the focus of this task and report; and (2) Conduct a set of Observing System Simulation Experiments (OSSE) for the Mid-Colombia basin region. The results of this task are presented in a separate report. The objective of the OSE task involves validating the ESA-MOOA results from the previous sensitivity studies for the Mid-Columbia Basin by testing the impact of existing meteorological tower measurements on the 0- to 6-hour ahead 80-m wind forecasts at the target locations. The testing of the ESA-MOOA method used a combination of data assimilation techniques and data denial experiments to accomplish the task objective.

17 WIND ENERGY↗

Beyond Moore’s Law: Exploring the Future of Computation

Conclusions: Emerging computational hardware may fundamentally change optimization algorithm development; Ising Coprocessors are like ALUs or GPUs for optimization!; Based on initial benchmarking efforts D-Wave hardware is not outperforming state-of-the-art alternatives, but seems competitive

97 MATHEMATICS AND COMPUTING↗

Data-Driven Optimization for the Design and Control of Large-Scale Systems (LDRD Final Report)

Engineering decisions are often formulated as optimization problems such as the optimal design or control of physical systems. In these applications, the resulting optimization problems are constrained by large-scale simulations involving systems of partial differential equations (PDEs), ordinary differential equations (ODEs), and differential algebraic equations (DAEs). In addition, critical components of these systems are fraught with uncertainty, including unverifiable modeling assumptions, unknown boundary and initial conditions, and uncertain coefficients. Typically, these components are estimated using noisy and incomplete data from a variety of sources (e.g., physical experiments). The lack of knowledge of the true underlying probabilistic characterization of model inputs motivates the need for optimal solutions that are robust to this uncertainty. In this report, we introduce a framework for handling "distributional" uncertainties in the context of simulation-based optimization. This includes a novel measure discretization technique that will lead to an adaptive optimization algorithm tailored to exploit the structures inherent to simulation- based optimization.

42 ENGINEERING↗

The Pointing Self-calibration Algorithm for Aperture Synthesis Radio Telescopes

This paper is concerned with algorithms for calibration of direction-dependent effects (DDE) in aperture synthesis radio telescopes (ASRT). After correction of direction-independent effects (DIE) using self-calibration, imaging performance can be limited by the imprecise knowledge of the forward gain of the elements in the array. In general, the forward gain pattern is directionally dependent and varies with time due to a number of reasons. Some factors, such as rotation of the primary beam with Parallactic Angle for Azimuth–Elevation mount antennas are known a priori. Some, such as antenna pointing errors and structural deformation/projection effects for aperture-array elements cannot be measured a priori. Thus, in addition to algorithms to correct for DD effects known a priori, algorithms to solve for DD gains are required for high dynamic range imaging. Here, we discuss a mathematical framework for antenna-based DDE calibration algorithms and show that this framework leads to computationally efficient optimal algorithms that scale well in a parallel computing environment. As an example of an antenna-based DD calibration algorithm, we demonstrate the Pointing SelfCal (PSC) algorithm to solve for the antenna pointing errors. Our analysis show that the sensitivity of modern ASRT is sufficient to solve for antenna pointing errors and other DD effects. We also discuss the use of the PSC algorithm in real-time calibration systems and extensions for antenna Shape SelfCal algorithm for real-time tracking and corrections for pointing offsets and changes in antenna shape.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

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↗

Introduction to HOBIT, a b-jet identification tagger at the CDF experiment optimized for light Higgs boson searches

We present the development and validation of the Higgs Optimized b Identification Tagger (HOBIT), a multivariate b-jet identification algorithm optimized for Higgs boson searches at the CDF experiment at the Fermilab Tevatron. At collider experiments, b taggers allow one to distinguish particle jets containing B hadrons from other jets; these algorithms have been used for many years with great success at CDF. HOBIT has been designed specifically for use in searches for light Higgs bosons decaying via H ! b\bar{b}. This fact combined with the extent to which HOBIT synthesizes and extends the best ideas of previous taggers makes HOBIT unique among CDF b-tagging algorithms. Employing feed-forward neural network architectures, HOBIT provides an output value ranging from approximately -1 ("light-jet like") to 1 ("b-jet like"); this continuous output value has been tuned to provide maximum sensitivity in light Higgs boson search analyses. When tuned to the equivalent light jet rejection rate, HOBIT tags 54% of b jets in simulated 120 GeV/c2 Higgs boson events compared to 39% for SecVtx, the most commonly used b tagger at CDF. We present features of the tagger as well as its characterization in the form of b-jet finding efficiencies and false (light-jet) tag rates.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

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)↗

The Application of an Evolutionary Algorithm to the Optimization of a Mesoscale Meteorological Model

It is demonstrated that a simple evolutionary algorithm can optimize a set of mesoscale atmospheric model parameters with respect to agreement between the mesoscale simulation and a limited set of synthetic observations. This is highlighted using the Regional Atmospheric Modeling System (RAMS). A set of 23 RAMS parameters is optimized by minimizing a cost function based on the root-mean-square (rms) error between the RAMS simulation and synthetic data (observations derived from a separate RAMS simulation). It is found that the optimization can be done with relatively modest computer resources; therefore, operational implementation is possible. The overall number of simulations needed to obtain a specific reduction of the cost function is found to depend strongly on the procedure used to perturb the "child" parameters relative to their "parents" within the evolutionary algorithm. Furthermore, the choice of meteorological variables that are included in the rms error and their relative weighting are also found to be important factors in the optimization.

54 ENVIRONMENTAL SCIENCES↗

Optimization of carbon capture systems using surrogate models of simulated processes.

With increasing demand placed on power generation plants to reduce carbon dioxide (CO2) emissions, processes to separate and capture CO2 for eventual sequestration are highly sought after. Carbon capture processes impart a parasitic load on the power plants; it is estimated that this would increase the cost of electricity from existing pulverized coal plants anywhere from 71-85 percent [1]. The National Energy and Technology Lab (NETL) is working to lower this to below a 30 percent increase. To reach this goal, work is being done not only to accurately simulate these processes, but also to leverage those accurate and detailed simulations to design optimal carbon capture processes. The major challenges include the lack of accurate algebraic models of the processes, computationally costly simulations, and insufficiently robust simulations. The first challenge bars the use of provable derivative-based optimization algorithms. The latter two can either lead to difficult or impossible direct derivative-free optimization. To overcome these difficulties, we take a more indirect method to solving this problem by, first, generating an accurate set of algebraic surrogate models from the simulation then using derivative-based solvers to optimize the surrogate models. We developed a method that uses derivative-based and derivative-free optimization alongside machine learning and statistical techniques to generate the set of low-complexity surrogate models using data sampled from detailed simulations. The models are validated and improved through the use of derivative-free solvers to adaptively sample new simulation points. The resulting surrogate models can then be used in a superstructure-based process synthesis and solved using derivative-based methods to optimize carbon capture processes.

01 COAL, LIGNITE, AND PEAT↗

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↗

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↗

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↗

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↗