mlsanityData to 7 Oct 2026

Convex optimization for finite horizon robust covariance control of linear stochastic systems

arXiv 2007.00132 ↗First posted 30 Jun 2020math.OCcited by 2

Not on the map. Why?

Abstract (arXiv)

This work addresses the finite-horizon robust covariance control problem for discrete-time, partially observable, linear system affected by random zero mean noise and deterministic but unknown disturbances restricted to lie in what is called ellitopic uncertainty set (e.g., finite intersection of centered at the origin ellipsoids/elliptic cylinders). Performance specifications are imposed on the random state-control trajectory via averaged convex quadratic inequalities, linear inequalities on the mean, as well as pre-specified upper bounds on the covariance matrix. For this problem we develop a computationally tractable procedure for designing affine control policies, in the sense that the parameters of the policy that guarantees the aforementioned performance specifications are obtained as solutions to an explicit convex program. Our theoretical findings are illustrated by a numerical example.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 1.

2 papers.