Searcharxiv⌕ Search

arXiv · 2610.41633

Probability-Layer Clustering for Bound-and-Budget Calibration in Multi-Bound Robust Bidding of Renewable-Based Virtual Power Plants

Abstract

RVPPs that aggregate dispatchable and non-dispatchable renewable energy sources, storage, and flexible demand that bid in the day-ahead and secondary reserve markets must cope with uncertainties in market prices, renewable generation, and demand. MBRO is well suited to this setting because it hedges adverse realizations through several deviation layers while keeping the final bidding problem as a tractable, scenario-free MILP. Its performance, however, depends on how the deviation bounds and uncertainty budgets are calibrated. Existing MBRO implementations commonly rely on fixed percentile-based bounds and externally specified budget vectors, usually examined through sensitivity analysis. This paper proposes PL-MBRO, that constructs parameter-specific deviation bounds from historical data conditional on selected risk-attitude quantiles and automatically derives the corresponding uncertainty budgets from empirical cluster probabilities. For each uncertain parameter, k-medians clustering partitions the historical daily profiles into representative probability layers; the cluster median defines the balanced representative, while favorable and adverse within-cluster percentiles define the optimistic and pessimistic representatives. The empirical cluster probabilities are mapped to integer full-horizon uncertainty budgets over the 96 quarter-hourly periods, while the robust inner problem determines the periods in which the corresponding deviation layers are most adverse to the schedule. Compared with a percentilebased MBRO benchmark, in-sample and out-of-sample tests on an RVPP bidding in both markets show that PL-MBRO consistently achieves better realized economic outcomes across the optimistic, balanced, and pessimistic strategies, with improvements of up to 92.7% in-sample and 57.3% out-of-sample, measured relative to the absolute value of the corresponding benchmark realized profit.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hadi Nemati, Álvaro Ortega, Enrique Lobato, Luis Rouco. 2026-10-30. Probability-Layer Clustering for Bound-and-Budget Calibration in Multi-Bound Robust Bidding of Renewable-Based Virtual Power Plants. https://arxiv.org/abs/2610.41633

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

KEEP EXPLORING

Related papers

Reinforcement Learning based Traffic Signal Control for Queue Minimization: From Lane-based to Laneless Traffic

Efficient traffic signal control (TSC) is essential for reducing congestion and delays. Traditional TSC methods struggle to capture the dynamics of laneless, heterogeneous traffic. We propose a reinforcement learning (RL) based adaptive TSC framework whose reward depends only on approach-level queue length, motivated by the difficulty of obtaining per-vehicle measurements in laneless traffic, and evaluate it using SUMO on a conventional lane-based, homogeneous (LBHO) intersection and on a non-orthogonal laneless, heterogeneous (LLHE) intersection. On the LBHO site, the lowest mean configuration has about 23\% lower mean queue length than a Dynamic Webster baseline, and the unselected Full-State configuration about 15\% lower. On the LLHE site, all RL configurations have 66-73\% lower mean queue length than a Dynamic Webster baseline under nominal demand, and 63--74\% lower under two higher-demand scenarios evaluated without retraining. Our algorithm also outperforms actuated control and a RESCO-DQN baseline on mean queue length. We additionally release a laneless, heterogeneous-vehicle SUMO framework integrated with RL based signal control, to our knowledge the first such open implementation on a current SUMO version.

eess.SY↗

A Deep State-Space Model Compression Method using Upper Bound on Output Error

We study deep state-space models (Deep SSMs) that contain linear quadratic-output (LQO) systems as internal blocks and present a compression method with a provable output error guarantee. We first derive an upper bound on the output error between two Deep SSMs and show that the bound can be expressed in terms of the $h^2$-error norms between the layerwise LQO systems. In particular, we show that reducing the $h^2$ approximation errors of the LQO systems placed in shallow layers is effective in reducing the derived upper bound on the output error. Next, we formulate an optimization problem for the derived upper bound and develop a gradient-based MOR method. In the numerical experiments, using the IMDb task from the LRA benchmark, we demonstrate the effectiveness of the proposed upper-bound-based compression method. In particular, we show that the number of trainable parameters can be reduced by approximately 60\% without retraining while maintaining the performance of the original model.

eess.SY↗

Safe Navigation in Cluttered Environments Via Spline-Based Harmonic Potential Fields

We provide a motion-planning framework for target reaching and obstacle avoidance in cluttered environments. Given a polyhedral decomposition of the feasible space, the agent is guided through a prescribed sequence of cells by a suitable control policy. For each cell, we construct a potential induced by a harmonic function on the unit disk whose Dirichlet boundary condition is represented by a cardinal B-spline curve. A detailed analysis of the curve periodicity, support, and control-point selection provides an explicit analytical construction of these potentials and the associated vector fields. We further characterize inter-cell control continuity and forward invariance of non-exit facets, and introduce a smoothed control law ensuring continuous switching between independently constructed neighboring cells. Numerical results illustrate that the resulting framework safely guides the agent along the prescribed cell sequence from the initial point to the target.

eess.SY↗