Search arXivSearch

arXiv · 2406.07454

Reserve Provision from Electric Vehicles: Aggregate Boundaries and Stochastic Model Predictive Control

Abstract

Controlled charging of electric vehicles, EVs, is a major potential source of flexibility to facilitate the integration of variable renewable energy and reduce the need for stationary energy storage. To offer system services from EVs, fleet aggregators must address the uncertainty of individual driving and charging behaviour. This paper introduces a means of forecasting the service volume available from EVs by considering several EV batteries as one conceptual battery with aggregate power and energy boundaries. Aggregation avoids the difficult prediction of individual driving behaviour. The predictability of the boundaries is demonstrated using a multiple linear regression model which achieves a normalised root mean square error of 20% - 40% for a fleet of 1,000 EVs. A two-stage stochastic model predictive control algorithm is used to schedule reserve services on a day-ahead basis addressing risk trade-offs by including Conditional Value-at-Risk in the objective function. A case study with 1.2 million domestic EV charge records from Great Britain illustrates that increasing fleet size improves prediction accuracy, thereby increasing reserve revenues and decreasing an aggregator's operational costs. For fleet sizes of 400 or above, cost reductions plateau at 60% compared to uncontrolled charging, with an average of 1.8kW of reserve provided per vehicle.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jacob Thrän, Jakub Mareček, Robert N. Shorten, Timothy C. Green. 2025-02-17. Reserve Provision from Electric Vehicles: Aggregate Boundaries and Stochastic Model Predictive Control. https://doi.org/10.1109/tpwrs.2025.3539863

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