SEARCH · Engineering Papers

Results for “schedule”

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.

SourceResearch connectionFrom yearThrough year

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

At least 955 records · Page 53

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Optimal Network Reconfiguration and Scheduling With Hardware-in-the-Loop Validation for Improved Microgrid Resilience

With the increased occurrence of various major extreme weather events, power outages and prompt power system restorations have recently drawn more attention to the resilience and recovery of power systems. From the perspective of a more resilient power delivery at the distribution grid, system restoration using network topology reconfiguration together with optimal scheduling of distributed energy resources are adopted in this paper. The proposed optimization model aims at minimizing the total load shedding cost and other operational costs, in which linearized topological constraints borrowed from graph theory and linearized DistFlow models are respectively used to maintain the radial network topology and power flow balance after system contingencies. To demonstrate the applicability of the proposed strategy, a real-world case study of a networked three-microgrid system in Adjuntas, Puerto Rico, is used with the consideration of different independent/interconnected microgrid scenarios, contingencies, and fairness settings. Furthermore, hardware-in-the-loop testing is conducted for the same three-microgrid network, where the closely matched results with the simulated ones have validated the effectiveness of the proposed restoration strategy, which is now ready to move one step forward towards field deployment. Finally, to test the proposed restoration strategy in a larger networked system, the modified IEEE-33 bus test distribution system is considered, and the results show a more resilient power delivery for critical loads under three and four line outages.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2018

Chance-Constrained Day-Ahead Hourly Scheduling in Distribution System Operation

This paper aims to propose a two-step approach for day-ahead hourly scheduling in a distribution system operation, which contains two operation costs, the operation cost at substation level and feeder level. In the first step, the objective is to minimize the electric power purchase from the day-ahead market with the stochastic optimization. The historical data of day-ahead hourly electric power consumption is used to provide the forecast results with the forecasting error, which is presented by a chance constraint and formulated into a deterministic form by Gaussian mixture model (GMM). In the second step, the objective is to minimize the system loss. Considering the nonconvexity of the three-phase balanced AC optimal power flow problem in distribution systems, the second-order cone program (SOCP) is used to relax the problem. Then, a distributed optimization approach is built based on the alternating direction method of multiplier (ADMM). The results shows that the validity and effectiveness method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2016

Flexible Data-Aware Scheduling for Workflows over an In-Memory Object Store

This paper explores novel techniques for improving the performance of many-task workflows based on the Swift scripting language. We propose novel programmer options for automated distributed data placement and task scheduling. These options trigger a data placement mechanism used for distributing intermediate workflow data over the servers of Hercules, a distributed key-value store that can be used to cache file system data. We demonstrate that these new mechanisms can significantly improve the aggregated throughput of many-task workflows with up to 86x, reduce the contention on the shared file system, exploit the data locality, and trade off locality and load balance.

Duro, Francisco Rodrigo↗

DOE OSTI2018

BigData Express: Toward Schedulable, Predictable, and High-Performance Data Transfer

Big Data has emerged as a driving force for scientific discoveries. Large scientific instruments (e.g., colliders, and telescopes) generate exponentially increasing volumes of data. To enable scientific discovery, science data must be collected, indexed, archived, shared, and analyzed, typically in a widely distributed, highly collaborative manner. Data transfer is now an essential function for science discoveries, particularly within big data environments. Although significant improvements have been made in the area of bulk data transfer, the currently available data transfer tools and services can not successfully address the high-performance and time-constraint challenges of data transfer required by extreme-scale science applications for the following reasons: disjoint end-to-end data transfer loops, cross-interference between data transfers, and existing data transfer tools and services are oblivious to user requirements (deadline and QoS requirements). Fermilab has been working on the BigData Express project to address these problems. BigData Express seeks to provide a schedulable, predictable, and high-performance data transfer service for big data science. The BigData Express software is being deployed and evaluated at multiple research institutions, which include UMD, StarLight, FNAL, KISTI, KSTAR, SURFnet, Ciena, and other sites. Meanwhile, the BigData Express research team is collaborating with the StarLight International/National Communications Exchange Facility to deploy BigData Express at various research platforms, including Pacific Research Platform, National Research Platform, and Global Research Platform. It is envisioned that we are working toward building a high-performance data transfer federation for big data science.

Lu, Qiming↗

DOE OSTI2021

Optimal Energy Scheduling and Sensitivity Analysis for Integrated Power-Water-Heat Systems

The conventionally independent power, water, and heating networks are becoming more tightly connected, which motivates their joint optimal energy scheduling to improve the overall efficiency of an integrated energy system. However, such a joint optimization is known as a challenging problem with complex network constraints and couplings of electric, hydraulic, and thermal models that are nonlinear and nonconvex. We formulate an optimal power-water-heat flow (OPWHF) problem and develop a computationally efficient heuristic to solve it. The proposed heuristic decomposes OPWHF into subproblems, which are iteratively solved via convex relaxation and convex-concave procedure. Simulation results validate that the proposed framework can improve operational flexibility and social welfare of the integrated system, wherein the water and heating networks respond as virtual energy storage to time-varying energy prices and solar photovoltaic generation. Moreover, we perform sensitivity analysis to compare two modes of heating network control: by flow rate and by temperature. Our results reveal that the latter is more effective for heating networks with a wider space of pipeline parameters.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2015

Stochastic Optimal Scheduling of Residential Appliances with Renewable Energy Sources

This paper proposes a stochastic, multi-objective optimization model within a Model Predictive Control (MPC) framework, to determine the optimal operational schedules of residential appliances operating in the presence of renewable energy source (RES). The objective function minimizes the weighted sum of discomfort, energy cost, total and peak electricity consumption, and carbon footprint. A heuristic method is developed for combining different objective components. The proposed stochastic model utilizes Monte Carlo simulation (MCS) for representing uncertainties in electricity price, outdoor temperature, RES generation, water usage, and non-controllable loads. The proposed model is solved using a mixed integer linear programming (MILP) solver and numerical results show the validity of the model. Case studies show the benefit of using the proposed optimization model.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2018

Integrated Transmission and Distribution Systems Restoration with Distributed Generation Scheduling

The self-healing smart grids enable system operators to quickly and efficiently recover transmission and distribution systems from outages and blackouts. The current restoration procedure solves the transmission and distribution system restoration problems separately without considering their impacts on each other, which may prolong the restoration process. However, with the emerging active distribution networks, distributed generators can contribute into the bottom-up restoration strategy. The interaction between the restoration of two interconnected systems should be taken into account. In this paper, a hybrid model of transmission and distribution systems restoration (HTDSR) is proposed by exchanging data of power and voltage between two separate optimization problems. The effectiveness of the HTDSR algorithm is demonstrated through case studies of the integrated IEEE 13-bus distribution network and IEEE 39-bus transmission grid. Simulation results demonstrate that the integrated restoration strategy with optimal scheduling of distributed generation sources can expedite the restoration process.

Distributed generation↗

DOE OSTI2019

Transactive Coordination of Flexible Loads with Energy Storage through Day-ahead Scheduling

We are motivated by the problem faced by the aggregator (market coordinator) to optimally schedule the day-ahead operation of flexible loads and energy storages through transactive coordination. The aggregator, which may be the ISO/DSO/LSE/Utility company/Microgrid controller depending on the system considered, aims to maximize social welfare of interconnected distributed energy resources (DERs) by determining the optimal hourly prices for the next operating day. Arbitrage and private objectives are incorporated to ensure participation of third-party energy storages. We show that the coordination problem can be mathematically formulated as a multi-period optimal control problem with global power flow constraints and local DER-level constraints, and propose an iterative hierarchical decentralized solution method which respects the privacy of DERs. Under proper convexity assumptions, the algorithm will converge to the optimal day-ahead market clearing prices. We illustrate the algorithm using a four-bus power system with DC power flow constraints. Results show that incorporating degradation cost decreases the energy storage's ability of peak shaving and that social welfare of the system increases when discharging and charging efficiencies increase.

Ma, Ke↗

DOE OSTI2023

A Modified Maximum Entropy Inverse Reinforcement Learning Approach for Microgrid Energy Scheduling

Increasing popularity of integrating distributed energy resources (DERs) into the power system brings a challenge to optimize the microgrid dispatch policy. The reinforcement learning methods suffer from a long-time problem with the theoretical assumption of the objective/reward function for the microgrid system. Although the traditional inverse reinforcement learning (IRL) approaches can solve this problem to some extent, they encounter a limitation of complex computations for state visitation frequency in the large and continuous state space. To alleviate this limitation, we propose a modified maximum entropy IRL (MMIRL) method to extract the reward function from the expert demonstrations for solving the microgrid energy scheduling problem. The proposed MMIRL algorithm is promising in recovering the reward function and learning the dispatch policy compared to conventional approaches. Case studies are performed in an energy arbitrage problem and a microgrid system with DERs. Results substantiate that the proposed MMIRL approach can learn the dispatch policy with more than 99% efficiency and outperforms other comparative methods.

artificial intelligence, reinforcement learning, m↗

DOE OSTI2013

An Ensemble Approach for Forecasting Net Interchange Schedule

The net interchange schedule (NIS) is the sum of the transactions (MW) between an ISO/RTO and its neighbors. Effective forecasting of the submitted NIS can improve grid operation efficiency. This paper applies a Bayesian model averaging (BMA) technique to forecast submitted NIS. As an ensemble approach, the BMA method aggregates different forecasting models in order to improve forecasting accuracy and consistency. In this study, the BMA method is compared to two alternative approaches: a stepwise regression method and an artificial neural network (ANN) trained for NIS forecasting. In our comparative analysis, we use field measurement data from the Pennsylvania, New Jersey, and Maryland (PJM) Regional Transmission Organization (RTO) to train and test each method. Our preliminary results indicate that ensemble-based methods can provide more accurate and consistent NIS forecasts in comparison to non-ensemble alternate methods.

Vlachopoulou, Maria↗

DOE OSTI2024

Scalable Circuit Cutting and Scheduling in a Resource-constrained and Distributed Quantum System

Despite quantum computing's rapid development, current systems remain limited in practical applications due to their limited qubit count and quality. Various technologies, such as superconducting, trapped ions, and neutral atom quantum computing technologies are progressing towards a fault tolerant era, however they all face a diverse set of challenges in scalability and control. Recent efforts have focused on multi-node quantum systems that connect multiple smaller quantum devices to execute larger circuits. Future demonstrations hope to use quantum channels to couple systems, however current demonstrations can leverage classical communication with circuit cutting techniques. This involves cutting large circuits into smaller subcircuits and reconstructing them post-execution. However, existing cutting methods are hindered by lengthy search times as the number of qubits and gates increases. Additionally, they often fail to effectively utilize the resources of various worker configurations in a multi-node system. To address these challenges, we introduce FitCut, a novel approach that transforms quantum circuits into weighted graphs and utilizes a community-based, bottom-up approach to cut circuits according to resource constraints, e.g., qubit counts, on each worker. FitCut also includes a scheduling algorithm that optimizes resource utilization across workers. Implemented with Qiskit and evaluated extensively, FitCut significantly outperforms the Qiskit Circuit Knitting Toolbox, reducing time costs by factors ranging from 3 to 2000 and improving resource utilization rates by up to 3.88 times on the worker side, achieving a system-wide improvement of 2.86 times.

Kan, Shuwen [Fordham University]↗

DOE OSTI2019

Scheduling Multiple Agents in a Persistent Monitoring Task Using Reachability Analysis

We consider the problem of controlling the dynamic state of each of a finite collection of targets distributed in physical space using a much smaller collection of mobile agents. Each agent can attend to no more than one target at a given time, thus agents must move between targets to control the collective state, implying that the states of each of the individual targets are only controlled intermittently. We assume that the state dynamics of each of the targets are given by a linear, time-invariant, controllable system, and develop conditions on the visiting schedules of the agents to ensure that the property of controllability is maintained in the face of the intermittent control. We then introduce constraints on the magnitude of the control input and a bounded disturbance into the target dynamics and develop a method to evaluate system performance under this scenario. Finally, we use this method to determine how the amount of time the agents spend at a given target, before switching to the next in its sequence, influences the control of the states of the entire collection of targets.

42 ENGINEERING↗

DOE OSTI2019

Optimal Scheduling of an Isolated Microgrid With Battery Storage Considering Load and Renewable Generation Uncertainties

By modeling the uncertainty of spinning reserves provided by energy storage with probabilistic constraints, a new optimal scheduling mode is proposed in this paper for minimizing the operating costs of an isolated microgrid (MG) by using chance-constrained programming. The model is transformed into a readily solvable mixed integer linear programming formulation in general algebraic modeling system (GAMS) via a proposed discretized step transformation approach and finally solved by applying the CPLEX solver. By properly setting the confidence levels of the spinning reserve probability constraints, the MG operation can achieve a tradeoff between reliability and economy. The test results on the modified Oak Ridge National Laboratory Distributed Energy Control and Communication lab MG test system reveal that the proposal significantly exceeds the commonly used hybrid intelligent algorithm with much better and more stable optimization results and significantly reduced calculation times.

Li, Yang↗

DOE OSTI2017

Scheduled Sequential Compressed Spectrum Sensing for Wideband Cognitive Radios

The support for high data rate applications with the cognitive radio technology necessitates wideband spectrum sensing. However, it is costly to apply long-term wideband sensing and is especially difficult in the presence of uncertainty, such as high noise, interference, outliers, and channel fading. In this paper, we propose scheduling of sequential compressed spectrum sensing which jointly exploits compressed sensing (CS) and sequential periodic detection techniques to achieve more accurate and timely wideband sensing. Instead of invoking CS to reconstruct the signal in each period, our proposed scheme performs backward grouped-compressed-data sequential probability ratio test (backward GCD-SPRT) using compressed data samples in sequential detection, while CS recovery is only pursued when needed. This method on one hand significantly reduces the CS recovery overhead, and on the other takes advantage of sequential detection to improve the sensing quality. Furthermore, we propose (a) an in-depth sensing scheme to accelerate sensing decision-making when a change in channel status is suspected, (b) a block-sparse CS reconstruction algorithm to exploit the block sparsity properties of wide spectrum, and (c) a set of schemes to fuse results from the recovered spectrum signals to further improve the overall sensing accuracy. Finally, extensive performance evaluation results show that our proposed schemes can significantly outperform peer schemes under sufficiently low SNR settings.

42 ENGINEERING↗

DOE OSTI2020

A Comprehensive Scheduling Framework using SP-ADMM for Residential Demand Response with Weather and Consumer Uncertainties

This paper presents a comprehensive scheduling framework for residential demand response (DR) programs considering both the day-ahead and real-time electricity markets. In the first stage, residential customers determine the operating status of their responsive devices such as heating, ventilation, and air conditioning (HVAC) systems and electric water heaters (EWHs), while the distribution system operator (DSO) computes the amount of electricity to be purchased in the day-ahead electricity market. In the second stage, the DSO purchases insufficient (or sells surplus) electricity in the real-time electricity market to maintain the supply-demand balance. Due to its computational complexity and data privacy issues, the proposed model cannot be directly solved in a centralized manner, especially with a large number of uncertain scenarios. Therefore, this paper proposes a combination of stochastic programming (SP) and the alternating direction method of multipliers (ADMM) algorithm, called SP-ADMM, to decompose the original model and then solve each sub-problem in a distributed manner while considering multiple uncertain scenarios. The simulation study is performed on the IEEE 33-bus system including 121 residential houses. Here, the results demonstrate the effectiveness of the proposed approach for large-scale residential DR applications under weather and consumer uncertainties.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2015

Flexible operation of batteries in power system scheduling with renewable energy

The fast growing expansion of renewable energy increases the complexities in balancing generation and demand in the power system. The energy-shifting and fast-ramping capability of energy storage has led to increasing interests in batteries to facilitate the integration of renewable resources. In this paper, we present a two-step framework to evaluate the potential value of energy storage in power systems with renewable generation. First, we formulate a stochastic unit commitment approach with wind power forecast uncertainty and energy storage. Second, the solution from the stochastic unit commitment is used to derive a flexible schedule for energy storage in economic dispatch where the look-ahead horizon is limited. Here, analysis is conducted on the IEEE 24-bus system to demonstrate the benefits of battery storage in systems with renewable resources and the effectiveness of the proposed battery operation strategy.

25 ENERGY STORAGE↗

DOE OSTI2015

Large-scale compute-intensive analysis via a combined in-situ and co-scheduling workflow approach, In: SC '15 Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis

Large-scale simulations can produce hundreds of terabytes to petabytes of data, complicating and limiting the efficiency of workflows. Traditionally, outputs are stored on the file system and analyzed in post-processing. With the rapidly increasing size and complexity of simulations, this approach faces an uncertain future. Trending techniques consist of performing the analysis in-situ, utilizing the same resources as the simulation, and/or off-loading subsets of the data to a compute-intensive analysis system. We introduce an analysis framework developed for HACC, a cosmological N-body code, that uses both in-situ and co-scheduling approaches for handling petabyte-scale outputs. We compare different analysis set-ups ranging from purely off-line, to purely in-situ to in-situ/co-scheduling. The analysis routines are implemented using the PISTON/VTK-m framework, allowing a single implementation of an algorithm that simultaneously targets a variety of GPU, multi-core, and many-core architectures.

Computer Science↗

DOE OSTI2022

Online peak-aware energy scheduling with untrusted advice

This paper studies the online energy scheduling problem in a hybrid model where the cost of energy is proportional to both the volume and peak usage, and where energy can be either locally generated or drawn from the grid. Inspired by recent advances in online algorithms with Machine Learned (ML) advice, we develop parameterized deterministic and randomized algorithms for this problem such that the level of reliance on the advice can be adjusted by a trust parameter. We then analyze the performance of the proposed algorithms using two performance metrics: robustness that measures the competitive ratio as a function of the trust parameter when the advice is inaccurate, and consistency for competitive ratio when the advice is accurate. Since the competitive ratio is analyzed in two different regimes, we further investigate the Pareto optimality of the proposed algorithms. Our results show that the proposed deterministic algorithm is Pareto-optimal, in the sense that no other online deterministic algorithms can dominate the robustness and consistency of our algorithm. Furthermore, we show that the proposed randomized algorithm dominates the Pareto-optimal deterministic algorithm. Our large-scale empirical evaluations using real traces of energy demand, energy prices, and renewable energy generations highlight that the proposed algorithms outperform worst-case optimized algorithms and fully data-driven algorithms.

Lee, Russell↗