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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Spatial-Temporal Synchrophasor Data Characterization and Analytics in Smart Grid Fault Detection, Identification, and Impact Causal Analysis

An approach of big data characterization for smart grids (SGs) and its applications in fault detection, identification, and causal impact analysis is proposed in this paper, which aims to provide substantial data volume reduction while keeping comprehensive information from synchrophasor measurements in spatial and temporal domains. Especially, based on secondary voltage control (SVC) and local SG observation algorithm, a two-layer dynamic optimal synchrophasor measurement devices selection algorithm (OSMDSA) is proposed to determine SVC zones, their corresponding pilot buses, and the optimal synchrophasor measurement devices. Combining the two-layer dynamic OSMDSA and matching pursuit decomposition, the synchrophasor data is completely characterized in the spatial-temporal domain. To demonstrate the effectiveness of the proposed characterization approach, SG situational awareness is investigated based on hidden Markov model based fault detection and identification using the spatial-temporal characteristics generated from the reduced data. To identify the major impact buses, the weighted Granger causality for SGs is proposed to investigate the causal relationship of buses during system disturbance. The IEEE 39-bus system and IEEE 118-bus system are employed to validate and evaluate the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Autonomous alloy composition optimization using molecular dynamics guided by a large language model

Here, we present an autonomous materials discovery framework that couples a large language model (LLM) with molecular dynamics (MD) simulations to optimize Fe–Cr–Mn alloy compositions for tensile strength. Starting from six distinct compositions, the LLM operated as an intelligent agent, iteratively proposing changes based on prior simulation results and constraints. Over 50 iterations per case, the LLM adaptively explored the composition space, identifying high-strength regions, not easily accessible by conventional methods. The highest strength, 18.7 GPa, was achieved with Fe 71 Cr 25 Mn 4 composition, identified from a Fe 75 Cr 20 Mn 5 starting point. The LLM autonomously adjusted its strategy in real time, demonstrating closed-loop decision-making using commodity hardware. This approach showcases the potential of LLMs as scientific co-pilots, capable of accelerating materials discovery and generalizable to other domains like biology and drug design.

Autonomy↗
DOE OSTI2025

On optimal control of hybrid dynamical systems using complementarity constraints

Optimal control for switch-based dynamical systems is a challenging problem in the process control literature. In this study, we model these systems as hybrid dynamical systems with finite number of unknown switching points and reformulate them using non-smooth and non-convex complementarity constraints as a mathematical program with complementarity constraints (MPCC). We utilize a moving finite element based strategy to discretize the differential equation system to accurately locate the unknown switching points at the finite element boundary and achieve high-order accuracy at intermediate non-collocation points. We propose a globalization approach to solve the discretized MPCC problem using a mixed NLP/MILP-based strategy to converge to a non-spurious first-order optimal solution. The method is tested on three dynamic optimization examples, including a gas–liquid tank model and an optimal control problem with a sliding mode solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Binary optimal control by trust-region steepest descent

Abstract We present a trust-region steepest descent method for dynamic optimal control problems with binary-valued integrable control functions. Our method interprets the control function as an indicator function of a measurable set and makes set-valued adjustments derived from the sublevel sets of a topological gradient function. By combining this type of update with a trust-region framework, we are able to show by theoretical argument that our method achieves asymptotic stationarity despite possible discretization errors and truncation errors during step determination. To demonstrate the practical applicability of our method, we solve two optimal control problems constrained by ordinary and partial differential equations, respectively, and one topological optimization problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Model-Free Primal-Dual Methods for Network Optimization with Application to Real-Time Optimal Power Flow

This paper examines the problem of real-time optimization of networked systems and develops online algorithms that steer the system towards the optimal trajectory without explicit knowledge of the system model. The problem is modeled as a dynamic optimization problem with time-varying performance objectives and engineering constraints. The design of the algorithms leverages the online zero-order primal-dual projected-gradient method. In particular, the primal step that involves the gradient of the objective function (and hence requires a networked systems model) is replaced by its zero-order approximation with two function evaluations using a deterministic perturbation signal. The evaluations are performed using the measurements of the system output, hence giving rise to a feedback interconnection, with the optimization algorithm serving as a feedback controller. The paper provides some insights on the stability and tracking properties of this interconnection. Finally, the paper applies this methodology to a real-time optimal power flow problem in power systems, and shows its efficacy on the IEEE 37-node distribution test feeder for reference power tracking and voltage regulation.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2020

Model-Free Primal-Dual Methods for Network Optimization with Application to Real-Time Optimal Power Flow: Preprint

This paper examines the problem of real-time optimization of networked systems and develops online algorithms that steer the system towards the optimal trajectory without explicit knowledge of the system model. The problem is modeled as a dynamic optimization problem with time-varying performance objectives and engineering constraints. The design of the algorithms leverages the online zero-order primal-dual projected-gradient method. In particular, the primal step that involves the gradient of the objective function (and hence requires networked systems model) is replaced by its zero-order approximation with two function evaluations using a deterministic perturbation signal. The evaluations are performed using the measurements of the system output, hence giving rise to a feedback interconnection, with the optimization algorithm serving as a feedback controller. The paper provides some insights on the stability and tracking properties of this interconnection. Finally, the paper applies this methodology to a real-time optimal power flow problem in power systems, and shows its efficacy on the IEEE 37-node distribution test feeder for reference power tracking and voltage regulation.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2020

Efficient optimization method for finding minimum energy paths of magnetic transitions

Here, efficient algorithms for the calculation of minimum energy paths of magnetic transitions are implemented within the geodesic nudged elastic band (GNEB) approach. While an objective function is not available for GNEB and a traditional line search can, therefore, not be performed, the use of limited memory Broyden–Fletcher–Goldfarb–Shanno (LBFGS) and conjugate gradient algorithms in conjunction with orthogonal spin optimization (OSO) approach is shown to greatly outperform the previously used velocity projection and dissipative Landau–Lifschitz dynamics optimization methods. The implementation makes use of energy weighted springs for the distribution of the discretization points along the path and this is found to improve performance significantly. The various methods are applied to several test problems using a Heisenberg-type Hamiltonian, extended in some cases to include Dzyaloshinskii–Moriya and exchange interactions beyond nearest neighbours. Minimum energy paths are found for magnetization reversals in a nano-island, collapse of skyrmions in two-dimensional layers and annihilation of a chiral bobber near the surface of a three-dimensional magnet. The LBFGS-OSO method is found to outperform the dynamics based approaches by up to a factor of 8 in some cases.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Optimize heat prosumers' economic performance under current heating price models by using water tank thermal energy storage

Due to heat prosumers' dual roles of heat producer and heat consumer, the future district heating (DH) systems will become more flexible and competitive. However, the current heating price models have not yet supported the reverse heat supply from prosumers to the central DH system, which means the prosumers would gain no economic benefit from supplying heat to the central DH system. These unidirectional heating price models will reduce interest in prosumers, and thus hinder the promotion of prosumers in DH systems. This study aimed to optimize prosumers' economic performance under the current heating price models by introducing water tank thermal energy storage (WTTES). A dynamic optimization problem was formulated to explore prosumers' economic potentials. The size parameter of WTTESs was swept in prosumers to obtain the optimal storage size considering the trade-off between the payback period and the heating cost saving. The proposed method was tested on a campus DH system in Norway. The results showed that the prosumer's annual heating cost was saved up to 9%, and the investment of WTTES could be recovered in less than ten years. This study could provide guidelines on improving prosumers' economic performance and promote the development of prosumers during the transformation period of DH systems.

Li, H↗
DOE OSTI2023

Energy-efficient cooperative resource allocation and task scheduling for Internet of Things environments

Offloading Internet of Things (IoT) tasks to the cloud for further processing might not always lead to an optimal execution time, particularly in situations such as resource contention, under-provisioning, over-provisioning, and fragmentation. In addition, dynamically optimizing the number of Virtual Machines (VMs) for resource scheduling in order to meet application requirements remains a major research challenge. Further, existing resource scheduling algorithms focus primarily on minimizing operational costs while maximizing resource sharing and utilization. Considering energy utilization as part of the resource allocation and scheduling process as an optimization objective for maintaining load balancing has often been neglected. To address these challenges and more, we propose a cooperative energy-aware resource allocation and scheduling strategy based on a Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) multi-criteria decision-making method. Here we used the Grid Workloads Archive dataset to evaluate our proposed approach named TOPREAL. Experimental results with respect to the allocation of VM resources when considering processing a large segment of tasks indicate that TOPREAL outperforms existing algorithms in terms of energy savings, with an average improvement of 40.25%, while maintaining an average improvement of 16.21% when it comes to execution time. Results also demonstrate that our method can save an average of 78.06 processing hours and 63,215kJ of energy when compared to existing scheduling algorithms. These results demonstrate the effectiveness of our proposed model and the viability of using multi-criteria decision-making techniques such as TOPSIS to solve the resource allocation and scheduling problem in edge environments.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

Solid State Power Substation DC Node Optimization and Controller Hardware-In-The-Loop Demonstration

A solid state power substation (SSPS) node is a microgrid that integrates distributed energy resources and loads and injects/absorbs power to/from the SSPS distribution network. It is an essential building block of a futuristic distribution grid network. This paper presents the development and demonstration of optimization use cases of a SSPS DC node. By adopting multi-layer hierarchical control architecture and developing automatic device identification and dynamic optimization formulation algorithms, the SSPS DC node can perform plug-and-play resource integration and seamless transition of the optimized node operation under on and off grid condition without sophisticated algorithms, control mode changes, and user interactions. Four optimization use cases including economic dispatches with price signal changes, a sudden PV power drop, and a single directional meter and its associated costs with sending power back to the grid, and resiliency under a grid inverter trip condition were demonstrated through the real-time controller hardware-in-the-loop simulation.

Kim, Namwon↗
DOE OSTI2018

Dynamic Investment and Counterparty Risk

We introduce a dynamic optimization framework in which collateral is used to mitigate losses arising at counterparty’s default. The investor faces two sources of risk: the default risk of the entity referencing the traded credit swap security, and counterparty risk generated from the default event of the trading counterparty. We show that the value function of the control problem coincides with the classical solution of a nonlinear dynamic programming equation. We provide an explicit characterization of the optimal investment strategy, and show that the investor does not trade if counterparty risk is sufficiently high. These findings suggest that moving credit swap trades into well-designed clearinghouses may stimulate economic activities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

A unifying modeling abstraction for infinite-dimensional optimization

Infinite-dimensional optimization (InfiniteOpt) problems involve modeling components (variables, objectives, and constraints) that are functions defined over infinite-dimensional domains. Examples include continuous-time dynamic optimization (time is an infinite domain and components are functions of time), PDE optimization problems (space and time are infinite domains and components are functions of space-time), as well as stochastic and semi-infinite optimization (random space is an infinite domain and components are a function of such random space). InfiniteOpt problems also arise from combinations of these problem classes (e.g., stochastic PDE optimization). Given the infinite-dimensional nature of objectives and constraints, one often needs to define appropriate quantities (measures) to properly pose the problem. Moreover, InfiniteOpt problems often need to be transformed into a finite dimensional representation so that they can be solved numerically. Here in this work, we present a unifying abstraction that facilitates the modeling, analysis, and solution of InfiniteOpt problems. The proposed abstraction enables a general treatment of infinite-dimensional domains and provides a measure-centric paradigm to handle associated variables, objectives, and constraints. This abstraction allows us to transfer techniques across disciplines and with this identify new, interesting, and useful modeling paradigms (e.g., event constraints and risk measures defined over time domains). Our abstraction serves as the backbone of an intuitive Julia-based modeling package that we call InfiniteOpt.jl. We demonstrate the developments using diverse case studies arising in engineering.

42 ENGINEERING↗
DOE OSTI2017

MULTI-OBJECTIVE ONLINE OPTIMIZATION OF BEAM LIFETIME AT APS

In this paper, online optimization of beam lifetime at the APS (Advanced Photon Source) storage ring is presented. A general genetic algorithm (GA) is developed and employed for some online optimizations in the APS storage ring. Sextupole magnets in 40 sectors of the APS storage ring are employed as variables for the online nonlinear beam dynamics optimization. The algorithm employs several optimization objectives and is designed to run with topup mode or beam current decay mode. Up to 50\% improvement of beam lifetime is demonstrated, without affecting the transverse beam sizes and other relevant parameters. In some cases, the top-up injection efficiency is also improved.

APS↗
DOE OSTI2022

Near-wake dynamics of a vertical-axis turbine

Cross-flow, or vertical-axis, turbines are a promising technology for capturing kinetic energy in wind or flowing water and their inherently unsteady fluid mechanics present unique opportunities for control optimization of individual rotors or arrays. To explore the potential for beneficial interactions between turbines in an array, as well as to characterize important cycle-to-cycle variations, coherent structures in the wake of a single two-bladed cross-flow turbine are examined using planar stereo particle image velocimetry in a water channel experiment. There are three main objectives in the present work. First, the mean wake structure of this high chord-to-radius ratio rotor is described, compared with previous studies, and a simple explanation for observed wake deflection is presented. Second, the unsteady flow is then analysed via the triple decomposition, with the periodic component extracted using a combination of traditional techniques and a novel implementation of the optimized dynamic mode decomposition. The latter method is shown to outperform conditional averaging and Fourier methods, as well as uncover frequencies suggesting a transition to bluff-body shedding in the far wake. Third, vorticity and finite-time Lyapunov exponents are then employed to further analyse the oscillatory wake component. Vortex streets on both sides of the wake are identified, and their formation mechanisms and effects on the mean flow are discussed. Strong axial (vertical) flow is observed in vortical structures shed on the retreating side of the rotor where the blades travel downstream. Time-resolved tracking of these vortices is performed, which demonstrates that vortex trajectories have significant rotation-to-rotation variation within one diameter downstream. This variability suggests it would be challenging to harness or avoid such structures at greater downstream distances.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Advances in global optimization of high brightness beams

High brightness electron beams play an important role in accelerator-based applications such as driving X-ray free electron laser (FEL) radiation.Here in this paper, we report on advances in global beam dynamics optimization of an accelerator design using start-to-end simulations and a new parallel multi-objective differential evolution optimization method. The global optimization results in significant improvement of the final electron beam brightness.

43 PARTICLE ACCELERATORS↗
DOE OSTI2019

Real-Time Analysis and Signal Optimization for Charge Detection Mass Spectrometry

Charge detection mass spectrometry (CDMS) is an important tool for measuring mass distributions for high mass samples and heterogeneous mixtures. In CDMS, single ions are trapped and their m/z and charge are measured simultaneously. As a single particle technique, the average signal must be optimized to maximize the number of single ion trapping events. If the average signal is too small, most of the trapping events will be empty, and if the average signal is too large, most of the trapping events will contain multiple ions. In recent embodiments, the time domain signal from the trapped ion is analyzed by fast Fourier transforms. The analysis time is much longer that the data collection time which precludes real-time optimization of the experimental conditions. In this paper, we describe the implementation of CDMS with real-time analysis. Processing the data in real time allows the average signal intensities to be dynamically optimized to maximize the number of single ion trapping events. Real-time analysis also allows the experimental settings to be optimized in a timely manner to target specific mass regimes to maximize the useful information content of the measurements. .

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

Tree tensor network hierarchical equations of motion based on time-dependent variational principle for efficient open quantum dynamics in structured thermal environments

In this work, we introduce an efficient method, TTN-HEOM, for exactly calculating the open quantum dynamics for driven quantum systems interacting with highly structured bosonic baths by combining the tree tensor network (TTN) decomposition scheme with the bexcitonic generalization of the numerically exact hierarchical equations of motion (HEOM). The method yields a series of quantum master equations for all core tensors in the TTN that efficiently and accurately capture the open quantum dynamics for non-Markovian environments to all orders in the system–bath interaction. These master equations are constructed based on the time-dependent Dirac–Frenkel variational principle, which isolates the optimal dynamics for the core tensors given the TTN ansatz. The dynamics converges to the HEOM when increasing the rank of the core tensors, a limit in which the TTN ansatz becomes exact. We introduce TENSO, tensor equations for non-Markovian structured open systems, as a general-purpose Python code to propagate the TTN-HEOM dynamics. We implement three general propagators for the coupled master equations: two fixed-rank methods that require a constant memory footprint during the dynamics and one adaptive-rank method with a variable memory footprint controlled by the target level of computational error. We exemplify the utility of these methods by simulating a two-level system coupled to a structured bath containing one Drude–Lorentz component and eight Brownian oscillators, which is beyond what can presently be computed using the standard HEOM. Our results show that the TTN-HEOM is capable of simulating both dephasing and relaxation dynamics of driven quantum systems interacting with structured baths, even those of chemical complexity, with an affordable computational cost.

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

High-performance epistasis detection in quantitative trait GWAS

epiSNP is a program for identifying pairwise single nucleotide polymorphism (SNP) interactions (epistasis) in quantitative-trait genome-wide association studies (GWAS). A parallel MPI version (EPISNPmpi) was created in 2008 to address this computationally expensive analysis on large data sets with many quantitative traits and SNP markers. However, the falling cost of genotyping has led to an explosion of large-scale GWAS data sets that challenge EPISNPmpi’s ability to compute results in a reasonable amount of time. Therefore, we optimized epiSNP for modern multi-core and highly parallel many-core processors to efficiently handle these large data sets. This paper describes the serial optimizations, dynamic load balancing using MPI-3 RMA operations, and shared-memory parallelization with OpenMP to further enhance load balancing and allow execution on the Intel Xeon Phi coprocessor (MIC). For a large GWAS data set, our optimizations provided a 38.43× speedup over EPISNPmpi on 126 nodes using 2 MICs on TACC’s Stampede Supercomputer. We also describe a Coarray Fortran (CAF) version that demonstrates the suitability of PGAS languages for problems with this computational pattern. We show that the Coarray version performs competitively with the MPI version on the NERSC Edison Cray XC30 supercomputer. Finally, the performance benefits of hyper-threading for this application on Edison (average 1.35× speedup) are demonstrated.

97 MATHEMATICS AND COMPUTING↗