Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > eess > arXiv:2509.00956

Help | Advanced Search

Electrical Engineering and Systems Science > Systems and Control

arXiv:2509.00956 (eess)
[Submitted on 31 Aug 2025 ]

Title: On the Global Optimality of Linear Policies for Sinkhorn Distributionally Robust Linear Quadratic Control

Title: 关于线性策略在Sinkhorn分布鲁棒线性二次控制中的全局最优性

Authors:Riccardo Cescon, Andrea Martin, Giancarlo Ferrari-Trecate
Abstract: The Linear Quadratic Gaussian (LQG) regulator is a cornerstone of optimal control theory, yet its performance can degrade significantly when the noise distributions deviate from the assumed Gaussian model. To address this limitation, this work proposes a distributionally robust generalization of the finite-horizon LQG control problem. Specifically, we assume that the noise distributions are unknown and belong to ambiguity sets defined in terms of an entropy-regularized Wasserstein distance centered at a nominal Gaussian distribution. By deriving novel bounds on this Sinkhorn discrepancy and proving structural and topological properties of the resulting ambiguity sets, we establish global optimality of linear policies. Numerical experiments showcase improved distributional robustness of our control policy.
Abstract: 线性二次高斯(LQG)调节器是最优控制理论的基石,但当噪声分布偏离假设的高斯模型时,其性能可能会显著下降。 为解决这一限制,本研究提出了一种有限时间范围LQG控制问题的分布鲁棒推广。 具体而言,我们假设噪声分布是未知的,并属于以名义高斯分布为中心的熵正则化Wasserstein距离定义的模糊集。 通过推导这种Sinkhorn差异的新界限,并证明所得模糊集的结构和拓扑性质,我们建立了线性策略的全局最优性。 数值实验展示了我们控制策略改进的分布鲁棒性。
Subjects: Systems and Control (eess.SY) ; Optimization and Control (math.OC)
Cite as: arXiv:2509.00956 [eess.SY]
  (or arXiv:2509.00956v1 [eess.SY] for this version)
  https://doi.org/10.48550/arXiv.2509.00956
arXiv-issued DOI via DataCite

Submission history

From: Riccardo Cescon [view email]
[v1] Sun, 31 Aug 2025 18:22:30 UTC (108 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
math.OC
< prev   |   next >
new | recent | 2025-09
Change to browse by:
cs
cs.SY
eess
eess.SY
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号