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 1,189 records · Page 66

The optimal control frequency response problem in manual control

An optimal control frequency response problem is defined within the context of the optimal pilot model. The problem is designed to specify pilot model control frequencies reflective of important aircraft system properties, such as control feel system dynamics, airframe dynamics, and gust environment, as well as man machine properties, such as task and attention allocation. This is accomplished by determining a bounded set of control frequencies which minimize the total control cost. The bounds are given by zero and the neuromuscular control frequency response for each control actuator. This approach is fully adaptive, i.e., does not depend upon user entered estimates. An algorithm is developed to solve this optimal control frequency response problem. The algorithm is then applied to an attitude hold task for a bare airframe fighter aircraft case with interesting dynamic properties.

Harrington, W. W.↗

Stress‐constrained topology optimization of structures subjected to nonproportional loading

Abstract This work considers the topology optimization of hyperelastic structures for maximum stiffness (minimum compliance) subject to constraints on their volume and maximum stress. In contrast to almost all previous works, we subject the structures to nonproportional loading, wherein the maximum stress does not necessarily occur at the final load step. As such, the stress is constrained at each load step. The augmented Lagrangian method is used to formulate the optimization problem with its many constraints. In numerical examples, we investigate different load trajectories for the same terminal load and compare the optimized designs and their performances. The results show the importance of considering the entire load trajectory as the load history significantly influences the optimized designs.

42 ENGINEERING↗

A unified funnel restoration SQP algorithm

We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of basic algorithmic ingredients that unifies a broad range of nonlinear optimization solvers. This framework has been implemented in the open-source solver Uno, a Swiss Army knife-like C++ optimization framework that unifies many nonlinearly constrained nonconvex optimization solvers. We illustrate the framework with a sequential quadratic programming (SQP) algorithm that maintains an acceptable upper bound on the constraint violation, called a funnel, that is monotonically decreased to control the feasibility of the iterates. Infeasible quadratic subproblems are handled by a feasibility restoration strategy. Globalization is controlled by a line search or a trust-region method. We prove global convergence of the trust-region funnel SQP method, building on known results from filter methods. We implement the algorithm in Uno, and we provide extensive test results for the trust-region line-search funnel SQP on small CUTEst instances.

Kiessling, David [Katholieke Univ. Leuven, Heverle↗

Invertible neural networks for real-time control of extrusion additive manufacturing

Material extrusion additive manufacturing (AM) has enabled an elegant fabrication pathway for a vast material library. Nonetheless, each material requires optimization of printing parameters generally determined through significant trial-and-error testing. To eliminate arduous, iteration-based optimization approaches, many researchers have used machine learning (ML) algorithms which provide opportunities for automated process optimization. Here, in this work, we demonstrate the use of an ML-driven approach for real-time material extrusion print-parameter optimization through in-situ monitoring of printed line geometry. To do this, we use deep invertible neural networks (INNs) which can solve both forward and inverse, or optimization, problems using a single network. By combining in-situ computer vision and deep INNs, the printing parameters can be autonomously optimized to print a target line width in 1.2 s. Furthermore, defects that occur during printing can be rapidly identified and corrected autonomously. The methods developed and presented in this work eliminate user-intensive, time-consuming, and iterative parameter discovery approaches that currently limit accelerated implementation of extrusion-based AM processes. Furthermore, the presented approach can be generalized to provide real-time monitoring and optimization pathways for increasingly complex AM environments.

36 MATERIALS SCIENCE↗

Comparison of multiobjective optimization methods for the $\mathrm{LCLS-II}$ photoinjector

Particle accelerators are among some of the largest science experiments in the world and can consist of thousands of components with a wide variety of input ranges. These systems can easily become unwieldy optimization problems during design and operations studies. Starting in the early 2000s, searching for better beam dynamics configurations became synonymous with heuristic optimization methods in the accelerator physics community. Genetic algorithms and particle swarm optimization are currently the most widely used. These algorithms can take thousands of simulation evaluations to find optimal solutions for one machine prototype. For large facilities such as the Linac Coherent Light Source (LCLS) and others, this equates to a limited exploration of many possible design configurations. In this paper, the LCLS-II photoinjector is optimized with three optimization algorithms. All optimizations were started from both a uniform random and Latin hypercube sample. In all cases, the optimizations started from Latin hypercube samples outperformed optimizations started from uniform samples. All three algorithms were able to optimize the photoinjector, with the model-based methods approximating the Pareto front in fewer simulation evaluations. This work, in combination with previous optimization observations, indicates objective penalties have a strong impact on the efficiency of such methods. In general, we recommend heuristic methods for initial optimizations and model-based methods when information about the objective space is available.

43 PARTICLE ACCELERATORS↗

Methodology for optimizing composite towers for use on floating wind turbines

In this work, a methodology for the design and optimization of a composite wind turbine tower for use on a floating offshore platform is presented. A composite turbine tower on a floating offshore platform not only has the potential to reduce maintenance and upkeep costs associated with the use of steel offshore but also has potential to reduce the tower mass and subsequently the support platform mass. The optimization problem is formulated to obtain a turbine tower that meets all strength and serviceability criteria and minimizes the tower mass. The optimization and design process link a number of dynamic analyses and finite element routines using a genetic algorithm. This work documents the optimization and design software and illustrates its use in various case studies for a 6 MW floating wind turbine system. Case studies include the optimization of a steel tower as a comparison to a composite material tower and the use of a cored, sandwich panel composite tower versus a solid composite tower. The results demonstrate that significant reductions in the tower mass are likely when comparing a steel tower with a composite tower. Also demonstrated for the platform and turbine configuration considered in this work is that the minimum mass tower design is driven towards a solid shell composite configuration, rather than a sandwich panel tower shell, in the face of reasonable design constraints.

17 WIND ENERGY↗

On the linear optimal digital servo problem

For linear time-invariant digital systems, convergence of the Riccati equation associated with the optimal servo problem is examined. Necessary and sufficient conditions are established for the existence of finite gains when the command input trajectories may fail to be asymptotically stable.

Armstrong, E. S.↗

Adaptive Multi-Agent Systems for Constrained Optimization

Product Distribution (PD) theory is a new framework for analyzing and controlling distributed systems. Here we demonstrate its use for distributed stochastic optimization. First we review one motivation of PD theory, as the information-theoretic extension of conventional full-rationality game theory to the case of bounded rational agents. In this extension the equilibrium of the game is the optimizer of a Lagrangian of the (probability distribution of) the joint state of the agents. When the game in question is a team game with constraints, that equilibrium optimizes the expected value of the team game utility, subject to those constraints. The updating of the Lagrange parameters in the Lagrangian can be viewed as a form of automated annealing, that focuses the MAS more and more on the optimal pure strategy. This provides a simple way to map the solution of any constrained optimization problem onto the equilibrium of a Multi-Agent System (MAS). We present computer experiments involving both the Queen s problem and K-SAT validating the predictions of PD theory and its use for off-the-shelf distributed adaptive optimization.

Macready, William↗

Genetic Algorithm for Optimization: Preprocessing with n Dimensional Bisection and Error Estimation

A knowledge of the appropriate values of the parameters of a genetic algorithm (GA) such as the population size, the shrunk search space containing the solution, crossover and mutation probabilities is not available a priori for a general optimization problem. Recommended here is a polynomial-time preprocessing scheme that includes an n-dimensional bisection and that determines the foregoing parameters before deciding upon an appropriate GA for all problems of similar nature and type. Such a preprocessing is not only fast but also enables us to get the global optimal solution and its reasonably narrow error bounds with a high degree of confidence.

Sen, S. K.↗

Sizing and Layout Design of an Aeroelastic Wingbox Through Nested Optimization

The goals of this work are to 1) develop an optimization algorithm that can simultaneously handle a large number of sizing variables and topological layout variables for an aeroelastic wingbox optimization problem and 2) utilize this algorithm to ascertain the benefits of curvilinear wingbox components. The algorithm used here is a nested optimization, where the outer level optimizes the rib and skin stiffener layouts with a surrogate-based optimizer, and the inner level sizes all of the components via gradient-based optimization. Two optimizations are performed: one restricted to straight rib and stiffener components only, the other allowing curved members. A moderate 1.18% structural mass reduction is obtained through the use of curvilinear members.

Stanford, Bret K.↗

Multi-objective optimization of a PCHE-type intermediate heat exchanger using genetic algorithms

For the advanced nuclear reactor systems and power conversion units, it is important to optimize the design of intermediate heat exchangers (IHXs) which transfer heat from the primary loop to the secondary or intermediate loop. For a multi-objective optimization problem, a printed circuit heat exchanger-type IHX with zigzag and S-shaped fin channels is selected to be optimized in terms of both the total cost and the heat exchanger thermal effectiveness using genetic algorithms. A computer code is developed to search a set of optimized designs of the zigzag channel geometry. It is found that among the Pareto-optimal solutions, the total cost is approximately linearly related to the thermal effectiveness between 88 and 95% while it rises rapidly after the effectiveness exceeds 95%. An optimal flow channel diameter is also determined through the optimization. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Image processing and reconstruction [Slides]

This talk will examine some mathematical methods for image processing and the solution of underdetermined, linear inverse problems. The talk will have a tutorial flavor, mostly accessible to undergraduates, while still presenting research results. The primary approach is the use of optimization problems. We will find that relaxing the usual assumption of convexity will give us much better results.

97 MATHEMATICS AND COMPUTING↗

First-Order Frameworks for Managing Models in Engineering Optimization

Approximation/model management optimization (AMMO) is a rigorous methodology for attaining solutions of high-fidelity optimization problems with minimal expense in high- fidelity function and derivative evaluation. First-order AMMO frameworks allow for a wide variety of models and underlying optimization algorithms. Recent demonstrations with aerodynamic optimization achieved three-fold savings in terms of high- fidelity function and derivative evaluation in the case of variable-resolution models and five-fold savings in the case of variable-fidelity physics models. The savings are problem dependent but certain trends are beginning to emerge. We give an overview of the first-order frameworks, current computational results, and an idea of the scope of the first-order framework applicability.

Alexandrov, Natlia M.↗

A data-driven sensor placement approach for detecting voltage violations in distribution systems

Stochastic fluctuations in power injections from distributed energy resources (DERs) combined with load variability can cause constraint violations (e.g., exceeded voltage limits) in electric distribution systems. To monitor grid operations, sensors are placed to measure important quantities such as the voltage magnitudes. Here, in this paper, we consider a sensor placement problem which seeks to identify locations for installing sensors that can capture all possible violations of voltage magnitude limits. We formulate a bilevel optimization problem that minimizes the number of sensors and avoids false sensor alarms in the upper level while ensuring detection of any voltage violations in the lower level. This problem is challenging due to the nonlinearity of the power flow equations and the presence of binary variables. Accordingly, we employ recently developed conservative linear approximations of the power flow equations that overestimate or underestimate the voltage magnitudes. By replacing the nonlinear power flow equations with conservative linear approximations, we can ensure that the resulting sensor locations and thresholds are sufficient to identify any constraint violations. Additionally, we apply various problem reformulations to significantly improve computational tractability while simultaneously ensuring an appropriate placement of sensors. Lastly, we improve the quality of the results via an approximate gradient descent method that adjusts the sensor thresholds. We demonstrate the effectiveness of our proposed method for several test cases, including a system with multiple switching configurations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Multi-objective design of microvascular panels for battery cooling applications

Building on a recently developed optimization method based on an interface-enriched generalized finite element method, multiple objective functions are considered for the optimization of 2D networks of microchannels embedded in battery-cooling panels. The objective functions considered in this study are a differentiable alternative to the maximum temperature (the p-mean of the temperature), the pressure drop and the variance of the temperature. The -constraint method and the normalized normal constraint method are used to generate the pressure-temperature Pareto optimal front of the multi-objective optimization problem. The effects of different operating constraints/conditions such as localization of heat sources, prescribed pump power and imposed flow rate on the optimal designs are investigated. In addition to the topology of the embedded network, the cross sections of the microchannels are also introduced as design parameters to further improve the pressure drop of the designs. The resulting variable-cross-section optimized design is validated with experiment.

energy storage (including batteries and capacitors↗

An Uncertainty Management Framework for Integrated Gas-Electric Energy Systems

In many parts of the world, electric power systems have seen a significant shift toward generation from renewable energy and natural gas. Because of their ability to flexibly adjust power generation in real time, gas-fired power plants are frequently seen as the perfect partner for variable renewable generation. However, this reliance on gas generation increases interdependence and propagates uncertainty between power grids and gas pipelines and brings coordination and uncertainty management challenges. To address these issues, we propose an uncertainty management framework for uncertain, but bounded gas consumption by gas-fired power plants. The admissible ranges are computed based on a joint optimization problem for the combined gas and electricity networks, which involves chance-constrained scheduling for the electric grid and a novel robust optimization formulation for the natural-gas network. This formulation ensures feasibility of the integrated system with a high probability, while providing a tractable numerical formulation. A key advance with respect to existing methods is that our method is based on a physically accurate, validated model for transient gas pipeline flows. Our case study benchmarks our proposed formulation against methods that ignore how reserve activation impacts the fuel use of gas power plants and only consider predetermined gas consumption. Here, the results demonstrate the importance of considering uncertainty to avoid operating constraint violations and curtailment of gas to the generators.

24 POWER TRANSMISSION AND DISTRIBUTION↗

SU-F-BRD-13: Quantum Annealing Applied to IMRT Beamlet Intensity Optimization

Purpose: We report on the first application of quantum annealing (QA) to the process of beamlet intensity optimization for IMRT. QA is a new technology, which employs novel hardware and software techniques to address various discrete optimization problems in many fields. Methods: We apply the D-Wave Inc. proprietary hardware, which natively exploits quantum mechanical effects for improved optimization. The new QA algorithm, running on this hardware, is most similar to simulated annealing, but relies on natural processes to directly minimize the free energy of a system. A simple quantum system is slowly evolved into a classical system, representing the objective function. To apply QA to IMRT-type optimization, two prostate cases were considered. A reduced number of beamlets were employed, due to the current QA hardware limitation of ∼500 binary variables. The beamlet dose matrices were computed using CERR, and an objective function was defined based on typical clinical constraints, including dose-volume objectives. The objective function was discretized, and the QA method was compared to two standard optimization Methods: simulated annealing and Tabu search, run on a conventional computing cluster. Results: Based on several runs, the average final objective function value achieved by the QA was 16.9 for the first patient, compared with 10.0 for Tabu and 6.7 for the SA. For the second patient, the values were 70.7 for the QA, 120.0 for Tabu, and 22.9 for the SA. The QA algorithm required 27–38% of the time required by the other two methods. Conclusion: In terms of objective function value, the QA performance was similar to Tabu but less effective than the SA. However, its speed was 3–4 times faster than the other two methods. This initial experiment suggests that QA-based heuristics may offer significant speedup over conventional clinical optimization methods, as quantum annealing hardware scales to larger sizes.

07 ISOTOPE AND RADIATION SOURCES↗

Coordinated Platoon Routing in a Metropolitan Network

Platooning vehicles—connected and automated vehicles traveling with small intervehicle distances—use less fuel because of reduced aerodynamic drag. Given a network de- fined by vertex and edge sets and a set of vehicles with origin/destination nodes/times, we model and solve the combinatorial optimization problem of coordinated routing of vehicles in a manner that routes them to their destination on time while using the least amount of fuel. Common approaches decompose the platoon coordination and vehicle routing into separate problems. Our model addresses both problems simultaneously to obtain the best solution. We use modern modeling techniques and constraints implied from analyzing the platoon routing problem to address larger numbers of vehicles and larger networks than previously considered. While the numerical method used is unable to certify optimality for candidate solutions to all networks and parameters considered, we obtain excellent solutions in approximately one minute for much larger networks and vehicle sets than previously considered in the literature.

Larson, Jeffrey↗