Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “scenario 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 1,063 records · Page 59

Transient Optimization of a Gas Turbine Engine

Gas turbine engines are the primary power plants for modern commercial aircraft. Transients prompted by significant changes in thrust or power demand are common and unavoidable. Extreme transient scenarios such as those associated with a go-around during a landing attempt are possible and must be accounted for in the design of the engine and its controller. Engine transients tend to cause a reduction in compressor operability margin, which must be addressed by the engine control system and accounted for in the engine design to prevent events such as compressor stall/surge and combustor blow out. Transient operability concerns typically lead to compromises in the engine design that sacrifice efficiency and/or limit responsiveness. Transient operability is typically managed by logic that limits the fuel flow command. If this logic is not optimized, then the potential for valuable performance could be lost. This study presents a strategy for optimizing the transient limit logic and proposes a strategy for updating the control logic over the lifespan of the engine. The results demonstrate significant improvements in transient operability. For example, of the results at sea level static conditions demonstrated a 31% reduction in the usage of the high pressure compressor operability stack during a snap acceleration transient. Furthermore, a reinforcement learning algorithm is demonstrated to modify the transient logic as the engine degrades to minimize response time while respecting a prescribed compressor operability margin limit. A simple demonstration of the reinforcement learning algorithm resulted in a thrust response time reduction of ~11.8%.

transient↗

Transient Optimization of a Gas Turbine Engine

Gas turbine engines are the primary power plants for modern commercial aircraft. Transients prompted by significant changes in thrust or power demand are common and unavoidable. Extreme transient scenarios such as those associated with a go-around during a landing attempt are possible and must be accounted for in the design of the engine and its controller. Engine transients tend to cause a reduction in compressor operability margin, which must be addressed by the engine control system and accounted for in the engine design to prevent events such as compressor stall/surge and combustor blow out. Transient operability concerns typically lead to compromises in the engine design that sacrifice efficiency and/or limit responsiveness. Transient operability is typically managed by logic that limits the fuel flow command. If this logic is not optimized, then the potential for valuable performance could be lost. This study presents a strategy for optimizing the transient limit logic and proposes a strategy for updating the control logic over the lifespan of the engine. The results demonstrate significant improvements in transient operability. For example, of the results at sea level static conditions demonstrated a 31% reduction in the usage of the high pressure compressor operability stack during a snap acceleration transient. Furthermore, a reinforcement learning algorithm is demonstrated to modify the transient logic as the engine degrades to minimize response time while respecting a prescribed compressor operability margin limit. A simple demonstration of the reinforcement learning algorithm resulted in a thrust response time reduction of ~11.8%.

transient↗

Transient Optimization of a Gas Turbine Engine

Gas turbine engines are the primary power plants for modern commercial aircraft. Transients prompted by significant changes in thrust or power demand are common and unavoidable. Extreme transient scenarios such as those associated with a go-around during a landing attempt are possible and must be accounted for in the design of the engine and its controller. Engine transients tend to cause a reduction in compressor operability margin, which must be addressed by the engine control system and accounted for in the engine design to prevent events such as compressor stall/surge and combustor blow out. Transient operability concerns typically lead to compromises in the engine design that sacrifice efficiency and/or limit responsiveness. Transient operability is typically managed by logic that limits the fuel flow command. If this logic is not optimized, then the potential for valuable performance could be lost. This study presents a strategy for optimizing the transient limit logic and proposes a strategy for updating the control logic over the lifespan of the engine. The results demonstrate significant improvements in transient operability. For example, of the results at sea level static conditions demonstrated a 31% reduction in the usage of the high pressure compressor operability stack during a snap acceleration transient. Furthermore, a reinforcement learning algorithm is demonstrated to modify the transient logic as the engine degrades to minimize response time while respecting a prescribed compressor operability margin limit. A simple demonstration of the reinforcement learning algorithm resulted in a thrust response time reduction of ~11.8%.

transient↗

Machine Learning for Scalable and Optimal Load Shedding Under Power System Contingency

Prompt and effective corrective actions in response to unexpected contingencies are crucial for improving power system resilience and preventing cascading blackouts. The optimal load shedding (OLS) accounting for network limits has the potential to address the diverse system-wide impacts of contingency scenarios as compared to traditional local schemes. However, due to the fast cascading propagation of initial contingencies, real-time OLS solutions are challenging to attain in large systems with high computation and communication needs. In this paper, we propose a decentralized design that leverages offline training of a neural network (NN) model for individual load centers to autonomously construct the OLS solutions from locally available measurements. Our learning-for-OLS approach can greatly reduce the computation and communication needs during online emergency responses, thus preventing the cascading propagation of contingencies for enhanced power grid resilience. Numerical studies on both the IEEE 118-bus system and a synthetic Texas 2000-bus system have demonstrated the efficiency and effectiveness of our scalable OLS learning design for timely power system emergency operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Convergence analysis for a nonlocal gradient descent method via directional Gaussian smoothing

We analyze the convergence of a nonlocal gradient descent method for minimizing a class of high-dimensional non-convex functions, where a directional Gaussian smoothing (DGS) is proposed to define the nonlocal gradient (also referred to as the DGS gradient). The method was first proposed in [Zhang et al., Enabling long-range exploration in minimization of multimodal functions, UAI 2021], in which multiple numerical experiments showed that replacing the traditional local gradient with the DGS gradient can help the optimizers escape local minima more easily and significantly improve their performance. However, a rigorous theory for the efficiency of the method on nonconvex landscape is lacking. In this work, we investigate the scenario where the objective function is composed of a convex function, perturbed by deterministic oscillating noise. We provide a convergence theory under which the iterates exponentially converge to a tightened neighborhood of the solution, whose size is characterized by the noise wavelength. Here, we also establish a correlation between the optimal values of the Gaussian smoothing radius and the noise wavelength, thus justifying the advantage of using moderate or large smoothing radii with the method. Furthermore, if the noise level decays to zero when approaching the global minimum, we prove that DGS-based optimization converges to the exact global minimum with linear rates, similarly to standard gradient-based methods in optimizing convex functions. Several numerical experiments are provided to confirm our theory and illustrate the superiority of the approach over those based on the local gradient.

Tran, Hoang [Oak Ridge National Laboratory (ORNL),↗

Smart-DS: Synthetic Models for Advanced, Realistic Testing: Distribution Systems and Scenarios

The explosion of new ideas for distributed energy resources and advanced distribution grid algorithms faces a critical challenge: how can one effectively develop and evaluate these breakthrough technologies without an adequate set of power systems network, load, and resource data to test against? Today's open test systems, particularly for distribution systems, are tiny and incomplete; and though with enough effort, obtaining utility data under NDA can overcome scale challenges, the results can't be openly shared, preventing fair comparison. The Smart-DS project-led by NREL in partnership with MIT, Universidad Pontificia Comillas, CYME, and EDD-is working to overcome this gap by generating multiple large-scale, open, synthetic, distribution systems that are realistic but not real. These datasets go beyond a single medium voltage feeder (~1000 customers) to cover entire metropolitan areas and their surrounds with up to hundreds of feeders and millions of customers, complete with low voltage customer connections and high voltage sub-transmission. This scale allows adequate testing and analysis of not just local controls and advanced DERs, but also multiple substation interactions, optimized switching, full-scale distribution-OPF, and more. To accompany these datasets, the project is also building a rich set of scenario generation tools that can be used for distribution and transmission systems alike. This includes automated, spatially aware access to world-class, high-resolution solar, wind, and weather data: forward looking generation mixes: and highly configurable DER, load, climate, outage, control-scheme, and other scenarios. We will also highlight DiTTo, an exciting open-source, multi-way distribution dataset transformation tool for many-to-many format translation with scenario, merge/split, and many other manipulation capabilities.

DERs↗

SU-E-T-262: Planning for Proton Pencil Beam Scanning (PBS): Applications of Gradient Optimization for Field Matching

Purpose: To propose the gradient optimization(GO) approach in planning for matching proton PBS fields and present two commonly used applications in our institution. Methods: GO is employed for PBS field matching in the scenarios that when the size of the target is beyond the field size limit of the beam delivery system or matching is required for beams from different angles to either improve the sparing of important organs or to pass through a short and simple beam path. Overlap is designed between adjacent fields and in the overlapped junction, the dose was optimized such that it gradually decreases in one field and the decrease is compensated by increase from another field. Clinical applications of this approach on craniospinal irradiation(CSI) and whole pelvis treatment were presented. Mathematical model was developed to study the relationships between dose errors, setup errors and junction lengths. Results: Uniform and conformal dose coverage to the entire target volumes was achieved for both applications using GO approach. For CSI, the gradient matching (6.7cm junction) between fields overcame the complexity of planning associated with feathering match lines. A slow dose gradient in the junction area significantly reduced the sensitivity of the treatment to setup errors. For whole pelvis, gradient matching (4cm junction) between posterior fields for superior target and bilateral fields for inferior target provided dose sparing to organs such as bowel, bladder and rectum. For a setup error of 3 mm in longitudinal direction from one field, mathematical model predicted dose errors of 10%, 6% and 4.3% for junction length of 3, 5 and 7cm. Conclusion: This GO approach improves the quality of the PBS treatment plan with matching fields while maintaining the safety of treatment delivery relative to potential misalignments.

60 APPLIED LIFE SCIENCES↗

Freeway Loop Detector Data Reconciliation Based on Vehicle Conservation

Loop detector is the most common source of traffic flow measurements on freeways. Though being a mature technology, loop detector is prone to miscounts even when it is properly deployed and adjusted. If a loop detectors systematically over- or under-counts, the estimation based on vehicle conservation leads to results that are not physically plausible such as negative density or density higher than the jam-density. Here we propose an optimization-based method in which plausible values of accumulation is guaranteed through explicit constraints. Compared to similar methods, the proposed method distinct in the following: (i) the optimization problem is convex therefore leads to shorter computational time; (ii) occupancy is also taken into account in order to estimate upper and lower bounds in the accumulation between stations; (iii) no modifications are required when data from one or multiple lanes are missing. The method is first validated using micro-simulation by disturbing the loop-detector from micro-simulation, applying the method and then comparing the results with the ground truth data. The results show the method is able to capture the average counts almost exactly while providing estimate of density with satisfactory accuracy. The method is also successfully applied in a scenario in which field-data is available.

data reconciliation↗

Wi-Fi Signal Survey of the International Space Station by Autonomous Free-Flying Robot

This paper analyzes Wi-Fi signal propagation inside pressurized modules of the International Space Station (ISS). Various flight datasets were collected by the Astrobee fleet of autonomous free-flying robots developed by the NASA Ames Research Center (ARC). The enclosed module spaces of the ISS pose unique challenges for Wi-Fi signal propagation, and understanding these challenges is crucial for optimizing connectivity in such environments. The survey data presented are valuable for optimizing wireless access point (WAP) locations and conditions. A computational method is developed to analyze the wireless communication system, RF coverage, and module compositions. The method is both rigorous and practical for assessing the ISS wireless system performance. The computational tools in this paper serve as a complementary approach to direct, on-orbit measurements, which is a complicated and expensive task. In some operational scenarios, ground measurements may be intractable due to the size of the spacecraft. Results from this research will aid future space missions and commercial spacecraft, providing insights into optimal WAP placements and robust wireless communication systems.

Astrobee↗

Wi-Fi Signal Survey of the International Space Station by Autonomous Free-Flying Robot

This paper analyzes Wi-Fi signal propagation inside pressurized modules of the International Space Station (ISS). Various flight datasets were collected by the Astrobee fleet of autonomous free-flying robots developed by the NASA Ames Research Center (ARC). The enclosed module spaces of the ISS pose unique challenges for Wi-Fi signal propagation, and understanding these challenges is crucial for optimizing connectivity in such environments. The survey data presented are valuable for optimizing wireless access point (WAP) locations and conditions. A computational method is developed to analyze the wireless communication system, RF coverage, and module compositions. The method is both rigorous and practical for assessing the ISS wireless system performance. The computational tools in this paper serve as a complementary approach to direct, on-orbit measurements, which is a complicated and expensive task. In some operational scenarios, ground measurements may be intractable due to the size of the spacecraft. Results from this research will aid future space missions and commercial spacecraft, providing insights into optimal WAP placements and robust wireless communication systems.

International Space Station↗

Generating Exploration Mission-3 Trajectories to a 9:2 NRHO using Machine Learning

The purpose of this thesis is to design a machine learning algorithm platform that provides expanded knowledge of mission availability through a launch season by improving trajectory resolution and introducing launch mission forecasting. The specific scenario addressed in this paper is one in which data is provided for four deterministic translational maneuvers through a mission to a Near Rectilinear Halo Orbit (NRHO) with a 9:2 synodic frequency. Current launch availability knowledge under NASA's Orion Orbit Performance Team is established by altering optimization variables associated to given reference launch epochs. This current method can bean abstract task and relies on an orbit analyst to structure a mission based on an established mission design methodology associated to the performance of Orion and NASA's Space Launch System. Introducing a machine learning algorithm trained to construct mission scenarios within the feasible range of known trajectories reduces the required interaction of the orbit analyst by removing the needed step of optimizing the orbit to fit an expected translational response required of the spacecraft. In this study, k-Nearest Neighbor and Bayesian Linear Regression successfully predicted classical orbital elements for the launch windows observed. However both algorithms had limitations due to their approaches to model fitting. Training machine learning algorithms off of classical orbital elements introduced a repetitive approach to reconstructing mission segments for different arrival opportunities through the launch window and can prove to be a viable method of launch window scan generation for future missions.

Guzman, Esteban↗

Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty

We introduce the problem of scheduling observations on a constellation of remote sensors, to maximize the aggregate quality of the collections obtained. While automated tools exist to schedule remote sensors, they are often based on heuristic scheduling techniques, which typically fail to provide bounds on the quality of the resultant schedules. To address this issue, we first introduce a novel deterministic mixed-integer programming (MIP) model for scheduling a constellation of one to n satellites, which relies on extensive pre-computations associated with orbital propagators and sensor collection simulators to mitigate model size and complexity. Our MIP model captures realistic and complex constellation-target geometries, with solutions providing optimality guarantees. We then extend our base deterministic MIP model to obtain two-stage and three-stage stochastic MIP models that proactively schedule to maximize expected collection quality across a set of scenarios representing cloud cover uncertainty. Our experimental conclusions on instances of one and two satellites demonstrate that our stochastic MIP models yield significantly improved collection quality relative to our base deterministic MIP model. We further demonstrate that commercial off-the-shelf MIP solvers can produce provably optimal or near-optimal schedules from these models in time frames suitable for sensor operations.

47 OTHER INSTRUMENTATION↗

Optimizing Heat Recovery with Storage: Control Validation and Sensitivity Analysis of the Time-Independent Energy Recovery Plant Using Modelica

Heat recovery in large building central plants saves energy but traditionally requires simultaneous heating and cooling. The Time-Independent Energy Recovery (TIER) plant shifts this paradigm by integrating thermal energy storage (TES) to enable heat recovery regardless of concurrent demand, offering a highly efficient, space-saving solution to achieve California’s energy goals. However, its integration of heat recovery chillers, cooling-only chillers, cooling towers, and trim air-source heat pumps (ASHPs) creates growing control and sizing complexity. To overcome this, this study employs high-fidelity Modelica dynamic simulation to validate TIER control sequences and optimize equipment sizing. We translated the written Sequences of Operation into executable Control Description Language (CDL) to test logic against sub-hourly loads. This verification workflow successfully identified and resolved critical vulnerabilities, such as thermal storage freezing and equipment short-cycling, in a virtual environment prior to physical deployment. Then, the study analyzes TIER plant performance across three simulated building types in three locations, and a real building load profile, ensuring variety in heating and cooling loads, and simultaneity factors and explores sizing rules for the TES and ASHP capacity. The analysis shows that the TIER plant operates equipment efficiently leading to a plant SCOP of around 7.5 across all scenarios, higher than a traditional ASHP plant, and a viable pathway to de-risk complex system design and control through simulation to identify optimal designs that maximize energy efficiency, minimize operational costs, and ensure robust operation in varied environmental conditions, thereby facilitating the broader adoption of such a solution for large buildings.

Zanetti, Ettore↗

Enhanced Grid Operation and Optimized PV Penetration Utilizing Highly Distributed Sensor Data

Sandia National Laboratories (SNL) and Enphase Energy, Inc. (Enphase) collaborated to address challenges related to the integration of Renewable Energy Systems. The goal of this research was to develop methods to cost-effectively achieve very high PV penetration scenarios (well beyond 100% of peak load at the feeder level) by leveraging distributed inverters to increase operator visibility and provide local voltage support This project focused on the integration of high penetration PV systems and other distributed resources such as energy storage, to determine how these technologies interoperate with each other and with utility distribution operations and management systems. To address the lack of coverage of feeder monitoring and communications infrastructure, SNL and Enphase leveraged highly distributed micro inverters that were installed in very large numbers in CA and Hawaii, and that have the ability to measure currant and voltage and communicate via a highly distributed network. The data was used to verify and enhance distribution system models and to optimize the control settings of distributed resources. SNL and Enphase demonstrated the effectiveness of these techniques by analyzing high PV penetration scenarios on distribution systems in California.

14 SOLAR ENERGY↗

Optimal test selection for prediction uncertainty reduction

Economic factors and experimental limitations often lead to sparse and/or imprecise data used for the calibration and validation of computational models. This paper addresses resource allocation for calibration and validation experiments, in order to maximize their effectiveness within given resource constraints. When observation data are used for model calibration, the quality of the inferred parameter descriptions is directly affected by the quality and quantity of the data. This paper characterizes parameter uncertainty within a probabilistic framework, which enables the uncertainty to be systematically reduced with additional data. The validation assessment is also uncertain in the presence of sparse and imprecise data; therefore, this paper proposes an approach for quantifying the resulting validation uncertainty. Since calibration and validation uncertainty affect the prediction of interest, the proposed framework explores the decision of cost versus importance of data in terms of the impact on the prediction uncertainty. Often, calibration and validation tests may be performed for different input scenarios, and this paper shows how the calibration and validation results from different conditions may be integrated into the prediction. Then, a constrained discrete optimization formulation that selects the number of tests of each type (calibration or validation at given input conditions) is proposed. Furthermore, the proposed test selection methodology is demonstrated on a microelectromechanical system (MEMS) example.

97 MATHEMATICS AND COMPUTING↗

A Decision Theoretic Approach To Optimizing Machine Learning Decisions with Prediction Uncertainty

While the use of machine learning (ML) classifiers is widespread, their output is often not part of any follow-on decision-making process. To illustrate, consider the scenario where we have developed and trained an ML classifier to find malicious URL links. In this scenario, network administrators must decide whether to allow a computer user to visit a particular website, or to instead block access because the site is deemed malicious. It would be very beneficial if decisions such as these could be made automatically using a trained ML classifier. Unfortunately, due to a variety of reasons discussed herein, the output from these classifiers can be uncertain, rendering downstream decisions difficult. Herein, we provide a framework for: (1) quantifying and propagating uncertainty in ML classifiers; (2) formally linking ML outputs with the decision-making process; and (3) making optimal decisions for classification under uncertainty with single or multiple objectives.

97 MATHEMATICS AND COMPUTING↗

Applying the Cognitive Space Gateway to Swarm Topologies

NASA's future vision for interplanetary networking includes a lunar network, Cube Satellite (CubeSat) constellations, and deep space robotic missions, comprising what could be viewed as a network of networks. Delay-tolerant networking (DTN) architecture and protocols provide a standard network layer among these varying scenarios and mitigate many challenges of the space environment, such as long delays, unplanned service interruptions, and asymmetric links. The Cognitive Space Gateway (CSG) is a routing method in a DTN architecture that uses spiking neural networks as the learning element to optimize routing decisions in a complex environment. This work aims to further develop cognitive networking technologies in several critical areas, including DTN, the CSG algorithm, CubeSat swarm topologies, and cloud services. To test the algorithm in a realistic scenario, the emulated network topology is based on a CubeSat swarm. The swarm may function as a mesh of nodes or as a hub-and-spoke network. An emulation environment will be built upon a commercial cloud service, such as Amazon Web Services (AWS) Elastic Compute Cloud. The cloud environment may enable a flexible, lower maintenance approach versus a multi-hop network based in a physical laboratory. The cloud platform will provide a secure environment allowing for collaboration among government and academic entities.

Ricardo Lent↗

High-Order Mesh Morphing for Boundary and Interface Fitting to Implicit Geometries

Here, we propose a method that morphs high-order meshes such that their boundaries and interfaces coincide/align with implicitly defined geometries. Our focus is particularly on the case when the target surface is prescribed as the zero isocontour of a smooth discrete function. Common examples of this scenario include using level set functions to represent material interfaces in multimaterial configurations, and evolving geometries in shape and topology optimization. The proposed method formulates the mesh optimization problem as a variational minimization of the sum of a chosen mesh-quality metric using the Target-Matrix Optimization Paradigm (TMOP) and a penalty term that weakly forces the selected faces of the mesh to align with the target surface. The distinct features of the method are use of a source mesh to represent the level set function with sufficient accuracy, and adaptive strategies for setting the penalization weight and selecting the faces of the mesh to be fit to the target isocontour of the level set field. We demonstrate that the proposed method is robust for generating boundary- and interface-fitted meshes for curvilinear domains using different element types in 2D and 3D.

97 MATHEMATICS AND COMPUTING↗