SearcharxivSearch

arXiv · 2510.11998

Distributed Stochastic Model Predictive Control with Temporal Aggregation for the Joint Dispatch of Cascaded Hydropower and Renewables

Abstract

This paper addresses the real-time energy dispatch of a hybrid system comprising cascaded run-of-the-river hydropower plants, wind, and solar photovoltaic units, operated under uncertainty in water inflows and renewable power generation. Traditional scenario-based stochastic model predictive control (MPC) schemes suffer from severe computational limitations due to the high dimensionality induced by both the temporal and scenario dimensions of the dispatch problem, as well as the inherent nonconvexities associated with cascaded hydropower dynamics. To overcome these challenges, we propose a novel control scheme that seamlessly integrates time series aggregation (TSA), distributed optimization, and stochastic MPC. The resulting temporally aggregated distributed stochastic MPC scheme simultaneously reduces the temporal dimension of the dispatch problem via TSA and decomposes it across scenarios through distributed optimization. Our main theoretical result establishes a formal performance guarantee for the proposed controller, enabling a rigorous quantification of its solution accuracy at every MPC iteration. Numerical results based on a real-world case study show the effectiveness of the proposed controller, achieving up to 74% reduction in computational effort relative to the full-scale centralized counterpart when the required solution accuracy is at least 99%, and up to 85% when the accuracy requirement is relaxed to 95%. Notably, the proposed controller not only significantly enhances computational efficiency relative to the traditional full-scale centralized counterpart, but more importantly restores computational tractability, whereas the traditional controller fails to solve the dispatch problem within the prescribed time limit for computing control actions.

Explore related subjects

Keep this discovery

BibTeXRIS

Luca Santosuosso, Sonja Wogrin. 2025-10-13. Distributed Stochastic Model Predictive Control with Temporal Aggregation for the Joint Dispatch of Cascaded Hydropower and Renewables. https://arxiv.org/abs/2510.11998

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

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC