Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimizer”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,063 records · Page 59

TRANSP-based optimization towards tokamak scenario development

An optimization approach that incorporates the predictive transport code TRANSP is proposed for tokamak scenario development. Optimization methods are often employed to develop open-loop control strategies to aid access to high performance tokamak scenarios. Generally, the optimization approaches use control-oriented models, i.e. models that are reduced in complexity and prediction accuracy as compared to physics-oriented transport codes such as TRANSP. In the presented approach, an optimization procedure using the TRANSP code to simulate the tokamak plasma is considered for improved predictive capabilities. As a test case, the neutral beam injection (NBI) power is optimized to develop a control strategy that maximizes the noninductive current fraction during the ramp-up phase for NSTX-U. Simulation studies towards the achievement of noninductive ramp-up in NSTX-U have already been carried out with the TRANSP code. The optimization-based approach presented in this work is used to maximize the noninductive current fraction during ramp-up in NSTX-U, demonstrating that the scenario development task can be automated. An additional test case considers optimization of the current ramp rate in DIII-D for obtaining a stationary plasma characterized by a flat loop voltage profile in the flattop phase.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Pseudospectral convex optimization for on-ramp merging control of connected vehicles

It can be a daunting task for human drivers to merge into highways because of the intricate vehicle negotiations and potential risk within limited time and space. Connected vehicle (CV) technologies could be a solution to this problem and offer many benefits to the road safety, traffic mobility, and energy efficiency. However, real-time optimal control of CVs is still an open challenge, due to the nonlinear vehicle dynamics, non-convex fuel consumption model, and highly dynamic uncertain inter-vehicle interactions. To tackle these issues, a novel real-time optimal control approach that balances the computational efficiency and solution optimality is proposed for the purpose of onboard application. To this end, the pseudospectral collocation method is integrated with a sequential convex programming approach to develop two new optimization algorithms, which are implemented within a model predictive control (MPC) framework to allow for real-time generation of optimal merging speed profiles. One algorithm leverages the line search technique to improve convergence, and the other benefits from the trust region method for better computational efficiency. The optimality and convergence process of both proposed algorithms are investigated by comparing their solutions with a popular non-linear solver. Furthermore, simulation results show that the proposed methods outperform the benchmark in terms of computational cost, fuel consumption, and traffic efficiency. In particular, the proposed fuel-economy merging rule can save 57.1% fuel consumption on average on four different traffic volumes. Meanwhile, the proposed optimal control algorithms can reduce 2.2% travel time on average comparing to the “first-in-first-out” merging rule.

33 ADVANCED PROPULSION SYSTEMS↗

Distributed ADMM Using Private Blockchain for Power Flow Optimization in Distribution Network With Coupled and Mixed-Integer Constraints

The optimization problem for scheduling distributed energy resources (DERs) and battery energy storage systems (BESS) integrated with the power grid is important to minimize energy consumption from conventional sources in response to demand. Conventionally this optimization problem is solved in a centralized manner, limiting the size of the problem that can be solved and creating a high communication overhead because all the data is transferred to the central controller. These limitations are addressed by the proposed distributed consensus-based alternating direction method of multiplier (DC-ADMM) optimization algorithm, which decomposes the optimization problem into subproblems with private cost function and constraints. The distribution feeder is partitioned into low coupling subnetworks/regions, which solves the private subproblem locally and exchanges information with the neighboring regions to reach consensus. The relaxation strategy is employed for mixed-integer and coupled constraints introduced in the optimal power flow (OPF) problem by stationary and transportable BESS because DC-ADMM convergence is only guaranteed for strict convex problems. The information exchange and synchronization between subnetworks/regions are vital for distributed optimization. In this work, both of these aspects are addressed by the blockchain. The smart contract deployed on the blockchain network acts as a mediator for secure data exchange and synchronization in distributed computation. The blockchain-based distributed optimization problem’s effectiveness is tested for a 0.5-MW laboratory microgrid for one hour ahead and day-ahead for the IEEE 123-bus and EPRI J1 test feeders, and results are compared with a centralized solution.

25 ENERGY STORAGE↗

Outcomes and Insights From Simplified Analytic Trajectory Optimization for a Tethered Underwater Kite

This letter formulates and solves a periodic trajectory optimization problem for a tethered underwater kite. The goal is to maximize the average mechanical power harvested by the kite. The type of kite considered in this letter extracts electricity from ocean currents by moving cross-current as its reel away from its base station, and consumes electricity to reel back. The problem of optimizing this kite’s trajectory is challenging due to the high dimensionality and nonlinearity of its dynamics. To tackle this challenge, the literature often separates the problem into two subproblems focusing on optimizing the cross-current and the reel-in/reel-out components of the trajectory, respectively, which may be sub-optimal. In contrast, this letter solves for the combined cross-current and reel-in/reel-out trajectory by linearizing the dynamics of the kite around a zero-power reference equilibrium trajectory in spherical coordinates. This allows the trajectory optimization problem to be solved analytically for simple sinusoidal input perturbations from equilibrium. Here we use linear quadratic regulation to enable the nonlinear kite model to track the optimized trajectory. The result is a computationally efficient approach that achieves an attractive Loyd factor of 19.9%, while providing important insights into the nature of the optimal trajectory.

42 ENGINEERING↗

A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems

Historically, centrally computed algorithms have been the primary means of power system optimization and control. With increasing penetrations of distributed energy resources requiring optimization and control of power systems with many controllable devices, distributed algorithms have been the subject of significant research interest. Here, this paper surveys the literature of distributed algorithms with applications to optimization and control of power systems. In particular, this paper reviews distributed algorithms for offline solution of optimal power flow (OPF) problems as well as online algorithms for real-time solution of OPF, optimal frequency control, optimal voltage control, and optimal wide-area control problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Improved Guarantees for Optimal Nash Equilibrium Seeking and Bilevel Variational Inequalities

We consider a class of hierarchical variational inequality (VI) problems that subsumes VI-constrained optimization and several other problem classes, including the optimal solution selection problem and the optimal Nash equilibrium (NE) seeking problem. Our main contribution is threefold. (i) We consider bilevel VIs with monotone and Lipschitz continuous mappings and devise a single-timescale iteratively regularized extragradient method, named IR-EG 𝚖,𝚖 . We improve the existing iteration complexity results for addressing both bilevel VI and VI-constrained convex optimization problems. (ii) Under the strong monotonicity of the outer-level mapping, we develop a method named IR-EG 𝚜,𝚖 and derive faster guarantees than those in (i). We also study the iteration complexity of this method under a constant regularization parameter. These results appear to be new for both bilevel VIs and VI-constrained optimization. (iii) To our knowledge, complexity guarantees for computing the optimal NE in nonconvex settings do not exist. Motivated by this lacuna, we consider VI-constrained nonconvex optimization problems and devise an inexactly projected gradient method, named IPR-EG, where the projection onto the unknown set of equilibria is performed using IR-EG 𝚜,𝚖 with a prescribed termination criterion and an adaptive regularization parameter. We obtain new complexity guarantees in terms of a residual map and an infeasibility metric for computing a stationary point. Here, we validate the theoretical findings using preliminary numerical experiments for computing the best and the worst NEs.

bilevel optimization↗

TRANSP-based Optimization Towards Tokamak Scenario Development

An optimization approach that incorporates the predictive transport code TRANSP is proposed for tokamak scenario development. Optimization methods are often employed to develop open-loop control strategies to aid access to high performance tokamak scenarios. In general, the optimization approaches use control-oriented models, i.e. models that are reduced in complexity and prediction accuracy as compared to physics-oriented transport codes such as TRANSP. In the presented approach, an optimization procedure using the TRANSP code to simulate the tokamak plasma is considered for improved predictive capabilities. As a test case, the neutral beam injection (NBI) power is optimized to develop a control strategy that maximizes the non-inductive current fraction during the ramp-up phase for NSTX-U. Simulation studies towards the achievement of non-inductive ramp up in NSTX-U have already been carried out with the TRANSP code. The optimization-based approach proposed in this work is used to maximize the non-inductive current fraction during ramp-up in NSTX-U, demonstrating that the scenario development task can be automated. An additional test case considers optimization of the current ramp rate in DIII-D for obtaining a stationary plasma characterized bya flat loop voltage profile in the flattop phase.

DIII-D↗

Binary Quantum Control Optimization with Uncertain Hamiltonians

Optimizing the controls of quantum systems plays a crucial role in advancing quantum technologies. The time-varying noises in quantum systems and the widespread use of inhomogeneous quantum ensembles raise the need for high-quality quantum controls under uncertainties. In this paper, we consider a stochastic discrete optimization formulation of a discretized binary optimal quantum control problem involving Hamiltonians with predictable uncertainties. We propose a sample-based reformulation that optimizes both risk-neutral and risk-averse measurements of control policies, and solve these with two gradient-based algorithms using sum-up-rounding approaches. Furthermore, we discuss the differentiability of the objective function and prove upper bounds of the gaps between the optimal solutions to binary control problems and their continuous relaxations. We conduct numerical simulations on various sized problem instances based on two applications of quantum pulse optimization; we evaluate different strategies to mitigate the impact of uncertainties in quantum systems. In conclusion, we demonstrate that the controls of our stochastic optimization model achieve significantly higher quality and robustness compared with the controls of a deterministic model.

conditional value-at-risk (CVaR)↗

Computational Approaches to Simulation and Optimization of Global Aircraft Trajectories

This study examines three possible approaches to improving the speed in generating wind-optimal routes for air traffic at the national or global level. They are: (a) using the resources of a supercomputer, (b) running the computations on multiple commercially available computers and (c) implementing those same algorithms into NASAs Future ATM Concepts Evaluation Tool (FACET) and compares those to a standard implementation run on a single CPU. Wind-optimal aircraft trajectories are computed using global air traffic schedules. The run time and wait time on the supercomputer for trajectory optimization using various numbers of CPUs ranging from 80 to 10,240 units are compared with the total computational time for running the same computation on a single desktop computer and on multiple commercially available computers for potential computational enhancement through parallel processing on the computer clusters. This study also re-implements the trajectory optimization algorithm for further reduction of computational time through algorithm modifications and integrates that with FACET to facilitate the use of the new features which calculate time-optimal routes between worldwide airport pairs in a wind field for use with existing FACET applications. The implementations of trajectory optimization algorithms use MATLAB, Python, and Java programming languages. The performance evaluations are done by comparing their computational efficiencies and based on the potential application of optimized trajectories. The paper shows that in the absence of special privileges on a supercomputer, a cluster of commercially available computers provides a feasible approach for national and global air traffic system studies.

global air traffic optimization↗

Wind-Optimal Trajectories for Multirotor eVTOL Aircraft on UAM Missions

Distributed electric propulsion powered electric vertical takeoff and landing aircraft are expected to enable urban air mobility. Low specific energy of onboard lithium-ion polymer batteries and wind conditions impose constraints on flight endurance. Therefore, from the safety and efficiency perspective, planning and flying minimum energy trajectories are important.The primary motivation for this paper is to determine if there is an operational benefit to flying wind-optimal trajectories for short flights (less than 60 miles) in the urban environment. This study employs wind-optimal trajectories for a NASA-proposed conceptual multirotor aircraft flight in the urban environment. The optimal control model presented includes a wind model for quantifying the effect of wind on the trajectory. The optimal control problem is numerically solved using the direct method. Energy consumption and flight duration flying wind-optimal trajectories between origins and destinations in a metropolitan area are compared with energy consumption and flight duration flying on the great-circle paths between the same origin and destination pairs to determine the operational benefit of wind-optimal routing for short flights.The flight duration results for different scenarios are validated using a simulation tool designed and developed by NASA for exploring advanced air traffic management concepts. In summary,this research study suggests that for short flights in an urban environment, the wind-optimal trajectories have a very slight (insignificant) operational advantage over the great-circle trajectories in terms of energy consumption and flight duration. As expected, headwinds and tailwinds along the route of flight have a significant impact on energy consumption and flight duration.

Urban Air Mobility↗

Copernicus-LinCov (COPCOV) Software Integration in Support of Robust Trajectory Optimization

Robust trajectory optimization is the process of optimizing a trajectory while accounting for system uncertainty due to a variety of potential error sources. This work highlights the development and features of a novel tool known as CopCov to support robust trajectory optimization efforts. CopCov acts as an interface between Copernicus, a generalized trajectory design and optimization tool, and LinCov, a linear covariance analysis tool. By having a direct interface between these two software packages, Copernicus can receive covariance information from LinCov through a direct feedback loop, thus enabling optimization of a trajectory that is robust to trajectory dispersions and navigation errors. This paper details the architecture of CopCov and its flexibility to operate under varying configurations, including with both tools running locally or alternatively with the tools communicating via a remote connection. Additionally, the CopCov tool is demonstrated on a simple Hohmann transfer reference trajectory with varying numbers of Trajectory Correction Maneuvers (TCMs) and varying problem formulations. This example scenario is used to highlight how the inclusion of the CopCov interface affects burn placement of both major burns and minor burns (i.e., TCMs) in the optimized solution. Results are compared against analytical solutions and against a Genetic Algorithm (GA) optimizer for independent verification and validation.

Copernicus↗

On The Incorporation of Both Function-Driven Requirements and Topology Optimization in The Development of Lunar Launch & Landing Pads

In the design of additively manufactured structures, there can be a constant battle between focusing on function-driven design and topology optimization in an attempt to improve a products ability to meet all requirements. Function-driven optimization is defined as the process of identifying the best design parameters that satisfy project functionality requirements. Function-driven optimization is typically implemented by a designer(s) who, instead of computational limitations, has human bias for the input or inputs determined. On the other hand, topology optimization is defined as a mathematical method that optimizes material layout within a given design space, for a given set of loads, boundary conditions, and constraints with the goal of maximizing the performance of the system. In topology optimization, the work is defined by the limited mathematical inputs and computationally available goals/restraints. If not evaluated simultaneously, these two approaches can result in fundamentally different design concepts meant to address the same requirements. NASA’s Artemis program includes the development of a base camp near the lunar South Pole. After site selection is made, one of the first infrastructure elements needed will be a launch and landing pad (LLP). The construction of such a pad will prevent damage to nearby structures from plume-surface interaction (PSI) while also providing a stable platform for the lander. These benefits reduce the required distance between the established landing zones and other settlement infrastructure. In this paper, the authors evaluate the requirements associated with lunar LLP development, application of both functional and topological optimization techniques, methodologies to combine the two techniques, and potential impacts on final design of such a pad.

In-situ↗

Efficient Distributed Optimization of Wind Farms Using Proximal Primal-Dual Algorithms: Preprint

This paper presents a distributed approach to perform real-time optimization of large wind farms. Wind turbines in a wind farm typically operate individually to maximize their own performance regardless of the impact of aerodynamic interactions on neighboring turbines. This paper optimizes the overall power produced by a wind farm by formulating and solving a nonconvex optimization problem where the yaw angles are optimized to allow some turbines to operate in misaligned conditions and shape the aerodynamic interactions in a favorable way. The solution of the nonconvex smooth problem is tackled using a proximal primal-dual gradient method, which provably identifies a first-order stationary solution in a global sublinear manner. By adding auxiliary optimization variables for every pair of turbines that are coupled aerodynamically and properly adding consensus constraints into the underlying problem, a distributed algorithm with turbine-to-turbine message passing is obtained; this allows for turbines to be optimized in parallel using local information rather than information from the whole wind farm. This algorithm is computationally light, as it involves closed-form updates. This approach is demonstrated on a large wind farm with 60 turbines. The results indicate that similar performance can be achieved as with finite-difference gradient-based optimization at a fraction of the computational time and thus approach real-time control/optimization.

17 WIND ENERGY↗

Efficient Distributed Optimization of Wind Farms Using Proximal Primal-Dual Algorithms

This paper presents a distributed approach to performing real-time optimization of large wind farms. Wind turbines in a wind farm typically operate individually to maximize their own performance regardless of the impact of aerodynamic interactions on neighboring turbines. This paper optimizes the overall power produced by a wind farm by formulating and solving a nonconvex optimization problem where the yaw angles are optimized to allow some turbines to operate in misaligned conditions and shape the aerodynamic interactions in a favorable way. The solution of the nonconvex smooth problem is tackled using a proximal primal-dual gradient method, which provably identifies a first-order stationary solution in a global sublinear manner. By adding auxiliary optimization variables for every pair of turbines that are coupled aerodynamically, and properly adding consensus constraints into the underlying problem, a distributed algorithm with turbine-to-turbine message passing is obtained; this allows for turbines to be optimized in parallel using local information rather than information from the whole wind farm. This algorithm is computationally light, as it involves closed-form updates. This approach is demonstrated on a large wind farm with 60 turbines. The results indicate that similar performance can be achieved as with finite-difference gradient-based optimization at a fraction of the computational time and thus approaching real-time control/optimization.

17 WIND ENERGY↗

Review of Shape and Topology Optimization for Design of Air-to-Refrigerant Heat Exchangers

Air-to-refrigerant heat exchangers (HXs) have been the topic of exhaustive research as they are fundamental components of HVAC&R systems. It has been well-established that the large airside thermal resistance dominates the HX thermal resistance, and thus significant research efforts have focused on improving the air-side performance of these heat exchangers. As HXs continue to become more compact, thermal resistance reduction is typically realized through the utilization of extended secondary heat transfer surfaces such as fins. However, past research has shown that the thermal-hydraulic trade-offs provided by fins are often not attractive enough to warrant their use, especially for small diameter tubes. Yet, the inadequate primary surface area provided by compact HXs essentially mandate the necessity of fins to meet thermal resistance requirements. In recent years, advancements in computational tools such as Computational Fluid Dynamics (CFD) and optimization algorithms, coupled with the advent of additive manufacturing technologies, have allowed engineers to expand conventional HX design ideologies to include such concepts as shape and topology optimization. This lends itself directly to primary heat transfer surface optimization and even the potential removal of finned surfaces altogether. This paper presents a comprehensive literature review investigating air-to-refrigerant HX shape and topology optimization. The fundamentals of both shape and topology optimization, model development, and experimental validations are all separately discussed. Studies featuring manufactured prototypes and/or experimentally validated optimal designs are treated with additional emphasis. This paper concludes by identifying key research gaps and proposing future research directions for HX shape and topology optimization.

42 ENGINEERING↗

Developing a Drilling Optimization System for Improved Overall Rate of Penetration in Geothermal Wells

Geothermal energy is renewable, reliable and environmentally friendly source of energy. The major cost in the development of geothermal wells is the actual drilling of the wells. The main objective of this paper is to introduce a new real-time drilling optimization system designed for granite formation to reduce the overall drilling cost. In this study, a drilling optimization system is verified using drilling data from Utah-Forge well 58-32. The drilling optimization system used the Utah-Forge well 58-32 data to achieve real-time unconfined compressive strength (UCS). Based on the UCS value from the previous feet, the system simulates the ROP for the next drilling feet. The drilling optimization system utilizes the Differential Evolution Algorithm (DEA), which is a metaheuristic method to search the space of solution, to find the best operating parameters (i.e. WOB and RPM) for the next drilling foot. The optimization algorithm takes a maximum cutter temperature into account as a constraint and avoids the accelerated wear. The developed drilling optimization system improves ROP responses and reduces the drilling cost of geothermal wells. The simulated ROP results from the system show a good agreement with the ROP from Utah-Forge well 58-32 drilling data. The drilling time before and after optimization for both intervals were presented.

15 GEOTHERMAL ENERGY↗

Hydrodynamic Optimization Method and Design Code for Stall-Regulated Hydrokinetic Turbine Rotors

This report describes the adaptation of a wind turbine performance code for use in the development of a general use design code and optimization method for stall-regulated horizontal-axis hydrokinetic turbine rotors. This rotor optimization code couples a modern genetic algorithm and blade-element momentum performance code in a user-friendly graphical user interface (GUI) that allows for rapid and intuitive design of optimal stall-regulated rotors. This optimization method calculates the optimal chord, twist, and hydrofoil distributions which maximize the hydrodynamic efficiency and ensure that the rotor produces an ideal power curve and avoids cavitation. Optimizing a rotor for maximum efficiency does not necessarily create a turbine with the lowest cost of energy, but maximizing the efficiency is an excellent criterion to use as a first pass in the design process. To test the capabilities of this optimization method, two conceptual rotors were designed which successfully met the design objectives.

17 WIND ENERGY↗

Wind Turbine Rotor Design Using High-Fidelity Aerostructural Optimization

Large wind turbines yield more energy but demand careful aeroelastic blade design. Coupled multiphysics design strategies can reduce wind energy costs by exploiting fluid-structure interactions. This work presents the first high-fidelity aerostructural optimization study of a large wind turbine rotor. We use blade-resolved fluid dynamics and structural solvers in a monolithic gradient-based optimization framework to explore steady-state torque and blade mass tradeoffs. The coupled-adjoint approach computes gradients efficiently, enabling the optimization of over 100 structural and geometric parameters simultaneously. Our optimization study modifies a DTU 10 MW benchmark with a simplified structure and isotropic material properties. The tightly coupled optimizations increase torque by 14% while reducing rotor mass by 9% or reduce blade mass by 27% while maintaining torque. Blade-resolved models provide greater design freedom, enabling 5% higher mass reductions than conventional parameterizations at equal torque. This framework paves the way for more detailed high-fidelity optimization studies to complement conventional design approaches.

17 WIND ENERGY↗