Search arXivSearch

arXiv · 2608.15076

Industrial Load Modeling and Optimization for Market-Based Interaction with Power Systems

Abstract

Industrial loads account for over 60% of China's electricity consumption and can provide substantial flexibility for renewable-dominated power systems. Their market participation remains limited by complex production constraints, unavailable equipment parameters, and the computational scale of resource coordination. This dissertation addresses these barriers from the perspective of a load aggregator. It reformulates the State Task Network and Resource Task Network as the Linearized State Task Network and continuous Resource Task Network. In a standard grid-interaction case, the reformulation reduces solution time from 24 hours to 30 minutes and supports coordinated optimization of 2,000 industrial users. Production Scheduling Identification combines process knowledge and cost-minimizing behavior with hourly smart-meter data; using 21 training days, it achieves load-model errors of 5.2% and 8.5% for cement and steel-powder cases, compared with 13.4%-19.2% for machine-learning baselines. Data-Driven Dimension Reduction yields errors of 3.6%-10.3% across three industrial cases and replaces 10,208 integer variables with 24-48 continuous variables in the steelmaking case. For market interaction, a joint bidding and power-disaggregation framework uses shadow prices to allocate real-time commands among tens of thousands of resources through millisecond-level arithmetic. In a representative comparison, it reduces interaction costs by 40% while retaining the solution quality of the joint optimization model. These contributions keep detailed industrial process models available for executable scheduling while providing aggregators with compact models for flexibility assessment, portfolio optimization, and electricity-market participation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ruike Lyu. 2026-08-19. Industrial Load Modeling and Optimization for Market-Based Interaction with Power Systems. https://arxiv.org/abs/2608.15076

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

KEEP EXPLORING

Related papers

Constrained Feedback Control of Nonlinear Systems via Approximate HJB and Control Barrier Functions

This paper presents a two-stage framework for constrained feedback control of input-affine nonlinear systems. Offline, an approximate value function for the unconstrained problem is computed, for example using Hamilton--Jacobi--Bellman (HJB)-based policy iteration. Online, the proposed quadratic program (QP) minimizes the pre-Hamiltonian evaluated using the approximate value-function gradient subject to safety constraints enforced by control barrier functions (CBFs). This architecture decouples performance optimization from constraint enforcement, allowing constraints to be modified without recomputing the value function. As in CBF-QP architectures based on control Lyapunov functions (CLFs), safety is enforced as a hard constraint; however, the performance objective targets approximate optimality rather than a prescribed Lyapunov decay. Numerical results on a linear 2-state hovercraft and a nonlinear 9-state spacecraft attitude-control problem show agreement with the constrained open-loop optimal control problem (OCP) benchmark in the linear case, and performance close to the OCP benchmark, improving on CLF-based controllers, in the nonlinear case.

eess.SY

Rao-Blackwellized Stein Gradient Descent for Joint State-Parameter Estimation

We present a filtering framework for online joint state estimation and parameter identification in nonlinear, time-varying systems. The algorithm uses a Rao-Blackwellization technique to infer joint state-parameter posteriors efficiently. In particular, conditional state distributions are computed analytically via Kalman filtering, while model parameters, including the measurement-noise covariance, are approximated using particle-based Stein Variational Gradient Descent (SVGD), enabling stable real-time inference. To handle parameters subject to physical constraints, we further introduce constrained variants that enforce them through an alternating direction method of multipliers (ADMM) splitting of the SVGD update, including nonlinear equality constraints that standard particle filters cannot readily handle. We derive a stability bound that relates the approximation error in the parameter posterior to the resulting error in the marginal state distribution. Performance of the proposed filters is validated on three case studies: a fed-batch bioreactor with Haldane kinetics and a damped pendulum, both under physical constraints, and a neural-network-augmented dynamic system. The examples cover parameter estimation under inequality and equality constraints and online neural-network training within a dynamical model.

eess.SY

Firing Rate Neural Network Implementations of Model Predictive Control

Human and animal brains perform planning to enable complex movements and behaviors, a process that can be effectively described using model predictive control (MPC). How could the brain physically implement MPC? In this work, we translate model predictive controllers into firing rate neural networks, offering insights into the nonlinear neural dynamics that underpin planning. We propose a constructive method; no training is required. This is done first applying the projected gradient method to the dual problem to derive a baseline neural network implementation. We then use factorization and contraction analysis to systematically generate alternative network architectures; in other words, we systematically generate hypotheses for how planning is done in the brain via neural dynamics. Finally, we present numerical simulations to study different neural networks performing MPC to balance an inverted pendulum on a cart (i.e., balancing a stick on a hand), including one example in which imposing sparse connectivity (a property observed in brain networks) does not degrade control performance.

eess.SY