Searcharxiv⌕ Search

arXiv subjects

Jonas Schießl

Publications and source records attributed to Jonas Schießl.

10 recordsLinked to original sources
arXiv2026

Towards turnpike-based performance analysis of risk-averse stochastic predictive control

In this paper, we present performance estimates for stochastic economic MPC schemes with risk-averse cost formulations. For MPC algorithms with costs given by expectations, it was recently shown that the guaranteed near-optimal performance of abstract MPC in random variables coincides with its implementable variant using pathwise feedback. In general, this property does not extend to costs formulated in terms of risk measures. However, through a turnpike-based analysis, this paper demonstrates that for a particular class of risk measures, this result can still be leveraged to formulate an implementable risk-averse MPC scheme, resulting in near-optimal averaged performance.

math.OC↗
arXiv2026

Stability and performance of stochastic economic MPC -- Stochastic characterization of the closed-loop asymptotics

Model Predictive Control (MPC) is well understood in the deterministic setting, yet rigorous stability and performance guarantees for stochastic MPC remain limited to the consideration of terminal constraints and penalties. In contrast, this work analyzes stochastic economic MPC with an expected cost criterion and establishes closed-loop guarantees without terminal conditions. Relying on stochastic dissipativity and turnpike properties, we construct closed-loop Lyapunov functions that ensure $P$-practical asymptotic stability of a particular optimal stationary process under different notions of stochastic convergence, such as in distribution or in the $p$-th mean. In addition, we derive tight near-optimal bounds for both averaged and non-averaged performance, thereby extending classical deterministic results to the stochastic domain. Finally, we show that the abstract stochastic MPC scheme requiring distributional knowledge shares the same closed-loop properties as a practically implementable algorithm based only on sampled state information, ensuring applicability of our findings. Our findings are illustrated by a numerical example.

math.OC↗
arXiv2026

PolyOCP.jl -- A Julia Package for Stochastic OCPs and MPC

The consideration of stochastic uncertainty in optimal and predictive control is a well-explored topic. Recently Polynomial Chaos Expansions (PCE) have received considerable attention for problems involving stochastically uncertain system parameters and also for problems with additive stochastic i.i.d. disturbances. While there exist a number of open-source PCE toolboxes, tailored open-source codes for the solution of OCPs involving additive stochastic i.i.d. disturbances in julia are not available. Hence, this paper introduces the toolbox PolyOCP$.$jl which enables to efficiently solve stochastic OCPs for linear systems subject to a large class of disturbance distributions. We explain the main mathematical concepts between the PCE transcription of stochastic OCPs and how they are provided in the toolbox. We draw upon two examples to illustrate the functionalities of PolyOCP$.$jl.

eess.SY↗
arXiv2026

Closed-loop analysis of linear stochastic MPC with risk-averse constraints

Chance constraints are widely used in stochastic model predictive control (MPC) to enforce probabilistic state and input constraints in the presence of unbounded disturbances. However, they only restrict violation probabilities and do not account for the magnitude of rare but severe constraint violations. In this paper, we extend the indirect feedback approach for linear stochastic MPC from chance constraints to risk-averse constraints like the conditional value-at-risk. For the resulting risk-averse MPC scheme, we establish recursive feasibility and closed-loop constraint satisfaction. Furthermore, based on a stochastic dissipativity notion and suitable conditions on the terminal ingredients we show that (near)-optimality of the averaged closed-loop performance can be ensured.

math.OC↗
arXiv2025

Turnpike and dissipativity in generalized discrete-time stochastic linear-quadratic optimal control

We investigate different turnpike phenomena of generalized discrete-time stochastic linear-quadratic optimal control problems. Our analysis is based on a novel strict dissipativity notion for such problems, in which a stationary stochastic process replaces the optimal steady state of the deterministic setting. We show that from this time-varying dissipativity notion, we can conclude turnpike behaviors concerning different objects like distributions, moments, or sample paths of the stochastic system and that the distributions of the stationary pair can be characterized by a stationary optimization problem. The analytical findings are illustrated by numerical simulations.

math.OC↗
arXiv2025

A Polynomial Chaos Approach to Stochastic LQ Optimal Control: Error Bounds and Infinite-Horizon Results

The stochastic linear--quadratic regulator problem subject to Gaussian disturbances is well known and usually addressed via a moment-based reformulation. Here, we leverage polynomial chaos expansions, which model random variables via series expansions in a suitable $\mathcal{L}^2$ probability space, to tackle the non-Gaussian case. We present the optimal solutions for finite and infinite horizons and we analyze the infinite-horizon asymptotics. We show that the limit of the optimal state-input trajectory is the unique solution to a corresponding stochastic stationary optimization problem in the sense of probability measures. Moreover, we provide a constructive error analysis for finite-dimensional polynomial chaos approximations of the optimal solutions and of the optimal stationary pair in non-Gaussian settings. A numerical example illustrates our findings.

math.OC↗
arXiv2024

Near-optimal performance of stochastic economic MPC

This paper presents first results for near optimality in expectation of the closed-loop solutions for stochastic economic MPC. The approach relies on a recently developed turnpike property for stochastic optimal control problems at an optimal stationary process, combined with techniques for analyzing time-varying economic MPC schemes. We obtain near optimality in finite time as well as overtaking and average near optimality on infinite time horizons.

math.OC↗
arXiv2024

On the relationship between stochastic turnpike and dissipativity notions

In this paper, we introduce and study different dissipativity notions and different turnpike properties for discrete-time stochastic nonlinear optimal control problems. The proposed stochastic dissipativity notions extend the classic notion of Jan C. Willems to $L^r$ random variables and to probability measures. Our stochastic turnpike properties range from a formulation for random variables via turnpike phenomena in probability and in probability measures to the turnpike property for the moments. Moreover, we investigate how different metrics (such as Wasserstein or Lévy-Prokhorov) can be leveraged in the analysis. Our results are built upon stationarity concepts in distribution and in random variables and on the formulation of the stochastic optimal control problem as a finite-horizon Markov decision process. We investigate how the proposed dissipativity notions connect to the various stochastic turnpike properties and we work out the link between different forms of dissipativity.

math.OC↗
arXiv2022

Relaxed dissipativity assumptions and a simplified algorithm for multiobjective MPC

We consider nonlinear model predictive control (MPC) with multiple competing cost functions. In each step of the scheme, a multiobjective optimal control problem with a nonlinear system and terminal conditions is solved. We propose an algorithm and give performance guarantees for the resulting MPC closed loop system. Thereby, we significantly simplify the assumptions made in the literature so far by assuming strict dissipativity and the existence of a compatible terminal cost for one of the competing objective functions only. We give conditions which ensure asymptotic stability of the closed loop and, what is more, obtain performance estimates for all cost criteria. Numerical simulations on various instances illustrate our findings. The proposed algorithm requires the selection of an efficient solution in each iteration, thus we examine several selection rules and their impact on the results.

math.OC↗