Stochastic Optimal Control via Measure Relaxations
Not on the map. Why?
Abstract (arXiv)
The optimal control problem of stochastic systems is commonly solved via robust or scenario-based optimization methods, which are both challenging to scale to long optimization horizons. We cast the optimal control problem of a stochastic system as a convex optimization problem over occupation measures. We demonstrate our method on a set of synthetic and real-world scenarios, learning cost functions from data via Christoffel polynomials. The code for our experiments is available at https://github.com/ebuehrle/dpoc.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 20 references that are in the map. First posted on arXiv 26 Jul 2025.
Builds on
8 of 20 references.
References · 8
- 2019INTERACTION Dataset: An INTERnational, Adversarial and Cooperative moTION Dataset in Interactive Driving Scenarios with Semantic Mapscited by 231
- 2017Hamilton-Jacobi Reachability: A Brief Overview and Recent Advancescited by 201
- 2019COSMO: A conic operator splitting method for convex conic problemscited by 8
- 2022Fully-Automated Verification of Linear Systems Using Inner- and Outer-Approximations of Reachable Setscited by 4
- 2021Incremental Proximal Multi-Forecast Model Predictive Controlcited by 2
- 2022Scenario-based Stochastic MPC for systems with uncertain dynamicscited by 2
- 2021Performance enhancements for a generic conic interior point algorithmcited by 1
- 2023Symmetry reduction and recovery of trajectories of optimal control problems via measure relaxationscited by 1
Built on by
Not cited yet.