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 703 records · Page 39

X-ray FEL linear accelerator design via start-to-end global optimization

An X-ray Free Electron Laser (FEL) prefers using an electron beam with low emittance, small energy spread, and a high core current to generate coherent radiation through an undulator. In order to attain such a high brightness beam, the linear accelerator beam dynamics design generally involves separate photoinjector optimization and linac optimization. In this paper, we propose a new beam dynamics design strategy based on global optimization with fast start-to-end simulations from the photocathode to the end of the accelerator. The new start-to-end model significantly reduces the simulation time and makes the global optimization practical. The global optimization method avoids the need to choose a single solution based on bunch length at the injector exit for the linac optimization and helps find the solution with unfavorable bunch length at the injector exit but better phase space distribution that can result in better final electron beam phase space distribution at the entrance of the undulator. Here, using the start-to-end global optimization, we showed in an application example, with a 100 pC beam that good transverse emittance and over kilo-Ampere final core current can be attained using a photoinjector that consists of a VHF gun and boosting RF cavities.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A New Simple-to-Configure Self-Perturbing Multivariable Extremum-Seeking Controller

This paper presents a new stochastic relay-based extremum-seeking controller (ESC) for multi-input-single-output (MISO) systems. The algorithm was developed with the goal of simplifying configuration to enable easier deployment to real-world problems. A solution is developed first for a static map and then adapted for a general class of dynamic systems. The number of configurable parameters is one per input channel for the static case and only one additional parameter is needed for the dynamic version. The problem of gradient identifiability is solved via the use of stochastic relay gains and a simple stability proof for the static case is presented. Simulation tests demonstrate the performance of the strategy for optimizing both static and dynamic systems.

Salsbury, Timothy [BATTELLE (PACIFIC NW LAB)]↗

Constrained optimization framework for interface-aware sub-scale dynamics models for voids closure in Lagrangian hydrodynamics

In hydrocodes, voids are used to represent vacuum and model free boundaries between vacuum and real materials. We give a systematic description of a new treatment of void closure in the framework of the multimaterial arbitrary Lagrangian–Eulerian (ALE) methods. This includes a new formulation of the interface-aware sub-scale-dynamics (IA-SSD) closure model for multimaterial cells with voids, which is used in the Lagrangian stage of our indirect ALE scheme. The results of the comprehensive testing of the new model are presented for one- and two-dimensional multimaterial calculations in the presence of voids. Finally, we also present a sneak peek of a realistic shaped charge calculation in the presence of voids and solids.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Time Discretisation and Rate of Convergence for the Optimal Control of Continuous-Time Stochastic Systems with Delay

We study a semi-discretisation scheme for stochastic optimal control problems whose dynamics are given by controlled stochastic delay (or functional) differential equations with bounded memory. Performance is measured in terms of expected costs. By discretising time in two steps, we construct a sequence of approximating finite-dimensional Markovian optimal control problems in discrete time. The corresponding value functions converge to the value function of the original problem, and we derive an upper bound on the discretisation error or, equivalently, a worst-case estimate for the rate of convergence.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Koopman-based Differentiable Predictive Control for the Dynamics-Aware Economic Dispatch Problem

The dynamics-aware economic dispatch (DED) problem embeds low-level generator dynamics and operational constraints to enable near real-time scheduling of generation units in a power network. DED produces a more dynamic supervisory control policy than traditional economic dispatch (T-ED) that reduces overall generation costs. However, the incorporation of differential equations that govern the system dynamics makes DED an optimization problem that is computationally prohibitive to solve. In this work, we present a new data-driven approach based on differentiable programming to efficiently obtain offline parametric solutions to the underlying DED problem. In particular, we employ the recently proposed differentiable predictive control (DPC) for offline learning of explicit neural control policies based on identified Koopman operator (KO) model of the system dynamics. We demonstrate the high solution quality and five orders of magnitude computational-time savings of the DPC method over the original optimization-based DED approach on a 9-bus test power grid network.

King, Ethan↗

Management of Risk and Uncertainty Through Optimized Co-Operation of Transmission Systems and Microgrids With Responsive Loads (Final Report)

The evolution of the power system to the reliable, efficient and sustainable system of the future will involve development of both demand- and supply-side technology and operations. Ambitious national and state-level goals around the decarbonization of electricity relies on the integration of very high levels of renewable resources, most of which are variable and intermittent. The use of demand response is an ideal approach to counterbalance the intermittency of renewable generation and brings the consumer into the spotlight. Though individual consumers are interconnected at the low-voltage distribution system, these resources are typically modeled as variables at the transmission network level. Demand-side participation cannot be leveraged effectively without explicitly including the distribution system dynamics in the optimization-based wholesale market operations. This project grew from a vision for co-optimized interaction of distribution systems, or microgrids, with the high-voltage transmission system. In this framework, microgrids encompass consumers, distributed renewables and storage. The energy management system of the lower voltage system (distribution or microgrid) can also sell (buy) excess (necessary) energy from the transmission system. Until recently, very little research had been conducted on the co-optimization of these two systems due to computational limitations. However, advances in computational capabilities, and the judicious use of decomposition methods and innovative approximation methods for high-dimension dynamic programming made this goal a viable objective for this project, leading to a fundamental shift in the ability to integrate and fully utilize demand-side resources. To this end, the modeling framework developed introduces a novel co-optimization framework, to include the operations of both the transmission and distribution systems (or microgrids) in operational decision making. This framework was used to analyze renewable and distributed generation along with responsive demand and to compare the capability of co-optimized systems to perform with higher levels of variable renewables. An ideal microgrid is defined as an electric entity capable of operating in both interconnected (with the high-voltage grid) and islanded mode. As such, the microgrid should incorporate generating units (traditional units and intermittent) and if needed, exchange power with the high-voltage grid. The interplay between the microgrid and high-voltage grid motivated the development of the co-optimization approach to ensure efficient performance of the interconnected network. Results show that the use of a bi-level optimization approach is an appropriate structure, capable of co-optimizing a transmission system with multiple distribution systems and microgrids. While increasing the number of connected systems provides increasing flexibility for renewables integration this can also the economic benefits to the low-voltage subsystems with each additional system connected. Comparison of a traditional single-level decision structure with the co-optimization approach illustrates a reduction in overall system cost under co-optimization, while specific cost allocations to transmission and distribution systems are changed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗

On-line economic optimization of energy systems using weather forecast information.

We establish an on-line optimization framework to exploit weather forecast information in the operation of energy systems. We argue that anticipating the weather conditions can lead to more proactive and cost-effective operations. The framework is based on the solution of a stochastic dynamic real-time optimization (D-RTO) problem incorporating forecasts generated from a state-of-the-art weather prediction model. The necessary uncertainty information is extracted from the weather model using an ensemble approach. The accuracy of the forecast trends and uncertainty bounds are validated using real meteorological data. We present a numerical simulation study in a building system to demonstrate the developments.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Model predictive control for robust quantum state preparation

A critical engineering challenge in quantum technology is the accurate control of quantum dynamics. Model-based methods for optimal control have been shown to be highly effective when theory and experiment closely match. Consequently, realizing high-fidelity quantum processes with model-based control requires careful device characterization. In quantum processors based on cold atoms, the Hamiltonian can be well-characterized. For superconducting qubits operating at milli-Kelvin temperatures, the Hamiltonian is not as well-characterized. Unaccounted for physics (i.e., mode discrepancy), coherent disturbances, and increased noise compromise traditional model-based control. This work introduces model predictive control (MPC) for quantum control applications. MPC is a closed-loop optimization framework that (i) inherits a natural degree of disturbance rejection by incorporating measurement feedback, (ii) utilizes finite-horizon model-based optimizations to control complex multi-input, multi-output dynamical systems under state and input constraints, and (iii) is flexible enough to develop synergistically alongside other modern control strategies. We show how MPC can be used to generate practical optimized control sequences in representative examples of quantum state preparation. Specifically, we demonstrate for a qubit, a weakly-anharmonic qubit, and a system undergoing crosstalk, that MPC can realize successful model-based control even when the model is inadequate. These examples showcase why MPC is an important addition to the quantum engineering control suite.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bayesian blacksmithing: discovering thermomechanical properties and deformation mechanisms in high-entropy refractory alloys

Finding alloys with specific design properties is challenging due to the large number of possible compositions and the complex interactions between elements. This study introduces a multi-objective Bayesian optimization approach guiding molecular dynamics simulations for discovering high-performance refractory alloys with both targeted intrinsic static thermomechanical properties and also deformation mechanisms occurring during dynamic loading. The objective functions are aiming for excellent thermomechanical stability via a high bulk modulus, a low thermal expansion, a high heat capacity, and for a resilient deformation mechanism maximizing the retention of the BCC phase after shock loading. Contrasting two optimization procedures, we show that the Pareto-optimal solutions are confined to a small performance space when the property objectives display a cooperative relationship. Conversely, the Pareto front is much broader in the performance space when these properties have antagonistic relationships. Density functional theory simulations validate these findings and unveil underlying atomic-bond changes driving property improvements.

36 MATERIALS SCIENCE↗

Exploring the Origins of Anti-Ambipolarity in BBL Polymer: Links to Redox Chemistry, Electronic Structure, and Structural Dynamics

We examine the intrinsic physical-chemical properties of the conjugated ladder-type polymer poly(benzimidazobenzophenanthroline) (BBL) in response to electron transfer. We aim at explaining the origin of the anti-ambipolar behavior behind the observed BBL nonlinear response associated with specific device architectures. To elucidate this point, we use theory and computation based on first principles, including density functional theory optimizations, ab initio molecular dynamics, time-dependent DFT, and Marcus-theory analysis. Our results reveal that this redox response is not simply monotonic but follows an alternating odd/even pattern in which gap narrowing and reopening occur sequentially before near-gapless behavior emerges at high charging. Converging theoretical evidence in this work demonstrates that bell shaped conductivity in BBL originates in its fundamental electronic structure and supramolecular organization.

FOS: Physical sciences↗

Optimizing the FEDVR-TDCC Code for Exploring the Quantum Dynamics of Two-Electron Systems in Intense Laser Pulses

To efficiently solve the three-dimensional (3D) time-dependent linear and nonlinear Schrödinger equation, we have developed a large-scale parallel code RSP-FEDVR [B. I. Schneider, L. A. Collins, and S. X. Hu, Phys. Rev. E 73, 036708 (2006)], which combines the finite-element discrete variable representation (FEDVR) with the real-space product algorithm. Using the similar algorithm, we have derived an accurate approach to solve the time-dependent close-coupling (TDCC) equation for exploring two-electron dynamics in linearly polarized intense laser pulses. However, when the number N of partial waves used for the TDCC expansion increases, the FEDVR-TDCC code unfortunately slows down, because the potential-matrix operation scales as ~O(N^2). In this paper, we show that the full potential-matrix operation can be decomposed into a series of small-matrix operations utilizing the sparse property of the N N potential matrix. Such optimization speeds up the FEDVR-TDCC code by an order of magnitude for N=256. This may facilitate the ultimate solution to the 3D two-electron quantum dynamics in ultrashort intense optical laser pulses, where a large number of partial waves are required.

Hu, S X↗

On the existence of the optimal order for wavefunction extrapolation in Born-Oppenheimer molecular dynamics

Wavefunction extrapolation greatly reduces the number of self-consistent field (SCF) iterations and thus the overall computational cost of Born-Oppenheimer molecular dynamics (BOMD) that is based on the Kohn–Sham density functional theory. Going against the intuition that the higher order of extrapolation possesses a better accuracy, we demonstrate, from both theoretical and numerical perspectives, that the extrapolation accuracy firstly increases and then decreases with respect to the order, and an optimal extrapolation order in terms of minimal number of SCF iterations always exists. We also prove that the optimal order tends to be larger when using larger MD time steps or more strict SCF convergence criteria. By example BOMD simulations of a solid copper system, we show that the optimal extrapolation order covers a broad range when varying the MD time step or the SCF convergence criterion. Therefore, we suggest the necessity for BOMD simulation packages to open the user interface and to provide more choices on the extrapolation order. Another factor that may influence the extrapolation accuracy is the alignment scheme that eliminates the discontinuity in the wavefunctions with respect to the atomic or cell variables. We prove the equivalence between the two existing schemes, thus the implementation of either of them does not lead to essential difference in the extrapolation accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Towards a self-driving trigger at the LHC: adaptive response in real time

Real-time data filtering and selection—or trigger—systems at high-throughput scientific facilities such as the experiments at the Large Hadron Collider must process extremely high-rate data streams under stringent bandwidth, latency, and storage constraints. Yet these systems are typically designed as static, hand-tuned menus of selection criteria grounded in prior knowledge and simulation. In this work, we further explore the concept of a self-driving trigger, an autonomous data-filtering framework that reallocates resources and adjusts thresholds dynamically in real-time to optimize signal efficiency, rate stability, and computational cost as instrumentation and environmental conditions evolve. We introduce a benchmark ecosystem to emulate realistic collider scenarios and demonstrate real-time optimization of a menu including canonical energy sum triggers as well as modern anomaly-detection algorithms that target non-standard event topologies using machine learning. Using simulated data streams and publicly available collision data from the Compact Muon Solenoid experiment, we demonstrate the capability to dynamically and automatically optimize trigger performance under specific cost objectives without manual retuning. Our adaptive strategy shifts trigger design from static menus with heuristic tuning to intelligent, automated, data-driven control, unlocking greater flexibility and discovery potential in future high-energy physics analyses.

Emami, Shaghayegh [Michigan U.] (ORCID:00090007589↗