Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast 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

Mars Optimal Aerobrake Maneuver Estimation

Mars science satellites often perform orbit changes to obtain different measurements, ground tracks or relay operations. Large reductions in semi-major axis and eccentricity can be done efficiently using the atmospheric drag, a.k.a aerobrake. Aerobraking is one of the most challenging planetary orbit maneuvers in terms of planning and operations. The most important consideration for aerobraking is maintaining the spacecraft's periapsis within an allocated atmospheric density corridor, which is accomplished by raising or lowering periapsis through one or a series of very small and short maneuvers. These maneuvers must be performed as efficiently as possible due to propellant constraints. Work herein details a fast and accurate method to calculate the required impulsive velocity changes in the orbit to guarantee that the spacecraft remains in a prescribed density corridor. The method makes use of the orbit's state transition matrix to map the solution space around the reference orbit. It evaluates the most efficient maneuver epochs to target a given periapsis change with a linear optimal control for single or multiple maneuvers. A fast calculation of the maneuver allows for a more comprehensive evaluation of the trade space, and the selected maneuver may be re-targeted later with a higher- fidelity model. Comparisons against fully propagated models and direct method optimizations demonstrate the new method's performance.

Sarli, Bruno V.↗

Rolling Optimization of Transmission Network Recovery and Load Restoration Considering Hybrid Wind-Storage System and Cold Load Pickup

A common solution to deal with the stochasticity introduced by fast-ramping wind power integration is to equip wind farms (WFs) with energy storage systems (ESSs) to formulate hybrid WF-ESSs. In addition to leveling off wind power fluctuations during normal operations, a hybrid WF-ESS can be a flexible power source to accumulate the power system restoration. In this paper, we propose a rolling optimization model for transmission network recovery and load restoration considering the contributions of WF-ESSs. The proposed model is formulated as a mixed integer linear programming problem that simultaneously optimizes the amount and location of restorable load blocks as well as the restoration lines. The cold load pickup features of interrupted loads considering the outage duration are modeled in detail. A chance-constrained method is employed to deal with the uncertainty of wind power, and a rolling horizon-based framework is adopted to reduce the influence of forecast error. Case studies are conducted on both New England 39-bus system and part of a provincial power system in China. The results show that the load restoration process can be significantly accelerated by employing the proposed method and contributions of hybrid WF-ESSs to power system restoration are validated.

chance-constrained optimization↗

Accelerating laser ray tracing in high fidelity physics simulations of laser melting using squeeze U-net

Laser melting is a core component of the ongoing industrial revolution, dubbed Industry 4.0, as lasers facilitate fast and precise melting and fusion in advanced manufacturing. There is a strong need to optimize the laser process using simulations. However, this has proven challenging as high fidelity simulations are needed for predictive modeling and this is currently prohibitively expensive even when run on hundreds of processors on high performance computers. The challenge is capturing complex physics of laser material interaction, fluid dynamics, thermal physics and material phase transformations at various length and time scales. To close this technological gap, we modified a squeeze U-net to accelerate the laser ray tracing component of such high fidelity models by ~4x–40x while preserving the core physics principle of conservation of energy with 97% accuracy. This approach enables the accurate modeling of global laser energy absorption as a function of local surface temperatures and complex surface topologies, which govern the reflection directions and energy losses of laser rays upon interacting with the material surface.

Computer science↗

ATTNChecker: Highly-Optimized Fault Tolerant Attention for Large Language Model Training

Large Language Models (LLMs) have demonstrated remarkable performance in various natural language processing tasks. However, the training of these models is computationally intensive and susceptible to faults, particularly in the attention mechanism, which is a critical component of transformer-based LLMs. In this paper, we investigate the impact of faults on LLM training, focusing on INF, NaN, and near-INF values in the computation results with systematic fault injection experiments. We observe the propagation patterns of these errors, which can trigger non-trainable states in the model and disrupt training, forcing the procedure to load from checkpoints. To mitigate the impact of these faults, we propose ATTNChecker, the first Algorithm-Based Fault Tolerance (ABFT) technique tailored for the attention mechanism in LLMs. ATTNChecker is designed based on fault propagation patterns of LLM and incorporates performance optimization to adapt to both system reliability and model vulnerability while providing lightweight protection for fast LLM training. Evaluations on four LLMs show that ATTNChecker on average incurs on average 7% overhead on training while detecting and correcting all extreme errors. Compared with the state-of-the-art checkpoint/restore approach, ATTNChecker reduces recovery overhead by up to 49×.

Liang, Yuhang [University of Alabama - Birmingham]↗

Distributed fiber sensing systems for 3D combustion temperature field monitoring in coal-fired boilers using optically generated acoustic waves (Final Report)

In this project, we have developed and tested three kinds of fiber optic sensing systems for real time monitoring of temperature variations within an industrial scale boiler furnace. The fiber optic sensing systems target spatial and temporal distributions of high temperature profiles in a boiler furnace in fossil power plants. The reconstructed temperature profile will provide critical input for the control mechanisms to optimize the combustion process. This temperature profile will address the essential problem for fossil power plants in achieving higher efficiency and fewer pollutant emissions. Acoustic pyrometer systems have been used to reconstruct temperature field of power plant boilers based on measuring TOF (times-of-flight) of sound waves along some straight paths in a 2D cross-section of the boiler. In this project, optically generated acoustic signals from a fiber optic sensing system have replaced the acoustic signals generated from an electrical transducer. A 3D reconstruction algorithm replaced the previous 2D model. In this project, three kinds of fiber optic sensing systems have been developed and tested. They are fiber optic sensing system I, fiber optic sensing system II (Distributed Sensing System I) and fiber optic sensing system III (Distributed Sensing System II). For fiber optic sensing system I, the fiber optic ultrasound generator acts as a signal generator. A microphone, hydrophone or other electronic devices serve as a signal receiver. In this system, there are one generator and one receiver. Distance test, water temperature test, air temperature test, air temperature reconstruction, and GE ISBF pilot test were performed by Fiber optic sensing system I. The fiber optic sensing system I successfully detected temperature in all these tests. We got 2D temperature reconstruction results by using the fiber optic sensing system I and it matched the reference data. The fiber optic sensing system I successfully survived in GE ISBF boiler environment (480 °F). For fiber optic sensing system II (Distributed Sensing System I), it is an all optical ultrasound system. The fiber optic ultrasound generator acts as a signal generator. Fiber Bragg Grating (FBG) and Fabry-Perot (FP) sensor act as a signal receiver. In this system, there is one generator and one receiver. Aluminum plate temperature test, furnace high temperature test, and GE ISBF pilot test were performed by the fiber optic sensing system II. Fiber optic sensing system II successfully detected the temperature in all these tests. The fiber optic sensing system II successfully survived at up to 700 °C furnace environment and 320 °C GE ISBF boiler environment. For fiber optic sensing system III (Distributed Sensing System II), it is also an all optical ultrasound system. The fiber optic ultrasound generator acts as a signal generator. Multiple FP fiber sensors act as signal receivers. In this system, there is one generator and three receivers. Three GE ISBF pilot tests were performed by fiber optic sensing system III. The fiber optic sensing system III survived in the cold flow tests in GE’s ISBF pilot test facility. However, we didn’t get high temperature data by using this system since the nanosecond laser issues. During the period of the project, test trials, data simulation and algorithm optimization was performed successfully. For real time temperature field construction, the sampling rate must be fast enough to capture the field variations. The technology of Code-division multiple access (CDMA) is well studied which could allow parallel multiplexing, even if signals overlap in time or frequencies. Moreover, it has been known that extending the length of signal significantly improves SNR. For acoustic signals, these multiplexing techniques have also been widely used, mainly for sonar and acoustic communications. The CDMA modulation technique has been proposed and studied to guarantee high network throughput, low channel access delay and low energy consumption. We have studied the temperature field reconstruction using Gaussian Radial Basis Functions (GRBF)-based approximation approach. Reconstruction of 3D temperature field using Neural Networks with measured TOF and known propagation paths is feasible. 2D and 3D temperature field reconstruction simulation results are achieved. The milestone status is shown in Table 1. We finished milestone 1-8 and milestone 10. For milestone 9, we did three pilot tests by using the fiber optic sensing system III (Distributed Sensing System II) at GE Power. However, due to the failure of the ns laser, we did not get the temperature results. We conducted some additional tasks that were not originally proposed: 1) We fabricated a fiber optic sensing system I and did a pilot test based on this system. 2) In the proposal, we proposed two pilot tests at GE Power. In reality, we finished at least seven pilot tests at GE Power. GE Power has made a lot of efforts for supporting the pilot tests. 3) We got a simulation results based on CDMA. In summary, most of the tasks have been accomplished. The outcome of this project removed a few barriers that hinder the achievement of the final product of the distributed sensing systems. With the successful accomplishment of this project, a prototype of the fiber optic sensing system can be fabricated to attract more interests from companies and other funding agencies.

47 OTHER INSTRUMENTATION↗

Extending the operating range and safety of Li-ion batteries with new fluorinated electrolytes

Orbia Fluor and Energy Materials (formerly Koura) has successfully developed a new class of fluorinated electrolyte solvents for lithium-ion batteries. In collaboration with Silatronix and Argonne National Laboratory, the team synthesized and screened over 20 novel fluorinated compounds, optimizing formulations that significantly enhance battery performance across critical metrics such as thermal stability, fast-charging capability, and cycling life at extreme temperatures. Electrolytes with fluorinated molecules developed in this program demonstrated superior performance in 2 Ah pouch cells, achieving over 1000 fast-charge cycles with minimal capacity fade, outperforming conventional carbonate-based electrolytes. Mechanistic studies revealed that the fluorinated electrolytes promote a stable solid electrolyte interphase at the anode and reduce cathode metal dissolution, contributing to improved long-term stability. These advancements mark a significant step toward safer, more efficient batteries for applications ranging from grid storage to defense systems to electric vehicles. We gratefully acknowledge DOE’s financial support through contract DE-EE0009642.

25 ENERGY STORAGE↗

Two-time scale stabilization of a flexible arm with output feedback

An approach is presented to designing a control system with output feedback for a lightweight flexible arm. A two-time-scale dynamic model is obtained which allows the adoption of a composite control strategy. First a slow control can be designed for the slow (rigid) subsystem, and then a fast stabilizing control for the fast (flexible) subsystem. The problem of the lack of full state measurements connected with the fast control design is solved. An output-feedback, low-order dynamic compensator whose optimal gains are computed by a convergent numerical algorithm is designed. A more robust design can be achieved if a loop transfer recovery procedure is introduced. The design procedure is tested by means of nonlinear simulation, and the results are discussed.

Siciliano, Bruno↗

An End-to-End Architecture for Science Goal Driven Observing

New observatories will have greater on-board storage capacity and on-board processing capabilities. The new bottleneck will be download capacity. The cost of downlink time and limitations of bandwidth will end the era where all exposure data is downloaded and all data processing is performed on the ground. In addition, observing campaigns involving inherently variable targets will need scheduling flexibility to focus observing time and data download on exposures that are scientifically interesting. The ability to quickly recognize and react to such events by re-prioritizing the observing schedule will be an essential characteristic for maximizing scientific returns. It will also be a step towards increasing spacecraft autonomy, a major goal of NASA's strategic plan. The science goal monitoring (SGM) system is a proof-of-concept effort to address these challenges. We are developing an interactive distributed system that will use on-board processing and storage combined with event-driven interfaces with ground-based processing and operations, to enable fast re-prioritization of observing schedules, and to minimize time spent on non-optimized observations. SGM is initially aimed towards time-tagged observing modes used frequently in spectroscopic studies of varying targets. In particular, the SGM is collaborating with the proposed MIDEX-class mission Kronos team. The variable targets that Kronos seeks to study make an adaptive system such as SGM particularly valuable for achieving mission goals. However, the architecture and interfaces will also be designed for easy adaptability to other observing platforms, including ground-based systems and to work with different scheduling and pipeline processing systems. This talk will focus on our strategy for developing SGM and the technical challenges that we have encountered. We will discuss the SGM architecture as it applies to the Kronos mission and explain how it is scalable to other missions.

Jones, Jeremy↗

Science Goal Driven Observing and Spacecraft Autonomy

Spacecraft autonomy will be an integral part of mission operations in the coming decade. While recent missions have made great strides in the ability to autonomously monitor and react to changing health and physical status of spacecraft, little progress has been made in responding quickly to science driven events. For observations of inherently variable targets and targets of opportunity, the ability to recognize early if an observation will meet the science goals of a program, and react accordingly, can have a major positive impact on the overall scientific returns of an observatory and on its operational costs. If the onboard software can reprioritize the schedule to focus on alternate targets, discard uninteresting observations prior to downloading, or download a subset of observations at a reduced resolution, the spacecraft's overall efficiency will be dramatically increased. The science goal monitoring (SGM) system is a proof- of-concept effort to address the above challenge. The SGM will have an interface to help capture higher-level science goals from the scientists and translate them into a flexible observing strategy that SGM can execute and monitor. We are developing an interactive distributed system that will use on-board processing and storage combined with event-driven interfaces with ground-based processing and operations, to enable fast re-prioritization of observing schedules, and to minimize time spent on non-optimized observations. This paper will focus on our strategy for developing SGM and the technical challenges that we have encountered. We will discuss the SGM architecture as it applies to the proposed MIDEX-class mission Kronos. However, the architecture and interfaces will also be designed for easy adaptability to other observing platforms, including ground-based systems and to work with different scheduling and pipeline processing systems.

Jones, Jeremy↗

Science Goal Driven Observing and Spacecraft Autonomy

Spacecraft autonomy will be an integral part of mission operations in the coming decade. While recent missions have made great strides in the ability to autonomously monitor and react to changing health and physical status of spacecraft, little progress has been made in responding quickly to science driven events. For observations of inherently variable targets and targets of opportunity, the ability to recognize early if an observation will meet the science goals of a program, and react accordingly, can have a major positive impact on the overall scientific returns of an observatory and on its operational costs. If the onboard software can reprioritize the schedule to focus on alternate targets, discard uninteresting observations prior to downloading, or download a subset of observations at a reduced resolution, the spacecraft's overall efficiency will be dramatically increased. The science goal monitoring (SGM) system is a proof-of-concept effort to address the above challenge. The SGM will have an interface to help capture higher level science goals from the scientists and translate them into a flexible observing strategy that SGM can execute and monitor. We are developing an interactive distributed system that will use on-board processing and storage combined with event-driven interfaces with ground-based processing and operations, to enable fast re-prioritization of observing schedules, and to minimize time spent on non-optimized observations.

Koratkar, Amuradha↗

Combined Numerical/Analytical Perturbation Solutions of the Navier-Stokes Equations for Aerodynamic (Ejector Nozzle) Flows

In spite of the rapid advances in both scalar and parallel computational tools, the large number and breadth of variables involved in aerodynamic systems make the use of parabolized or even boundary layer fluid flow models impractical for both preliminary design and inverse design problems. Given this restriction, we have concluded that reduced or approximate models are an important family of tools for design purposes. This study of a combined perturbation/numerical modeling methodology with an application to ejector-mixer nozzles (shown schematically in the following figure) is nearing completion. The work is being funded by a grant from the NASA Lewis Research Center to Texas A&M University. These ejector-mixer nozzle models are designed to be of use to the High Speed Civil Transport Program and may be adopted by both NASA and industry. A computer code incorporating the ejector-mixer models is under development. This code, the Differential Reduced Ejector/Mixer Analysis (DREA), can be run fast enough to be used as a subroutine or to be called by a design optimization routine. Simplified conservation equations--x-momentum, energy, and mass conservation--are used to define the model. Unlike other preliminary design models, DREA requires minimal empirical input and includes vortical mixing and a fully compressible formulation among other features. DREA is being validated by comparing it with results obtained from open literature and proprietary industry data. Preliminary results for a subsonic ejector and a supersonic ejector are shown. In addition, dedicated experiments have been performed at Texas A&M. These experiments use a hydraulic/gas flow analog to provide information about the inviscid mixing interface structure. Final validation and documentation of this work is expected by May of 1997. However, preliminary versions of DREA can be expected in early 1997. In summary, DREA provides a sufficiently detailed and realistic ejector-mixer nozzle model at a computational cost compatible with preliminary design applications.

DeChant, Lawrence J.↗

Robust Path Planning and Feedback Design Under Stochastic Uncertainty

Autonomous vehicles require optimal path planning algorithms to achieve mission goals while avoiding obstacles and being robust to uncertainties. The uncertainties arise from exogenous disturbances, modeling errors, and sensor noise, which can be characterized via stochastic models. Previous work defined a notion of robustness in a stochastic setting by using the concept of chance constraints. This requires that mission constraint violation can occur with a probability less than a prescribed value.In this paper we describe a novel method for optimal chance constrained path planning with feedback design. The approach optimizes both the reference trajectory to be followed and the feedback controller used to reject uncertainty. Our method extends recent results in constrained control synthesis based on convex optimization to solve control problems with nonconvex constraints. This extension is essential for path planning problems, which inherently have nonconvex obstacle avoidance constraints. Unlike previous approaches to chance constrained path planning, the new approach optimizes the feedback gain as wellas the reference trajectory.The key idea is to couple a fast, nonconvex solver that does not take into account uncertainty, with existing robust approaches that apply only to convex feasible regions. By alternating between robust and nonrobust solutions, the new algorithm guarantees convergence to a global optimum. We apply the new method to an unmanned aircraft and show simulation results that demonstrate the efficacy of the approach.

autonomuys vehicles↗

Effect of Recent Revisions to the Geomagnetic Reversal Time Scale on Estimates of Current Plate Motions

Recent revisions to the geomagnetic time scale indicate that global plate motion model NUVEL-1 should be modified for comparison with rates of motion estimated from space geodetic measurements. The optimal recalibration, which is a compromise among slightly different calibrations appropriate for slow, medium, and fast spreading rates is to multiply NUVEL-1 angular velocities by a multiplicative constant, alpha, of 0.9562. We refer to this simply recalibrated plate motion model as NUVEL-1A, and give correspondingly revised tables of angular velocities and uncertainties. Prior work has shown that space geodetic rates are slower on average than those calculated from NUVEL-1 by 6±1%. This average discrepancy is reduced to less that 2% when space geodetic rates are instead compared to NUVEL-1A.

geodetic↗

Revenue prediction for integrated renewable energy and energy storage system using machine learning techniques

Revenue estimation for integrated renewable energy and energy storage systems is important to support plant owners or operators’ decisions in battery sizing selection that leads to maximized financial performances. A common approach to optimizing revenues of a hybrid hydro and energy storage system is using mixed-integer linear programming (MILP). Although MILP models can provide accurate production cost estimations, they are typically very computationally expensive. To provide a fast yet accurate first-step information to hydropower plant owners or operators who consider integrating energy storage systems, we propose an innovative approach to predicting optimal revenues of an integrated energy generation and storage system. In this study, we examined the performance of two prediction techniques: Generalized Additive Models (GAMs) and machine learning (ML) models developed based on artificial neural networks (ANN). Predictive equations and models are generated based on optimized solutions from a market participation optimization model, the Conventional Hydropower Energy and Environmental Resource System (CHEERS) model. The two predicting techniques reduce the computational time to evaluate annual revenue for one set of battery configurations from 3 h to 1 to 4 min per run while also being implementable with significantly less data. The model validation prediction errors of developed GAMs and ML models are generally below 5%; for model testing predictions, the ML models consistently outperform the regression equations in terms of root mean square errors. This new approach allows plant owners, operators, or potential investors to quickly access multiple battery configurations under different energy generation and market scenarios. This new revenue prediction method will therefore help reduce the barriers, and thereby promoting the deployment of battery hybridization with existing renewable energy sources.

13 HYDRO ENERGY↗

Avoiding excess computation in asynchronous evolutionary algorithms

Abstract Asynchronous evolutionary algorithms are becoming increasingly popular as a means of making full use of many processors while solving computationally expensive search and optimization problems. These algorithms excel at keeping large clusters fully utilized, but may sometimes inefficiently sample an excess of fast‐evaluating solutions at the expense of higher‐quality, slow‐evaluating ones. We have previously introduced a steady‐state parent selection strategy, SWEET (“Selection whilE EvaluaTing”), that sometimes selects individuals that are still being evaluated and allows them to reproduce early. We perform a takeover‐time analysis that confirms that this strategy gives slow‐evaluating individuals that have higher fitnesses an increased ability to multiply in the population. We also find that SWEET appears effective at improving optimization performance on problems in which solution quality is positively correlated with evaluation time. We evaluate our approach on six simulated real‐valued optimization problems and three real‐world applications: an autonomous vehicle controller problem that involves tuning a spiking neural network and two adversarial EA problems. We further evaluate SWEET versus a basic asynchronous process in a simulated setting. We present evidence that SWEET outperforms basic asynchronous processes in a use‐case in which performance is positively correlated with evaluation time, and performs comparably (and often better) than basic asynchronous processes in several use‐cases where performance is negatively correlated with evaluation time. That said, in the cases where performance and evaluation time are negatively correlated the variance of outcomes for SWEET is notably high.

97 MATHEMATICS AND COMPUTING↗

Primer for OTERR Core Reloading Optimization

OTERR (Optimization of Test Reactor Reloading) is a software tool which assists in finding optimal fuel assembly reloading patterns for nuclear reactors. It was created specifically to support the Versatile Test Reactor (VTR) program, but its functionality is general enough to be applied to most fast spectrum reactors which use hexagonal prismatic fuel elements. This document is meant to be a primer for new users of OTERR to walk through example workflows for core reloading optimization cases. Simple cases are followed step-by-step to discuss what needs to be done to complete a reloading optimization sequence. Note that the intent of this document is to provide practical examples for users to follow along with so they can quickly start using OTERR and then make changes to fit their own modeling needs. Detail is limited in terms of addressing additional features not used in these examples and especially lacking in discussion of theory used in the code. To better address these points, users are highly encouraged to refer to the OTERR User Manual and the OTERR Theory Manual.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Fast Solution in Sparse LDA for Binary Classification

An algorithm that performs sparse linear discriminant analysis (Sparse-LDA) finds near-optimal solutions in far less time than the prior art when specialized to binary classification (of 2 classes). Sparse-LDA is a type of feature- or variable- selection problem with numerous applications in statistics, machine learning, computer vision, computational finance, operations research, and bio-informatics. Because of its combinatorial nature, feature- or variable-selection problems are NP-hard or computationally intractable in cases involving more than 30 variables or features. Therefore, one typically seeks approximate solutions by means of greedy search algorithms. The prior Sparse-LDA algorithm was a greedy algorithm that considered the best variable or feature to add/ delete to/ from its subsets in order to maximally discriminate between multiple classes of data. The present algorithm is designed for the special but prevalent case of 2-class or binary classification (e.g. 1 vs. 0, functioning vs. malfunctioning, or change versus no change). The present algorithm provides near-optimal solutions on large real-world datasets having hundreds or even thousands of variables or features (e.g. selecting the fewest wavelength bands in a hyperspectral sensor to do terrain classification) and does so in typical computation times of minutes as compared to days or weeks as taken by the prior art. Sparse LDA requires solving generalized eigenvalue problems for a large number of variable subsets (represented by the submatrices of the input within-class and between-class covariance matrices). In the general (fullrank) case, the amount of computation scales at least cubically with the number of variables and thus the size of the problems that can be solved is limited accordingly. However, in binary classification, the principal eigenvalues can be found using a special analytic formula, without resorting to costly iterative techniques. The present algorithm exploits this analytic form along with the inherent sequential nature of greedy search itself. Together this enables the use of highly-efficient partitioned-matrix-inverse techniques that result in large speedups of computation in both the forward-selection and backward-elimination stages of greedy algorithms in general.

Moghaddam, Baback↗