Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.22463

Stateful Pricing and Allocation for Repeated Constrained DER Coordination in Distribution Networks

Shaun Sweeney·Peter Kilby·Blake Penney·Komeil Moghaddasi·Sunera Mudiyanselage
View original source ↗Read source document ↗Export metadata ↓

Abstract

Distribution networks with high penetrations of distributed energy resources (DERs) must repeatedly allocate limited network capability in two directions: under import scarcity, which flexible demand is served, and under export congestion, which generation is curtailed. Dynamic operating envelopes (DOEs) enforce hard feasibility bounds but lack intertemporal correction, while dynamic network prices (DNPs) provide an allocative signal but cannot guarantee constraint satisfaction. This paper develops a stateful cyber-physical coordination mechanism, termed an Automatic Market Maker (AMM), as an additive coordination layer for machine-to-machine DER access. The mechanism combines dual fairness states for import and export, bounded bilateral prices driven by a voltage-aware deficit signal, and feasibility-constrained matching within a two-tier MV/LV architecture. Experiments on the CSIRO MV+33LV feeder dataset compare five mechanisms and benchmark the fair-over-time DOE formulations of Moring et al. (FET, FOT, FUH). Relative to equal-allocation DOE, the AMM reduces unserved flexible demand by 76% (96.0 MWh to 23.2 MWh) with zero thermal violations and reduces export curtailment from 85.4 MWh to 64.5 MWh. Near-identical DOE and DOE-GREEDY performance confirms that heuristic choice alone does not improve repeated constrained outcomes. The AMM reaches an annual inter-feeder Jain index of 0.9998, outperforming all DOE variants from month 6 onwards. Direct benchmarking against FET/FOT/FUH shows that these mechanisms achieve higher worst-feeder equity through an explicit max-min MV objective, but operate offline over predetermined horizons and do not provide bilateral scarcity signals, real-time operation, or participant-level intertemporal correction. The two approaches address different objectives and may be combined in future work.

Explore related subjects

eess.SYcs.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shaun Sweeney, Peter Kilby, Blake Penney, Komeil Moghaddasi, Sunera Mudiyanselage. 2026-06-21. Stateful Pricing and Allocation for Repeated Constrained DER Coordination in Distribution Networks. https://arxiv.org/abs/2606.22463

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

KEEP EXPLORING

Related papers

arXiv2026

Failure-Aware Iterative Learning of State-Control Invariant Sets

In this paper, we address the problem of computing maximal state-control invariant sets for deterministic linear systems using failing trajectories. We introduce the concept of state-control invariance, which extends control invariance from the state space to the joint state-control space. The maximal state-control invariant (MSCI) set simultaneously encodes the maximal control invariant set (MCI) and, for each state in the MCI, the set of control inputs that preserve invariance. We prove that the state projection of the MSCI is the MCI and the state-dependent sections of the MSCI are the admissible invariance-preserving inputs. Building on this framework, we develop a Failure-Aware Iterative Learning (FAIL) algorithm for deterministic linear time-invariant systems with polytopic constraints. The algorithm iteratively updates a constraint set in the state-control space by learning predecessor halfspaces from one-step failing state-input pairs, without knowing the dynamics. For each failure, FAIL learns the violated halfspaces of the predecessor of the constraint set by a regression on failing trajectories. We prove that the learned constraint set converges monotonically to the MSCI. Numerical experiments on a double integrator system validate the proposed approach.

eess.SY↗
arXiv2026

Consensus and Synchronization of Multi-agent Systems over Finite Fields - Graph Topologies

This paper presents cooperative protocols for multi-agent systems with agents having a finite state-space. Both scalar single-integrator consensus and general LTI system synchronization are considered. Systems having a finite state-space describe agents with minimal memory capacity processing only a finite alphabet. Such systems are remarkably resilient to communication noise. The crucial problem, however, is to construct the admissible communication topology, which is NP-hard. We address this by efficiently exploring the subsets of admissible graph matrices and propose two new algorithms to generate them. Simulations validate the proposed approach.

eess.SY↗
arXiv2026

Extracting Exact Lie Derivatives Without Backpropagation: A Dual Compiler for Neural Control Barrier Functions

A safety filter based on a neural control barrier function (CBF) deployed in an embedded control loop evaluates, at each control cycle, the trained network and its Lie derivatives along the system vector fields, under the memory and worst-case execution time (WCET) constraints that safety-oriented coding standards impose. Reverse-mode automatic differentiation, by which training frameworks obtain these derivatives, retains an activation cache whose size grows with the sum of the layer widths, and general-purpose differentiation runtimes allocate the computational graph from the heap at each call. This paper presents a compiler that evaluates a neural CBF and its exact Lie derivatives by forward-mode dual-number arithmetic. The compiler emits self-contained C++ code in which a single forward pass, without backpropagation, returns the barrier value and its exact Lie derivative along a given vector field; the drift and input Lie derivatives of the safety constraint are obtained from one such pass per vector field, and a second-order extension based on hyper-dual numbers returns the exact second-order Lie derivatives required by CBFs of relative degree two. The dual forward pass requires a workspace bounded by four times the widest layer, independent of network depth, and the emitted code contains no allocation call sites, so the absence of dynamic allocation is verifiable by inspection of the code. On an ESP32-S3 microcontroller, the compiled filter assembles the complete safety constraint in under one millisecond from statically allocated buffers of at most 768 bytes, and the maximum execution time over 1000 evaluations lies within 5% of the median in all three examples, whereas a heap-allocating reverse-mode baseline shows maxima 33% and 70% above its median in the two first-order examples. The compiler and the embedded experiments are released as open-source software.

eess.SY↗