Search NASA⌕ Search

SEARCH · Search NASA

Results for “dispatch 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.

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

At least 55 records · Page 3

DSO+T: Integrated System Simulation (DSO+T Study: Volume 2)

This report summarizes an integrated co-simulation model used by the Distribution System Operator with Transactive (DSO+T) study to represent an electrical generation, delivery, and end-load systems for the purposes of assessing the viability and value proposition of transactive energy coordination of flexible assets versus a business-as-usual case. The integrated co-simulation model includes the bulk generation and transmission system, including the day-ahead and real-time scheduling and dispatch of thermal generators. Forty distribution system operators were modelled in detail, including tens of thousands of residential and commercial buildings and their flexible end-loads. These included HVAC systems, residential water heaters, electric vehicles, and stationary, behind-the-meter, batteries. Both wholesale market and end-load results for the business-as-usual case are presented and compared to actual ERCOT system data to assess the accuracy and representativeness of the resulting model.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Two-stage Stochastic Generalized Disjunctive Programming (GDP) Model for Proactive Planning and Reactive Operations of Resilient Power Systems under Disruptions

In this work, we propose a Generalized Disjunctive Programming (GDP) model that optimizes both long-term capacity planning (such as the number and size of dispatchable/renewable generators, batteries, and transmission lines) and hourly operation (such as on/off schedules of dispatchable generators, power output from each generator, and power flow) to maximize power system reliability while minimizing total cost and CO2 emissions.

Cho, Seolhee↗

Optimization Model and Algorithm for Capacity Planning and Operation of Reliable and Carbon-neutral Power Systems with High Penetration of Renewable Generation

In this work, we propose a Generalized Disjunctive Programming (GDP) model that optimizes both long-term capacity planning (such as the number and size of dispatchable/renewable generators, batteries, and transmission lines) and hourly operation (such as on/off schedules of dispatchable generators, power output from each generator, and power flow) to maximize power system reliability while minimizing total cost and CO2 emissions.

Cho, Seolhee↗

Concepts for design of an energy management system incorporating dispersed storage and generation

New forms of generation based on renewable resources must be managed as part of existing power systems in order to be utilized with maximum effectiveness. Many of these generators are by their very nature dispersed or small, so that they will be connected to the distribution part of the power system. This situation poses new questions of control and protection, and the intermittent nature of some of the energy sources poses problems of scheduling and dispatch. Under the assumption that the general objectives of energy management will remain unchanged, the impact of dispersed storage and generation on some of the specific functions of power system control and its hardware are discussed.

Kirkham, H.↗

Development and evaluation of a Fault-Tolerant Multiprocessor (FTMP) computer. Volume 2: FTMP software

The software developed for the Fault-Tolerant Multiprocessor (FTMP) is described. The FTMP executive is a timer-interrupt driven dispatcher that schedules iterative tasks which run at 3.125, 12.5, and 25 Hz. Major tasks which run under the executive include system configuration control, flight control, and display. The flight control task includes autopilot and autoland functions for a jet transport aircraft. System Displays include status displays of all hardware elements (processors, memories, I/O ports, buses), failure log displays showing transient and hard faults, and an autopilot display. All software is in a higher order language (AED, an ALGOL derivative). The executive is a fully distributed general purpose executive which automatically balances the load among available processor triads. Provisions for graceful performance degradation under processing overload are an integral part of the scheduling algorithms.

Lala, J. H.↗

Projecting Future Colorado River Basin Water and Hydropower Operations

Drought, variable renewable energy (VRE) resources (primarily wind and photovoltaic technologies), and power markets can all impact hydropower plant operations. We analyze how these three factors collectively may potentially change the future operation and economics of federal dams and hydropower plants located in the Colorado River Basin (CRB). Federal CRB energy and capacity resources, including 4,200 MW of hydropower capacity, are marketed by Western Area Power Administration (WAPA) and sold through long-term Firm Electric Service (FES) contracts to entities located in 15 western and central States that serve millions of electricity consumers. The parameters of FES contracts allow a wide range of scheduling flexibility for FES customers. The FES customers will adjust the timing of energy delivery according to the changing water, power market, and VRE contribution level to the power grid. We simulate and project water and hydropower operations with two models: 1) reservoir operation and 2) power system operation (production cost) with various temporal granularity. We consider two sets of grid scenarios (one representing today's infrastructure, and one representing higher VRE contributions in 2036) and two sets of water scenarios (drought and normal hydrology). We modeled scenarios to understand the power market-energy price levels and patterns, FES customer scheduling, hydropower economics, WAPA finances and hydropower operation for various hydrologic conditions, and VRE contribution level to the power grid. The detailed modeling framework includes: (1) creating ensembles of CRB hydrologic and hydropower futures, (2) selecting representative futures, (3) simulation of FES customer contracts, (4) simulating western U.S. power grid economic scheduling and dispatch under two VRE contribution levels, utilizing information from modeling steps (1)-(4), (5) assessment of reservoir water and hydropower operation, and (6) comparing scenario operations and economics. Our study team comprising WAPA, and an interdisciplinary team of national labs will gain insight into how WAPA can prepare for and adapt its practices in response to an evolving U.S. power grid.

Colorado River↗

2022 FORCE Development Status Update

Integrated energy systems (IESs) are essential for decarbonizing electricity and industrial sectors and fully exploiting these systems requires sophisticated planning, scheduling, and dispatching tools to maximize their socio-economic benefits. The Framework for Optimization of Resources and Economics (FORCE) is a tool suite developed at Idaho National Laboratory and is dedicated to making robust analyses of IESs easier for analysts and researchers. The report summarizes the improvements and updates to FORCE during the most recent development cycle. Particularly, we demonstrate improvements to user accessibility, stochastic time-series analysis, and vertical integration with the software tools provided in FORCE.

97 MATHEMATICS AND COMPUTING↗

Decentralized Distribution System Restoration with Grid-Forming/Following Inverter-Based Resources

The high penetration of distributed energy resources (DERs) in active distribution systems has posed challenges to the centralized distribution system restoration (DSR) strategies in current practice. On the other hand, the advancement in smart inverter technologies enables the bottom-up restoration capability. This paper is motivated to develop a 3-layered hierarchical framework for decentralized DSR, based on the grid-forming (GFM) and grid-following (GFL) grid-edge inverters. The first layer presents the tertiary control, which determines the load pickup schedule and generation dispatch of DERs, using the alternating direction method of the multipliers algorithm. The second layer consists of two control functions: GFM control, which regulates voltage and frequency, establishing a stable grid for GFL inverters to follow; and GFL control, which regulates the real and reactive power. In the third layer, the primary control is proposed to regulate the inverter voltage and current, which is developed based on the virtual oscillator control (VOC). Furthermore, the developed framework is tested in the modified IEEE 13-node test feeder. Two scenarios of grid-connected and islanded operating modes are designed, and simulation results demonstrate the effectiveness of decentralized DSR strategies for controlling grid-edge inverters to enhance the distribution system resilience.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Lila: Optimal Dispatching in Probabilistic Temporal Networks using Monte Carlo Tree Search

Executing a Probabilistic Simple Temporal Network (PSTN) amounts at scheduling, i.e. \textit{dispatch}, a set of events under time uncertainty. This constitutes a NP-hard online optimization problem. The right execution time must be dynamically assigned to each event of the PSTN such that the temporal constraints are met, whereas activity durations are progressively observed as the execution unfolds. We propose a dispatching algorithm based on Monte Carlo Tree Search, called Lila, with the following characteristics: (i) it is an anytime algorithm, both offline and online, proven asymptotically optimal; (ii) it returns the current probability of success, either before or at any moment during operations; (iii) it handles any possible continuous or discrete, even non-parametric, probability distributions, as well as inter-dependencies between random variables, exogenous and endogenous uncertainty; and (iv) can be easily extended to handle probabilistic external events, PSTNs with resources, PSTNs with cutoff times and precondition chains, etc. Lila is universal in the sense that it can handle any dispatching protocol, simply by specifying it to the algorithm. It has the unlimited flexibility offered by the simulation paradigm, whilst it asymptotically converges to optimal decisions and/or robustness approximations.

Chien, Steve A.↗

Balancing antagonistic time and resource utilization constraints in over-subscribed scheduling problems

In this paper, we report work aimed at applying concepts of constraint-based problem structuring and multi-perspective scheduling to an over-subscribed scheduling problem. Previous research has demonstrated the utility of these concepts as a means for effectively balancing conflicting objectives in constraint-relaxable scheduling problems, and our goal here is to provide evidence of their similar potential in the context of HST observation scheduling. To this end, we define and experimentally assess the performance of two time-bounded heuristic scheduling strategies in balancing the tradeoff between resource setup time minimization and satisfaction of absolute time constraints. The first strategy considered is motivated by dispatch-based manufacturing scheduling research, and employs a problem decomposition that concentrates local search on minimizing resource idle time due to setup activities. The second is motivated by research in opportunistic scheduling and advocates a problem decomposition that focuses attention on the goal activities that have the tightest temporal constraints. Analysis of experimental results gives evidence of differential superiority on the part of each strategy in different problem solving circumstances. A composite strategy based on recognition of characteristics of the current problem solving state is then defined and tested to illustrate the potential benefits of constraint-based problem structuring and multi-perspective scheduling in over-subscribe scheduling problems.

Smith, Stephen F.↗

Distributed optimization and control for autonomous distributed energy resource power dispatch and frequency regulation considering communication failures

Distributed energy resources (DERs) can significantly enhance grid flexibility by supplying power and secondary frequency regulation (SFR) services. Yet, their large number and dispersed nature limit the effectiveness of traditional centralized power dispatch and frequency control schemes, and expose the system to single-point communication failures. This paper presents a unified distributed optimization and control framework for DER power dispatch and SFR provision. A transmission-loss-aware distributed direct current optimal power flow is first formulated to optimize DER power dispatch and reserve scheduling. On top of this, a fully distributed control scheme for DER autonomous SFR provision is developed to allocate automatic generation control signals cost-effectively while ensuring robustness to communication link disruptions. The framework is validated on IEEE 14-bus and 39-bus transmission systems with large-scale distribution feeders using transmission-distribution dynamic co-simulation, demonstrating reliable and autonomous DER power dispatch and SFR provision under diverse operating conditions and communication contingencies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

On the operational characteristics and economic value of pumped thermal energy storage

Pumped thermal energy storage (PTES) systems use an electrically-driven heat pump to store electricity in the form of thermal energy, and subsequently dispatch the stored thermal energy to generate electricity using a thermodynamic heat engine. Optimal day-ahead operational scheduling and annual value of a PTES system based on Joule-Brayton thermodynamic cycles and two-tank molten salt hot thermal storage is evaluated in this work. Production cost models, which simultaneously optimize commitment and dispatch schedules for an entire set of generators to minimize the cost of satisfying electricity demand, are employed to determine system-optimal operation and day-ahead energy value of the PTES system within each of six hypothetical near-future grid scenarios intended to approximately represent the U.S. Western Interconnection or the Texas Interconnection. Sensitivity to grid scenario (including the contribution of variable renewable energy sources), thermal storage capacity, relative heat pump and heat engine capacities, and startup/shutdown cycling costs are evaluated. PTES energy value and heat engine annual capacity factor increase strongly as the contribution of variable renewable resources increases, heat pump capacity increases relative to heat engine capacity, or PTES cycling costs decrease. Grid scenarios in which the contribution of variable renewable energy is dominated by solar photovoltaics (PV) vs. wind produce inherently different PTES operational patterns. Annual PTES energy value within PV-dominated scenarios increased with storage capacity only up to approximately seven hours of full-load discharge capacity, whereas that within wind-dominated scenarios exhibited a continual increase with storage duration up to at least 16 hours.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Secure and Adaptive Hierarchical Multi-Timescale Framework for Resilient Load Restoration Using a Community Microgrid

Distribution system integrated community microgrids (CMGs) can partake in restoring loads during extended duration outages. At such times, the CMGs are challenged with limited resource availability, absence of robust grid support, and heightened demand-supply uncertainty. Here, this paper proposes a secure and adaptive three-stage hierarchical multi-timescale framework for scheduling and real-time (RT) dispatch of CMGs with hybrid PV systems to address these challenges. The framework enables the CMG to dynamically expand its boundary to support the neighboring grid sections and is adaptive to the changing forecast error impacts. The first stage solves a stochastic extended duration scheduling (EDS) problem to obtain referral plans for optimal resource rationing. The intermediate near-real-time (NRT) scheduling stage updates the EDS schedule closer to the dispatch time using new obtained forecasts, followed by the RT dispatch stage. To make the decisions more secure and robust against forecast errors, a novel concept called delayed recourse is designed. The approach is evaluated via numerical simulations on a modified IEEE 123-bus system and validated using OpenDSS and hardware-in-loop simulations. The results show superior performance in maximizing load supply and continuous secure distribution network operation under different operating scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Endogenous Interface Pricing for Consistent Transmission–Distribution Co-Optimization With Discrete Distribution Controls

This paper proposes an endogenous interface pricing model for day-ahead transmission–distribution co-optimization that co-determines the interface locational marginal price (LMP) and the transmission–distribution exchange, ensuring price–dispatch consistency while optimally scheduling discrete distribution controls. The formulation couples a DC optimal power flow (OPF) with a branch-flow AC OPF that schedules distributed energy resources (DERs), tap-changer settings, capacitor banks (CBs), and multi-period energy storage systems (ESSs) under feeder voltage and current limits, and is solved as a mixed-integer second-order cone program (MISOCP). In a T14–D33 system, coordinated device scheduling recovers about 90% of the distribution-to-transmission export achievable in a reference case that ignores distribution network (DN) limits, while satisfying a 1.05 p.u. voltage upper bound. In a T39–D34/D37/D123 system, a sequential decoupled benchmark produces interface LMP distortions up to 12.5% and a 7.28% mismatch in net export energy, whereas the proposed model removes these distortions and the associated settlement mismatches. Second-order cone (SOC) relaxation gaps remain below $10^{-3}$ in all cases.

Noh, Seung-Gil↗

Scheduling Operations for Massive Heterogeneous Clusters

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Humphrey, John↗

Modeling distributed energy resource aggregations in security constrained unit commitment and economic dispatch

The Federal Energy Regulatory Commission (FERC) recently issued Order 2222, which requires all wholesale electricity markets in the US to allow distributed energy resources (DERs) to participate in the market as aggregated resources. These DER aggregations may be composed of many individual resources that are offered and dispatched by the market as a single entity. We present here a model of a distributed energy resource aggregator (DERA) that is scheduled by a market operator’s security constrained unit commitment (SCUC) and security constrained economic dispatch (SCED). The DERA model includes constraints for battery energy storage systems (BESSs), demand response resources (DRRs), and a simple distributed energy resource (DER). This paper describes a model for each resource type and presents two methods for the DERA to generate market offer curves: a profit-maximizing optimization to compute cost curves and a direct cost algorithm to determine dispatch costs for each resource and combine into cost curves. Once all participating DERAs are scheduled in SCUC/SCED, the model is then modified to dispatch individual DERs to maximize profit or minimize schedule deviation of the DERAs. A simulation of a representative day illustrates the DERA offers, the scheduled generation, and the DERA dispatch. Findings show the potential for unavoidable schedule deviations due to internal DER constraints and due to economic incentives to deviate from the SCUC/SCED schedules. This highlights the importance of DERA offer construction on market efficiency and system reliability. Novel aspects of our approach include: (1) We consider the asymmetry of price incentives impacting DERAs from the wholesale market compared to those impacting consumers from the retail market, as imposed by current regulations and laws. (2) We model aggregate consumer response through statistically parameterizable utility functions rather than a potentially impractical approach of modeling each individual consumer. (3) We show how to use the DERA operational dispatch model to create offers into the wholesale electricity market. (4) We show how DERAs may fail to meet their scheduled dispatch because the market offer format may not permit them to fully express their operational features such as intertemporal costs and constraints to the market.

aggregations↗

US 2023/0182605 A1 Network constraint energy management system for electric vehicle depot charging and scheduling

Network constraint energy management system for electric vehicle (EV) depot charging and scheduling. In an embodiment, a power schedule is received from an economic dispatch application for a charging depot comprising EV charging station(s) and distributed energy resource(s). The power schedule may be simulated on a distribution network model of the charging depot, according to load flow analysis, to determine whether any grid-code violations occur. In response to the detection of violation(s), a constraint may be generated for each violating node, and the economic dispatch application may be re-executed with the constraint(s) to produce a new power schedule, until no violations are detected. When not all load demand can be satisfied by the power schedule, a charging schedule may be adjusted to ensure that critical energy requirements are satisfied. The final power and charging schedules may be used to schedule and control power generation and charging in the charging depot.

Hafiz, Faeza↗

TTEthernet for Integrated Spacecraft Networks

Aerospace projects have traditionally employed federated avionics architectures, in which each computer system is designed to perform one specific function (e.g. navigation). There are obvious downsides to this approach, including excessive weight (from so much computing hardware), and inefficient processor utilization (since modern processors are capable of performing multiple tasks). There has therefore been a push for integrated modular avionics (IMA), in which common computing platforms can be leveraged for different purposes. This consolidation of multiple vehicle functions to shared computing platforms can significantly reduce spacecraft cost, weight, and design complexity. However, the application of IMA principles introduces significant challenges, as the data network must accommodate traffic of mixed criticality and performance levels - potentially all related to the same shared computer hardware. Because individual network technologies are rarely so competent, the development of truly integrated network architectures often proves unreasonable. Several different types of networks are utilized - each suited to support a specific vehicle function. Critical functions are typically driven by precise timing loops, requiring networks with strict guarantees regarding message latency (i.e. determinism) and fault-tolerance. Alternatively, non-critical systems generally employ data networks prioritizing flexibility and high performance over reliable operation. Switched Ethernet has seen widespread success filling this role in terrestrial applications. Its high speed, flexibility, and the availability of inexpensive commercial off-the-shelf (COTS) components make it desirable for inclusion in spacecraft platforms. Basic Ethernet configurations have been incorporated into several preexisting aerospace projects, including both the Space Shuttle and International Space Station (ISS). However, classical switched Ethernet cannot provide the high level of network determinism required by real-time spacecraft applications. Even with modern advancements, the uncoordinated (i.e. event-driven) nature of Ethernet communication unavoidably leads to message contention within network switches. The arbitration process used to resolve such conflicts introduces variation in the time it takes for messages to be forwarded. TTEthernet1 introduces decentralized clock synchronization to switched Ethernet, enabling message transmission according to a time-triggered (TT) paradigm. A network planning tool is used to allocate each device a finite amount of time in which it may transmit a frame. Each time slot is repeated sequentially to form a periodic communication schedule that is then loaded onto each TTEthernet device (e.g. switches and end systems). Each network participant references the synchronized time in order to dispatch messages at predetermined instances. This schedule guarantees that no contention exists between time-triggered Ethernet frames in the network switches, therefore eliminating the need for arbitration (and the timing variation it causes). Besides time-triggered messaging, TTEthernet networks may provide two additional traffic classes to support communication of different criticality levels. In the rate-constrained (RC) traffic class, the frame payload size and rate of transmission along each communication channel are limited to predetermined maximums. The network switches can therefore be configured to accommodate the known worst-case traffic pattern, and buffer overflows can be eliminated. The best-effort (BE) traffic class behaves akin to classical Ethernet. No guarantees are provided regarding transmission latency or successful message delivery. TTEthernet coordinates transmission of all three traffic classes over the same physical connections, therefore accommodating the full spectrum of traffic criticality levels required in IMA architectures. Common computing platforms (e.g. LRUs) can share networking resources in such a way that failures in non-critical systems (using BE or RC communication modes) cannot impact flight-critical functions (using TT communication). Furthermore, TTEthernet hardware (e.g. switches, cabling) can be shared by both TTEthernet and classical Ethernet traffic.

Loveless, Andrew↗