Search NASASearch

SEARCH · Search NASA

Results for “solution 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 217 records · Page 12

Time-Extended Payoffs for Collectives of Autonomous Agents

A collective is a set of self-interested agents which try to maximize their own utilities, along with a a well-defined, time-extended world utility function which rates the performance of the entire system. In this paper, we use theory of collectives to design time-extended payoff utilities for agents that are both aligned with the world utility, and are "learnable", i.e., the agents can readily see how their behavior affects their utility. We show that in systems where each agent aims to optimize such payoff functions, coordination arises as a byproduct of the agents selfishly pursuing their own goals. A game theoretic analysis shows that such payoff functions have the net effect of aligning the Nash equilibrium, Pareto optimal solution and world utility optimum, thus eliminating undesirable behavior such as agents working at cross-purposes. We then apply collective-based payoff functions to the token collection in a gridworld problem where agents need to optimize the aggregate value of tokens collected across an episode of finite duration (i.e., an abstracted version of rovers on Mars collecting scientifically interesting rock samples, subject to power limitations). We show that, regardless of the initial token distribution, reinforcement learning agents using collective-based payoff functions significantly outperform both natural extensions of single agent algorithms and global reinforcement learning solutions based on "team games".

Tumer, Kagan

Application of Aviation Turbulence Information to Air-Traffic Management (ATM): Chapter - 24

Unexpected turbulence especially in the upper troposphere and lower stratosphere where cabin crews and passengers in cruising aircraft are likely to unbuckle causes in-flight injuries, structural damage, and flight delay. Therefore, turbulence information can be used to improve safety while pursuing efficiency in Air-Traffic Management (ATM). In this chapter, simple modeling of aircraft trajectories combined with wind and turbulence predictions can suggest the optimal solution of flight plans that minimizes both total flight time (e.g., fuel consumption) and potential encounters of turbulence from departure to arrival airports. Also, probabilistic ensemble turbulence forecasts are applied to suggest an optimal strategic and tactical ATM route planning in a given weather and turbulence condition in the United States which are evaluated against in situ Eddy Dissipation Rate observations from commercial aircraft. Finally, variations of long-haul trans-Oceanic flight routes and their turbulence potentials are investigated using a global reanalysis data to understand how the upper-level large-scale flow patterns can affect the long-term ATM planning through the changes of winds and turbulence conditions.

Wind Optimal

Optimal Reorganization of NASA Earth Science Data for Enhanced Accessibility and Usability for the Hydrology Community

A long-standing "Digital Divide" in data representation exists between the preferred way of data access by the hydrology community and the common way of data archival by earth science data centers. Typically, in hydrology, earth surface features are expressed as discrete spatial objects (e.g., watersheds), and time-varying data are contained in associated time series. Data in earth science archives, although stored as discrete values (of satellite swath pixels or geographical grids), represent continuous spatial fields, one file per time step. This Divide has been an obstacle, specifically, between the Consortium of Universities for the Advancement of Hydrologic Science, Inc. and NASA earth science data systems. In essence, the way data are archived is conceptually orthogonal to the desired method of access. Our recent work has shown an optimal method of bridging the Divide, by enabling operational access to long-time series (e.g., 36 years of hourly data) of selected NASA datasets. These time series, which we have termed "data rods," are pre-generated or generated on-the-fly. This optimal solution was arrived at after extensive investigations of various approaches, including one based on "data curtains." The on-the-fly generation of data rods uses "data cubes," NASA Giovanni, and parallel processing. The optimal reorganization of NASA earth science data has significantly enhanced the access to and use of the data for the hydrology user community.

data rods

An algorithm for the solution of dynamic linear programs

The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme.

Psiaki, Mark L.

Optimal landing of a helicopter in autorotation

The landing of a helicopter in autorotation is formulated as a nonlinear optimal control problem. A unique feature in the present formulation is the addition of path inequality constraints on both the control and the state vectors. The control variable inequality constraint is a reflection of the limitation on the rotor thrust coefficient. The state-variable inequality constraint is an upper bound on the vertical sink-rate of the helicopter during descent. Optimal trajectories are calculated for entry conditions well within the height-velocity (H-V) restriction curve, with the helicopter initially in hover or in forward flight. The optimal solutions exhibited control techniques similar to those used by helicopter pilots in actual autorotational landings. The study indicates that, subject to pilot acceptability, a substantial reduction could be made in the H-V restriction zone using optimal control techniques.

Lee, A. Y.

Optimal Angle of Attack Control for Aerocapture Maneuvers

Recent investigations of aerocapture maneuvers have considered direct force control as a promising alternative to bank angle control. By modulating the angle of attack and sideslip angle independently, the longitudinal and lateral channels can be decoupled and thus solved separately. However, the optimal angle of attack profile for minimizing post-atmospheric propellant expenditure was previously unknown. This research applies principles of optimal control theory to numerically solve for the optimal angle of attack profile for control of the longitudinal channel. Direct methods are first employed to discretize the angle of attack profile and show that an optimal solution follows a nearly bang-bang (full lift up then full lift down) structure under a variety of conditions along the flight path angle corridor. To corroborate these results, indirect methods were also applied to scope the Optimal Control Problem (OCP) as a Two Point Boundary Value Problem (2P-BVP) which could then be solved numerically. The indirect optimization results aligned closely with the direct results, providing further evidence that a bang-bang structure provides a good approximation for the optimal angle of attack profile for aerocapture maneuvers using direct force control.

aerocapture

A holistic platform for accelerating sorbent-based carbon capture

Abstract Reducing carbon dioxide (CO 2 ) emissions urgently requires the large-scale deployment of carbon-capture technologies. These technologies must separate CO 2 from various sources and deliver it to different sinks 1,2 . The quest for optimal solutions for specific source–sink pairs is a complex, multi-objective challenge involving multiple stakeholders and depends on social, economic and regional contexts. Currently, research follows a sequential approach: chemists focus on materials design 3 and engineers on optimizing processes 4,5 , which are then operated at a scale that impacts the economy and the environment. Assessing these impacts, such as the greenhouse gas emissions over the plant’s lifetime, is typically one of the final steps 6 . Here we introduce the PrISMa (Process-Informed design of tailor-made Sorbent Materials) platform, which integrates materials, process design, techno-economics and life-cycle assessment. We compare more than 60 case studies capturing CO 2 from various sources in 5 global regions using different technologies. The platform simultaneously informs various stakeholders about the cost-effectiveness of technologies, process configurations and locations, reveals the molecular characteristics of the top-performing sorbents, and provides insights on environmental impacts, co-benefits and trade-offs. By uniting stakeholders at an early research stage, PrISMa accelerates carbon-capture technology development during this critical period as we aim for a net-zero world.

Science & Technology - Other Topics

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

Optimization problems in finance, physics, and computer science are typically very hard to tackle in classical computing; quantum computing could help speed up computations and provide efficient methods for tackling large problems. Typically, to treat a problem with a quantum computer, the optimal solution is cast as the ground state of a diagonal Hamiltonian. Here, we develop a method, called imaginary-time evolution block encoding (ITE-BE), based on a recent imaginary-time algorithm, which requires no variational parameter optimization, as all parameters can be derived analytically from the target Hamiltonian. We also demonstrate that our method can be successfully combined with other quantum algorithms such as the quantum approximate optimization algorithm (QAOA). For illustration, here we study the MaxCut problem. We find that the QAOA ansatz increases the postselection success of ITE-BE, and shallow QAOA circuits, when boosted with ITE-BE, achieve better performance than deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block-encoding scheme to allow for a deterministic application of the first layer of the circuit.

Zhong, Dawei [University of Southern California, L

Multi-objective sizing and dispatch for building thermal and battery storage towards economic and environmental synergy

The role of building thermal and battery storage is pivotal in advancing smart cities and achieving sustainability goals through effective energy management. Despite their significance, there are several limitations in the sizing approach and value stream analysis with various objectives for their widespread adoption in buildings. This work proposes a flexible and scalable multi-objective optimization framework for optimal sizing and dispatch of building thermal and battery storage, addressing conflicting objectives simultaneously using mixed-integer linear programming. The weighted-sum method is adapted, combining multiple objectives into a single function. The two-stage procedure iterates over different weights, generating optimal solutions and forming the Pareto front. Case studies are performed to assess the energy, economic, and environmental benefits of building energy storage systems for a large office building in three climate locations. The results demonstrate that the proposed framework efficiently determines optimal sizing and dispatch strategies, addressing the balance between economic viability and emission reduction. The dynamic relationship between time-of-use energy charges and emission factors leads to significantly different strategies based on whether economic or environmental concerns are prioritized. This research enhances our understanding of the benefits of TES and BES systems in buildings, providing valuable guidance to stakeholders.

25 ENERGY STORAGE

Time Synchronization Techniques in the Modern Smart Grid: A Comprehensive Survey

In modern smart grids, accurate and synchronized time signals are essential for effective monitoring, protection, and control. Various time synchronization methods exist, each tailored to specific application needs. Widely adopted solutions, such as GPS, however, are vulnerable to challenges such as signal loss and cyber-attacks, underscoring the need for reliable backup or supplementary solutions. This paper examines the timing requirements across different power grid applications and provides a comprehensive review of available time synchronization mechanisms. Through a comparative analysis of timing methods based on accuracy, flexibility, reliability, and security, this study offers insights to guide the selection of optimal solutions for seamless grid integration.

comparison

Singular trajectories for time-optimal half-loop maneuvers of a high alpha fighter aircraft

Consideration is given to the problem of deriving a time-optimal open-loop control for the half-loop maneuver of a high-alpha aircraft, with initial conditions Mach 0.6 and 15,000 feet. Pontriagin's maximum principle is used to derive candidate optimal solutions. Using the two-point boundary-value algorithm, the flight path angle is maximized for various increasing specified final times until a final time of 13.6 sec yields a 180-deg flight-path angle. As the final time increased from 0.0 to 13.6 sec, the optimization process revealed 13 distinct switching structures of the control law, of which 11 contained singular arcs, and two had double singular arcs.

Hoffman, Eric

Multiobjective Optimization of Rocket Engine Pumps Using Evolutionary Algorithm

A design optimization method for turbopumps of cryogenic rocket engines has been developed. Multiobjective Evolutionary Algorithm (MOEA) is used for multiobjective pump design optimizations. Performances of design candidates are evaluated by using the meanline pump flow modeling method based on the Euler turbine equation coupled with empirical correlations for rotor efficiency. To demonstrate the feasibility of the present approach, a single stage centrifugal pump design and multistage pump design optimizations are presented. In both cases, the present method obtains very reasonable Pareto-optimal solutions that include some designs outperforming the original design in total head while reducing input power by one percent. Detailed observation of the design results also reveals some important design criteria for turbopumps in cryogenic rocket engines. These results demonstrate the feasibility of the EA-based design optimization method in this field.

Oyama, Akira

Leveraging prior mean models for faster Bayesian optimization of particle accelerators

Tuning particle accelerators is a challenging and time-consuming task that can be automated and carried out efficiently using suitable optimization algorithms, such as model-based Bayesian optimization techniques. One of the major advantages of Bayesian algorithms is the ability to incorporate prior information about beam physics and historical behavior into the model used to make control decisions. In this work, we examine incorporating prior accelerator physics information into Bayesian optimization algorithms by utilizing fast executing, neural network models trained on simulated or historical datasets as prior mean functions in Gaussian process models. We show that in ideal cases, this technique substantially increases convergence speed to optimal solutions in high-dimensional tuning parameter spaces. Additionally, we demonstrate that even in non-ideal cases, where prior models of beam dynamics do not exactly match experimental conditions, the use of this technique can still enhance convergence speed. Finally, we demonstrate how these methods can be used to improve optimization in practical applications, such as transferring information gained from beam dynamics simulations to online control of the LCLS injector, and transferring knowledge gained from experimental measurements across different operating modes, such as accelerating different ion species at the ATLAS heavy ion accelerator.

43 PARTICLE ACCELERATORS

Ambiguity resolution for satellite Doppler positioning systems

The implementation of satellite-based Doppler positioning systems frequently requires the recovery of transmitter position from a single pass of Doppler data. The least-squares approach to the problem yields conjugate solutions on either side of the satellite subtrack. It is important to develop a procedure for choosing the proper solution which is correct in a high percentage of cases. A test for ambiguity resolution which is the most powerful in the sense that it maximizes the probability of a correct decision is derived. When systematic error sources are properly included in the least-squares reduction process to yield an optimal solution the test reduces to choosing the solution which provides the smaller valuation of the least-squares loss function. When systematic error sources are ignored in the least-squares reduction, the most powerful test is a quadratic form comparison with the weighting matrix of the quadratic form obtained by computing the pseudoinverse of a reduced-rank square matrix. A formula for computing the power of the most powerful test is provided. Numerical examples are included in which the power of the test is computed for situations that are relevant to the design of a satellite-aided search and rescue system.

Argentiero, P.

Enhancing the Cassini Mission Through FP Applications After Launch

Although rigorous pre-emptive measures are taken to preclude failures and anomalous conditions from occurring in JPL spacecraft missions prior to launch, unforeseeable problems can still surface after liftoff. In the case of the Cassini/Huygens Mission-to-Saturn spacecraft, several problems were observed post-launch: 1) immediately after takeoff, the collected engineering/science data stored on the Solid State Recorders (SSR) contained a significantly higher number of corrupted bits than was expected (considerably over spec) due to human error in the memory mapping of these devices, 2) numerous Solid State Power Switches (SSPS) sporadically tripped off throughout the mission due to cosmic ray bombardment from the unique space environment, and 3) false assumptions in the pressure regulator design in combination with missing heritage test data led to inaccurate design conclusions, causing the issuance of two waivers for the regulator to close properly (a potentially mission catastrophic single-point failure which occurred 24 days after launch) - amongst other problems. For Cassini, some of these anomalies led to arduous work-arounds or required continuous monitoring of telemetry variables by the ground-based Spacecraft Operations Flight Support (SOFS) team in order to detect and fix fault occurrences as they happened. Fortunately, sufficient funding and schedule margin allowed several Fault Protection (FP) solutions to be implemented into post-launch Flight Software (FSW) uploads to help resolve these issues autonomously, reducing SOFS ground support efforts while improving anomaly recovery time in order to preserve maximum science capture. This paper details the FP applications used to resolve the above issues as well as to optimize solutions for several other problems experienced by the Cassini spacecraft during its fight, in order to enhance the spacecraft's overall mission success throughout the 18 years of its 20 year expedition to and within the Saturnian system.

fault protection