Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2509.10713

Demand Charge Management: Prototype Design and Testing

Christian Escarrega·Wyatt Lopez Coggins·Sammy Hamed·Mohammadreza Iranpour·Mohammad Rasoul Narimani
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper presents the design, implementation, and validation of a smart, low-cost Energy Management System (EMS) and Demand Charge Management (DCM) prototype, developed as part of an undergraduate senior design project. The system serves as both a practical solution for reducing electricity costs and a pedagogical tool for teaching real-time energy control concepts in power and embedded systems courses. Unlike conventional EMS/DCM solutions that rely on high-cost commercial hardware or purely theoretical models, the proposed system integrates grid power, lithium-iron phosphate (LiFePO4) battery storage, and real-time control into a unified, scalable platform constructed at a fraction of the cost, approximately $1,800 compared to over $16,000 for leading commercial options. The controller dynamically optimizes energy usage by switching between grid and battery sources based on real-time measurements of electricity prices, load power, and battery state of charge (SoC). This enables peak shaving, energy arbitrage, and backup power functionality, thereby enhancing cost efficiency and grid resilience for both residential and small commercial users. The architecture features a modular three-layer design comprising a sensing layer for electrical data acquisition, a control layer executing Python-based logic on a Raspberry Pi, and an actuator layer for seamless energy switching. Data is communicated via MQTT and visualized through the Blynk IoT platform, providing an intuitive and remotely accessible user interface. The prototype's effectiveness was validated through real-world testing, confirming its capability to reduce demand charges and ensure reliable energy delivery under varying operational conditions. Its affordability, open-source control logic, and educational versatility make it an ideal candidate for both deployment and instructional use.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christian Escarrega, Wyatt Lopez Coggins, Sammy Hamed, Mohammadreza Iranpour, Mohammad Rasoul Narimani. 2025-09-12. Demand Charge Management: Prototype Design and Testing. https://arxiv.org/abs/2509.10713

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Subpath-Based Column Generation for Electric Vehicle Routing Problems

Motivated by widespread electrification targets, this paper studies an Electric Vehicle Routing Problem with Time Windows and Nonlinear Charging (EVRPTWNL) that jointly optimizes routing-scheduling decisions and charging decisions given vehicle capacities, time windows and battery capacities. We develop a column generation scheme with a subpath-based label-setting algorithm that decomposes the pricing problem into two phases: (i) generating subpaths between charging stations, and (ii) combining subpaths into paths while optimizing charging decisions in between. We formalize a domination framework to establish the convergence and exactness of the algorithm, and prove that the methodology can solve a range of EVRP variants (e.g., with vehicle capacities, time windows, and nonlinear charging) and relaxation-tightening strategies (e.g., ng-relaxations and subset-row cuts). Computational results show improvements over path-based benchmarks in both computational time and solution quality, especially when time windows become wider, when vehicles can perform multiple tasks on a single charge and when vehicles still need to recharge several times across the planning horizon. Ultimately, the methodology can scale to otherwise intractable instances with up to 100 customers, thereby enhancing fleet management capabilities across electrified logistics areas.

math.OC↗
arXiv2026

Polynomial Scaling is Possible For Neural Operator Approximations of Structured Families of BSDEs

Neural operator (NO) architectures learn nonlinear maps between infinite-dimensional function spaces and are widely used to accelerate simulation and enable data-driven model discovery. While universality results ensure expressivity, they do not address \emph{complexity}: for broad operator classes described only through regularity (e.g.\ uniform continuity or $C^r$-regularity), information-theoretic lower bounds imply that minimax-optimal NO approximation rates scale \emph{exponentially} in the reciprocal accuracy $1/\varepsilon$. This has shifted the focus of NO theory toward identifying additional problem-specific structure, beyond regularity, under which suitably tailored NO architectures can leverage to unlock polynomial scaling in $1/\varepsilon$. We exhibit the first polynomial-scaling regime for NO approximations of solution operators in stochastic analysis; by identifying structured families of \emph{non-Markovian} BSDEs with randomized terminal condition parameterized by the Sobolev-regular terminal condition and by Sobolev-regular additive nonlinear perturbations of the generator. We prove that their solution operator can be approximated (uniformly over the family) by a tailored NO whose number of trainable parameters grows \emph{polynomially} in $1/\varepsilon$. We unlock this polynomial scaling regime by \emph{informing the NO's inductive bias} by factoring out the singular part of the associated semilinear elliptic PDE Green's function and by incorporating the Doléans--Dade exponential of the BSDE's common non-Markovian factor into the NO's decoding layers. As a byproduct, we extend polynomial-scaling guarantees from families of linear elliptic PDEs on regular domains to the semilinear setting.

math.OC↗
arXiv2026

The Competive Spectral Radius of Families of Nonexpansive Mappings

We consider a new class of repeated zero-sum games in which the payoff is the escape rate of a switched dynamical system, where at every stage, the transition is given by a nonexpansive operator depending on the actions of both players. This generalizes to the two-player (and non-linear) case the notion of joint spectral radius of a family of matrices. We show that the value of this game does exist, and we characterize it in terms of an infinite dimensional non-linear eigenproblem. This provides a two-player analogue of Mañe's lemma from ergodic control. This also extends to the two-player case results of Kohlberg and Neyman (1981), Karlsson (2001), and Vigeral and the second author (2012), concerning the asymptotic behavior of nonexpansive mappings. We discuss two special cases of this game: order preserving and positively homogeneous self-maps of a cone equipped with Funk's and Thompson's metrics, and translations of a finite dimensional normed space.

math.OC↗