Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “self 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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A bilevel multistage stochastic self-scheduling model with indivisibilities for trading in the continuous intraday electricity market

In this paper, we study the profit maximization problem of a virtual power plant trading in the continuous intraday electricity market. Our virtual power plant model is compatible with renewable, and thermal assets, covering a range of virtual power plants currently participating in energy markets. We model the trading problem as a bilevel multistage stochastic program. The upper level of the problem accounts for the profit maximization of the virtual power plant with explicit modeling of the technical constraints of the operational status of the thermal power plant including minimum start-up and shut-down times, ramp-up and ramp-down rates, and minimum generation level. The upper level also decides which continuous and indivisible (fill-or-kill) orders are submitted to the market. The lower-level problem accounts for the clearing of the continuous intraday market, i.e., matching of buy and sell orders. Because of the presence of fill-or-kill orders, the lower-level problem is mixed-integer, which prevents its direct conversion to a single-level problem using duality. In order to solve this challenging problem, we develop a convex-hull extended formulation for the lower-level problem, apply duality theory to obtain a single-level stochastic equivalent formulation, and employ McCormick envelopes to turn the problem into a multistage stochastic mixed-integer linear problem, which we solve using the stochastic dual dynamic integer programming algorithm. We conduct numerical experiments and analyze the optimal trading behavior of a virtual power plant trading in an ideal continuous market without arbitrage.

Bilevel multistage stochastic programming problem↗
DOE OSTI2015

Systematic Approach to Better Understanding Integration Costs: Preprint

When someone mentions integration costs, thoughts of the costs of integrating renewable generation into an existing system come to mind. We think about how variability and uncertainty can increase power system cycling costs as increasing amounts of wind or solar generation are incorporated into the generation mix. However, seldom do we think about what happens to system costs when new baseload generation is added to an existing system or when generation self-schedules. What happens when a highly flexible combined-cycle plant is added? Do system costs go up, or do they go down? Are other, non-cycling, maintenance costs impacted? In this paper we investigate six technologies and operating practices--including VG, baseload generation, generation mix, gas prices, self-scheduling, and fast-start generation--and how changes in these areas can impact a system's operating costs. This paper provides a working definition of integration costs and four components of variable costs. It describes the study approach and how a production cost modeling-based method was used to determine the cost effects, and, as a part of the study approach section, it describes the test system and data used for the comparisons. Finally, it presents the research findings, and, in closing, suggests three areas for future work.

17 WIND ENERGY↗
DOE OSTI2018

A comparison of price-taker and production cost models for determining system value, revenue, and scheduling of concentrating solar power plants

Concentrating solar power (CSP) plants convert solar energy into electricity and can be coupled with low-cost thermal energy storage to provide a dispatchable renewable resource. Maximizing the economic benefits of CSP systems requires deliberate selection of the timing of thermal energy dispatch to coincide with high-price or high-value periods. The performance and value of CSP systems have traditionally been evaluated using two distinct approaches: (1) production cost models (PCMs), which optimize commitment and dispatch schedules for an entire fleet of generators to minimize the cost of satisfying electricity demand; and (2) price-taker (PT) models, which optimize dispatch of the CSP system against historical or forecasted electricity prices to maximize revenue available to the CSP operator. The PCM approach is, in principle, superior because of the ability to capture system-level details such as transmission pathways and associated constraints, and feedback between CSP dispatch schedules and operation of other generators. The computationally simpler PT technique cannot explicitly address these concerns, but the comparative reduction in solution time is attractive for sensitivity analysis and rigorous optimization of CSP plant design and operation. In this work, we directly compare the dispatch profiles, net revenue, and operational value of CSP systems using implementations of each technique to assess how closely the solutions from the PT technique can approach those from the PCM for a specific market scenario. The PT implementation produced characteristically similar dispatch profiles as the PCM for both a large solar-multiple configuration and a small solar-multiple peaking configuration, while requiring only 1% of the computational time of the PCM. In addition, dispatching the CSP plant according to the self-scheduled PT solution - as opposed to the system-optimized PCM solution - only reduced the total CSP operational value by 1-5%, with consistent trends across CSP configurations and locations. This analysis validates the ability of the PT approach to substantially capture the economic benefits of CSP systems when pricing profiles are available, and indicates that the PT approach is suitable for initial design and optimization of CSP technologies.

14 SOLAR ENERGY↗
DOE OSTI2021

Plentiful electricity turns wholesale prices negative

In 2020, average wholesale electricity prices in the United States fell to $21/MWh, their lowest level since the beginning of the 21st century. Low natural gas prices and the proliferation of low marginal cost resources like wind and solar had already established a trend toward lower wholesale prices, and this trend was exacerbated by declining electricity demand due to the Covid-19 pandemic in 2020. Negative real-time hourly wholesale prices occurred in about 4% of all hours and wholesale market nodes across the United States, but these were not distributed evenly. Regional clusters emerged, for example, in the Permian Basin in western Texas, and in Kansas and western Oklahoma in the Southwest Power Pool (SPP), negative prices accounted for more than 25% of all hours. Negative electricity prices result either from local congestion of the transmission system leading supply to exceed demand locally or due to system-wide oversupply. Looking at the latter condition in SPP, we find that all major generator types contribute to this excess supply, because of limited ramping flexibility or self-scheduled out-of-market unit commitments. Additional monetary production incentives such as renewable energy credits or tax credits also enable negative bids; indeed, negative prices predominantly occur when demand levels are low and wind production levels are high. Frequent negative prices can inform the value of additional renewable energy investments at specific locations, the need for transmission and storage development, and opportunities load growth or adaptation.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2019

An accurate bilinear cavern model for compressed air energy storage

Compressed air energy storage is suitable for large-scale electrical energy storage, which is important for integrating renewable energy sources into electric power systems. A typical compressed air energy storage plant consists of compressors, expanders, caverns, and a motor/generator set. Current cavern models used for compressed air energy storage are either accurate but highly nonlinear or linear but inaccurate. The application of highly nonlinear cavern models in power system optimization problems renders them computationally challenging to solve. In this regard, an accurate bilinear cavern model for compressed air energy storage is proposed. The charging and discharging processes in a cavern are divided into several real/virtual states. The first law of thermodynamics and ideal gas law are then utilized to derive a cavern model, i.e., a model for the variation of temperature and pressure in these processes. Thereafter, the heat transfer between the air in the cavern and the cavern wall is considered and integrated into the cavern model. By subsequently eliminating several negligible terms, the cavern model reduces to a bilinear model. The accuracy of the bilinear cavern model is verified via comparison with both an accurate nonlinear model and two sets of field-measured data. The bilinear cavern model can be easily linearized and is then suitable for integration into optimization problems considering compressed air energy storage. This is verified via comparatively solving a self-scheduling problem of compressed air energy storage using different cavern models.

25 ENERGY STORAGE↗
DOE OSTI2017

Evolution of a minimal parallel programming model

Here, we take a historical approach to our presentation of self-scheduled task parallelism, a programming model with its origins in early irregular and nondeterministic computations encountered in automated theorem proving and logic programming. We show how an extremely simple task model has evolved into a system, asynchronous dynamic load balancing (ADLB), and a scalable implementation capable of supporting sophisticated applications on today’s (and tomorrow’s) largest supercomputers; and we illustrate the use of ADLB with a Green’s function Monte Carlo application, a modern, mature nuclear physics code in production use. Our lesson is that by surrendering a certain amount of generality and thus applicability, a minimal programming model (in terms of its basic concepts and the size of its application programmer interface) can achieve extreme scalability without introducing complexity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Systematic Approach to Better Understanding Integration Costs

This research presents a systematic approach to evaluating the costs of integrating new generation and operational procedures into an existing power system, and the methodology is independent of the type of change or nature of the generation. The work was commissioned by the U.S. Department of Energy and performed by the National Renewable Energy Laboratory to investigate three integration cost-related questions: (1) How does the addition of new generation affect a system's operational costs, (2) How do generation mix and operating parameters and procedures affect costs, and (3) How does the amount of variable generation (non-dispatchable wind and solar) impact the accuracy of natural gas orders? A detailed operational analysis was performed for seven sets of experiments: variable generation, large conventional generation, generation mix, gas prices, fast-start generation, self-scheduling, and gas supply constraints. For each experiment, four components of integration costs were examined: cycling costs, non-cycling VO&M costs, fuel costs, and reserves provisioning costs. The investigation was conducted with PLEXOS production cost modeling software utilizing an updated version of the Institute of Electrical and Electronics Engineers 118-bus test system overlaid with projected operating loads from the Western Electricity Coordinating Council for the Sacramento Municipal Utility District, Puget Sound Energy, and Public Service Colorado in the year 2020. The test system was selected in consultation with an industry-based technical review committee to be a reasonable approximation of an interconnection yet small enough to allow the research team to investigate a large number of scenarios and sensitivity combinations. The research should prove useful to market designers, regulators, utilities, and others who want to better understand how system changes can affect production costs.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Self-Driving Telescopes: Autonomous Scheduling of Astronomical Observation Campaigns with Offline Reinforcement Learning

Modern astronomical experiments are designed to achieve multiple scientific goals, from studies of galaxy evolution to cosmic acceleration. These goals require data of many different classes of night-sky objects, each of which has a particular set of observational needs. These observational needs are typically in strong competition with one another. This poses a challenging multi-objective optimization problem that remains unsolved. The effectiveness of Reinforcement Learning (RL) as a valuable paradigm for training autonomous systems has been well-demonstrated, and it may provide the basis for self-driving telescopes capable of optimizing the scheduling for astronomy campaigns. Simulated datasets containing examples of interactions between a telescope and a discrete set of sky locations on the celestial sphere can be used to train an RL model to sequentially gather data from these several locations to maximize a cumulative reward as a measure of the quality of the data gathered. We use simulated data to test and compare multiple implementations of a Deep Q-Network (DQN) for the task of optimizing the schedule of observations from the Stone Edge Observatory (SEO). We combine multiple improvements on the DQN and adjustments to the dataset, showing that DQNs can achieve an average reward of 87%+-6% of the maximum achievable reward in each state on the test set. This is the first comparison of offline RL algorithms for a particular astronomical challenge and the first open-source framework for performing such a comparison and assessment task.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2015

Adaptive track scheduling to optimize concurrency and vectorization in GeantV

The GeantV project is focused on the R&D of new particle transport techniques to maximize parallelism on multiple levels, profiting from the use of both SIMD instructions and co-processors for the CPU-intensive calculations specific to this type of applications. In our approach, vectors of tracks belonging to multiple events and matching different locality criteria must be gathered and dispatched to algorithms having vector signatures. While the transport propagates tracks and changes their individual states, data locality becomes harder to maintain. The scheduling policy has to be changed to maintain efficient vectors while keeping an optimal level of concurrency. The model has complex dynamics requiring tuning the thresholds to switch between the normal regime and special modes, i.e. prioritizing events to allow flushing memory, adding new events in the transport pipeline to boost locality, dynamically adjusting the particle vector size or switching between vector to single track mode when vectorization causes only overhead. Lastly, this work requires a comprehensive study for optimizing these parameters to make the behaviour of the scheduler self-adapting, presenting here its initial results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
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 OSTI2014

Community-driven development for computational biology at Sprints, Hackathons and Codefests

Background: Computational biology comprises a wide range of technologies and approaches. Multiple technologies can be combined to create more powerful workflows if the individuals contributing the data or providing tools for its interpretation can find mutual understanding and consensus. Much conversation and joint investigation are required in order to identify and implement the best approaches. Traditionally, scientific conferences feature talks presenting novel technologies or insights, followed up by informal discussions during coffee breaks. In multi-institution collaborations, in order to reach agreement on implementation details or to transfer deeper insights in a technology and practical skills, a representative of one group typically visits the other. However, this does not scale well when the number of technologies or research groups is large. Conferences have responded to this issue by introducing Birds-of-a-Feather (BoF) sessions, which offer an opportunity for individuals with common interests to intensify their interaction. However, parallel BoF sessions often make it hard for participants to join multiple BoFs and find common ground between the different technologies, and BoFs are generally too short to allow time for participants to program together. Results: This report summarises our experience with computational biology Codefests, Hackathons and Sprints, which are interactive developer meetings. They are structured to reduce the limitations of traditional scientific meetings described above by strengthening the interaction among peers and letting the participants determine the schedule and topics. These meetings are commonly run as loosely scheduled “unconferences” (self-organized identification of participants and topics for meetings) over at least two days, with early introductory talks to welcome and organize contributors, followed by intensive collaborative coding sessions. We summarise some prominent achievements of those meetings and describe differences in how these are organised, how their audience is addressed, and their outreach to their respective communities. Conclusions: Hackathons, Codefests and Sprints share a stimulating atmosphere that encourages participants to jointly brainstorm and tackle problems of shared interest in a self-driven proactive environment, as well as providing an opportunity for new participants to get involved in collaborative projects.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Dynamical logical qubits in the Bacon-Shor code

The Bacon-Shor code is a quantum error correcting subsystem code composed of weight-2 check operators that admits a single logical qubit, and has distance 𝑑 on a 𝑑×𝑑 square lattice. We show that when viewed as a Floquet code, by choosing an appropriate measurement schedule of the check operators, it can additionally host several dynamical logical qubits. Specifically, we identify a period-4 measurement schedule of the check operators that preserves logical information between the instantaneous stabilizer groups. Such a schedule not only measures the usual stabilizers of the Bacon-Shor code, but also measures and promotes gauge operators of the parent subsystem code to additional temporary stabilizers that protect the dynamical logical qubits against errors. We show that the code distance of these Floquet-Bacon-Shor codes scales as Θ⁢(𝑑/√𝑘) on an 𝑛=𝑑×𝑑 lattice with 𝑘 dynamical logical qubits, along with the logical qubit of the parent subsystem code. Unlike the usual Bacon-Shor code, the Floquet-Bacon-Shor code family introduced here can therefore saturate the subsystem bound 𝑘⁢𝑑=𝑂⁡(𝑛). Moreover, several errors are shown to be self-corrected purely by the measurement schedule itself. This work provides insights into the design space for dynamical codes and expands the known approaches for constructing Floquet codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

MARS: Malleable Actor-Critic Reinforcement Learning Scheduler

In this paper, we introduce MARS, a new scheduling system for HPC-cloud infrastructures based on a cost-aware, flexible reinforcement learning approach, which serves as an intermediate layer for next generation HPC-cloud resource manager. MARS ensembles the pre-trained models from heuristic workloads and decides on the most cost-effective strategy for optimization. A whole workflow application would be split into several optimizable dependent sub-tasks, then based on the pre- defined resource management plan, a reward will be generated after executing a scheduled task. Lastly, MARS updates the Deep Neural Network (DNN) model based on the reward. MARS is designed to optimize the existing models through reinforcement mechanisms. MARS adapts to the dynamics of workflow applications, selects the most cost-effective scheduling solution among pre-built scheduling strategies (backfilling, SJF, etc.) and self- learning deep neural network model at run-time. We evaluate MARS with different real-world workflow traces. MARS can achieve 5%-60% increased performance compare to state-of-the- art approaches.

Baheri, Betis↗
DOE OSTI2023

Curb Allocation and Pick-Up Drop-Off Aggregation for a Shared Autonomous Vehicle Fleet

Advances in information technologies and vehicle automation have birthed new transportation services, including shared autonomous vehicles (SAVs). Shared autonomous vehicles are on-demand self-driving taxis, with flexible routes and schedules, able to replace personal vehicles for many trips in the near future. The siting and density of pick-up and drop-off (PUDO) points for SAVs, much like bus stops, can be key in planning SAV fleet operations, since PUDOs impact SAV demand, route choices, passenger wait times, and network congestion. Unlike traditional human-driven taxis and ride-hailing vehicles like Lyft and Uber, SAVs are unlikely to engage in quasi-legal procedures, like double parking or fire hydrant pick-ups. In congested settings, like central business districts (CBD) or airport curbs, SAVs and others will not be allowed to pick up and drop off passengers wherever they like. This paper uses an agent-based simulation to model the impact of different PUDO locations and densities in the Austin, Texas CBD, where land values are highest and curb spaces are coveted. In this paper 18 scenarios were tested, varying PUDO density, fleet size and fare price. The results show that for a given fare price and fleet size, PUDO spacing (e.g., one block vs. three blocks) has significant impact on ridership, vehicle-miles travelled, vehicle occupancy, and revenue. A good fleet size to serve the region’s 80 core square miles is 4000 SAVs, charging a $1 fare per mile of travel distance, and with PUDOs spaced three blocks of distance apart from each other in the CBD.

Hunter, Christian B.↗
DOE OSTI2022

Optimal economic dispatch policy for prosumer with energy storage considering self-consumption demand

This paper analyzed the effects of self-consumption demand on the joint economic dispatch of prosumers (energy consumers who are also producers), particularly for prosumers with both energy storage and distributed energy sources (DERs). Studies in the existing literature on the economic dispatch scheduling policy of energy storage, mostly from the perspective of electricity merchants, do not address the impacts of self-consumption demand. However, due to the intermittent and high levels of uncertainty regarding DERs generation and the dynamic demand of the prosumer, production and consumption are not always simultaneous; there are two possible scenarios in each period depending on whether DERs generation can meet prosumers' self-consumption or not. Incorporating the self-consumption demand will pose modeling challenges since these two scenarios cannot occur simultaneously in each period, and different scenarios require different decisions for prosumers. Further, this paper analyzed the two scenarios separately to find the optimal storage scheduling strategy, and the results were combined to get the optimal global solution. We focused on prosumers' economic decision-making while considering self-consumption demand and the physical constraints of a battery based on dynamic programming. Our study showed that the feasible state of charge (SOC) range of storage can be segmented into several sub-ranges by SOC reference points under the above two scenarios. As a result, a prosumer's optimal scheduling can be uniquely and conveniently selected based on the sub-ranges within which the current SOC falls. The results, therefore, provided multistage decision-making guidance for prosumers with energy storage.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

Unlocking Autonomous Telescopes through Reinforcement Learning: An Offline Framework and Insights from a Case Study

Optimizing observational astronomy campaigns is becoming a complex and expensive task for next-generation telescopes, where manual planning of observations may tend to reach suboptimal results in terms of optimization.Reinforcement Learning (RL) has been well-demonstrated as a valuable approach for training autonomous systems, and it may provide the basis for self-driving telescopes capable of scanning the sky and optimizing the scheduling for astronomy campaigns.We have developed a framework for the optimization of telescope scheduling using RL techniques, based on a dataset containing data on a discrete set of sky locations that the telescope should visit, and a reward metric. We compared several RL algorithms applied to an offline simulation dataset based at the Stone Edge Observatory, considering a discrete set of sky locations to visit and using “t-effective” as a reward metric, a measure of the quality of the data.Deep Q-Networks (DQNs), belonging to the class of value-based methods, have shown remarkable success in the optimization of astronomical observations in our dataset. In the full environment, the average reward value in each state was found to be 92%±5% of the maximum possible reward, while on the test set it resulted in 87%±9% of the maximum possible reward.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗