Convex Chance-Constrained Stochastic Control under Uncertain Specifications with Application to Learning-Based Hybrid Powertrain Control

arXiv:2601.18313 · eess.SY, cs.LG, cs.SY, math.OC · Submitted 2026-01-26 · Read on arXiv

eess.SY, cs.LG, cs.SY, math.OC

Submitted: 2026-01-26

Updated: 2026-10-12

Comments: Submitted to IEEE Transactions on Control Systems Technology (TCST)

License: http://creativecommons.org/licenses/by-nc-nd/4.0/

The gist: This paper proposes a strictly convex chance-constrained stochastic control framework that accounts for uncertainty in control specifications such as reference trajectories and operational

Abstract

This paper proposes a strictly convex chance-constrained stochastic control framework that accounts for uncertainty in control specifications such as reference trajectories and operational constraints. Control inputs and risk allocation are jointly optimized under general, possibly non-Gaussian, uncertainties through sufficient deterministic conditions for probabilistic constraint satisfaction. A decreasing risk regularizer ensures existence and full use of the allowable risk. Under the stated regularity assumptions, the joint solution is unique and locally Lipschitz-continuous, supporting stable numerical optimization. The formulation is extended to learning-based exactly linearizable (EL) models through monotone state and input transformations. A hybrid powertrain example compares deterministic control, equal risk allocation, and optimized risk allocation with and without regularization in terms of charge sustaining, constraint violations, closed-loop cost, and solver time.

Sources

Related papers