S3TS: Stochastic Scenario-Structured Tree Search for Advanced Planning Under Uncertainty
- URL: http://arxiv.org/abs/2606.02151v1
- Date: Mon, 01 Jun 2026 12:17:41 GMT
- Title: S3TS: Stochastic Scenario-Structured Tree Search for Advanced Planning Under Uncertainty
- Abstract summary: An effective planning strategy must accommodate advanced and potentially non-linear system models.<n>Existing approaches can address either non-linearity (e.g., Monte Carlo Tree Search) or uncertainty.<n>We propose a Scenario-Structured Tree Search (S3TS) algorithm that explicitly represents uncertainty through scenario trees.
- Score: 4.2329543571238615
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Effective scheduling in the energy sector is essential to ensure the reliable operation of electrical grids and their connected assets by, for instance, optimizing the dispatch of generation units and storage systems. An effective planning strategy must (a) accommodate advanced and potentially non-linear system models -- exploiting the increasing data availability of modern grids, and (b) explicitly handle uncertainties arising, for instance, from the integration of renewable energy sources. While existing approaches can address either non-linearity (e.g., Monte Carlo Tree Search) or uncertainty (e.g., stochastic mathematical optimization), there is a lack of planning techniques capable of addressing both challenges simultaneously. To bridge this gap, we propose a Stochastic Scenario-Structured Tree Search (S3TS) algorithm that explicitly represents uncertainty through scenario trees while enabling the integration of advanced non-linear models. We evaluate S3TS on a simulated demand response signal publication problem, largely mimicking the imbalance settlement mechanism in Belgium. The results demonstrate near-optimal performance in linear, analytically tractable settings, with costs within 14% of the mathematically optimal solution conditioned to the scenario trees. In highly non-linear scenarios, S3TS significantly outperforms baseline methods, achieving cost reductions of up to 51% and 5.4% compared to a myopic algorithm and deterministic MCTS, respectively.
Related papers
- Genetic Algorithm Based Coordination and Optimization Model for Generation Grid Load Storage in Active Distribution Networks [5.6099061092572775]
This project uses fuzzy set representation to model renewable energy generation, load curves, and market prices.<n>Genetic algorithms introduce fuzzy elements into system management, adjusting thru penalty factors to improve stability.<n>This will provide a scientific basis for the uncertainty assessment in distribution network planning.
arXiv Detail & Related papers (2026-06-12T11:37:08Z) - Fitting Unknown Number of Hyperplanes with Manifold Optimization [57.48093263119306]
Fitting unknown number of linearplanes to data is a fundamental yet challenging problem in machine learning.<n>Existing approaches often struggle with optimum optima or lack geometric consistency.
arXiv Detail & Related papers (2026-05-27T14:02:20Z) - Bridging Theory and Practice: A Stochastic Learning-Optimization Model for Resilient Automotive Supply Chains [0.0]
Supply chain disruptions and volatile demand pose significant challenges to the UK automotive industry, which relies heavily on Just-In-Time (JIT) manufacturing.<n>This paper introduces a novel learning-optimization framework that integrates Bayesian inference with inventory optimization for supply chain management.
arXiv Detail & Related papers (2025-11-09T17:51:51Z) - Agentic World Modeling for 6G: Near-Real-Time Generative State-Space Reasoning [70.56067503630486]
We argue that sixth-generation (6G) intelligence is not fluent token prediction but calibrated the capacity to imagine and choose.<n>We show that WM-MS3M cuts mean absolute error (MAE) by 1.69% versus MS3M with 32% fewer parameters and similar latency, and achieves 35-80% lower root mean squared error (RMSE) than attention/hybrid baselines with 2.3-4.1x faster inference.
arXiv Detail & Related papers (2025-11-04T17:22:22Z) - Momentum-constrained Hybrid Heuristic Trajectory Optimization Framework with Residual-enhanced DRL for Visually Impaired Scenarios [4.735413508037063]
This paper proposes a momentum-constrained hybrid trajectory optimization framework (MHHTOF) tailored for assistive navigation in visually impaired scenarios.<n>It integrates trajectory sampling generation, optimization and evaluation with residual deep reinforcement learning (DRL)<n> Experimental results demonstrate that the proposed LSTM-BResPPO achieves significantly faster convergence, attaining stable policy performance in approximately half the training required by the PPO.
arXiv Detail & Related papers (2025-09-19T04:33:39Z) - Diffusion-Based Scenario Tree Generation for Multivariate Time Series Prediction and Multistage Stochastic Optimization [16.795461001108098]
Diffusion Scenario Tree (DST) is a general framework for constructing scenario trees for multivariate prediction tasks.<n>We evaluate the framework on the optimization task of energy arbitrage in New York State's day-ahead electricity market.
arXiv Detail & Related papers (2025-09-18T10:49:05Z) - UncertaintyRAG: Span-Level Uncertainty Enhanced Long-Context Modeling for Retrieval-Augmented Generation [93.38604803625294]
We present UncertaintyRAG, a novel approach for long-context Retrieval-Augmented Generation (RAG)
We use Signal-to-Noise Ratio (SNR)-based span uncertainty to estimate similarity between text chunks.
UncertaintyRAG outperforms baselines by 2.03% on LLaMA-2-7B, achieving state-of-the-art results.
arXiv Detail & Related papers (2024-10-03T17:39:38Z) - Dynamic Bayesian Network Auxiliary ABC-SMC for Hybrid Model Bayesian
Inference to Accelerate Biomanufacturing Process Mechanism Learning and
Robust Control [2.727760379582405]
We present a knowledge graph hybrid model characterizing complex causal interdependencies of underlying bioprocessing mechanisms.
It can faithfully capture the important properties, including nonlinear reactions, partially observed state, and nonstationary dynamics.
We derive a posterior distribution model uncertainty, which can facilitate mechanism learning and support robust process control.
arXiv Detail & Related papers (2022-05-05T02:54:21Z) - Pessimistic Q-Learning for Offline Reinforcement Learning: Towards
Optimal Sample Complexity [51.476337785345436]
We study a pessimistic variant of Q-learning in the context of finite-horizon Markov decision processes.
A variance-reduced pessimistic Q-learning algorithm is proposed to achieve near-optimal sample complexity.
arXiv Detail & Related papers (2022-02-28T15:39:36Z) - A Priori Denoising Strategies for Sparse Identification of Nonlinear
Dynamical Systems: A Comparative Study [68.8204255655161]
We investigate and compare the performance of several local and global smoothing techniques to a priori denoise the state measurements.
We show that, in general, global methods, which use the entire measurement data set, outperform local methods, which employ a neighboring data subset around a local point.
arXiv Detail & Related papers (2022-01-29T23:31:25Z) - A Dynamical Systems Approach for Convergence of the Bayesian EM
Algorithm [59.99439951055238]
We show how (discrete-time) Lyapunov stability theory can serve as a powerful tool to aid, or even lead, in the analysis (and potential design) of optimization algorithms that are not necessarily gradient-based.
The particular ML problem that this paper focuses on is that of parameter estimation in an incomplete-data Bayesian framework via the popular optimization algorithm known as maximum a posteriori expectation-maximization (MAP-EM)
We show that fast convergence (linear or quadratic) is achieved, which could have been difficult to unveil without our adopted S&C approach.
arXiv Detail & Related papers (2020-06-23T01:34:18Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.