Search NASA⌕ Search

SEARCH · Search NASA

Results for “Dynamic 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 271 records · Page 15

Risk-Based Distributionally Robust Optimal Power Flow With Dynamic Line Rating

In this paper, we propose a risk-based data-driven distributionally robust approach to investigating the optimal power flow with dynamic line rating. The risk terms, including penalties for load shedding, wind generation curtailment and line overload, are embedded into the objective function. To robustify the solution, we consider a distributional uncertainty set based on the second-order moment, that captures the correlation between wind generation outputs and line ratings, and also the Wasserstein distance, that hedges against data perturbations. We show that the proposed model can be reformulated as a convex conic program. Approximations of the proposed model are suggested, which leads to a significant reduction of the number of the constraints. For practical large-scale test systems, a distributionally robust optimal power flow model with Wasserstein-distance-based distributional uncertainty set and its convex reformulation are also provided. Simulation results on the 5-bus, the IEEE 118-bus and the Polish 2736-bus test systems validate the effectiveness of the proposed models.

distributionally robust optimization↗

INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization

It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some NP -hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms we have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.

Groër, Christopher S.↗

Optimal mitigation and control over power system dynamics for stochastic grid resilience

Optimal mitigation planning for highly disruptive contingencies to a transmission-level power system requires optimization with dynamic power system constraints, due to the key role of dynamics in system stability to major perturbations. We formulate a generalized disjunctive program to determine optimal grid component hardening choices for protecting against major failures, with differential algebraic constraints representing system dynamics (specifically, differential equations representing generator and load behavior and algebraic equations representing instantaneous power balance over the transmission system). We optionally allow stochastic optimal pre-positioning across all considered failure scenarios, and optimal emergency control within each scenario. This novel formulation allows, for the first time, analyzing the resilience interdependencies of mitigation planning, preventive control, and emergency control. Using all three strategies in concert is particularly effective at maintaining robust power system operation under severe contingencies, as we demonstrate on the western system coordinating council 9-bus test system using synthetic multi-device outage scenarios.

30 DIRECT ENERGY CONVERSION↗

Memristor design rules for dynamic learning and edge processing applications

The ability to dynamically learn and adapt to changes in the environment is one of the hallmarks of biological systems. In this work, we identify the subset of the design space of memristive materials that is optimal for dynamic learning applications. Using an architecture inspired on the learning center of the insect brain, we implement a model system consisting of a discrete implementation of spiking neurons where dynamic learning takes place on a set of plastic synapses formed by memristor pairs in a crossbar array. Using two separate benchmarks, one comprising the dynamic learning of the Modified National Institute of Standards and Technology dataset and another one targeting one shot learning, we have identified the key properties that memristive materials should have to be optimal dynamic learners. The results obtained show that a fine degree of control of the memristor internal state is key to achieve high classification accuracy during dynamic learning but that within this optimal region learning is extremely robust both to device variability and to errors in the writing of the internal state, in all cases allowing for 2 sigma variations greater than 40% without significant loss of accuracy, hence overcoming two of the perceived limitations of memristors. By additionally requiring that learning takes place concurrently to information processing, we are able to derive a set constraints to the memristor dynamics.

36 MATERIALS SCIENCE↗

A Tchebycheff-based multi-objective combined with a PSO–SQP dynamic real-time optimization framework for cycling energy systems

The aim in this work is to develop an optimization framework to address cycling of baseload energy systems due to the penetration of renewables into the grid. The developed strategy corresponds to a multi-objective and dynamic real-time optimization (MOO-DRTO) framework applied to a postcombustion MEA-based CO 2 capture process from a baseload coal-fired power plant under cycling conditions. A Tchebycheff-based method is used for the multi-objective optimization (MOO) component. Also, a hybrid approach consisting of Particle Swarm Optimization (PSO) and Sequential Quadratic Programming (SQP) is implemented for the first time in process systems engineering to solve the dynamic real-time optimization (DRTO) component. The objectives considered in the MOO-DRTO framework are economic and environmental. The proposed MOO-DRTO strategy is successfully implemented and 24-h optimal output trajectories for the carbon capture system under cycling are generated. Also, the optimal compromise is chosen from the Pareto front according to a set of selected weights for the objectives with minimal interaction between the framework and decision maker. The results indicated that the developed framework has potential to be extended to plant-wide optimization applications under cycling.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO)

The INDDGO software package offers a set of tools for finding exact solutions to graph optimization problems via tree decompositions and dynamic programming algorithms. Currently the framework offers serial and parallel (distributed memory) algorithms for finding tree decompositions and solving the maximum weighted independent set problem. The parallel dynamic programming algorithm is implemented on top of the MADNESS task-based runtime.

Source record↗

Integrated Network Decompositions and Dynamic Programming for Graph Optimization (INDDGO)

The INDDGO software package offers a set of tools for finding exact solutions to graph optimization problems via tree decompositions and dynamic programming algorithms. Currently the framework offers serial and parallel (distributed memory) algorithms for finding tree decompositions and solving the maximum weighted independent set problem. The parallel dynamic programming algorithm is implemented on top of the MADNESS task-based runtime.

Source record↗

Systematic analysis of protein–detergent complexes applying dynamic light scattering to optimize solutions for crystallization trials

Application of in situ dynamic light scattering to solutions of protein–detergent complexes permits characterization of these complexes in samples as small as 2 µl in volume. Detergents are widely used for the isolation and solubilization of membrane proteins to support crystallization and structure determination. Detergents are amphiphilic molecules that form micelles once the characteristic critical micelle concentration (CMC) is achieved and can solubilize membrane proteins by the formation of micelles around them. The results are presented of a study of micelle formation observed by in situ dynamic light-scattering (DLS) analyses performed on selected detergent solutions using a newly designed advanced hardware device. DLS was initially applied in situ to detergent samples with a total volume of approximately 2 µl. When measured with DLS, pure detergents show a monodisperse radial distribution in water at concentrations exceeding the CMC. A series of all-transn-alkyl-β-d-maltopyranosides, from n-hexyl to n-tetradecyl, were used in the investigations. The results obtained verify that the application of DLS in situ is capable of distinguishing differences in the hydrodynamic radii of micelles formed by detergents differing in length by only a single CH{sub 2} group in their aliphatic tails. Subsequently, DLS was applied to investigate the distribution of hydrodynamic radii of membrane proteins and selected water-insoluble proteins in presence of detergent micelles. The results confirm that stable protein–detergent complexes were prepared for (i) bacteriorhodopsin and (ii) FetA in complex with a ligand as examples of transmembrane proteins. A fusion of maltose-binding protein and the Duck hepatitis B virus X protein was added to this investigation as an example of a non-membrane-associated protein with low water solubility. The increased solubility of this protein in the presence of detergent could be monitored, as well as the progress of proteolytic cleavage to separate the fusion partners. This study demonstrates the potential of in situ DLS to optimize solutions of protein–detergent complexes for crystallization applications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Design Status Update of the Electron-Ion Collider

The design of the electron-ion collider EIC to be constructed at Brookhaven National Laboratory has been continuously evolving towards a realistic and robust design that meets all the requirements set forth by the nuclear physics community in the White Paper. Over the past year activities have been focused on maturing the design, and on developing alternatives to mitigate risk. These include improvements of the interaction region design as well as modifications of the hadron ring vacuum system to accommodate the high average and peak beam currents. Beam dynamics studies have been performed to determine and optimize the dynamic aperture in the two collider rings and the beam-beam performance. We will present the EIC design with a focus on recent developments.

43 PARTICLE ACCELERATORS↗

Nonlinear Optimal Control of Electron Dynamics Within Hartree-Fock Theory

Consider the problem of determining the optimal applied electric field to drive a molecule from an initial state to a desired target state. For even moderately sized molecules, solving this problem directly using the exact equations of motion—the time-dependent Schrödinger equation (TDSE)—is numerically intractable. Here, we present a solution of this problem within time-dependent Hartree-Fock (TDHF) theory, a mean field approximation of the TDSE. Optimality is defined in terms of minimizing the total control effort while maximizing the overlap between desired and achieved target states. We frame this problem as an optimization problem constrained by the nonlinear TDHF equations; we solve it using trust region optimization with gradients computed via a custom-built adjoint state method. For three molecular systems, we show that with very small neural network parametrizations of the control, our method yields solutions that achieve desired targets within acceptable constraints and tolerances.

97 MATHEMATICS AND COMPUTING↗

Dynamic ADMM for Real-Time Optimal Power Flow

This paper considers distribution networks featuring distributed energy resources (DERs), and develops a dynamic optimization method to maximize given operational objectives in real time while adhering to relevant network constraints. The design of the dynamic algorithm is based on suitable linearization of the AC power flow equations, and it leverages the so-called alternating direction method of multipliers (ADMM). The steps of the ADMM, however, are suitably modified to accommodate appropriate measurements from the distribution network and the DERs. With the aid of these measurements, the resultant algorithm can enforce given operational constraints in spite of inaccuracies in the representation of the AC power flows, and it avoids ubiquitous metering to gather the state of noncontrollable resources. Optimality and convergence of the proposed algorithm are established in terms of tracking of the solution of a convex surrogate of the AC optimal power flow problem.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Dynamic ADMM for Real-Time Optimal Power Flow: Preprint

This paper considers distribution networks featuring distributed energy resources (DERs), and develops a dynamic optimization method to maximize given operational objectives in real time while adhering to relevant network constraints. The design of the dynamic algorithm is based on suitable linearizations of the AC power flow equations, and it leverages the so-called alternating direction method of multipliers (ADMM). The steps of the ADMM, however, are suitably modified to accommodate appropriate measurements from the distribution network and the DERs. With the aid of these measurements, the resultant algorithm can enforce given operational constraints in spite of inaccuracies in the representation of the AC power flows, and it avoids ubiquitous metering to gather the state of non-controllable resources. Optimality and convergence of the propose algorithm are established in terms of tracking of the solution of a convex surrogate of the AC optimal power flow problem.

24 POWER TRANSMISSION AND DISTRIBUTION↗