skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Experimental Evaluation of Energy Transfers by an Energy Packet Switch in a Digital Microgrid
In this paper, we experimentally demonstrate the performance of the recently proposed Energy Packet Switch (EPS) for energy distribution. The N × M EPS aggregates the energy from N sources and dispatches energy to M outputs, each of which feeds one or many loads. Energy is distributed from a source to a load in the form of energy packets. The operation of the EPS is an enabler device to realize a digital microgrid. We carry out exhaustive experiments to show that the EPS grants energy to keep demand satisfied and even in cases when the demand overwhelms the EPS capacity. Results of the experiments show that the EPS ably grants all energy requests that fall within its capacity, and it controls the distribution of energy under extenuating conditions by approaching a level of fairness. The experiments also show the average time that a request waits for the corresponding grant.  more » « less
Award ID(s):
1641033
PAR ID:
10124363
Author(s) / Creator(s):
; ; ; ; ;
Date Published:
Journal Name:
019 IEEE 7th International Conference on Smart Energy Grid Engineering (SEGE)
Page Range / eLocation ID:
1-6
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, Proceedings of the annual ACM Symposium on Theory of Computing)
    We present an algorithm that, with high probability, generates a random spanning tree from an edge-weighted undirected graph in \Otil(n^{5/3 }m^{1/3}) time\footnote{The \Otil(\cdot) notation hides \poly(\log n) factors}. The tree is sampled from a distribution where the probability of each tree is proportional to the product of its edge weights. This improves upon the previous best algorithm due to Colbourn et al. that runs in matrix multiplication time, O(n^\omega). For the special case of unweighted graphs, this improves upon the best previously known running time of \tilde{O}(\min\{n^{\omega},m\sqrt{n},m^{4/3}\}) for m >> n^{7/4} (Colbourn et al. '96, Kelner-Madry '09, Madry et al. '15). The effective resistance metric is essential to our algorithm, as in the work of Madry et al., but we eschew determinant-based and random walk-based techniques used by previous algorithms. Instead, our algorithm is based on Gaussian elimination, and the fact that effective resistance is preserved in the graph resulting from eliminating a subset of vertices (called a Schur complement). As part of our algorithm, we show how to compute \eps-approximate effective resistances for a set SS of vertex pairs via approximate Schur complements in \Otil(m+(n + |S|)\eps^{-2}) time, without using the Johnson-Lindenstrauss lemma which requires \Otil( \min\{(m + |S|)\eps^{-2}, m+n\eps^{-4} +|S|\eps^{-2}\}) time. We combine this approximation procedure with an error correction procedure for handing edges where our estimate isn't sufficiently accurate. 
    more » « less
  2. ; ; ; ; (, Proceedings of the 37th International Conference on Machine Learning)
    We study the problem of efficiently estimating the effect of an intervention on a single variable using observational samples. Our goal is to give algorithms with polynomial time and sample complexity in a non-parametric setting. Tian and Pearl (AAAI ’02) have exactly characterized the class of causal graphs for which causal effects of atomic interventions can be identified from observational data. We make their result quantitative. Suppose 𝒫 is a causal model on a set V of n observable variables with respect to a given causal graph G, and let do(x) be an identifiable intervention on a variable X. We show that assuming that G has bounded in-degree and bounded c-components (k) and that the observational distribution satisfies a strong positivity condition: (i) [Evaluation] There is an algorithm that outputs with probability 2/3 an evaluator for a distribution P^ that satisfies TV(P(V | do(x)), P^(V)) < eps using m=O (n/eps^2) samples from P and O(mn) time. The evaluator can return in O(n) time the probability P^(v) for any assignment v to V. (ii) [Sampling] There is an algorithm that outputs with probability 2/3 a sampler for a distribution P^ that satisfies TV(P(V | do(x)), P^(V)) < eps using m=O (n/eps^2) samples from P and O(mn) time. The sampler returns an iid sample from P^ with probability 1 in O(n) time. We extend our techniques to estimate P(Y | do(x)) for a subset Y of variables of interest. We also show lower bounds for the sample complexity, demonstrating that our sample complexity has optimal dependence on the parameters n and eps, as well as if k=1 on the strong positivity parameter. 
    more » « less
  3. ; ; ; (, 2017 IEEE 14th International Conference on Mobile Ad Hoc and Sensor Systems (MASS))
    We present a feasibility analysis of the controlled delivery power grid (CDG) that uses aggregated power request by users to reduce communications overhead. The CDG, as an approach to the power grid, uses a data network to communicate requests and grants of power in the distribution of electrical power. These requests and grants allow the energy supplier know the power demand in advance and to designate the loads and the time when power is supplied to them. Each load is assigned a power-network address that is used for communication of requests and grants with the energy supplier. With addressed loads, power is only delivered to selected loads. However, issuing a request for power before delivery takes place requires knowing the demand of power the load consumes during the operation interval. However, it is a general concern that having issuing requests in a time-slot basis may risk request losses and therefore, generate intermittent supply. Therefore, we propose request aggregation to minimize the number of requests issued. We show by simulation that the CDG with request aggregation attains high performance, in terms of satisfaction ratio and waiting time for power supply. 
    more » « less
  4. ; ; (, European Control Conference)
    This work seeks to quantify the benefits of using energy storage toward the reduction of the energy generation cost of a power system. A two-fold optimization framework is provided where the first optimization problem seeks to find the optimal storage schedule that minimizes operational costs. Since the operational cost depends on the storage capacity, a second optimization problem is then formulated with the aim of finding the optimal storage capacity to be deployed. Although, in general, these problems are difficult to solve, we provide a lower bound on the cost savings for a parametrized family of demand profiles. The optimization framework is numerically illustrated using real-world demand data from ISO New England. Numerical results show that energy storage can reduce energy generation costs by at least 2.5 percent. 
    more » « less
  5. ; ; ; ; ; (, Zenodo)
    Summary:   This repository contains the datasets used in the 2025 PG&E Energy Analytics Challenge on Electricity Load Forecasting, co-organized by the IISE Energy Systems Division and the INFORMS Quality, Statistics, and Reliability Section, and graciously sponsored by the Pacific Gas & Electric Company (PG&E).  The repository contains two files: Train.xlsx: Contains three years of hourly electric loads from San Diego, California (Years 2020-2022), as well as exogenous weather information at five neighboring sites within the San Diego area.    Test.xlsx: Contains one year of hourly electric loads from San Diego, California (Year 2023), as as well as exogenous weather information at five neighboring sites within the San Diego area.    Background:  This competition aimed to predict electricity loads for a specific location within the CAISO system. Accurate load forecasting is critical for managing electricity distribution within California’s diverse and dynamic energy market. Load patterns can vary significantly due to factors such as weather conditions, local supply and demand, and the mix of nearby energy generation sources.   During the competition, the specific location and the actual years were not disclosed to the participants. Participants were then asked to generate a year’s worth of load forecasts using historical load values and exogeneous weather information. Predictor data were not allowed to be taken from future time periods: When predicting the load values at a particular day, the model was allowed to only use predictor variable information from that time period or before. For example, if a team is predicting the load for Day 5 Hour 3 in Year 3, the model can only take in predictor values from Day 5 Hour 3 in Year 3, or before. Furthermore, during the competition, the load information for the test set (highlighted in yellow in the test data file) was reserved from all participants, who were asked to submit their predictions for the full year.    This is the second offering of the PG&E Energy Analytics challenge, complementing the first offering in 2024 which focused on electricity price forecasting [Results of the 2024 challenge: Aziz Ezzat, A., Mansouri, M., Yildirim, M., & Fang, X. (2025). IISE PG&E Energy Analytics Challenge 2024: Forecasting day-ahead electricity prices. IISE Transactions, 1–13. https://doi.org/10.1080/24725854.2024.2447049].  
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email