Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimality”

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 775 records · Page 43
All sourcesNASA NTRSDOE OSTI
NASA NTRS2018

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.↗
NASA NTRS2015

Optimized Off-Design Performance of Flexible Wings with Continuous Trailing-Edge Flaps

This work assesses the potential aerodynamic performance benefits of a variable-camber, continuous-trailing-edge flap system on a generic transport aircraft at off-design conditions. A process to optimize transport wings while addressing static aeroelastic effects is presented. To establish a proper baseline, a transport wing is first aerodynamically optimized at a mid-cruise flight condition using an inviscid, aeroelastic analysis tool. The optimized wing is then analyzed at off-design cruise conditions. The optimization is repeated at these off-design conditions to determine how much performance is lost by the wing optimized solely for the mid-cruise condition. The full-span flap system is then adapted to improve performance of the mid-cruise-optimized wing at these off-design conditions. The measured improvement is quantified by a comparison with wings designed specifically for the off-design conditions. To evaluate the effects of aeroelasticity on the effectiveness of the flap system, this entire process is performed on both a conventionally stiff wing and a modern, more flexible wing. The results indicate that the flap system allows for recovery of near-optimal performance throughout cruise. The flap system is found to be advantageous even for modern wings with increased flexibility.

Rodriguez, David L.↗
NASA NTRS2015

Aerodynamic Shape Optimization Benchmarks with Error Control and Automatic Parameterization

Results are presented for four optimization benchmark problems posed by the AIAA Aerodynamic Design Optimization Discussion Group. The benchmarks are intended to exercise optimization frameworks on representative airfoil and wing design problems. All problems involve drag minimization subject to geometric and aerodynamic constraints. Our design approach involves two forms of adaptation. First, the shape parameterization is gradually and automatically enriched from an initially coarse search space. Second, adjoint solutions are used to drive adaptive mesh refinement to control discretization error. The error threshold is tailored so that the nest meshes, with the greatest accuracy, are used only when nearing the optimum. On the inviscid airfoil design problem, while reducing the drag by a factor of 10, we show how the combination of progressive parameterization and tiered discretization error control can dramatically accelerate the optimization. On the viscous airfoil design problem, we use inviscid analysis-driven optimization to reduce the total drag by a factor of two. Next, we improve the span efficiency factor of a wing by performing twist optimization. Finally, we optimize the Common Research Model wing, managing to hold drag roughly fixed, while targeting an initially-violated pitching moment constraint. Our approach aims to introduce greater complexity and accuracy only when necessary to improve the design, and also support a greater degree of automation.

Anderson, George R.↗
NASA NTRS2019

High-Fidelity Multidisciplinary Sensitivity Analysis Framework for Multipoint Rotorcraft Optimization

A multidisciplinary, gradient-based sensitivity-analysis methodology is evaluated for optimization of rotorcraft configurations. The tightly coupled discipline models include physics-based fluid dynamics and rotorcraft comprehensive analysis. A discretely-consistent adjoint method accounts for sensitivities of the unsteady flow and unstructured, dynamic, over set grids, while sensitivities of structural responses to aerodynamic loads are computed using a complex-variable method. The methodology is applied to optimize the shape of UH-60A Blackhawk helicopter blades for hover and forward flight conditions. The objective of the multipoint design is to simultaneously increase the rotorcraft figure of merit in a hover flight and reduce the rotor power in a forward flight. Trimmed loose-coupling solutions for the baseline configuration are used to initiate the tight-coupling multidisciplinary analysis. Target thrust and rolling and pitching moments are enforced as optimization constraints. The optimized configuration improves the optimization metrics at both design points. The improved performance and all constraints are maintained over many revolutions beyond the optimization interval, satisfying the required flight conditions. Computational cost of the optimization cycle is assessed in a high-performance computing environment and found affordable for design of rotorcraft in general level-flight conditions.

Wang, Li↗
NASA NTRSDate not supplied

Optimal Angle of Attack Control for Aerocapture Maneuvers

Recent investigations of aerocapture maneuvers have considered direct force control as a promising alternative to bank angle control. By modulating the angle of attack and sideslip angle independently, the longitudinal and lateral channels can be decoupled and thus solved separately. However, the optimal angle of attack profile for minimizing post-atmospheric propellant expenditure was previously unknown. This research applies principles of optimal control theory to numerically solve for the optimal angle of attack profile for control of the longitudinal channel. Direct methods are first employed to discretize the angle of attack profile and show that an optimal solution follows a nearly bang-bang (full lift up then full lift down) structure under a variety of conditions along the flight path angle corridor. To corroborate these results, indirect methods were also applied to scope the Optimal Control Problem (OCP) as a Two Point Boundary Value Problem (2P-BVP) which could then be solved numerically. The indirect optimization results aligned closely with the direct results, providing further evidence that a bang-bang structure provides a good approximation for the optimal angle of attack profile for aerocapture maneuvers using direct force control.

aerocapture↗
NASA NTRSDate not supplied

End-to-End Performance Optimization of a Crewed Lunar Landing Mission Staged from a Near Rectilinear Halo Orbit

A crewed lunar landing mission staged from a Near Rectilinear Halo Orbit (NRHO) presents a unique set of challenges not considered before for the Apollo-type direct missions. The NRHO does not have a fixed orbital plane and its period also changes with time, due to which the mission performance is very sensitive to the timing and location of the NRHO departure and arrival burns for a near-polar surface landing site. For such type of mission staged from the NRHO, an end-to-end optimization approach for the entire mission, from the NRHO departure to surface landing and from surface lift-off to the NRHO insertion, is well-suited for extracting the maximum performance out of this design. In this paper, an integrated approach for performing end-to-end optimization of a NRHO-staged crewed lunar landing mission is proposed that optimizes the in-space and powered flight segments simultaneously using Copernicus trajectory optimization tool. Copernicus is augmented with analytical approximations for the in-space, powered descent, and powered ascent segments in this work to improve the convergence of its multiple-shooting based direct optimization method. New analytical solutions are derived for the different phases of the powered flight segments by solving associated guidance problems. These analytical solutions act as initial guesses for starting the numerical optimization of the integrated mission in Copernicus. An example lunar landing mission is simulated to validate the proposed end-to-end optimization approach and the results are compared with the conventional patched trajectory approach.

Bharat Mahajan↗
NASA NTRSDate not supplied

An Optimization Approach to Support Science Decision Making for Lunar Surface Exploration

Introduction: Scientific exploration is one of the three pillars of NASA’s Moon2Mars architecture, with crew surface extra vehicular activities (EVA) serving a critical enabling function. Development of surface EVA operational planning and execution, specifically integrating science and flight control teams (FCT), is currently being explored through analog scenarios. This integration, exercised, for example, through the Joint EVA and Hu-man Surface Mobility Test Team (JETT), allows for science input on EVA activities in near real-time through a Science Evaluation Room (SER), or Arte-mis science backroom, which integrates with the broader FCT through the Science Officer. The SER works within the FCT to support dynamic EVA planning in response to changes in operational constraints as well as science opportunities and re-prioritization, increasing the mission science return and accelerating the accomplishment of the Moon2Mars science objectives. The SER works within the FCT to provide recommendations to traverse execution in near real-time. One challenge is the requirement to deliver SER inputs to the FCT on operationally relevant timelines. Failure to do so may result in suboptimal execution of science exploration EVAs or even loss of key science objectives. To close this gap, we present a network optimization tool to allow the SER to provide rapid input to the FCT in response to changes in operational constraints or science opportunities. Inputs are predicated on approved science objectives, and clear rationale must be provided to the FCT for any requested change. Accordingly, this tool incorporates the Science Traceability Matrix (STM), SER prioritization scheme, and station characterization and action planning with operational constraints such as duration, traverse speed, and distance to maximize science objectives based on SER priorities, consistent with FCT operational requirements. Method: As a proof of concept, we used an existing linear programing software package used to simulate optimal routes through cellular metabolism. We built a Demonstrative Model with three STM objectives and four stations on a region of the Moon. The objectives were given an arbitrary prioritization and mapped to the stations through four possible crew actions. (Figs. 1 and 2). This station to STM mapping is consistent with the method used by the JETT5 Science Team to develop analog surface EVA science planning. We used a grid system with the landing site at the origin and the four stations placed across the positive x,y quadrant. Actions were assigned to each station and the accomplishment of those actions resulted in a numerical “reward” based on the ability of that action to achieve science objectives. The aggregate reward from each individual STM objective contributes to a global score (Science Yield), weighted by its priority. Operational constraints included a requirement to start and end at the landing site, 5 minutes each for initial station characterization and “clean up,” and variable total EVA time, traverse rate (fixed to 0.5 meters per second in our example), and time to perform each action (10, 5, 7, and 15 min for actions 1, 2, 3, and 4, respectively). Additional constraints and variables will be added in the future (e.g., sample mass, number of stations, traverse route constraints, illumination). Optimization. We converted the connections (arcs) between these stations (nodes) into a mixed integer linear programming optimization problem (arcs = constraints, nodes = variables) with the objective to maximize Science Yield. For any action, the Science Yield is equal to the relevance of that action to an STM objective [3, 2, and 1 point(s) for High, Med., and Low relevance, respectively], multiplied by the STM Objective Priority [3, 2, and 1 point(s) for High, Med., and Low priority, respectively]. This resulted in a model that computes the optimal station and action combination to maximize the Science Yield. These weightings can be adjusted by the SER as desired. Results: We explored three test cases for the Demonstrative Model. First, we set the maximum EVA duration to 120 minutes and computed the optimal route (Fig. 3A). The model suggested per-forming Actions 1 and 2 at Station P01, followed by Actions 1 and 2 at Station P02, and finally Actions 1 and 3 at Station P04 before returning to the Landing Site. Second, we adjusted the STM Objective Priori-ty order and computed the new optimal route (Fig. 3B). Under this situation, the model suggested per-forming all Actions at Station P02 followed by all Actions at Station P03. The previous test cases were relevant to SER planning activities. Next, we explored providing mid-EVA replanning input to the FCT. Scenario: While executing the Route in Fig. 3A the crew finishes at Station P01 and FCT decides that the EVA needs to finish in 45 minutes back at the Landing Site. FCT asks SER to recommend changes to the plan to accommodate this operation-al change. Using the model and incorporating these new constraints (start at Station P01, max. time of 45 min), the model suggested performing Actions 2 and 4 at Station P03 (Fig. 4), requiring 41 minutes to complete and return to the Landing Site. Interestingly, Station 3 was not part of the original route. Using the model, we determined the EVA would need 66 minutes, instead of 45, in order for the original Station P04 to yield a larger Science Yield than Station P03. The parametrization and simulation was per-formed in less than a minute, demonstrating the operational relevance of the approach. Future Efforts: The results from the Demonstrative Model suggest this tool can accelerate SER decision making on operationally relevant timelines. Use in analog activities, such as JETT5 or follow-ons, which have over a dozen stations for a crew to explore and over a dozen actions per station, will provide needed validation of the utility of this tool for planning EVAs, replanning mid-EVA, or planning follow-on EVAs based on previous results. Further integration with FCT execution monitoring tools may provide additional efficiency gains, al-lowing rapid and iterative exploration of operation-al and science decision space by the FCT and SER.

Science Operations↗
NASA NTRS2025

Robust Trajectory Optimization for NRHO Rendezvous Using SPICE Kernel Relative Motion

In this paper, robust optimization is performed on trajectory correction maneuvers during the lunar lander return phase of an Artemis mission, treating the trajectory from one hour after low lunar orbit departure to arrival in the vicinity of the lunar Gateway as a relative motion problem. To enable rapid stochastic optimization techniques requiring many candidate trajectories, SPICE kernel relative motion as implemented by the Quadratic Interpolated State Transition (QIST) system is used as the underlying dynamics propagation. The optimization is performed with a genetic optimizer using linear covariance (LinCov) software in a simplified operational context, taking into account the availability of navigation sensors with varying measurement models, ranges, and accuracies. No numerical integration is used, since the relative motion around Gateway is fully characterized with the a priori computation of the QIST coefficients. Maneuver placements are computed to optimize the minimum 3σ delta-v of the trajectory, the position dispersion at a target point, and a convex combination of these two metrics. An order of magnitude runtime improvement is provided over legacy methods with less than 10% error introduced. All QIST results are shown to be in-family with legacy methods. The tradespace for optimal delta-v design is found to range from 77.0 to 93.9 m/s, while the range of optimal dispersion is between 1.4 and 11.7 km.

Relative Motion↗
DOE OSTI2018

Optimization study of B4C filter thickness for shifting to fast spectrum at experimental position in NRAD core

The Japan Atomic Energy Agency (JAEA) has investigated an accelerator-driven system (ADS) to transmute minor actinides (MAs) partitioned from the high level waste. In the nuclear transmutation system such as the ADS, the nuclear data validation of MA is required to reduce the uncertainty caused by the nuclear data of MA. In order to validate the nuclear data, many independent experimental data need to be mutually compared. The Idaho National Laboratory (INL) considers the measurement of fission rate ratio and sample worth with a wide spectral indices by inserting several types of thermal neutron shielding filters in the experimental position in Neutron RADiography (NRAD) which is the thermal neutron reactor. The JAEA has a plan to perform integral experiments with fission chambers in the NRAD because of the expansion of the experimental data contributing to nuclear data validation of MA. In this study, the optimization of the NRAD core configuration, the B4C filter thickness, and the experimental position design was conducted to acquire the high-accuracy and the beneficial experimental data by using MCNP 6.1 and ENDF/B-VII.1. First, by locating the experimental position as close to the center of the core as possible and concentrating the fuel around that position, the neutron flux of the optimized model could be constructed 2.5 times as much as that of the previous model. Second, the optimized B4C filter thickness was determined to be 3mm based on the comprehensive evaluation from the viewpoints of the shielding ability of low energy neutrons, the level of the total neutron flux, and the influence of fabrication accuracy of the B4C filter. Third, we constructed the experimental position model that could further reduce the influence of the low energy neutrons by adopting the aluminum dry box and the bottom filter. Moreover, the neutron energy spectrum of the tentative optimized model constructed by following the above results was compared with that of the fast neutron reactors such as the ADS and the Fast Critical Assembly (FCA). As a result, the tentative optimized model would be able to be obtained the beneficial experimental data for the verification of FCA-IX series data and the validation of MA nuclear data for accuracy improvement of ADS design. Furthermore, the adoption of the tentative optimized model would be acquired the experimental data such as fission reaction rate and sample worth with the wider spectral indices than the previous one because the tentative optimized model would be able to increase the ratio of the fast neutrons by almost completely eliminating the effect of the thermal neutrons.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2020

Experimental Validation of Approximate Dynamic Programming Based Optimization and Convergence on Microgrid Applications

Stochastic optimization can better address uncertainties in power system problems. However, when state space and action space become large, many existing approaches become computationally expensive and even infeasible. Approximate dynamic programming (ADP) attracts researchers’ attention as a powerful tool for solving power system optimization problems with reduced computational cost. In this paper, in light of the existing literature, we investigate how the ADP approach with post-decision value function approximation converges to the nearly optimal solution with improved computational speed and experimentally validate the performance of the approach for a microgrid energy optimization problem. The approximation error versus the number of iteration is studied for convergence analysis of the post-decision ADP. A flowchart is provided to illustrate the proposed ADP algorithm for a microgrid energy optimization problem. The performance of ADP and dynamic programming (DP) is compared in terms of optimization error and computational time. It has found that the post-decision ADP approach can achieve competitive optimality with improved computational speed compared to the traditional DP.

Das, Avijit↗
DOE OSTI2020

Do optimization methods in deep learning applications matter?

With advances in deep learning, exponential data growth and increasing model complexity, developing efficient optimization methods are attracting much research attention. Several implementations favor the use of Conjugate Gradient (CG) and Stochastic Gradient Descent (SGD) as being practical and elegant solutions to achieve quick convergence, however, these optimization processes also present many limitations in learning across deep learning applications. Recent research is exploring higher-order optimization functions as better approaches, but these present very complex computational challenges for practical use. Comparing first and higher-order optimization functions, in this paper, our experiments reveal that Levemberg-Marquardt (LM) significantly supersedes optimal convergence but suffers from very large processing time increasing the training complexity of both, classification and reinforcement learning problems. Our experiments compare off-the-shelf optimization functions(CG, SGD, LM and L-BFGS) in standard CIFAR, MNIST, CartPole and FlappyBird experiments.The paper presents arguments on which optimization functions to use and further, which functions would benefit from parallelization efforts to improve pretraining time and learning rate convergence.

Ozyildirim, Buse Melis↗
DOE OSTI2023

Heat Exchangers Circuitry Optimization using Low-GWP Refrigerants in Reversible Heat Pump Applications

Tube-fin heat exchangers (TFHX) are widely used in heat pump applications. Circuitry optimization can improve system performance. Previous optimizations focus on improving component-level performance under a specific operating condition, i.e., the TFHX either works as a condenser or an evaporator. The optimal circuitry obtained under air conditioning (AC) mode cannot guarantee optimal performance when used in heat pump (HP) mode. This study implements a bi-objective formulation to achieve optimal system performance in both AC and HP modes. An integer permutation-based Genetic Algorithm is integrated with Heat Pump Design Model (HPDM) to perform heat pump optimization. Six refrigerants, i.e., R410A, R452B, R454B, R32, D2Y60 and L41a are investigated. Case studies show that optimal heat exchangers yield 2.1%-6.1% EER improvement under AC mode and 1.9%-8.5% COP improvement under HP mode. Use of this design approach can help assure a preferable performance of reversible heat pumps during both cooling and heating mode usage.

Li, Zhenning↗
DOE OSTI2025

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↗
DOE OSTI2019

The use of multi-objective optimization to improve the design process of nuclear power plant systems

Multi-objective optimization is proposed to address the problem of design optimality in the nuclear power plant design process. This is done via the creation/development of the Optimization and Preference Tool for the Improvement of Nuclear Systems (OPTIONS). This work details applications of multi-objective optimization methods (in Python 3) to two different nuclear system design problems: the flash-Rankine power conversion system (PCS) of the I 2 S-LWR and the Passive Endothermic Reaction Cooling System (PERCS) attached to a standard PWR primary system (in RELAP5). The PCS design problem is first solved for three configurations using a specific particle swarm optimization method, achieving a thermodynamic efficiency of 34.81%. A new method, the Mixed-Integer Non-dominated Sorting Genetic Algorithm (MI-NSGA), is created and then used, solving a PCS superstructure of 22 configurations and achieving an efficiency of 35.63%. Finally, the OPTIONS tool is used to optimize the PERCS, improving cost, core temperature control, and cooling longevity.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2024

Simultaneous shape and topology optimization of inflatable soft robots

Simultaneous shape and topology optimization is used to design pressure-activated inflatable soft robots. The pressure loaded boundary is meshed conformingly and shape optimized, while the morphology of the robot is topology optimized. The design objective is to exert maximum force on an object, i.e. to produce soft “grippers”. The robot’s motion is modeled using nearly incompressible finite deformation hyperelasticity. To ensure stability of the robot, the buckling load factors obtained via linearized buckling analyses are constrained. The finite element method is used to evaluate the optimization cost and constraint functions and the adjoint method is employed to compute their sensitivities. The numerical examples produce pressure-driven soft robots with varying complexity. We also compare our simultaneous optimization results to those obtained via sequential topology and then shape optimization.

42 ENGINEERING↗
DOE OSTI2021

Statistical Multiobjective Optimization of Thiospinel CoNi 2 S 4 Nanocrystal Synthesis via Design of Experiments

Thiospinels, such as CoNi 2 S 4 , are showing promise for numerous applications, including as catalysts for the hydrogen evolution reaction, hydrodesulfurization, and oxygen evolution and reduction reactions; however, CoNi 2 S 4 has not been synthesized as small, colloidal nanocrystals with high surface-area-to-volume ratios. Traditional optimization methods to control nanocrystal attributes such as size typically rely upon one variable at a time (OVAT) methods that are not only time and labor intensive but also lack the ability to identify higher-order interactions between experimental variables that affect target outcomes. Herein, we demonstrate that a statistical design of experiments (DoE) approach can optimize the synthesis of CoNi 2 S 4 nanocrystals, allowing for control over the responses of nanocrystal size, size distribution, and isolated yield. After implementing a 2 5–2 fractional factorial design, the statistical screening of five different experimental variables identified temperature, Co:Ni precursor ratio, Co:thiol ratio, and their higher-order interactions as the most critical factors in influencing the aforementioned responses. Second-order design with a Doehlert matrix yielded polynomial functions used to predict the reaction parameters needed to individually optimize all three responses. A multiobjective optimization, allowing for the simultaneous optimization of size, size distribution, and isolated yield, predicted the synthetic conditions needed to achieve a minimum nanocrystal size of 6.1 nm, a minimum polydispersity (σ/$\bar{d}$) of 10%, and a maximum isolated yield of 99%, with a desirability of 96%. The resulting model was experimentally verified by performing reactions under the specified conditions. Furthermore, our work illustrates the advantage of multivariate experimental design as a powerful tool for accelerating control and optimization in nanocrystal syntheses.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Efficient wind farm layout optimization with the FLOWERS AEP model and analytic gradients

Wind farm layout optimization (WFLO) studies often aim to maximize the annual energy production (AEP) of a wind farm by choosing an arrangement of turbines that minimizes wake interactions. One way to reduce the cost of WFLO studies is by using more computationally efficient AEP models. The cost of standard AEP modeling approaches, based on the numerical integration of low-fidelity engineering wake models, scales poorly with the number of simulated discrete wind conditions. A second way to reduce cost when using a gradient-based algorithm is to supply exact gradient information instead of finite-difference estimates. However, analytical functions for the derivatives of AEP with respect to turbine positions are not always available in the conventional modeling approach. FLOWERS is a computationally inexpensive, analytical model for wind farm AEP that is specifically developed for WFLO applications. In this paper, we analyze the performance of the FLOWERS AEP model with analytic gradients in a layout optimization study compared with a reference optimization framework across three wind farm case studies. We find that the FLOWERS-based approach reduces computation time by a factor of 50–4000 and improves optimal AEP by about 0.3% with less than half of the variability in AEP across instances with randomized initial conditions. We also find the optimal layouts to be insensitive to model parameter tuning, making FLOWERS-based layout optimization a streamlined, user-friendly approach.

17 WIND ENERGY↗
DOE OSTI2018

A non-intrusive parallel-in-time approach for simultaneous optimization with unsteady PDEs

This paper presents a non-intrusive framework for integrating existing unsteady partial differential equation (PDE) solvers into a parallel-in-time simultaneous optimization algorithm. The time-parallelization is provided by the non-intrusive software library XBraid [Parallel multigrid in time, software available at http://llnl.gov/casc/xbraid], which applies an iterative multigrid reduction technique to the time domain of existing time-marching schemes for solving unsteady PDEs. Its general user-interface has been extended in [S. Günther, N.R. Gauger, and J.B. Schroder, A non-intrusive parallel-in-time adjoint solver with the XBraid library, Comput. Vis. Sci. 19 (2018), pp. 85–95. Available at arXiv, math.OC/1705.00663] for computing adjoint sensitivities such that gradients of output quantities with respect to design changes can be computed parallel-in-time alongside with the primal PDE solution. In this paper, the primal and adjoint XBraid iterations are embedded into a simultaneous optimization framework, namely the One-shot method. In this method, design updates towards optimality are employed after each state and adjoint update such that optimality and feasibility of the design and the PDE solution are reached simultaneously. Finally, the time-parallel optimization method is validated on an advection-dominated flow control problem which shows significant speedup over a classical time-serial optimization algorithm.

97 MATHEMATICS AND COMPUTING↗