Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “dynamic 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 163 records · Page 9

Real-time Ridesharing for Transportation Hubs with Demand and Supply Uncertainty

Transportation hubs in major cities generate a significant amount of trips by taxis and for-hail vehicles (FHV), with many of the trips sharing similar destinations. This suggests promising opportunities to leverage the collective travel needs with dedicated ridesharing solutions to reduce the externalities of excessive traffic at transportation hubs. In this study, we develop a novel dynamic ridesharing approach to serve trips from the transportation hub by considering (1) demand (new passengers) and supply (newly available vehicles) in the near future and (2) the uncertainty of future predictions. Our approach consists of two stages. In the first stage, we develop a data structure called hub mobility tree to generate potential combinations of shareable trips as candidate schedules efficiently. Then the generated schedules are used in the second stage to formulate the stochastic hub-based ridesharing problem (SHRP), which is a stochastic integer programming problem with the objective to maximize the total expected ridesharing profit over time. Due to the prohibitive number of shareable trips, we then approximately solve SHRP by the sample average approximate method (SAA), and a dual Lagrangian technique is implemented to further improve the scalability of the solution approach. We demonstrate the performances of the proposed method by simulating the ridesharing service at JFK airport using NYC taxi and FHV data. The results indicate that the proposed method outperforms the myopic ridesharing (maximize profit for a single time step) and the rolling horizon method with point estimation of future demand and supply.

dynamic ridesharing↗

EV charging site day-ahead load prediction in a synthetic environment for RL based grid-informed charging

Ensuring grid health in the face of increasing demand for power is an emerging challenge especially due to transportation electrification. A free market approach to influencing electric vehicle (EV) load through grid-informed hourly dynamic pricing is introduced in this work. The setting of charging price is done by a reinforcement learning (RL) agent that learns the complicated dynamics by interacting with a synthetic environment. This synthetic environment is a combination of distribution feeder simulation, EV charger user behavior dynamics, and EV charging simulation. A key module in this synthetic environment involves obtaining the day-ahead charging profile of EV charging stations based on real-world past data. The day-ahead prediction is also useful in other traditional optimizations related to EV charge scheduling. The proposed approach involves using EV charging data from two different past time horizons – one to determine the shape of the daily profile and the other to determine a scaling value to capture actual energy consumption. Real-world charging data over many years from the ACN charging network has been used to demonstrate the ability to predict the day-ahead profile with only charge session data. Both Python and MATLAB have been used for data cleaning, processing, analysis, and prediction.

Suryanarayana, Harish↗

Fuel Flow Modeling under Thermal Fluidics Considerations within Operational Domains of Molten Salt Reactors

Molten Salt Reactors (MSRs) offer significant versatility supported by their design flexibility and safety advantages due to high temperatures, design customization capabilities, strong negative reactivity feedback effects, and salt chemistry characteristics. Different control schedules and different mass flow rates in the MSR primary systems impact neutronics and thermal hydraulics coupling. The result is two-fold. First, it leads to adaptability in various applications when the customization of a MSR unit is desired. Second, it calls for the quantification of dynamics and safety characteristics to assess the operational domain and make sure reactor stability and inherent safety characteristics are maintained. This paper provides an in-depth transient analysis of the operational implications of MSRs having heat-generating fuel and heat-transporting salt mixed forming liquid fuel salts contained within primary systems. A coupling model was developed to simulate fuel flow in molten salt reactors. A zero-dimensional reactor kinetics model was used with a one-dimensional heat transfer model in the reactor core. The temperature reactivity feedbacks of the fuel salt resulting from the thermal-hydraulics model were used in the reactor kinetics model to complete the coupled code. The model was applied to simulate the Molten Salt Breeder Reactor (MSBR) response at steady state and transients. The developed model was shown to be a suitable tool for the dynamic analysis of molten salt reactors.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Development of A Hardware-In-the-Loop (HIL) Testbed for Cyber-Physical Security in Smart Buildings

As smart buildings move towards open communication technologies, providing access to the Building Automation System (BAS) through the building's intranet, or even remotely through the Internet, has become a common practice. However, BAS was historically developed as a closed environment and designed with limited cyber-security considerations. Thus, smart buildings are vulnerable to cyber-attacks with the increased accessibility. This study introduces the development and capability of a Hardware-in-the-Loop (HIT) testbed for testing and evaluating the cyber-physical security of typical BASs in smart buildings. The testbed consists of three subsystems: (1) a real-time HIL emulator simulating the behavior of a virtual building as well as the Heating, Ventilation, and Air Conditioning (HVAC) equipment via a dynamic simulation in Modelica; (2) a set of real HVAC controllers monitoring the virtual building operation and providing local control signals to control HVAC equipment in the HIL emulator; and (3) a BAS server along with a web-based service for users to fully access the schedule, setpoints, trends, alarms, and other control functions of the HVAC controllers remotely through the BACnet network. The server generates rule-based setpoints to local HVAC controllers. Based on these three subsystems, the HIL testbed supports attack/fault-free and attack/fault-injection experiments at various levels of the building system. The resulting test data can be used to inform the building community and support the cyber-physical security technology transfer to the building industry.

Li, Guowen↗

High-Level Synthesis of Parallel Specifications Coupling Static and Dynamic Controllers

The increased need for efficient ways to implement domain-specific accelerators is driving design methodologies towards the use of abstractions higher than the Register Transfer Level (RTL). In this scenario, High Level Synthesis (HLS) plays a significant role by enabling the automatic generation of custom hardware accelerators starting from high level descriptions (e.g., C code). Conventional HLS tools exploit parallelism mostly at the Instruction Level (ILP). They statically schedule the input specifications, and build centralized Finite State Machine (FSM) controllers. However, aggressive exploitation of ILP in many applications has diminishing returns and, usually, centralized approaches do not efficiently exploit coarser parallelism because FSMs are inherently serial. In this paper we present a HLS framework able to synthesize applications that, beside ILP, also expose Task Level Parallelism (TLP). An application can expose TLP through annotations that identify the parallel functions (i.e., tasks). To generate accelerators that efficiently execute concur- rent tasks, we need to solve several issues: devise a mechanism to support concurrent execution flows, exploit memory parallelism, and manage synchronization. To support concurrent execution flows, we introduce a novel adaptive controller. The adaptive controller is composed of a set of interacting control elements that independently manage the execution of a single operation or function call. These control elements check dependencies and resource constraints at runtime, enabling as soon as possible execution. To support parallel access to shared memories and synchronization, we introduce a novel Hierarchical Memory Interface (HMI). With respect to previous solutions, the proposed interface supports multi-ported memories and atomic memory operations, which commonly occur in parallel programming. Our framework can generate the hardware implementation of C functions by employing two different approaches, depending on its characteristics. If a function exposes TLP, then the framework generates hardware implementations based on the adaptive controller. Otherwise, the framework implements the function by exploiting a more conventional FSM approach, which is optimized for ILP exploitation. We evaluate our framework on a set of parallel applications, and show substantial performance improvements (average speedup of 4.7) with limited area over- heads (average area increase of 5.48 times).

Castellana, Vito G.↗

High-Level Synthesis of Parallel Specifications Coupling Static and Dynamic Controllers

The increased need for efficient ways to implement domain-specific accelerators is driving design methodologies towards the use of abstractions higher than the Register Transfer Level (RTL). In this scenario, High Level Synthesis (HLS) plays a significant role by enabling the automatic generation of custom hardware accelerators starting from high level descriptions (e.g., C code). Conventional HLS tools exploit parallelism mostly at the Instruction Level (ILP). They statically schedule the input specifications, and build centralized Finite State Machine (FSM) controllers. However, aggressive exploitation of ILP in many applications has diminishing returns and, usually, centralized approaches do not efficiently exploit coarser parallelism because FSMs are inherently serial. In this paper we present a HLS framework able to synthesize applications that, beside ILP, also expose Task Level Parallelism (TLP). An application can expose TLP through annotations that identify the parallel functions (i.e., tasks). To generate accelerators that efficiently execute concur- rent tasks, we need to solve several issues: devise a mechanism to support concurrent execution flows, exploit memory parallelism, and manage synchronization. To support concurrent execution flows, we introduce a novel adaptive controller. The adaptive controller is composed of a set of interacting control elements that independently manage the execution of a single operation or function call. These control elements check dependencies and resource constraints at runtime, enabling as soon as possible execution. To support parallel access to shared memories and synchronization, we introduce a novel Hierarchical Memory Interface (HMI). With respect to previous solutions, the proposed interface supports multi-ported memories and atomic memory operations, which commonly occur in parallel programming. Our framework can generate the hardware implementation of C functions by employing two different approaches, depending on its characteristics. If a function exposes TLP, then the framework generates hardware implementations based on the adaptive controller. Otherwise, the framework implements the function by exploiting a more conventional FSM approach, which is optimized for ILP exploitation. We evaluate our framework on a set of parallel applications, and show substantial performance improvements (average speedup of 4.7) with limited area over- heads (average area increase of 5.48 times).

Castellana, Vito G.↗

Implication of production tax credit on economic dispatch for electricity merchants with storage and wind farms

The production tax credit (PTC) promotes wind energy development, reduces power generation costs, and can affect merchants’ joint economic dispatch, particularly for electricity merchants with both energy storage and wind farms. Two common PTC policies are studied – in the first policy, a wind farm receives PTC by selling wind generation to the market and its storage can be used to store energy from the wind generation and energy purchased from the grid but the energy released from the storage cannot receive PTC; in the second policy, the energy released from the storage can also qualify for PTC but purchasing energy from the grid is not allowed. We then employ dynamic programming to study merchants' optimal decision-making while considering PTC and the physical characteristics of storage systems. We analytically show that the state of charge (SOC) range can be segmented into different regions by SOC reference points under two PTC policies. The merchant's optimal action can be conveniently and uniquely determined based on the region within which the current SOC falls. Moreover, this study illustrates that PTC could substantially alter the optimal scheduling policy structures by affecting reference points and their relationships. The results showed that the frequencies for charging and discharging storage decisions decreased with an increase in PTC subsidy. Last, we confirm that, although the first policy allows merchants to buy electricity from the market, the second policy can bring more profits when the PTC is large at the current PTC rates. Furthermore, the findings can provide multistage decision-making guidance to electricity merchants in the wholesale power market.

17 WIND ENERGY↗

Prototype energy models for data centers

Data centers in the United States consume about two percent of the nation’s electricity. Because heat gains from IT equipment drive cooling demand, data centers offer unique opportunities for energy savings. However, no prototype energy model for data centers is available in the suite of existing U.S. Department of Energy’s Commercial Prototype Building Models. Here we present the development of two new data center prototype models and their implementation in OpenStudio and EnergyPlus. The small-size data center model represents a computer room in a building served by computer room air conditioners (CRACs); while the large-sized model represents stand-alone data centers served by computer room air handlers (CRAHs) with a central chiller plant. For each data center model, two levels of IT equipment (ITE) load density were considered, to cover the wide range of IT power density of data centers: 40 and 100 W/ft 2 (430 and 1076 W/m 2 ) for the computer room, and 100 and 500 W/ft 2 (1076 and 5382 W/m 2 ) for the stand-alone data center. All other assumptions, such as building envelope, lighting, HVAC efficiencies and schedules, were based on the minimal requirements of ASHRAE Standard 90.1 at various vintages. We introduced a novel concept of supply and return air approach temperatures to capture the essential effects of non-uniform airflow and temperature distribution in data centers. The approach temperatures were pre-computed by computational fluid dynamics (CFD) simulations for various configurations of ITE loads and airflow containment management in data centers. A new feature was developed in EnergyPlus to implement the approach temperature method. A case study was conducted to demonstrate the use of the data center models. The two data center models cover all U.S. climate zones and can be used to evaluate energy saving measures for data centers, as well as to support development of data center energy efficiency codes and standards.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Autonomous reinforcement learning agent for chemical vapor deposition synthesis of quantum materials

Abstract Predictive materials synthesis is the primary bottleneck in realizing functional and quantum materials. Strategies for synthesis of promising materials are currently identified by time-consuming trial and error and there are no known predictive schemes to design synthesis parameters for materials. We use offline reinforcement learning (RL) to predict optimal synthesis schedules, i.e., a time-sequence of reaction conditions like temperatures and concentrations, for the synthesis of semiconducting monolayer MoS 2 using chemical vapor deposition. The RL agent, trained on 10,000 computational synthesis simulations, learned threshold temperatures and chemical potentials for onset of chemical reactions and predicted previously unknown synthesis schedules that produce well-sulfidized crystalline, phase-pure MoS 2 . The model can be extended to multi-task objectives such as predicting profiles for synthesis of complex structures including multi-phase heterostructures and can predict long-time behavior of reacting systems, far beyond the domain of molecular dynamics simulations, making these predictions directly relevant to experimental synthesis.

36 MATERIALS SCIENCE↗

DEPLOYING FAST CHARGING INFRASTRUCTURE FOR ELECTRIC VEHICLES IN URBAN NETWORKS: AN ACTIVITY-BASED APPROACH

This paper explores an important problem under the domain of network modeling, the optimal configuration of charging infrastructure for electric vehicles (EVs) in urban networks considering EV users' daily activities and charging behavior. This study proposes a charging behavior simulation model considering different initial state of charge (SOC), travel distance, availability of home chargers, and the daily schedule of trips for each traveler. The proposed charging behavior simulation model examines the complete chain of trips for EV users as well as the interdependency of trips traveled by each driver. The problem of finding the optimum charging configuration is then formulated as a mixed-integer nonlinear programming problem that considers the dynamics of travel time and travel distance, the interdependency of trips made by each driver, limited range of EVs, remaining battery capacity for recharging, waiting time in queue, and detour to access a charging station. This problem is solved using a metaheuristic approach for a large-scale case network. A series of examples are presented to demonstrate the model efficacy and explore the impact of energy consumption on the final SOC and the optimum charging infrastructure.

Chain of Trips↗

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↗

VC3: Virtual Clusters for Community Computation (Final Technical Report)

A traditional HPC computing facility provides a large amount of computing power but has a fixed environment designed to satisfy local needs. This makes it very challenging for users to deploy complex applications that span multiple sites and require specific application software, scheduling middleware, or sharing policies. This project addressed many of these challenges by making it possible for researchers to easily aggregate and share resources, install custom software environments, and deploy clustering frameworks across multiple HPC facilities through the concept of “virtual clusters”. We designed and implemented a prototype virtual cluster facility that enabled unprivileged users to create dynamic aggregations of computing power across multiple sites, deployed with custom middleware and complex software dependencies.

97 MATHEMATICS AND COMPUTING↗

VC3: Virtual Clusters for Community Computation

A traditional HPC computing facility provides a large amount of computing power but has a fixed environment designed to satisfy local needs. This makes it very challenging for users to deploy complex applications that span multiple sites and require specific application software, scheduling middleware, or sharing policies. This project addressed many of these challenges by making it possible for researchers to easily aggregate and share resources, install custom software environments, and deploy clustering frameworks across multiple HPC facilities through the concept of “virtual clusters”. We designed and implemented a prototype virtual cluster facility that enabled unprivileged users to create dynamic aggregations of computing power across multiple sites, deployed with custom middleware and complex software dependencies. This service is hosted at the University of Chicago and available through the site virtualclusters.org.

97 MATHEMATICS AND COMPUTING↗

Agent-Based Coordination Scheme for PV Integration (ABC4PV)

Renewables and especially photovoltaics (PV) have benefitted significantly from a host of incentives and policies targeted toward enhanced integration and adoption of specific energy technologies. However, with the push to move forward into a subsidy-free market framework, behind-the-meter residential PV applications have generally struggled to retain their value (unlike utility scale and commercial projects) [1]. This project focused on developing control-theoretic solutions aimed at improving the integration and interaction of behind-the-meter residential PV with other distribution system assets (controllable and non-controllable) to enhance the integrated value of residential PV. To this end, a suite of decentralized control methodologies have been developed to enable effective coordination and control of behind-the-meter residential load customers’ PV, battery storage systems (BSS), controllable loads and other similar assets within a distribution feeder. This interaction aims at procuring energy savings and, thus, energy bill savings. The main source of savings is drawn from reducing the effect of demand charge pricing and is realized at the feeder level, assuming community level interaction and management among the aforementioned assets. Optimal control of the assets is implemented with a distributed optimization methodology, leveraging consensus-based algorithms. The results gathered from the optimal control simulations demonstrates that the savings can be duly achieved and the algorithm decision times (to dynamically control asset set points, for example) are fast. As for the overall efficiency of PV+BSS systems, to procure energy savings from curtailment of the demand charge pricing effects, the optimal control is set up so as to minimize the variance of the load for all customers, throughout a feeder and throughout time in a rolling horizon scheduling with model predictive control. The control takes into account inter-temporal electrochemical storage (battery) degradation costs: specifically, we have developed a long-term lifetime model for the BSS that weighs in the effect of the degradation factor in the dispatch formulations, thus, a considerable operating cost that affects energy decision making. The levelized cost of energy (LCOE – redefined for the purpose of quantifying asset integration effectiveness through the customers’ energy cost) is shown to be below the threshold set for the combined PV+BSS topology of $ 0.14/kWh for multiple cases of PV penetration all the way up to 50%, provided that a policy of shared ownership of and savings is in place. Further, the LCOE calculated for the case before the deployment PV+BSS systems is also achievable, i.e. the deployment of PV+BSS, if planned and scheduled optimally. will have no effect on customers’ energy costs. From the control methodology viewpoint, the developed consensus-based algorithms are shown to converge for a wide range of problem cases (spanning normal operating scenarios and contingencies), guaranteeing dispatch solutions under forecasting errors, communication break-downs and cyber-security attacks. The proposed control solutions are scalable and real-time implementable, with dispatch computations and device set-point updates converging in less than 2s in most practical instances of the above events.

14 SOLAR ENERGY↗

Virtual Engineering Software Framework for Integrated Biomass Conversion Modeling

This presentation covers the design and implementation of a software tool to systematically connect computational models of unit operations to simulate an integrated process of low-temperature conversion of biomass to fuel. This virtual engineering (VE) software was designed with the overarching goal of connecting unit models written in various programming languages and requiring different computational resources within a single, flexible framework. The models and features currently considered for the VE library include mechanistic models for pretreatment, enzymatic hydrolysis, and aerobic bioreaction; high-fidelity computational fluid dynamics (CFD) simulations for enzymatic hydrolysis and aerobic bioreaction; and the capability to perform techno-economic analyses (TEA) using Aspen Plus, a commercial software package. The CFD models require access to high-performance computing (HPC) resources, so in addition to handling multiple programming languages and interfaces, the VE software must also be capable of interacting with an HPC scheduler to submit, run, and post-process jobs. Using the Python programming language, a new VE software package has been developed that contains functionality to manage the input-output communication between various unit models, schedule simulations to run on NREL's HPC and analyze those results, and interface with existing TEA software workflows. A Jupyter-notebook GUI was also created to solicit user input and provide documentation. In cases where multiple models for a particular unit-operation exist, selection between models is accomplished through a simple checkbox, with the appropriate inputs and outputs being parsed and converted seamlessly in the background. Each operation makes use of a different programming language, but the flow of information from pretreatment to enzymatic hydrolysis to bioreaction is managed with an intuitive, centralized file-communication strategy. In this talk, the programming approach and implementation details of the notebook are presented for multiple possibilities of the conversion process, including a demonstration of the ability to manage HPC resources. Additionally, an example of a sensitivity study of treatment parameters governing the overall conversion outcome is shown which highlights the ease of defining new problems using the VE Notebook workflow and leads into a discussion of ongoing work to enable outer-loop optimization studies.

biofuel↗

A novel method for co-optimizing battery sizing and charging strategy of battery electric bus fleets: An application to the city of Paris

Battery-electric buses (BEBs) are a promising technology for replacing diesel buses and reducing their environmental burden. However, their charging process can take several hours, depending on the charging technique and strategy, making them susceptible to schedule disruptions. Furthermore, the selection of the charging strategy and battery size can increase the total capital investment and operational expenses of a BEB fleet, which is a major obstacle to its adoption. Therefore, to minimize the total cost of ownership (TCO) and prevent schedule disruptions, it is essential to establish a well-defined approach to determine an appropriate battery size and charging strategy for BEB fleets. This paper presents a method for reducing the TCO of BEB by determining the optimal battery size and charging strategy for each bus while satisfying operating constraints. The method involves a two-step optimization algorithm that uses Dynamic Programming and Genetic Algorithm. Further, the study applies this approach to the bus fleet serving line 21 in Paris and generates the optimal battery sizing, charging strategy, and required charging infrastructure. The results indicate that 100 kWh batteries offer the best trade-off between capital and operational expenditure for the fleet deployment if used with 65–85 kW chargers at bus terminals.

33 ADVANCED PROPULSION SYSTEMS↗

Predicting core transport in ITER baseline discharges with neon injections

Achieving self-consistent performance predictions for ITER requires integrated modeling of core transport and divertor power exhaust under realistic impurity conditions. We present results from a systematic power-flow and impurity-content study for the ITER 15 MA baseline scenario constrained directly by existing SOLPS-ITER neon-seeded divertor solutions. Using the OMFIT STEP workflow, stationary temperature and density profiles are predicted with TGYRO for $1.5 \unicode{x2A7D} Z_\textrm{eff} \unicode{x2A7D} 2.5$, and the corresponding power crossing the separatrix $P_\textrm{sep}$ is evaluated. We find that $P_\textrm{sep}$ varies by more than a factor of 1.7 across this scan and matches the ${\sim}100$ MW SOLPS-ITER prediction when $Z_\textrm{eff} \simeq 1.6$ or when auxiliary heating is reduced to ${\sim}75\%$ of nominal. Rotation-sensitivity studies show that plausible variations in toroidal flow magnitude modify $P_\textrm{sep}$ by $\lesssim 20\%$, while AURORA modeling confirms that charge-exchange radiation inside the separatrix is dynamically negligible under predicted ITER neutral densities. These results identify a restricted compatibility window, $Z_\textrm{eff} \approx 1.6$ –1.75 and $0.75 \lesssim f_{P_\textrm{aux}} \unicode{x2A7D} 1.0$, in which core transport predictions remain aligned with neon-seeded divertor protection targets. This self-consistent, model-constrained framework provides actionable guidance for impurity control and auxiliary-heating scheduling in early ITER operation and supports future whole-device scenario optimization.

ITER↗

The Transactive Energy Network Template Metamodel

While transactive energy, which is defined as an allocation of electricity based on dynamically discovered values or prices, has been extensively studied, its uptake and use has been slow. This report describes a tool, the transactive network template, which should hasten the creation and uptake of transactive energy networks. Some basic principles of transactive energy are familiar from existing wholesale electricity markets. Locational prices are calculated today for zones within bulk electric transmission systems. Locational prices differ while accounting for the locational costs of electricity generation and the losses and constraints incurred when electricity is transmitted from generators and distributed to consumers. A transactive energy network might include these transmission zones. However, current research strives to apply transactive energy also in electricity distribution circuits, buildings, and even for individual generating and consuming devices. At the same time, researchers explore how to apply transactive energy in real time during increasingly shorter time intervals. Automated computational agents become necessary as transactive energy becomes applied to smaller circuit zones and at faster dynamic timescales. A transactive energy network is an example of a multi-agent system. Each zone in the network is represented by its transactive agent, which makes decisions for and acts on behalf of a business entity that is responsible for and manages one of the circuit regions. A transactive energy network is also an example of a decentralized, distributed control system. Control decisions and responsibilities are distributed among the network’s transactive agents. The transactive agents are independent; that is, there typically is no centralized authority or oversight function. Instead, transactive agents exchange transactive signals and thereby negotiate the prices and quantities of electricity that they will exchange. Initially, the circuit regions and responsibilities of transactive agents appear to be very dissimilar. Each circuit region may comprise transmission, distribution, or building-level circuits. Each has a unique position and electrical connectivity within the transactive energy network. Each possesses unique assets that either generate or consume electricity, and these (e.g., renewable energy generator, diesel generator, aggregate utility load, building load, space conditioning, refrigerator, etc.) may further differ in their price flexibility and in their strategies for responding to dynamic electricity prices. Given such diversity, an implementer’s first inclination might be to start from scratch to define all these devices and to engineer their seemingly unique interactions. Given that each implementer’s perspective may be narrow within a transactive energy network, it is unlikely that uniquely engineered systems would interact well. This is where the transactive network template is applicable. The transactive network template is a metamodel that has been developed to guide implementers as they configure their own transactive agent within a network of such agents. The object-oriented design of the transactive network template provides basic code object types that may be used and extended by implementers to represent each of the assets in their circuit region. These objects further facilitate the transactive agent’s necessary computations, which are divided among responsibilities to schedule power usage, balance electric supply and demand, and coordinate the exchange of electricity with the other transactive agents. This report addresses the conceptual transactive network template design. Implementers are directed to more formal design documents and reference implementations. A Python™-based1 reference implementation of the transactive network template has been coded, and three implementations have been configured to represent a national laboratory and two university campuses. Version 2 of the transactive node template generalizes the market class and its methods to facilitate multiple, and more diverse market coordination mechanisms than were facilitated by and demonstrated using Version 1. Version 3 includes new Appendix B, which addresses the designs of methods that would make dynamic prices track approved electricity rates. In the future, the author wishes to make the transactive network template more generally applicable to networks that require more accurate power flow. Development of the transactive network template is jointly funded by the U.S. Department of Energy (DOE) Energy Efficiency and Renewable Energy and the DOE Office of Electricity. In late 2015, one of the first projects to be funded by the DOE Grid Laboratory Modernization Laboratory Consortium was the Clean Energy and Transactive Campus project, led by Pacific Northwest National Laboratory. DOE funds were matched by an investment by the Washington Department of Commerce through its Clean Energy Fund. The transactive network template was developed to guide the implementation of transactive energy networks within this project’s scope.

24 POWER TRANSMISSION AND DISTRIBUTION↗