Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimal scheduling”

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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

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

Solving the Dynamics-Aware Economic Dispatch Problem with the Koopman Operator

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, in contrast to T-ED, DED is a nonlinear, non-convex optimization problem that is computationally prohibitive to solve. We introduce a machine learning-based operator-theoretic approach for solving the DED problem efficiently. Specifically, we develop a novel discrete-time Koopman Operator (KO) formulation that embeds domain information into the structure of the KO to learn high-fidelity approximations of the generator dynamics. Using the KO approximation, the DED problem can be reformulated as a computationally tractable linear program (abbreviated DED-KO). We demonstrate the high solution quality and computational-time savings of the DED-KO model over the original DED formulation on a 9-bus test system.

King, Ethan↗
DOE OSTI2021

Deep Reinforcement Scheduling of Energy Storage Systems for Real-time Voltage Regulation in Unbalanced LV Networks with High PV Penetration

The ever-growing higher penetration of distributed energy resources (DERs) in low-voltage (LV) distribution systems brings both opportunities and challenges to voltage support and regulation. This paper proposes a deep reinforcement learning (DRL)-based scheduling scheme of energy storage systems (ESSs) to mitigate system voltage deviations in unbalanced LV distribution networks. The ESS-based voltage regulation problem is formulated as a multi-stage quadratic stochastic program, with the objective of minimizing the expected total daily voltage regulation cost while satisfying operational constraints. While existing voltage regulation methods are mostly focused on onetime- step control, this paper explores a day-horizon systemwide voltage regulation problem. In other words, the size of action and state spaces are extremely high-dimensional and need to be delicately handled. Furthermore, in order to overcome the difficulty of modeling uncertainties and develop a realtime solution, a learn-to-schedule feedback control framework is proposed by adapting the problem to a model-free DRL setting. The proposed algorithm is tested on a customized 6-bus system and a modified IEEE 34-bus system. Simulation results validate the effectiveness and near-optimality of voltage regulation by ESS in comparison with a deterministic quadratic program solution.

Wang, Shengyi↗
DOE OSTI2023

O’Hare Airport Short-Term Ground Transportation Modal Demand Forecast Using Gaussian Processes

Here, the principal objective of this study is to analyze the spatial and temporal variation of ground transportation airport demand and provide demand forecast to inform planning capability and explore alternatives for investments to accommodate airport growth. Because of its good adaptability and strong generalization ability for dealing with high-dimensional input, small-sample, and nonlinear spatial data, Gaussian process (GP) regression is used to provide forecast estimates using data from transportation network company (TNC) trips and urban rail passengers at Chicago's O'Hare International Airport. TNC airport trips differ significantly, with three times more distance, more than twice the travel time, and half of the share requests compared with nonairport trips. This highlights the need for separate demand models. Hourly analysis of the rail service indicates that this is likely heavily used by airport workers, whereas TNC services focus on travelers because of variations in the peak demand hours. Heteroscedastic GP regression is implemented because of differences in trip variance between night and day hours. Estimates are given for weekdays and weekend trips, and the 95% confidence intervals are calculated. The introduction of flight schedule information into the models shows marginal improvements in their performance. However, fitting a GP regression becomes computationally expensive with increased sample size and the introduction of spatial components. Transportation planners and policymakers can use the results and methods implemented in this study to optimize transportation assets and provide long-range simulations of the current and future conditions in the area.

42 ENGINEERING↗
DOE OSTI2020

Accelerating Parallel Applications in Cloud Platforms via Adaptive Time-Slice Control

Cloud platforms can provide flexible and cost-effective environments for parallel applications. However, the resource over-commitment issues, i.e., cloud providers often provide much more executable virtual CPUs than available physical CPUs, still impede the synchronization operations of parallel applications, causing severe performance degradation. Existing methods optimize parallel applications by promoting the priorities of involved VMs. They cannot fully explore the performance of parallel applications, because they ignore the time-slice requirements of different phases of parallel applications. Furthermore, non-parallel applications experience unsatisfied performance because of low scheduling priorities. Given empirical analysis on time-slices of virtual machines (VMs), we find that shortening time-slices can mitigate synchronization overhead which incurs during communication phases, while over-short time-slices cause frequent cache misses in computation phases. Accordingly, we propose an Adaptive Time-slice Control (ATC) mechanism. ATC first detects the phases of parallel applications based on lock latency or cache misses. Then, ATC shortens time-slices during communication phases and prolongs time-slices during computation phases for parallel applications, and sets a uniform time-slice for non-parallel applications. Finally, we evaluate ATC using seven well-known benchmarks with 25+ applications. Experiments show that ATC obtains 1.5-75x performance gain for running parallel applications than state-of-the-art solutions, with nearly unaffected impact on non-parallel applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Towards Optimal and Executable Distribution Grid Restoration Planning With a Fine-Grained Power-Communication Interdependency Model

Distribution service restoration (DSR) under natural disasters is always a critical and challenging problem for utility companies. An effective solution must not ignore the power-communication interdependency as various systems are getting increasingly connected in the Smart Grid era. In this paper, we propose a two-layer distribution system model with both power and communication components. Based on this model, we formulate the restoration process as a routing problem that schedules the path and action sequence of utility crews that involves repairing damaged components, closing power switches, and enabling communication paths between the control center and remote field devices. Further, we develop a simulation-based method to quantitatively evaluate the restoration process with public reference models of large-scale power systems. The experimental results show that our method improves the total restored energy up to 57.6% and reduces the recovery time up to 63% by considering the power-communication interdependency.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Stochastic Unit Commitment: Model Reduction via Learning

As weather-dependent renewable generation increases its share in the generation mix of most electric energy systems, a stochastic unit commitment becomes the natural day-ahead scheduling tool. However, such a tool is generally computationally intractable if a detailed uncertainty description is considered. Taking this into account, we proposed a learning method to make the stochastic unit commitment problem tractable. Here, recent advances in statistical learning and machine learning to address optimization problems can be advantageously applied to the rather intractable stochastic unit commitment problem. Considering these advances, we explore simple learning techniques to drastically reduce the size of a stochastic unit commitment problem without significantly altering its optimal solution. The considered stochastic unit commitment problem is formulated as a two-stage stochastic programming problem. The first stage represents commitment decisions, while the second one represents the operation conditions under different scenarios. Taking into account historical solved instances (or proxies for them), we reduce the size (measured by numbers of constraints and variables) of the stochastic unit commitment problem by (i) fixing unchanged binary variables and by (ii) eliminating inactive inequality constraints. Our numerical results show that the reduced problem generally requires significantly less time to solve while obtaining high-quality solutions, which are very close to or indistinguishable from the one obtained by solving the original problem. We use an Illinois 200-bus system to illustrate and characterize the performance of the proposed problem-reduction method.

42 ENGINEERING↗
DOE OSTI2021

Estimating the value of jointly optimized electric power generation and end use: a study of ISO-scale load shaping applied to the residential building stock

A generation-to-load simulation estimated the impact, in terms of production costs and CO2 emissions, attributable to the joint optimization of electric power generation and flexible end uses to support increasing penetrations of renewable energy. Newly conceived, evaluated, and foundational in developing a U.S. National Standard was a transaction-less yet continuous demand response system based on a day-ahead optimum load shape (OLS) designed to encourage Internet-connected devices to autonomously and voluntarily explore options to favour lowest cost generators - without requiring two-way communications, personally identifiable information, or customer opt-in. Boundary conditions used for model calibration included historical weather, residential building stock construction attributes, home appliance and device empirical operating schedules, prototypical power distribution feeder models, thermal generator heat rates, startup and ramping constraints, and fuel costs. Results of an hourly-based annual case study of Texas indicate a 1/3 reduction in production costs and a 1/5 reduction in CO2 emissions are possible.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Application of real‐time nonlinear model predictive control for wave energy conversion

Abstract This article presents an approach to implement a Nonlinear Model Predictive Controller (NMPC) in real‐time with a non‐standard cost index. The proposed technique's applications are presented to maximize the energy produced by a Wave Energy Converter (WEC) when the cost index is a non‐quadratic piecewise discontinuous functional of some design variables. The presented framework is based on pseudo‐quadratisation and weight scheduling, which is implemented using the ACADO toolkit for MATLAB/Simulink. The proposed strategy features code generation and deployment on the real‐time target machines for industrial applications. The simulations and experiments confirm the success of the proposed approach in achieving the feasible operation of the NMPC and an optimal power capture by the wave energy converters.

16 TIDAL AND WAVE POWER↗
DOE OSTI2023

Advanced Anti-Fouling Coatings to Improve the Efficiency of Coal Power Plants

As the total cost of carbon to generate energy has become a global concern, operators are increasingly looking at all parts of the generation cycle to find areas where efficiency gains may be found. It has been long identified that fouling of heat exchangers is a persistent cause of up to 2.5% of global CO 2 emissions. Unfortunately, practice has also demonstrated that unless a powerful economic driver exists to encourage preemptive mitigation of fouling, there will always be a strong tendency for operators to minimize any form of intervention due to high costs and challenges in scheduling downtime. The objective of this proposed research effort was to demonstrate how existing power plants could lower their carbon emissions and significantly improve heat transfer efficiency using new surface treatment materials to control fouling in a variety of heat exchange equipment. The surface treatment material which was optimized and deployed in this effort is now known commercially as HeatX. It is a low-surface energy, water- and oil-repellent, abrasion resistant material which can be applied in-situ to a wide variety of previously worn/used/in-service substrates. Once applied, it provides a barrier against corrosion, scale deposit formation, and biofilm adhesion on the circulating water-containing tube-side. Alternatively, if applied to the tube exterior, the non-wetting nature of the surface was demonstrated to promote dropwise condensation, subsequently lowering condenser backpressure and increasing overall plant efficiency. As part of this cooperative effort, the Department of Energy’s support was crucial to de-risk and demonstrate the concept of HeatX, while validating both the performance and economic benefit in multiple pilot field studies. The HeatX material properties were optimized in this effort for full field applicability to heat exchangers and condensers, and Oceanit developed the necessary procedures and protocols to provide enough material to support extended length, multi-year demonstrations in the power generation, desalination, and refining industries, making this technology broadly applicable and ready for commercial transition. Field deployment case studies at thermal power plants have shown that the HeatX treatment can provide economic savings of up to $15,000 per day for an operator based on avoiding maintenance costs and lowering fuel usage. The complete mitigation of fouling effects can increase the efficiency of equipment by up to 7%, in a field where gains of 0.5% are generally seen as operationally significant. The HeatX treatment has also demonstrated exceptional lifetime and compatibility with a wide variety of seawater and hydrocarbon environments, further increasing both the return on investment and the effective emission reduction. Such efficiency improvements correlate to massive carbon savings. For every 1 GW of capacity, operators can see carbon emissions reductions of 300,000 tons of CO 2 per year. When looking at the bigger picture, improved condenser function across the U.S. has the potential to prevent 221.3 million tons of CO 2 emissions, equivalent to the sequestration capacity of 129 million acres of forest. If applied on a global scale, 1.26 billion metric tons of CO 2 could be averted from the atmosphere, the same amount of carbon sequestrated by 1.5 billion acres of forest annually or 262,000 wind turbines operating annually. As businesses across multiple industries take a more active role in focusing on environmental, social, and governance (ESG) solutions as part of their core business operations, HeatX will be an attractive technology for commercial investment.

01 COAL, LIGNITE, AND PEAT↗
DOE OSTI2023

Thermo-Hydrological Modeling of Thermal Energy Storage in a Depleted Oil Reservoir

Thermal energy storage in oil and gas reservoirs leverages the existing surface and subsurface infrastructure, which can pave the way for economic production of geothermal energy. Existing studies on geothermal energy storage are focused mostly on the use of aquifers with more homogeneous rock and fluid properties. Coupling of heat and fluid flow in a multiphase-multicomponent system, such as an oil reservoir, is imperative especially if existing oil field assets need to be repurposed as required for a sustainable energy transition. The objective is to model the subsurface thermo-hydrological processes associated with reservoir performance and operational sustainability. The model evaluates formation pressure and temperature within the reservoir and at the injection/production wells during multiple charge and discharge cycles. Hot water (approximately 200 degrees C) heated by Concentrating Solar Power (CSP) at high pressure is injected into the existing oil reservoir for storage and produced as thermal energy for power generation, which will be accompanied by enhanced oil recovery. To demonstrate the coupled fluid and heat flow during the injection/production cycle in the subsurface reservoir, TOUGH3 (developed by Berkeley Lab) is used to simulate the thermo-hydrological (TH) processes in a multiphase, multicomponent system. Two well geometries are considered within the reservoir grid: 1) a single-well huff-n-puff system (same well is used for injection and production), and 2) an isolated injection-production well doublet. Seasonal charge and discharge cycling are implemented based on the scheduling specified in the model input file. The model reports pressure, temperature, enthalpy, liquid fluxes, heat fluxes, pore velocities, and changes in porosity & permeability due to temperature and pressure variations during the cyclic Reservoir Thermal Energy Storage (RTES) operations. The results from the simulations can be used to optimize the operational parameters (such as well spacing and injection/production rates) and round-trip efficiency for surface power-plants coupled with thermal energy storage over time. They can also serve as important inputs for levelized cost of storage estimations. The research will help to design and integrate surface renewable energy sources, such as concentrating solar power (CSP), with RTES to help balance out power supply and demand on the grid.

CSP↗
DOE OSTI2023

Machine learning–assisted prediction of heat fluxes through thermally anisotropic building envelopes

Thermally anisotropic building envelope (TABE) is a novel active building envelope that can save energy use to maintain thermal comfort in buildings by redirecting heat and coolness from building envelopes to thermal loops. Finite element models (FEMs) can be used to compute the heat fluxes through TABEs, but the high computational cost of finite element simulations has prevented parametric studies and design optimizations. This paper proposes a domain knowledge–informed, finite element–based machine learning framework to reduce the computation cost for the energy management of buildings installed with TABE that uses a ground thermal loop. First, the training heat flux data set was generated by FEM simulations with different thermal loop schedules. Then, both shallow learning models (i.e., multivariate linear regression and eXtreme Gradient Boost, or XGBoost) and a deep learning model (i.e., deep neural network, or DNN) were trained to predict the heat fluxes. Domain knowledge was used for data preprocessing and feature selection. Finally, the suitability of the selected machine learning model was tested under different thermal loop schedules. Herein, the case study results showed that: (1) XGBoost can be as accurate as DNN (coefficient of determination equal to 0.81) with much less training time; (2) the annual energy cost savings for different thermal loop schedules obtained by the XGBoost-predicted and FEM-calculated heat fluxes are consistent, having a difference of only 4%; and (3) XGBoost can reduce the computation time for the annual energy analysis of the case study building with a given thermal loop schedule from around 12 h by using FEM to less than 1 min.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Automatic Generation of High-Performance Convolution Kernels on ARM CPUs for Deep Learning

In this work, we present FastConv, a template-based code auto-generation open source library that can automatically generate high-performance deep learning convolution kernels of arbitrary matrices/tensors shapes. FastConv is based on the Winograd algorithm, which is reportedly the highest performing algorithm for the time-consuming convolution layers of convolutional neural networks. ARM CPUs cover a wide range designs and specifications, from embedded devices to HPC-grade CPUs. The leads to the dilemma of how to consistently optimize Winograd-based convolution solvers for convolution layers of different shapes. FastConv addresses this problem by using templates to auto-generate multiple shapes of tuned kernels variants suitable for skinny tall matrices. As a performance portable library, FastConv transparently searches for the best combination of kernel shapes, cache tiles, scheduling of loop orders, packing strategies, access patterns, and online/offline computations. Auto-tuning is used to search the parameter configuration space for the best performance for a given target architecture and problem size. The experiments with layer-wise evaluation on the VGG--16 model confirms a 1.25x performance gains is got by tuning the Winograd library. Integrated comparison results shows 1.02x to 1.40x, 1.14x to 2.17x, and 1.22x and 2.48x speedup is achieved over NNPACK, Arm NN, and FeatherCNN on the Kunpeng 920 beside few cases. Furthermore, problem size performance portability experiments with various convolution shapes shows that FastConv achieves 1.2x to 1.7x speedup and 2x to 22x speedup over NNPACK and ARM NN inference engine using Winograd on Kunpeng 920 . CPU performance portability evaluation on the VGG--16 show an average speedup over NNPACK of 1.42x, 1.21x, 1.26x, 1.37x, 2.26x, and 11.02x is observed on Kunpeng 920, Snapdragon 835, 855, 888, Apple M1, and AWS Graviton2, respectively.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors

Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.

Physics↗
DOE OSTI2020

Characterizing the Performance of Executing Many-tasks on Summit

Many scientific workloads are comprised of many tasks, where each task is an independent simulation or analysis of data. The execution of millions of tasks on heterogeneous HPC platforms requires scalable dynamic resource management and multi-level scheduling. RADICAL-Pilot (RP) -- an implementation of the Pilot abstraction, addresses these challenges and serves as an effective runtime system to execute workloads comprised of many tasks. In this paper, we characterize the performance of executing many tasks using RP when interfaced with JSM and PRRTE on Summit: RP is responsible for resource management and task scheduling on acquired resource; JSM or PRRTE enact the placement of launching of scheduled tasks. Our experiments provide lower bounds on the performance of RP when integrated with JSM and PRRTE. Specifically, for workloads comprised of homogeneous single-core, 15 minutes-long tasks we find that: PRRTE scales better than JSM for > O(1000) tasks; PRRTE overheads are negligible; and PRRTE supports optimizations that lower the impact of overheads and enable resource utilization of 63% when executing O(16K), 1-core tasks over 404 compute nodes.

Matteo, Turilli↗
DOE OSTI2020

Stochastic DC optimal power flow with reserve saturation

We propose an optimization framework for stochastic optimal power flow with uncertain loads and renewable generator capacity. Our model follows previous work in assuming that generator outputs respond to load imbalances according to an affine control policy, but introduces a model of saturation of generator reserves by assuming that when a generator’s target level hits its limit, it abandons the affine policy and produces at that limit. This is a particularly interesting feature in models where wind power plants, which have uncertain upper generation limits, are scheduled to provide reserves to balance load fluctuations. Here, the resulting model is a nonsmooth nonconvex two-stage stochastic program, and we use a stochastic approximation method to find stationary solutions to a smooth approximation. Computational results on 6-bus and 118-bus test instances demonstrate that by considering the effects of saturation, our model can yield solutions with lower expected generation costs (at the same target line violation probability level) than those obtained from a model that enforces the affine policy to stay within generator limits with high probability.

17 WIND ENERGY↗