Search NASA⌕ Search

SEARCH · Search NASA

Results for “constrained 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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
NASA NTRS1979

Optimization of multiple flyby trajectories

A procedure has been developed which minimizes total delta-V (instantaneous velocity change) for a multiple flyby trajectory with constraints on flyby altitude and orientation. The solution is found by varying the locations of maneuver points between each flyby to minimize the delta-Vs at the maneuver points. Each trajectory segment connecting consecutive maneuver points is found by solving an N-body analog to Lambert's problem. Multiconic techniques are used for trajectory propagation and for computation of the state transition matrix. The constrained parameter optimization problem is converted to an unconstrained problem by means of penalty functions and then solved with a quasi-Newton algorithm utilizing analytic first derivatives. This procedure has been successfully applied to Galileo satellite tour trajectories.

Damario, L. A.↗
NASA NTRS1981

Optimization of extended propulsion time nuclear-electric propulsion trajectories

This paper presents the methodology used in optimizing extended propulsion time NEP missions considering realistic thruster lifetime constraints. These missions consist of a powered spiral escape from a 700-km circular orbit at the earth, followed by a powered heliocentric transfer with an optimized coast phase, and terminating in a spiral capture phase at the target planet. This analysis is most applicable to those missions with very high energy requirements such as outer planet orbiter missions or sample return missions where the total propulsion time could greatly exceed the expected lifetime of an individual thruster. This methodology has been applied to the investigation of NEP missions to the outer planets where examples are presented of both constrained and optimized trajectories.

Sauer, C. G., Jr.↗
DOE OSTI2025

A high-throughput approach for statistical process optimization in Laser Powder Bed Fusion

Process variability is inherent in metal additive manufacturing (AM). However, it is often overlooked in process optimization frameworks, constraining the understanding of process uncertainties and their influence on parameter selection. To address this, we present an integrated framework that combines high-throughput single-track experiments, GAN-based melt pool geometry extraction, robust statistical and machine learning modeling, and uncertainty-quantified process mapping. Process variability is characterized through single-track melt pool behaviors, and its influence on defect formation is systematically quantified to enable statistically guided process parameter optimization. This approach is demonstrated on Laser Powder Bed Fusion (L-PBF) of stainless steel 316L, effectively capturing the interplay between process parameters, melt pool variability, and defect probability. By integrating uncertainty quantification into process optimization, this study provides a structured methodology for addressing variability challenges in AM quality control, ultimately contributing to enhanced manufacturing reliability.

Laser Powder Bed Fusion↗
NASA NTRSDate not supplied

Integration of Low-Fidelity MDO and CFD-Based Redesign of Low-Boom Supersonic Transports

A mixed-fidelity low-boom multidisciplinary optimization (MDO) problem is formulated for integration of low-fidelity MDO and computational fluid dynamics (CFD) based low-boom inverse design optimization. The mixed-fidelity low-boom MDO problem aims to enforce the weight consistency for CFD-based low-boom inverse design optimization: the optimum low-boom configuration is designed for the weight at the start of cruise of the same configuration for the low-boom overland mission. Moreover, it also seeks the optimum trades among the maximum takeoff gross weight (MTOGW), cruise Mach, and range for the low-boom overland mission while meeting the requirement of flying a transatlantic overwater mission. A block coordinate optimization (BCO) method is developed to find an approximate solution of the mixed-fidelity low-boom MDO problem. The BCO method is successfully applied to generate two CFD-based low-boom configurations that closely match two reversed equivalent area targets with ground noise levels below 70 PLdB, respectively. Moreover, these CFD-based low-boom configurations can be obtained with minor wing modifications from the solutions of the low-fidelity MDO problem. The low-fidelity MDO solutions are Pareto points for constrained multiobjective optimization of MTOGW, low-boom cruise Mach, and low-boom range. The best low-boom concept has a predetermined fuselage shape tailored for passengers and main gear storage, carries 40 passengers at seat pitch of 48 in, flies a low-boom overland mission with cruise Mach of 1.8 and range of 2,950 nm, cruises overwater at Mach 1.8 with range of 3,600 nm, satisfies the specified constraints for landing/cruise/takeoff, has MTOGW of 145,164 lb, trims the low-boom cruise flight with fuel redistributions instead of control surface deflections, and has a reversed equivalent area distribution closely matching a target with ground noise level below 70 PLdB.

multidisciplinary optimization↗
NASA NTRSDate not supplied

Integration of Low-Fidelity MDO and CFD-Based Redesign of Low-Boom Supersonic Transports

A mixed-fidelity low-boom multidisciplinary optimization (MDO) problem is formulated for integration of low-fidelity MDO and computational fluid dynamics (CFD) based low-boom inverse design optimization. The mixed-fidelity low-boom MDO problem aims to enforce the weight consistency for CFD-based low-boom inverse design optimization: the optimum low-boom configuration is designed for the weight at the start of cruise of the same configuration for the low-boom overland mission. Moreover, it also seeks the optimum trades among the maximum takeoff gross weight (MTOGW), cruise Mach, and range for the low-boom overland mission while meeting the requirement of flying a transatlantic overwater mission. A block coordinate optimization (BCO) method is developed to find an approximate solution of the mixed-fidelity low-boom MDO problem. The BCO method is successfully applied to generate two CFD-based low-boom configurations that closely match two reversed equivalent area targets with ground noise levels below 70 PLdB, respectively. Moreover, these CFD-based low-boom configurations can be obtained with minor wing modifications from the solutions of the low-fidelity MDO problem. The low-fidelity MDO solutions are Pareto points for constrained multiobjective optimization of MTOGW, low-boom cruise Mach, and low-boom range. The best low-boom concept has a predetermined fuselage shape tailored for passengers and main gear storage, carries 40 passengers at seat pitch of 48 in, flies a low-boom overland mission with cruise Mach of 1.8 and range of 2,950 nm, cruises overwater at Mach 1.8 with range of 3,600 nm, satisfies the specified constraints for landing/cruise/takeoff, has MTOGW of 145,164 lb, trims the low-boom cruise flight with fuel redistributions instead of control surface deflections, and has a reversed equivalent area distribution closely matching a target with ground noise level below 70 PLdB.

low-boom supersonic transports↗
NASA NTRS2021

Integration of Low-Fidelity MDO and CFD-Based Redesign of Low-Boom Supersonic Transports

A mixed-fidelity low-boom multidisciplinary optimization (MDO) problem is formulated for integration of low-fidelity MDO and computational fluid dynamics (CFD) based low-boom inverse design optimization. The mixed-fidelity low-boom MDO problem aims to enforce the weight consistency for CFD-based low-boom inverse design optimization: the optimum low-boom configuration is designed for the weight at the start of cruise of the same configuration for the low-boom overland mission. Moreover, it also seeks the optimum trades among the maximum takeoff gross weight (MTOGW), cruise Mach, and range for the low-boom overland mission while meeting the requirement of flying a transatlantic overwater mission. A block coordinate optimization (BCO) method is developed to find an approximate solution of the mixed-fidelity low-boom MDO problem. The BCO method is successfully applied to generate two CFD-based low-boom configurations that closely match two reversed equivalent area targets with ground noise levels below 70 PLdB, respectively. Moreover, these CFD-based low-boom configurations can be obtained with minor wing modifications from the solutions of the low-fidelity MDO problem. The low-fidelity MDO solutions are Pareto points for constrained multiobjective optimization of MTOGW, low-boom cruise Mach, and low-boom range. The best low-boom concept has a predetermined fuselage shape tailored for passengers and main gear storage, carries 40 passengers at seat pitch of 48 in, flies a low-boom overland mission with cruise Mach of 1.8 and range of 2,950 nm, cruises overwater at Mach 1.8 with range of 3,600 nm, satisfies the specified constraints for landing/cruise/takeoff, has MTOGW of 145,164 lb, trims the low-boom cruise flight with fuel redistributions instead of control surface deflections, and has a reversed equivalent area distribution closely matching a target with ground noise level below 70 PLdB.

low-boom supersonic transports↗
NASA NTRS2022

Low-Earth Orbit Trajectory Optimization in the Presence of Atmospheric Uncertainty

The previous 20 to 25 years have seen a tremendous increase in space exploration, and with that an increase in the level of logistics planning needed to ensure mission success. For spacecraft that are designed to be periodically re-supplied, a key logistics consumable is propellant, as it constitutes the greatest up-mass on re-supply vehicles. A trajectory design strategy is therefore desired that minimizes propellant usage in order to ease the demand for propellant re-supply missions. This thesis develops such a strategy in three stages, and uses the International Space Station (ISS) as its testbed, as no other LEO spacecraft is more challenging from a space logistics standpoint. First, the ISS trajectory planning problem is formulated as a constrained burn optimization problem assuming a deterministic atmosphere. The cost function is total ∆v, with constraints imposed on longitude of ascending viii node (LAN) and semi-major axis (SMA) altitude. Analytic derivatives are constructed for both the cost and constraints, which are necessary given the 6-week to 2-year time frames being considered. A gradient-based optimizer is then utilized to find locally-optimal solutions to real-world ISS trajectory planning problems. Second, atmospheric uncertainty is addressed by constructing a probabilistic model of space weather data using Gaussian Processes (GPs). Bayesian inference is performed using the GP model to generate mean and covariance estimates for space weather predictions, whose pedigree is assessed against test data. The predictions are then mapped into atmospheric density via the analytic Jacchia-Roberts density model, and the effect of space weather uncertainty on orbital lifetime is examined. Third, an ISS burn execution uncertainty model is developed. This model, along with the space weather uncertainty model, are deployed in a linear covariance analysis to ascertain their combined effect on LAN and SMA altitude dispersions. The deterministic constraints from the original problem are re-formulated as stochastic constraints, where now the constraint uncertainty interval is required to fall within specified bounds. An updated optimization framework is constructed using the original ∆v cost function along with the stochastic constraints to solve the trajectory optimization problem under atmospheric uncertainty. Finally, the complete architecture is summarized for deployment in an operational setting.

Trajectory Optimization↗
DOE OSTI2025

Design Optimization of a Criticality Experiment for the Molten Chloride Reactor Experiment Facility

Neutronics simulations of Molten Chloride Fast Reactors have quantifiable biases that arise from nuclear data, modeling choices, or numerical methods. The multiphysics nature of molten salt reactors makes it challenging to disentangle neutronics modeling biases from biases originating from other physical phenomena. In comparison to a mock-up reactor, criticality experiments can specifically assess the neutronics modeling bias while limiting multiphysics effects. The criticality experiment must be neutronically representative of the full-scale reactor to be valuable. Here, in this paper, we describe the design of a criticality experiment to validate only the neutronics of TerraPower’s Molten Chloride Reactor Experiment (MCRE) and its criticality safety upset scenarios. The proposed experiment uses different chlorine-containing materials to maximize its similarity to the MCRE. The design process uses a constrained Bayesian optimization algorithm to investigate different objective functions that use covariance information for 35 Cl nuclear data. The experiments could reduce the nuclear data–induced uncertainty in k eff of the MCRE from 2161 to 886 pcm. They would also increase the upper subcritical limit of the MCRE criticality safety upset scenario from 0.94101 to 0.94476 when using the WHISPER analysis framework.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS2003

Recent results in Mars Relay Network planning and scheduing

At different time periods in the future, Mars missions will overlap and previous studies indicate that during such periods existing deep space communication infrastructure will not be able to handle all Mars communication needs. A plausible solution is to perform optimal resource allocation for the Mars relay communication network; a network consisting of multiple surface units and orbiters on Mars and the Deep Space Stations. Unlike direct-to-earth, a relay communication, either in real-time or store-and-forward, can increase network science data return, reduce surface unit's direct-to-earth communication demands, and enable communication even when the surface unit is not facing Earth. It is the objective of this paper to take advantage of the relay operation to efficiently plan and schedule the network communications.

Relay Network planning and scheduling constrained ↗
DOE OSTI2025

Neural network approaches for parameterized optimal control

Here, we consider numerical approaches for deterministic, finite-dimensional optimal control problems whose dynamics depend on unknown or uncertain parameters. We seek to amortize the solution over a set of relevant parameters in an offline stage to enable rapid decision-making and be able to react to changes in the parameter in the online stage. To tackle the curse of dimensionality arising when the state and/or parameter are high-dimensional, we represent the policy using neural networks. We compare two training paradigms: First, our model-based approach leverages the dynamics and definition of the objective function to learn the value function of the parameterized optimal control problem and obtain the policy using a feedback form. Second, we use actor-critic reinforcement learning to approximate the policy in a data-driven way. Using an example involving a two-dimensional convection-diffusion equation, which features high-dimensional state and parameter spaces, we investigate the accuracy and efficiency of both training paradigms. While both paradigms lead to a reasonable approximation of the policy, the model-based approach is more accurate and considerably reduces the number of PDE solves.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Dynamic analysis of fully constrained Cable-Driven Parallel Robots for automated prefabricated component installation

This paper presents a dynamic analysis and validation framework to assess a fully constrained six-anchor Cable-Driven Parallel Robot (CDPR) for automated installation of prefabricated facade components. Compared with conventional eight-anchor systems, the six-anchor configuration simplifies setup and reduces cost, but it also reduces control authority, shrinks the wrench-feasible workspace, and tightens orientation limits. Consequently, it is unclear a priori whether dynamically feasible trajectories exist to move the end effector from pickup to the facade. A constrained trajectory optimization is formulated to enforce the system dynamics, cable-tension bounds, and pose/velocity limits, and the framework is evaluated in simulation at three levels: (i) an idealized reference model, (ii) a lab-scale prototype model incorporating measured anchor misalignments and identified damping, and (iii) a full-scale three-story building model with load decomposition for structural feasibility checks. Across these scenarios, the analysis shows that optimal, constraint-satisfying trajectories exist that move the end effector from pickup to installation while maintaining a near-plumb, level orientation at the final pose. Collectively, this multi-scale dynamic analysis and validation framework supports the deployment readiness of the six-anchor CDPR and provides a prototype-based sensitivity case study of how measured anchor placement deviations affect feasibility.

CDPR↗
DOE OSTI2025

Local practically safe extremum seeking with assignable rate of attractivity to the safe set

We present Assignably Safe Extremum Seeking (ASfES), an algorithm designed to minimize a measured, static objective function while maintaining a measured, static metric of safety (a control barrier function or CBF) to be positive in a practical sense. We ensure that for trajectories with safe initial conditions, the violation of safety can be made arbitrarily small through appropriately chosen design constants. We also guarantee an assignable “attractivity” rate: from unsafe initial conditions, the trajectories approach the safe set, in the sense of the measured CBF, at a rate no slower than a user-assigned rate. Similarly, from safe initial conditions, the trajectories approach the unsafe set, in the sense of the CBF, no faster than the assigned attractivity rate. The feature of assignable attractivity is not present in the semiglobal version of safe extremum seeking, where the semiglobality of convergence is achieved by slowing the adaptation. We also demonstrate local convergence of the parameter to a neighborhood of the minimum of a quadratic objective function constrained to the safe set with a linear CBF. The ASfES algorithm and analysis are multivariable, but we also extend the algorithm to a Newton-Based ASfES scheme which we show is only useful in the scalar case. The proven properties of the designs are illustrated through simulation examples.

42 ENGINEERING↗
DOE OSTI2025

A comparative study of calibration techniques for finite strain elastoplasticity: Numerically-exact sensitivities for FEMU and VFM

Accurate identification of material parameters is crucial for predictive modeling in computational mechanics. Here, the two primary approaches in the experimental mechanics community for calibration from full-field digital image correlation data are known as finite element model updating (FEMU) and the virtual fields method (VFM). In VFM, the objective function is a squared mismatch between internal and external virtual work or power. In FEMU, the objective function quantifies the weighted mismatch between model predictions and corresponding experimentally measured quantities of interest. It is minimized by iteratively updating the parameters of an FE model. While FEMU is seen as more flexible, VFM is commonly used instead of FEMU due to its considerably greater computational expense. However, comparisons between the two methods usually involve approximations of gradients or sensitivities with finite difference schemes, thereby making direct assessments difficult. Hence, in this study, we compare VFM and FEMU in the context of numerically-exact sensitivities obtained through local sensitivity analyses and the application of automatic differentiation software. To this end, we conduct a series of test cases to assess both methods under practical challenges using a finite strain elastoplasticity model.

Automatic differentiation↗
DOE OSTI2026

Stochastic Microgrid Scheduling With Chance‐Constrained Resilience Consideration

Traditionally, it is assumed that microgrids transition seamlessly from grid‐connected operation to islanded mode in the event of sudden main grid outages. In reality, the islanding process, especially unintentional islanding, is rarely seamless. Instead, it is subject to voltage and frequency fluctuations caused by the instantaneous disconnection of the point of common coupling (PCC) switch, variations in loads and renewable generation output and even the protection tripping of distributed energy resources (DERs). To mitigate these fluctuations and facilitate a smooth islanding process, we propose a stochastic microgrid scheduling model that incorporates chance‐constrained resilience measures. Specifically, the resilience measure is defined as the probability of successful islanding (PSI), that is, the probability that a microgrid can mitigate the generation‐demand imbalance caused by the disconnection of the PCC switch, variations in load and renewable generation and DER tripping. This measure is modelled using chance constraints. Unlike existing reliability and resilience indices, which typically neglect the possibility of microgrid/DER failure under extreme events and assume their survival while primarily focussing on reducing impact duration or magnitude, the proposed PSI‐based framework explicitly addresses microgrid and DER survival during the islanding transition. The formulated nonlinear chance constraints are approximated using a multiinterval approach and equivalently represented as a mixed‐integer linear programming (MILP) formulation. Case study results validate the proposed method, showing that the PSI estimation error is reduced to less than 8%, compared to approximately 28% with existing methods. Various sensitivity analyses on the DER tripping rate and PSI settings were performed to validate the robustness of the proposed method. In particular, the necessity of accounting for DER tripping in the PSI calculation was demonstrated.

chance constrained optimization↗
DOE OSTI2025

Safe Reinforcement Learning-Based Transient Stability Control for Islanded Microgrids With Topology Reconfiguration

This paper proposes a safe reinforcement learning (RL)-based transient stability emergency control (TSEC) method for islanded microgrids. RL requires extensive interaction with the environment to learn control strategies, hence, a data-driven approach is used as a substitute for time-consuming time-domain simulation calculations. Deep sigma point processes (DSPP), which is a Gaussian process model, is utilized to predict the normal distribution of transient stability of microgrids and to construct a transient stability chance constraint. Reward-constrained policy optimization (RCPO) can simultaneously achieve objective prediction, policy learning, and constraint cost coefficient update across multiple timescales. RCPO interacts with the DSPP-based microgrid environment through a multi-process parallel manner, greatly increasing the training speed. Case studies on a real islanded microgrid demonstrate that the proposed method can efficiently and quickly obtain the optimal emergency control strategy while adhering to all hard constraints.

14 SOLAR ENERGY↗
DOE OSTI2026

Simplex‐based model for nanoparticle grain identification in four‐dimensional scanning transmission electron microscopy data

Grain identification in polycrystalline nanoparticles, for example, determining which crystal phases are present at each spatial location, is fundamental to materials characterisation. This is particularly challenging when grains overlap extensively, as commonly occurs in four-dimensional scanning transmission electron microscopy (4D-STEM) datasets. We propose a simplex-based model (SBM) in which each simplex vertex represents the diffraction pattern (DP) of a pure grain, and the simplex edges and interior represent overlapping grains. Our SBM grain identification algorithm operates on the Bragg disk (BD) data matrix distilled from the 4D-STEM data to identify the grain membership at each scan position, together with a BD feature matrix whose columns represent the DPs for each constituent grain, which is important for identifying the crystal structure of each grain. We solve the model using a two-stage algorithm. In Stage 1, we adapt a linear mixing algorithm to estimate an initial BD feature matrix whose columns represent DPs of potentially overlapping grains. Our Stage 2 algorithm incorporates sparsity considerations to transform the initial BD feature matrix so that its columns represent DPs of pure grains. Using simulated datasets with various grain configurations, we demonstrate that SBM recovers both the BD feature matrix and membership maps more accurately than existing methods, even when a grain lacks any pure region and completely overlaps with other grains.

4D-STEM segmentation↗