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 289 records · Page 16

Mesh Deformation Boundary Conditions for Three-Dimensional Ablation Solvers

A method for determining boundary node displacements for three-dimensional ablation solvers is developed. The approach is applicable to a wide range of mesh motion algorithms used to determine internal node displacements. The method leverages radial basis functions to analytically define the geometry to which the boundary nodes should be constrained. Constrained optimization, elasticity, and spring analogy solvers are utilized to redistribute the nodes on the evolved geometry surface while maintaining mesh quality. The method is implemented in the CHarring Ablator Response (CHAR) code, and a realistic demonstration case is presented on the Boundary Layer Transition (BOLT) flight experiment configuration. The method is shown to be robust for highly-curved geometries with large domain deformations.

Adam J Amar↗

Dynamically Learning Incentives for Load Control

As electrical generation becomes more distributed and volatile, and loads become more uncertain, controllability of distributed energy resources (DERs), regardless of their ownership status, will be necessary for grid reliability. Grid operators lack direct control over end-users' grid interactions, such as energy usage, but incentives can influence behavior -- for example, an end-user that receives a grid-driven incentive may adjust their consumption or expose relevant control variables in response. A key challenge in studying such incentives is the lack of data about human behavior, which usually motivates strong assumptions, such as distributional assumptions on compliance or rational utility-maximization. In this paper, we propose a general incentive mechanism in the form of a constrained optimization problem -- our approach is distinguished from prior work by modeling human behavior (e.g., reactions to an incentive) as an arbitrary unknown function. We propose feedback-based optimization algorithms to solve this problem that each leverage different amounts of information and/or measurements. We show that each converges to an asymptotically stable incentive with (near)-optimality guarantees given mild assumptions on the problem. Finally, we evaluate our proposed techniques in voltage regulation simulations on standard test beds. We test a variety of settings, including those that break assumptions required for theoretical convergence (e.g., convexity, smoothness) to capture realistic settings. In this evaluation, our proposed algorithms are able to find near-optimal incentives even when the reaction to an incentive is modeled by a theoretically difficult (yet realistic) function.

demand response↗

Optimization of Stability Constrained Geometrically Nonlinear Shallow Trusses Using an Arc Length Sparse Method with a Strain Energy Density Approach

A technique for the optimization of stability constrained geometrically nonlinear shallow trusses with snap through behavior is demonstrated using the arc length method and a strain energy density approach within a discrete finite element formulation. The optimization method uses an iterative scheme that evaluates the design variables' performance and then updates them according to a recursive formula controlled by the arc length method. A minimum weight design is achieved when a uniform nonlinear strain energy density is found in all members. This minimal condition places the design load just below the critical limit load causing snap through of the structure. The optimization scheme is programmed into a nonlinear finite element algorithm to find the large strain energy at critical limit loads. Examples of highly nonlinear trusses found in literature are presented to verify the method.

Hrinda, Glenn A.↗

Thermally-Constrained Fuel-Optimal ISS Maneuvers

Optimal Propellant Maneuvers (OPMs) are now being used to rotate the International Space Station (ISS) and have saved hundreds of kilograms of propellant over the last two years. The savings are achieved by commanding the ISS to follow a pre-planned attitude trajectory optimized to take advantage of environmental torques. The trajectory is obtained by solving an optimal control problem. Prior to use on orbit, OPM trajectories are screened to ensure a static sun vector (SSV) does not occur during the maneuver. The SSV is an indicator that the ISS hardware temperatures may exceed thermal limits, causing damage to the components. In this paper, thermally-constrained fuel-optimal trajectories are presented that avoid an SSV and can be used throughout the year while still reducing propellant consumption significantly.

Bhatt, Sagar↗

A Study of Penalty Function Methods for Constraint Handling with Genetic Algorithm

COMETBOARDS (Comparative Evaluation Testbed of Optimization and Analysis Routines for Design of Structures) is a design optimization test bed that can evaluate the performance of several different optimization algorithms. A few of these optimization algorithms are the sequence of unconstrained minimization techniques (SUMT), sequential linear programming (SLP) and the sequential quadratic programming techniques (SQP). A genetic algorithm (GA) is a search technique that is based on the principles of natural selection or "survival of the fittest". Instead of using gradient information, the GA uses the objective function directly in the search. The GA searches the solution space by maintaining a population of potential solutions. Then, using evolving operations such as recombination, mutation and selection, the GA creates successive generations of solutions that will evolve and take on the positive characteristics of their parents and thus gradually approach optimal or near-optimal solutions. By using the objective function directly in the search, genetic algorithms can be effectively applied in non-convex, highly nonlinear, complex problems. The genetic algorithm is not guaranteed to find the global optimum, but it is less likely to get trapped at a local optimum than traditional gradient-based search methods when the objective function is not smooth and generally well behaved. The purpose of this research is to assist in the integration of genetic algorithm (GA) into COMETBOARDS. COMETBOARDS cast the design of structures as a constrained nonlinear optimization problem. One method used to solve constrained optimization problem with a GA to convert the constrained optimization problem into an unconstrained optimization problem by developing a penalty function that penalizes infeasible solutions. There have been several suggested penalty function in the literature each with there own strengths and weaknesses. A statistical analysis of some suggested penalty functions is performed in this study. Also, a response surface approach to robust design is used to develop a new penalty function approach. This new penalty function approach is then compared with the other existing penalty functions.

Ortiz, Francisco↗

Exploring Multidimensional Spatial-Temporal Hydropower Operational Flexibilities by Modeling and Optimizing Water-Constrained Cascading Hydroelectric Systems

Because of unique characteristics such as clean and cost-competitive electricity as well as fast-ramping and storage abilities, the power industry continues to evolve its operation strategies for cascading hydroelectric (CHE) systems for providing enhanced values to the grid, especially under the deeper renewable resource integration. However, existing operation practices of CHEs predate the integration of renewables, which could prohibit the effective utilization of their inherent flexibilities in delivering maximum financial benefits and providing valuable grid services to the power system and electricity market operations. Indeed, modeling and optimizing these resource-limited while flexible CHE assets with uncertainties and imperfect information across multiple spatial-temporal dimensions present significant challenges. To facilitate CHE facility operators in effectively coordinating water usage and hydropower plant operations across multiple timescales, this project aims to fill the existing gaps by developing a suite of accurate water inflow (WI) forecast models as well as enhanced CHE modeling and optimization approaches with proper consideration of their unique characteristics, which would help explore their multidimensional spatial-temporal operational flexibility potentials. The developed approaches could better align reservoir operation strategies with variability and uncertainty of future water availability. They can also promote more effective utilization of multidimensional spatial-temporal hydropower operational flexibility potentials by designing long-term evacuation plans of reservoirs and short-term operation of CHEs, along with their coordination with other types of renewables. The project leverages various resources to facilitate the research and development activities, including actual characteristics data of CHE systems and a library of current and future cases of Portland General Electric (PGE). These realistic data enable the project team to study how to maximize the value of CHEs under current and future portfolios and evaluate opportunities to improve operation practices.

13 HYDRO ENERGY↗

Constrained fatigue life optimization of a NASVYTIS multiroller traction drive

A contact fatigue life analysis method for multiroller traction drives is presented. The method is based on the Lundberg-Palmgren analysis method for rolling element bearing life prediction, and also uses life adjustment factors for materials, processing, lubrication, and effect of traction. The analysis method is applied in an optimization study to the multiroller traction drive, consisting of a single-stage planetary configuration with two rows of stepped planet rollers of five rollers per row. The drive was approximately 25 centimeters in diameter by 11 centimeters long, having a nominal ratio of 15:1. The theoretically predicted drive life was 2510 hours at a nominal continuous power and speed of 74.6 kW (100 hp) and 75,000 rpm.

Coy, J. J.↗

Single step optimization strategies for constrained retargeting maneuvers

The present consideration of recent advancements in the nonlinear guidance of spacecraft, using feedback linearization and decoupling to generate exact nominal commands, gives attention to the correction of saturation effects and oscillation prevention in saturated operating regimes. In the case of spacecraft maneuvered by momentum-transfer devices, real time command generation is possible by means of pointwise minimization of the sum of the squares of the norms of the 'next state error' for the equivalent system and the linear system input. It is also possible to track a nominal trajectory, such as a critically damped harmonic oscillator response, by minimizing the square of the norm of the error between the actual and the tracked states.

Dwyer, T. A. W., III↗

Interactive method for planning constrained, fuel-optimal orbital proximity operations

An interactive graphical method for planning fuel-efficient rendezvous trajectories in the multi-spacecraft environment of the space station is presented. The method allows the operator to compose a multi-burn transfer trajectory between arbitrary initial chaser and target trajectories. The available task time of the mission is limited and the maneuver is subject to various operational constraints, such as departure, arrival, plume impingement and spatial constraints. The maneuvers are described in terms of the relataive motion experienced in a Space-Station centered coordinate system. The optimization method is based on the primer vector and its extension to non-optimal trajectories. The visual feedback of trajectory shapes, operational constraints, and optimization functions, provided by user-transparaent and continuously active background computations, allows the operator to make fast, iterative design changes which rapidly converge to fuel-efficient solutions. The optimization functions are presented. A variety of simple design examples has been presented to demonstrate the usefulness of the method. In many cases the addition of a properly positioned intermediate waypoint resulted in fuel savings of up to 30%. Furthermore, due to the counter-intuitive character of the optimization functions, most fuel-optimal solutions could not have been found without the aid of the optimization tools. Operating the system was found to be very easy, and did not require any previous in-depth knowledge of orbital dynamics or trajectory. The planning tool is an example of operator assisted optimization of nonlinear cost-functions.

Abramovitz, Adrian↗

Constrained Aeroacoustic Shape Optimization Using the Surrogate Management Framework

Reduction of noise generated by turbulent flow past the trailing-edge of a lifting surface is a challenge in many aeronautical and naval applications. Numerical predictions of trailing-edge noise necessitate the use of advanced simulation techniques such as large-eddy simulation (LES) in order to capture a wide range of turbulence scales which are the source of broadband noise. Aeroacoustic calculations of the flow over a model airfoil trailing edge using LES and aeroacoustic theory have been presented in Wang and Moin and were shown to agree favorably with experiments. The goal of the present work is to apply shape optimization to the trailing edge flow previously studied, in order to control aerodynamic noise.

Marsden, Alison L.↗

Risk-Constrained Dynamic Programming for Optimal Mars Entry, Descent, and Landing

A chance-constrained dynamic programming algorithm was developed that is capable of making optimal sequential decisions within a user-specified risk bound. This work handles stochastic uncertainties over multiple stages in the CEMAT (Combined EDL-Mobility Analyses Tool) framework. It was demonstrated by a simulation of Mars entry, descent, and landing (EDL) using real landscape data obtained from the Mars Reconnaissance Orbiter. Although standard dynamic programming (DP) provides a general framework for optimal sequential decisionmaking under uncertainty, it typically achieves risk aversion by imposing an arbitrary penalty on failure states. Such a penalty-based approach cannot explicitly bound the probability of mission failure. A key idea behind the new approach is called risk allocation, which decomposes a joint chance constraint into a set of individual chance constraints and distributes risk over them. The joint chance constraint was reformulated into a constraint on an expectation over a sum of an indicator function, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the chance-constraint optimization problem can be turned into an unconstrained optimization over a Lagrangian, which can be solved efficiently using a standard DP approach.

Ono, Masahiro↗

Advanced Method Optimization with Categorical and Constrained Continuous Parameters

Traditional approaches to analytical method optimization (e.g., univariate and “guess-and-check”) can be time-consuming, costly, and often fail to identify true optima within the parameter space. Previous work defined and implemented a generalized technique for method optimization for continuous method parameters, but a knowledge gap remains for the incorporation of categorical variables into these advanced method optimization schemes. This work presents and validates a generalized optimization approach that incorporates both continuous and categorical variables while also utilizing a multivariate, multiobjective optimization scheme with Karush–Kuhn–Tucker conditions to bound the optimization space to solutions within the physical limitations of the parameter space. Method optimization from a case study using GC–MS for the analysis of 11 analytical standards with objectives to minimize peak width and maximize peak height resulted in a 3 orders of magnitude improvement in the average peak height and a 2 orders of magnitude improvement in the average peak width compared to the least optimal (but reasonable) instrumental parameters utilized in this study. This approach to optimization allows for a customizable method optimization in which users can include both continuous and categorical variables to achieve objectives specific to their analytical goals. This approach significantly reduces the labor and cost associated with traditional method development approaches and can be applied in a variety of scientific fields across a range of laboratory techniques (e.g., instrument method development, sample preparation, and extraction techniques).

Amorphous materials↗

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↗

Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

We developed framework and the mathematical formulation for optimizing communication network using mixed integer programming. The design yields a system that is much smaller, in search space size, when compared to the earlier approach. Our constrained network optimization takes into account the dynamics of link performance within the network along with mission and operation requirements. A unique penalty function is introduced to transform the mixed integer programming into the more manageable problem of searching in a continuous space. The constrained optimization problem was proposed to solve in two stages: first using the heuristic Particle Swarming Optimization algorithm to get a good initial starting point, and then feeding the result into the Sequential Quadratic Programming algorithm to achieve the final optimal schedule. We demonstrate the above planning and scheduling methodology with a scenario of 20 spacecraft and 3 ground stations of a Deep Space Network site. Our approach and framework have been simple and flexible so that problems with larger number of constraints and network can be easily adapted and solved.

Mixed Integer Programming↗

Minimal complexity control law synthesis

A paradigm for control law design for modern engineering systems is proposed: Minimize control law complexity subject to the achievement of a specified accuracy in the face of a specified level of uncertainty. Correspondingly, the overall goal is to make progress towards the development of a control law design methodology which supports this paradigm. Researchers achieve this goal by developing a general theory of optimal constrained-structure dynamic output feedback compensation, where here constrained-structure means that the dynamic-structure (e.g., dynamic order, pole locations, zero locations, etc.) of the output feedback compensation is constrained in some way. By applying this theory in an innovative fashion, where here the indicated iteration occurs over the choice of the compensator dynamic-structure, the paradigm stated above can, in principle, be realized. The optimal constrained-structure dynamic output feedback problem is formulated in general terms. An elegant method for reducing optimal constrained-structure dynamic output feedback problems to optimal static output feedback problems is then developed. This reduction procedure makes use of star products, linear fractional transformations, and linear fractional decompositions, and yields as a byproduct a complete characterization of the class of optimal constrained-structure dynamic output feedback problems which can be reduced to optimal static output feedback problems. Issues such as operational/physical constraints, operating-point variations, and processor throughput/memory limitations are considered, and it is shown how anti-windup/bumpless transfer, gain-scheduling, and digital processor implementation can be facilitated by constraining the controller dynamic-structure in an appropriate fashion.

Bernstein, Dennis S.↗