Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization problems”

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 523 records · Page 29

A Higher Harmonic Optimal Controller to Optimise Rotorcraft Aeromechanical Behaviour

Three methods to optimize rotorcraft aeromechanical behavior for those cases where the rotorcraft plant can be adequately represented by a linear model system matrix were identified and implemented in a stand-alone code. These methods determine the optimal control vector which minimizes the vibration metric subject to constraints at discrete time points, and differ from the commonly used non-optimal constraint penalty methods such as those employed by conventional controllers in that the constraints are handled as actual constraints to an optimization problem rather than as just additional terms in the performance index. The first method is to use a Non-linear Programming algorithm to solve the problem directly. The second method is to solve the full set of non-linear equations which define the necessary conditions for optimality. The third method is to solve each of the possible reduced sets of equations defining the necessary conditions for optimality when the constraints are pre-selected to be either active or inactive, and then to simply select the best solution. The effects of maneuvers and aeroelasticity on the systems matrix are modelled by using a pseudo-random pseudo-row-dependency scheme to define the systems matrix. Cases run to date indicate that the first method of solution is reliable, robust, and easiest to use, and that it was superior to the conventional controllers which were considered.

Leyland, Jane Anne↗

Reduced Uncertainties in the Flutter Analysis of the Aerostructures Test Wing

Tuning the finite element model using measured data to minimize the model uncertainties is a challenging task in the area of structural dynamics. A test validated finite element model can provide a reliable flutter analysis to define the flutter placard speed to which the aircraft can be flown prior to flight flutter testing. Minimizing the difference between numerical and experimental results is a type of optimization problem. Through the use of the National Aeronautics and Space Administration Dryden Flight Research Center's (Edwards, California) multidisciplinary design, analysis, and optimization tool to optimize the objective function and constraints; the mass properties, the natural frequencies, and the mode shapes are matched to the target data, and the mass matrix orthogonality is retained. The approach in this study has been applied to minimize the model uncertainties for the structural dynamic model of the aerostructures test wing, which was designed, built, and tested at the National Aeronautics and Space Administration Dryden Flight Research Center. A 25 percent change in flutter speed has been shown after reducing the uncertainties.

Pak, Chan-Gi↗

Urine sampling and collection system optimization and testing

A Urine Sampling and Collection System (USCS) engineering model was developed to provide for the automatic collection, volume sensing and sampling of urine from each micturition. The purpose of the engineering model was to demonstrate verification of the system concept. The objective of the optimization and testing program was to update the engineering model, to provide additional performance features and to conduct system testing to determine operational problems. Optimization tasks were defined as modifications to minimize system fluid residual and addition of thermoelectric cooling.

Fogal, G. L.↗

Modified SUMT for structural synthesis

The concepts of the singular perturbation theory are employed to modify the SUMT (Sequential Unconstrained Minimization Technique) algorithm of Fiacco-McCormick (1968) in order to make it more robust and reliable. The algorithm, which uses a sequence of penalty parameters to convert a constrained problem into a sequence of unconstrained problems, suffers from the need to minimize an ill-conditioned penalty function. By using the modified SUMT algorithm on two different structural optimization problems, it is shown that the singular perturbation SUMT easily converges to accurate solutions.

Kamat, M. P.↗

Reduced Uncertainties in the Flutter Analysis of the Aerostructures Test Wing

Tuning the finite element model using measured data to minimize the model uncertainties is a challenging task in the area of structural dynamics. A test validated finite element model can provide a reliable flutter analysis to define the flutter placard speed to which the aircraft can be flown prior to flight flutter testing. Minimizing the difference between numerical and experimental results is a type of optimization problem. Through the use of the National Aeronautics and Space Administration Dryden Flight Research Center s (Edwards, California, USA) multidisciplinary design, analysis, and optimization tool to optimize the objective function and constraints; the mass properties, the natural frequencies, and the mode shapes are matched to the target data and the mass matrix orthogonality is retained. The approach in this study has been applied to minimize the model uncertainties for the structural dynamic model of the aerostructures test wing, which was designed, built, and tested at the National Aeronautics and Space Administration Dryden Flight Research Center. A 25-percent change in flutter speed has been shown after reducing the uncertainties

Pak, Chan-gi↗

Model Predictive Control in the Three-body Problem Using Invariant Funnels As Terminal Sets

This paper describes a method for augmenting Model Predictive Control techniques using invariant funnels computed in the Circular Restricted Three-Body Problem. We use ellipsoids that roughly approximate the boundary of the invariant funnel as convex terminal sets for a short look-ahead optimization problem at each time step. We apply this method to a hypothetical low-thrust mission to land on Jupiter’s mooon Europa and show that including the invariant funnels as terminal sets reduces the amount of control effort required by almost an order of magnitude.

Close, Sigrid↗

Application of A Dual-Quaternion Six Degree-of-Freedom Guidance to Human-Scale Mars Entry, Descent, and Landing

Landing humans on Mars comes with many challenges, including the execution of a safe and precise entry, descent, and landing (EDL) sequence. Various NASA studies have shown that there are a variety of EDL guidance methods that potentially offer solutions to the human-scale EDL precision landing problem and work is ongoing to assess new and novel methods. As part of these ongoing studies, a dual-quaternion-based six degree-of-freedom guidance algorithm was implemented in the Program to Optimize Simulated Trajectories II (POST2), a NASA-and industry-standard spacecraft trajectory and vehicle design tool. This algorithm considers both translational and rotational dynamics and casts the trajectory optimization problem as a quadratically constrained quadratic program (QCQP) with various constraints at discrete nodes throughout the trajectory. The QCQP problem is solved via an alternating direction method of multipliers (ADMM) approach, and the output is a discretized optimal trajectory. The guidance is applied to a NASA reference human-scale Mars EDL system, and results are compared and discussed.

Optimization↗

Application of A Dual-Quaternion Six Degree-of-Freedom Guidance to Human-Scale Mars Entry, Descent, and Landing

Landing humans on Mars comes with many challenges, including the execution of a safe and precise entry, descent, and landing (EDL) sequence. Various NASA studies have shown that there are a variety of EDL guidance methods that potentially offer solutions to the human-scale EDL precision landing problem and work is ongoing to assess new and novel methods. As part of these ongoing studies, a dual-quaternion-based six degree-of-freedom guidance algorithm was implemented in the Program to Optimize Simulated Trajectories II (POST2), a NASA-and industry-standard spacecraft trajectory and vehicle design tool. This algorithm considers both translational and rotational dynamics and casts the trajectory optimization problem as a quadratically constrained quadratic program (QCQP) with various constraints at discrete nodes throughout the trajectory. The QCQP problem is solved via an alternating direction method of multipliers (ADMM) approach, and the output is a discretized optimal trajectory. The guidance is applied to a NASA reference human-scale Mars EDL system, and results are compared and discussed.

Optimization↗

Guidance and flight control law development for hypersonic vehicles

During the third reporting period our efforts were focused on a reformulation of the optimal control problem involving active state-variable inequality constraints. In the reformulated problem the optimization is carried out not with respect to all controllers, but only with respect to asymptotic controllers leading to the state constraint boundary. Intimately connected with the traditional formulation is the fact that when the reduced solution for such problems lies on a state constraint boundary, the corresponding boundary layer transitions are of finite time in the stretched time scale. Thus, it has been impossible so far to apply the classical asymptotic boundary layer theory to such problems. Moreover, the traditional formulation leads to optimal controllers that are one-sided, that is, they break down when a disturbance throws the system on the prohibited side of the state constraint boundary.

Calise, A. J.↗

Investigation on the use of optimization techniques for helicopter airframe vibrations design studies

Results of the investigation of formal nonlinear programming-based numerical optimization techniques of helicopter airframe vibration reduction are summarized. The objective and constraint function and the sensitivity expressions used in the formulation of airframe vibration optimization problems are presented and discussed. Implementation of a new computational procedure based on MSC/NASTRAN and CONMIN in a computer program system called DYNOPT for optimizing airframes subject to strength, frequency, dynamic response, and dynamic stress constraints is described. An optimization methodology is proposed which is thought to provide a new way of applying formal optimization techniques during the various phases of the airframe design process. Numerical results obtained from the application of the DYNOPT optimization code to a helicopter airframe are discussed.

Sreekanta Murthy, T.↗

Mathematical Model of a Regenerative Fuel Cell for System Optimization

This thesis developed a system-level optimization model of a regenerative fuel cell (RFC) system for long-duration, off-world energy storage applications. Prior RFC design studies have typically been limited to reduced parameter sets and simplified constraints due to computational limitations relative to the number of relevant degrees of freedom. As a result, important nonlinear interactions between subsystems have not been fully captured. This work began to address that gap by developing a higher-fidelity, nonlinear optimization framework that incorporates a broader set of design variables and coupled constraints, enabling a multidimensional model that captures the coupled behavior of RFC subsystems and demonstrates the feasibility of applying optimization to such systems. An expanded system-level optimization approach was established that captures interactions between electrochemical performance, structural requirements, and storage design. This enabled a more comprehensive evaluation of trade-offs than conventional formulations. The model integrates four coupled subsystems: a fuel cell, an electrolyzer, reactant gas, and high-pressure storage tanks, and was formulated to accommodate a wide range of mission parameters, including operational time and required output power. It incorporates constraints on available solar array power, reactant mass balance between production and consumption, and pressure-dependent storage requirements. To enable reliable convergence, the optimization problem was reformulated to reduce dimensionality and improve numerical stability, with subsystem models organized for efficient evaluation. Problem dimensionality was reduced by consolidating lower-level design variables into higher-level representative quantities, and subsystem behavior was evaluated within the optimization loop. A multi-start initialization strategy was employed to mitigate sensitivity to local minima and improve solution quality, while nonlinear relationships were solved using robust numerical methods. The results showed that convergence was achieved across a range of required output power values. Specific energy reached a maximum at a critical mission power level, where the electrolyzer power matched the available solar input and operated near its voltage and current density limits. Beyond this point, further increases in required power resulted in less mass-efficient operation, increasing total system mass and reducing overall performance. The developed model represents an advancement in RFC system-level optimization by enabling analysis of a broader and more tightly coupled design space than previous considerations. While convergence behavior and computational cost remain challenges, the methods introduced improve solvability and allow inclusion of additional design variables with minimal loss of physical fidelity. However, the numerical results should not be interpreted as definitive design recommendations, as the model includes simplifying assumptions and omits several higher-order effects. Future work should extend this framework by incorporating additional subsystems and loss mechanisms, such as thermal management, parasitic power consumption, and reactant losses, to improve fidelity and ensure more representative design conclusions.

Electrochemistry↗

Genetic Evolution of Shape-Altering Programs for Supersonic Aerodynamics

Two constrained shape optimization problems relevant to aerodynamics are solved by genetic programming, in which a population of computer programs evolves automatically under pressure of fitness-driven reproduction and genetic crossover. Known optimal solutions are recovered using a small, naive set of elementary operations. Effectiveness is improved through use of automatically defined functions, especially when one of them is capable of a variable number of iterations, even though the test problems lack obvious exploitable regularities. An attempt at evolving new elementary operations was only partially successful.

Kennelly, Robert A., Jr.↗

Computationally Efficient Motion Planning Algorithms for Agile Autonomous Vehicles in Cluttered Environments

Fast, real-time motion planning of an agile, autonomous vehicle in a cluttered environment, with many geometrically-fixed obstacles, is a very complex problem, especially because of the vehicle dynamics constraints and resource constrained computational capabilities onboard the vehicle. In this paper, we present computationally-efficient versions of our novel motion planning algorithm called the Spherical Expansion and Sequential Convex Programming (SE–SCP) algorithm. The SE–SCP algorithm first uses a spherical-expansion-based randomized sampling algorithm to explore the workspace. Oncea path is found from the start position to the goal position, the algorithm computes a locally optimal trajectory, within its homotopy class for a desired cost function, by solving a sequence of convex optimization problems. Thus, the SE–SCP algorithm is anytime locally optimal and the trajectory is globally optimal if the number of samples tends to infinity. In this paper, we further enhance the computational efficiency of the SE–SCP algorithm using uni-directional and bi-directional rewiring techniques. We also present a detailed proof of the local optimality characteristics of the new SE–SCP algorithms for aspecial case of vehicle dynamics. Simulation examples involving quadrotor and spacecraft help demonstrate the effectiveness of our new algorithms.

Bandyopadhyay, Saptarshi↗

The computation of optimal control programmes using a modified successive sweep method.

A second-order method for numerically solving control optimization problems has been developed. The method, referred to as the modified sweep method (MSM), differs from the successive sweep method (SSM) proposed by McReynolds and Bryson (1965) in that the conditions for local control optimality are used to determine the control as an explicit function of the state variables and time. The control is eliminated from the problem and the solution to the resulting two-point boundary value problem can be obtained by linear perturbation methods. The modified sweep method proposed here uncouples the perturbation equations for the state variables and the Lagrange multipliers by using a generalized matrix-Riccati transformation of variables. The resulting algorithm for the numerical iteration process is concerned with determining the initial values of a set of Lagrange multipliers rather than correcting a numerical control programme over the entire time interval of interest.

Colunga, D.↗

Constrained optimization using design of experiment surfaces

An algorithm for solving constrained optimization problems is presented. First, design of experiment techniques are used to survey the design space. After evaluating the objective and constraint functions, as specified by Taguchi orthogonal arrays, analytical models of these functions are generated using a least-squares regression analysis. Next, a nonlinear programming package is used to optimize the analytical model. Based on the optimization information, the design space is reduced so as to close in around the minimum, and the entire procedure is repeated until convergence. An important feature of the algorithm is that function gradients are not required; therefore, for problems in which gradients would have to be estimated using finite-differences the number of function evaluations required for the optimization is significantly reduced, when compared with traditional nonlinear programming techniques. In addition, there is no requirement that the gradients must be smooth and continuous.

Bolt, Marvin Vance↗

Constant directions of the Riccati equation

A constant direction of the Riccati equation associated with a class of singular discrete-time optimization problems is defined. The set of constant directions is completely characterized using a control viewpoint. Constant directions are used to reduce the computational complexity of the optimal system. Application to optimal filtering in colored noise is given.

Rappaport, D.↗

Problem solving with genetic algorithms and Splicer

Genetic algorithms are highly parallel, adaptive search procedures (i.e., problem-solving methods) loosely based on the processes of population genetics and Darwinian survival of the fittest. Genetic algorithms have proven useful in domains where other optimization techniques perform poorly. The main purpose of the paper is to discuss a NASA-sponsored software development project to develop a general-purpose tool for using genetic algorithms. The tool, called Splicer, can be used to solve a wide variety of optimization problems and is currently available from NASA and COSMIC. This discussion is preceded by an introduction to basic genetic algorithm concepts and a discussion of genetic algorithm applications.

Bayer, Steven E.↗