Searcharxiv⌕ Search

arXiv · 2610.10958

EnergyNet in Practice: Long Grid, Short Grids and Mobility-Based Energy Peering

Abstract

Electrification is planned as a network problem: more demand, more upstream capacity, local resources waiting for reinforcement. We argue that a material part of that bill, in money and time, follows from architecture, not electrification itself, and propose the Short Grid as the deployment unit: a locally controlled building, block or campus whose demand, generation, storage and local market operate behind Energy Routers enforcing an approved connection envelope to the Long Grid. Because the envelope governs exchange, not installed capacity, local resources can grow and many sites can build in parallel at the pace of PV and EV installation, not grid reinforcement. PV and EV batteries dominate today, but the architecture is general: any generation or storage, fixed or mobile, fits behind the same boundary and interfaces. EnergyNet Operators coordinate exchange among Short Grids and with the Long Grid; protection stays local; Vehicle-to-EnergyNet (V2EN) and Mobility-Based Energy Peering (MEP) make mobility-financed batteries accessible within and between them; priority-based operation protects critical services in shortage. We test it in models, not yet the field: a ten-building neighbourhood in Lund, Sweden; a bus-linked microgrid pair at Stanford and Half Moon Bay; and a proposed 20-site network in Rockaway, New York. Households and services are the largest demand category in Sweden, Denmark, Norway, California and New York (484 TWh/yr); halving their grid imports would be about 242 TWh. Europe's network investment to 2040 is estimated above EUR 1.2 trillion; modelling shows it depends on system design. Negagrid value, following the negawatt, counts network investment avoided, downsized or deferred, net of local substitute costs. "Don't pay twice": build coordinated local capability first; reinforce the Long Grid for what remains.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonas Birgersson, Max Collins, Marc A. Weiss, Jimmy Chen, Daniel Kammen, Tomas Kåberger, Mark Z. Jacobson, Newsha K. Ajami, Franklin Carrero-Martínez, Michael Menser, Henrik Ny, Lou Riordan, Jill G. Ferguson. 2026-10-07. EnergyNet in Practice: Long Grid, Short Grids and Mobility-Based Energy Peering. https://arxiv.org/abs/2610.10958

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

KEEP EXPLORING

Related papers

Graphon Particle Systems, Part I: Spatio-Temporal Approximation and Law of Large Numbers

We study a class of graphon particle systems with time-varying random coefficients. In a graphon particle system, the interactions among particles are characterized by the coupled mean field terms through an underlying graphon and the randomness of the coefficients comes from exogenous stochastic processes. By constructing two-level approximated sequences converging in 2-Wasserstein distance, we prove the existence and uniqueness of the solution to the system. Besides, by constructing two-level approximated functions converging to the graphon mean field terms, we establish the law of large numbers, which reveals that if the number of particles tends to infinity and the discretization step tends to zero, then the discrete-time interacting particle system over a large-scale network converges to the graphon particle system. As a byproduct, we discover that the graphon particle system can describe the limiting dynamics of the distributed stochastic gradient descent algorithm over the large-scale network and prove that if the gradients of the local cost functions are Lipschitz continuous, then the graphon particle system can be regarded as the spatio-temporal approximation of the discrete-time distributed stochastic gradient descent algorithm as the number of network nodes tends to infinity and the algorithm step size tends to zero.

eess.SY↗

The Role of Information Incompleteness in Defending Against Stealth Attacks

The effectiveness of Data Injection Attacks (DIAs) critically depends on the completeness of the system information accessible to adversaries. This relationship positions information incompleteness enhancement as a vital defense strategy for degrading DIA performance. In this paper, we focus on information-theoretic stealth attacks, where the attacker encounters a fundamental tradeoff between the attack stealthiness and destructiveness. Specifically, we systematically characterize how incomplete admittance information impacts these dual objectives. In particular, we establish sufficient conditions for two distinct operational regimes: (i) stealthiness intensifies while destructive potential diminishes and (ii) destructiveness increases while stealth capability weakens. For scenarios beyond these regimes, we propose a maximal incompleteness strategy to optimally degrade stealth capability. To solve the associated optimization problem, the feasible region is reduced without excluding the optimal solution, and a heuristic algorithm is then introduced to effectively identify the near-optimal solutions within the reduced region. Furthermore, we extend our theoretical analysis to broader scenarios in which the initial sufficient conditions are not met, introducing exact diagnostic indices to evaluate instance-wise performance shifts. Numerical simulations are conducted on IEEE test systems to validate the findings.

eess.SY↗

Exact Decomposition of Value Functions for Two-Player Games in Hamilton-Jacobi Reachability

Hamilton-Jacobi reachability (HJR) is an important framework in safe control theory. HJR provides theoretical tools and numerical methods to obtain value-functions for tasks involving target-reaching and obstacle-avoidance. A recent work proposed an algebraic framework to scale to complex, composite tasks via decomposing the value functions of the composite tasks into value functions for the fundamental tasks traditionally studied in HJR, all in the one-player setting. Many of these decomposition results, however, do not directly translate to the two-player setting. In this technical note, we nevertheless show that one of the previous work's key results for analyzing various tasks involving reaching multiple targets while obeying constraints still holds in the two-player setting, so long as a critical monotonicity assumption is satisfied. In particular, we detail the analogous result and its proof (which structurally differs from the one-player case), we show via a counter-example what can go wrong if this monotonicity assumption is not satisfied, and we show how the analysis of a variety of tasks can be performed using this result. Such tasks include sequential and any-order multi-target-reaching tasks under constraints. We note that, whereas the prior work considered discrete-time, infinite-horizon tasks, which are more standard in reinforcement learning, we here consider continuous-time, finite-horizon tasks, which are more standard in HJR.

eess.SY↗