Search NASA⌕ Search

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 1,063 records · Page 59

Artificial Intelligence Based Control Power Optimization on Tailless Aircraft

Traditional methods of control allocation optimization have shown difficulties in exploiting the full potential of controlling large arrays of control devices on innovative air vehicles. Artificial neutral networks are inspired by biological nervous systems and neurocomputing has successfully been applied to a variety of complex optimization problems. This project investigates the potential of applying neurocomputing to the control allocation optimization problem of Hybrid Wing Body (HWB) aircraft concepts to minimize control power, hinge moments, and actuator forces, while keeping system weights within acceptable limits. The main objective of this project is to develop a proof-of-concept process suitable to demonstrate the potential of using neurocomputing for optimizing actuation power for aircraft featuring multiple independently actuated control surfaces. A Nastran aeroservoelastic finite element model is used to generate a learning database of hinge moment and actuation power characteristics for an array of flight conditions and control surface deflections. An artificial neural network incorporating a genetic algorithm then uses this training data to perform control allocation optimization for the investigated aircraft configuration. The phase I project showed that optimization results for the sum of required hinge moments are improved by more than 12% over the best Nastran solution by using the neural network optimization process.

Gern, Frank↗

Studies on Hot-Melt Prepregging of PMR-II-50 Polyimide Resin with Graphite Fibers

A Second generation PMR (in situ Polymerization of Monomer Reactants) polyimide resin, PMR-II-50, has been considered for high temperature and high stiffness space propulsion composites applications for its improved high temperature performance. As part of composite processing optimization, two commercial prepregging methods: solution vs. hot-melt processes were investigated with M40J fabrics from Toray. In a previous study a systematic chemical, physical, thermal and mechanical characterization of these composites indicated that poor resin-fiber interfacial wetting, especially for the hot-melt process, resulted in poor composite quality. In order to improve the interfacial wetting, optimization of the resin viscosity and process variables were attempted in a commercial hot-melt prepregging line. In addition to presenting the results from the prepreg quality optimization trials, the combined effects of the prepregging method and two different composite cure methods, i.e., hot press vs. autoclave on composite quality and properties are discussed.

Shin, E. Eugene↗

Studies on Hot-Melt Prepregging on PRM-II-50 Polyimide Resin with Graphite Fibers

A second generation PMR (in situ Polymerization of Monomer Reactants) polyimide resin PMR-II-50, has been considered for high temperature and high stiffness space propulsion composites applications for its improved high temperature performance. As part of composite processing optimization, two commercial prepregging methods: solution vs. hot-melt processes were investigated with M40J fabrics from Toray. In a previous study a systematic chemical, physical, thermal and mechanical characterization of these composites indicated the poor resin-fiber interfacial wetting, especially for the hot-melt process, resulted in poor composite quality. In order to improve the interfacial wetting, optimization of the resin viscosity and process variables were attempted in a commercial hot-melt prepregging line. In addition to presenting the results from the prepreg quality optimization trials, the combined effects of the prepregging method and two different composite cure methods, i.e. hot press vs. autoclave on composite quality and properties are discussed.

Shin, E. Eugene↗

The promise of macromolecular crystallization in microfluidic chips

Microfluidics, or lab-on-a-chip technology, is proving to be a powerful, rapid, and efficient approach to a wide variety of bioanalytical and microscale biopreparative needs. The low materials consumption, combined with the potential for packing a large number of experiments in a few cubic centimeters, makes it an attractive technique for both initial screening and subsequent optimization of macromolecular crystallization conditions. Screening operations, which require a macromolecule solution with a standard set of premixed solutions, are relatively straightforward and have been successfully demonstrated in a microfluidics platform. Optimization methods, in which crystallization solutions are independently formulated from a range of stock solutions, are considerably more complex and have yet to be demonstrated. To be competitive with either approach, a microfluidics system must offer ease of operation, be able to maintain a sealed environment over several weeks to months, and give ready access for the observation and harvesting of crystals as they are grown.

Review↗

An optimal control of a rigid spinning satellite

An analytical solution is provided of a simple control problem. A rigid symmetric spinning satellite is considered and the optimal control torque vector is obtained. It is pointed out that optimal control can be obtained even with unequal torque magnitudes.

Das, A.↗

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗

A Comparative Study of Probability Collectives Based Multi-agent Systems and Genetic Algorithms

We compare Genetic Algorithms (GA's) with Probability Collectives (PC), a new framework for distributed optimization and control. In contrast to GA's, PC-based methods do not update populations of solutions. Instead they update an explicitly parameterized probability distribution p over the space of solutions. That updating of p arises as the optimization of a functional of p. The functional is chosen so that any p that optimizes it should be p peaked about good solutions. The PC approach works in both continuous and discrete problems. It does not suffer from the resolution limitation of the finite bit length encoding of parameters into GA alleles. It also has deep connections with both game theory and statistical physics. We review the PC approach using its motivation as the information theoretic formulation of bounded rationality for multi-agent systems. It is then compared with GA's on a diverse set of problems. To handle high dimensional surfaces, in the PC method investigated here p is restricted to a product distribution. Each distribution in that product is controlled by a separate agent. The test functions were selected for their difficulty using either traditional gradient descent or genetic algorithms. On those functions the PC-based approach significantly outperforms traditional GA's in both rate of descent, trapping in false minima, and long term optimization.

Huang, Chien-Feng↗

RLMolLM: Reinforcement Learning-Enhanced Language Model Framework for Inverse Molecular Design

Inverse molecular design faces significant challenges due to vast chemical space and complex property requirements. While language models show promise for molecular generation, they struggle with validity, multi-property optimization, and structural constraints. This work presents RLMolLM, a reinforcement learning framework combining Proximal Policy Optimization (PPO) with genetic algorithms to address these limitations. Our approach optimizes multiple user-specified properties including quantitative estimates of drug-likeness (QED), synthetic accessibility (SA), and ADMET (absorption, distribution, metabolism, excretion, and toxicity) endpoints without requiring complete model retraining, while maintaining capability for scaffold-constrained generation where specific substructures must be preserved. We outperform state-of-the-art methods for molecular optimization, achieving best QED scores across GDB13, Moses, and Zinc datasets with up to 31% improvement over previous methods while maintaining excellent validity, uniqueness, and novelty metrics. For simultaneous multi-property optimization, our framework achieves substantial improvements in ADMET properties including 4.5-fold reduction in hERG toxicity and enhanced Caco-2 permeability compared to Moses dataset. Under structural constraints, the framework significantly improves molecular validity while preserving scaffolds and effectively optimizing properties. In conclusion, this versatile solution advances pharmaceutical and materials molecular design through effective integration of reinforcement learning and genetic algorithms with multi-property optimization and scaffold preservation.

Genetic algorithms↗

Enhanced Power Grid Maintenance Planning and Quantum-Inspired Combinatorial Prospects

Efficient and reliable scheduling of maintenance for power generation and transmission infrastructure is essential for minimizing operational costs and ensuring grid stability. This paper introduces an integrated optimization framework for coordinated maintenance scheduling of generators and transmission lines under resource and reliability constraints. The model minimizes a composite cost function including maintenance and generation costs, as well as penalties for delayed maintenance, while satisfying N−1 security constraints, operational limits, and crew availability. Case studies on the IEEE 300-bus test system demonstrate the effectiveness of the proposed approach in producing feasible and cost-effective maintenance schedules. To address scalability and combinatorial complexity, the model is mapped into a Quadratic Unconstrained Binary Optimization (QUBO) problem, enabling exploration of solution approaches based on Quantum Imaginary Time Evolution (QITE). While the QUBO reformulation provides a foundation for future quantum-inspired optimization, this study focuses primarily on the development and demonstration of the classical optimization framework and illustrates the potential applicability of QITE in large-scale maintenance scheduling.

Chen, Yang [ORNL] (ORCID:0000000271693874)↗

Implicit Formulation of Muscle Dynamics in OpenSim

Astronauts lose bone and muscle mass during spaceflight. Exercise countermeasure is the primary method for counteracting bone and muscle mass loss in space. New spacecraft exercise device concepts are currently being developed for the NASAs new crew exploration vehicle. The NASA Digital Astronaut Project (DAP) uses computational modeling to help determine if the new exercise devices will be effective as countermeasures. The NASA Digital Astronaut Project is developing the ability to utilize predictive simulation to provide insight into the change in kinematics and kinetics with a change in device and gravitational environment (1-g versus 0-g). For example, in space exercise the subject's body weight is applied in addition to the loads prescribed for musculoskeletal maintenance. How and where these loads are applied obviously directly impacts bone and tissue loads. Additionally, due to space vehicle structural requirements, exercise devices are often placed on vibration isolation systems. This changes the apparent impedance or stiffness of the device as seen by the user. Data collection under these conditions is often impractical and limited. Predictive modeling provides a means to have a virtual subject to test hypotheses. Predictive simulation provides a virtual subject for which we are able to perform studies such as sensitivity to device loading and vibration isolation without the need for laboratory kinematic or kinetic test data.Direct Collocation optimization provides an efficient means to perform task based optimization and predictive modeling. It is relatively straight forward to structure a physical exercise task in a Direct Collocation mathematical formulation: perform a motion such that you start at an initial pose, achieve a given amount of deflection i.e a squat, return to the initial pose, and minimize muscle activation cost. Direct Collocation is advantageous in that it does not require numerical integration to evaluate the objective function. Instead, the system dynamics are transformed to discrete time and the optimizer is constrained such that the solution is not considered to be a valid unless the dynamic equations are satisfied at all time points. The simulation and optimization are effectively done simultaneously. Due to the implicit integration, time steps can be more coarse than in a differential equation solver. In a gait scenario this means that that the model constraints and cost function are evaluated at 100 nodes in the gait cycle versus 10,000 integration steps in a variable-step forward dynamic simulation. Furthermore, no time is wasted on accurate simulations of movements that are far from the optimum. Constrained optimization algorithms require a Jacobian matrix that contains the partial derivatives of each of the dynamic constraints with respect to of each of the state and control variables at all time points. This is a large but sparse matrix. An implicit dynamics formulation requires computation of the dynamic residuals f as a function of the states x and their derivatives, and controls u:f(x, dxdt, u) 0If the dynamics of musculoskeletal system are formulated implicitly, the Jacobian elements are often available analytically, eliminating the need for numerical differentiation; this is obviously computationally advantageous. Additionally, implicit formulation of musculoskeletal dynamics do not suffer from singularities from low mass bodies, zero muscle activation, or other stiff system or

physical exercise↗

Constrained Burn Optimization for the International Space Station

In long-term trajectory planning for the International Space Station (ISS), translational burns are currently targeted sequentially to meet the immediate trajectory constraints, rather than simultaneously to meet all constraints, do not employ gradient-based search techniques, and are not optimized for a minimum total deltav (v) solution. An analytic formulation of the constraint gradients is developed and used in an optimization solver to overcome these obstacles. Two trajectory examples are explored, highlighting the advantage of the proposed method over the current approach, as well as the potential v and propellant savings in the event of propellant shortages.

Brown, Aaron J.↗

Active learning using hybrid surrogate tool life modeling for machining process optimization

Here, this paper describes an active learning approach for part-to-part iterative machining process optimization using a hybrid surrogate tool life model. A probabilistic interpolating tool life model is developed by combining the empirical Taylor-type tool life equation and the model fit error. The probabilistic tool life model is then used to calculate the machining cost per part distribution. The optimal machining parameters are selected using an expected improvement in machining cost per part criterion. The method is validated numerically using experimental results; the results show a median convergence error of 2.2% after three tests over 400 simulations. The method is validated experimentally on two industrial applications for Ti-6Al-4V roughing resulting in a cost per part reduction greater than 23% after two tests. The described method is a robust solution for rapid convergence to optimal machining parameters in an industrial production environment.

Active learning↗

A Scalable and Robust Multi-Agent Approach to Distributed Optimization

Modularizing a large optimization problem so that the solutions to the subproblems provide a good overall solution is a challenging problem. In this paper we present a multi-agent approach to this problem based on aligning the agent objectives with the system objectives, obviating the need to impose external mechanisms to achieve collaboration among the agents. This approach naturally addresses scaling and robustness issues by ensuring that the agents do not rely on the reliable operation of other agents We test this approach in the difficult distributed optimization problem of imperfect device subset selection [Challet and Johnson, 2002]. In this problem, there are n devices, each of which has a "distortion", and the task is to find the subset of those n devices that minimizes the average distortion. Our results show that in large systems (1000 agents) the proposed approach provides improvements of over an order of magnitude over both traditional optimization methods and traditional multi-agent methods. Furthermore, the results show that even in extreme cases of agent failures (i.e., half the agents fail midway through the simulation) the system remains coordinated and still outperforms a failure-free and centralized optimization algorithm.

Tumer, Kagan↗

Design Optimization and Analysis of a Composite Honeycomb Intertank

Intertanks, the structure between tanks of launch vehicles, are prime candidates for weight reduction of rockets. This paper discusses the optimization and detailed analysis of a 96 in (2.44 m) diameter, 77 in (1.85 m) tall intertank. The structure has composite face sheets and an aluminum honeycomb core. The ends taper to a thick built up laminate for a double lap bolted shear joint. It is made in 8 full length panels joined with bonded double lap joints. The nominal load is 4000 lb/in (7 x 10(exp 5) N/m). Optimization is by Genetic Algorithm and minimizes weight by varying C, core thickness, number and orientation of acreage and buildup plies, and the size, number and spacing of bolts. A variety of cases were run with populations up to 2000 and chromosomes as long as 150 bits. Constraints were buckling, face stresses (normal, shear, wrinkling and dimpling, bolt stress, and bolt hole stresses (bearing, net tension, wedge splitting, shear out and tension/shear out). Analysis is by a combination of theoretical solutions and empirical data. After optimization, a series of coupon tests were performed in conjunction with a rigorous analysis involving a variety of finite element models. The analysis and test resulted in several small changes to the optimized design. The intertank has undergone a 250,000 lb (1.1 x 10(exp 6) N) limit load test and been mated with a composite liquid hydrogen tank. The tank/intertank unit is being installed in a test stand where it will see 200 thermal/load cycles. Afterwards the intertank will be demated and loaded in compression to failure.

Finckenor, Jeffrey↗

Design Optimization and Analysis of a Composite Honeycomb Intertank

Intertanks, the structure between tanks of launch vehicles, are prime candidates for weight reduction of rockets. This paper discusses the optimization and detailed follow up analysis and testing of a 96 in. diameter, 77 in. tall intertank. The structure has composite face sheets with an aluminum honeycomb core. The ends taper to a thick built up laminate for a double lap bolted splice joint interface. It is made in 8 full length panels joined with bonded double lap joints. The nominal load is 4000 lb/in. Optimization is by Genetic Algorithm and minimizes weight by varying core thickness, number and orientation of acreage and buildup plies, and the size, number and spacing of bolts. A variety of design cases were run with populations up to 2000 and chromosomes as long as 150 bits. Constraints were buckling; face stresses (normal, shear, wrinkling and dimpling); bolt stress; and bolt hole stresses (bearing, net tension, wedge splitting, shear out and tension/shear out). Analysis is by a combination of elasticity solutions and empirical data. After optimization, a series of coupon tests were performed in conjunction with a rigorous analysis involving a variety of finite element models. This analysis and testing resulted in several small changes to the optimized design. The equation used for hole bearing strength was found to be inadequate, resulting in thicker ends. The core thickness increased 0.05", and potting compound was added in the taper to strengthen the facesheet bond. The intertank has undergone a 250,000 lb limit load test and been mated with a composite liquid hydrogen tank. The tank/intertank unit is being installed in a test stand where it will see 200 thermal/load cycles. Afterwards the intertank will be demated and loaded in compression to failure.

Finckenor, Jeff↗

A Nonlinear Schur Complement Solver for CFD-Based Multidisciplinary Models

CFD-based multidisciplinary models are the fundamental building blocks of multidis- ciplinary design optimization frameworks. Linear and nonlinear solutions of these coupled models are difficult, especially when the Jacobian matrices represent a saddle point problem, where a block-diagonal corresponding to a discipline is non-invertible. These scenarios necessitate the use of a coupled solver algorithm such as the Newton’s method instead of the popular block Gauss– Seidel-based methods because of this non-invertible block. To address this challenge, we introduce a nonlinear Schur complement solver suitable for CFD-based multidisciplinary models. The solver leverages the specialized linear and nonlinear solvers of the CFD code, and therefore, does not require the solution of a large coupled linear system as the coupled Newton’s method. Further- more, because the solver primarily uses the specialized linear and nonlinear solvers of the CFD code, it does not suffer from the same robustness limitations as the coupled Newton’s method. In this work, we will implement this solver in NASA’s OpenMDAO framework and demonstrate its effectiveness using a CFD-based aeropropulsive model. The solver will contribute to the develop- ment of aeropropulsive design optimization and CFD-based design optimization methods with the ultimate goal of accelerating the design and integration of advanced propulsion systems.

Nonlinear Solvers↗

The Promise of Macromolecular Crystallization in Micro-fluidic Chips

Micro-fluidics, or lab on a chip technology, is proving to be a powerful, rapid, and efficient approach to a wide variety of bio-analytical and microscale bio-preparative needs. The low materials consumption, combined with the potential for packing a large number of experiments in a few cubic centimeters, makes it an attractive technique for both initial screening and subsequent optimization of macromolecular crystallization conditions. Screening operations, which require equilibrating macromolecule solution with a standard set of premixed solutions, are relatively straightforward and have been successfully demonstrated in a micro-fluidics platform. More complex optimization methods, where crystallization solutions are independently formulated from a range of stock solutions, are considerably more complex and have yet to be demonstrated. To be competitive with either approach, a micro-fluidics system must offer ease of operation, be able to maintain a sealed environment over several weeks to months, and give ready access for the observation of crystals as they are grown.

vanderWoerd, Mark↗

A simple approach to metal hydride alloy optimization

Certain metals and related alloys can combine with hydrogen in a reversible fashion, so that on being heated, they release a portion of the gas. Such materials may find application in the large scale storage of hydrogen. Metal and alloys which show high dissociation pressure at low temperatures, and low endothermic heat of dissociation, and are therefore desirable for hydrogen storage, give values of the Hildebrand-Scott solubility parameter that lie between 100-118 Hildebrands, (Ref. 1), close to that of dissociated hydrogen. All of the less practical storage systems give much lower values of the solubility parameter. By using the Hildebrand solubility parameter as a criterion, and applying the mixing rule to combinations of known alloys and solid solutions, correlations are made to optimize alloy compositions and maximize hydrogen storage capacity.

Lawson, D. D.↗