Newest papers

Data-Driven Minimum Energy Control for Stochastic Linear Systems with Finite Sample Guarantees

Vaishnavi Sharma, Vaibhav Katewa · 2026 · arXiv (Cornell University)

DOI: 10.48550/arxiv.2610.27599 · cited by 0 works (OpenAlex) · open-access PDF

Portuguese

O problema do controle de energia mínima de probabilidade (MEC) sem validade do sistema de estabelecimento de probabilidade (Open-loop validity data control) exige inputs de controle que minimizem a energia de controle, ao mesmo tempo que garantem que o estado terminal atinge um valor desejado. Neste artigo, estudamos o problema do MEC de loop aberto para sistemas lineares lineares invariantes de tempo. Consideramos uma variedade de restrições estocásticas que forçam o erro do terminal a ser \emph{small}, e mostramos que o problema do MEC estocástico (SMEC) pode ser formulado como um QCQP. Obtemos a solução ideal para o SMEC e mostramos que ele generaliza o conhecido problema do MEC determinista usando estimativas de maior probabilidade com base em calib

Machine translation (Meta M2M100); the English original follows.

Abstract

The open-loop minimum-energy control (MEC) problem asks for control inputs that minimize the control energy while ensuring the terminal state reaches a desired value. In this paper, we study the open-loop MEC problem for stochastic linear time-invariant systems. We consider a variety of stochastic constraints that enforce the terminal error to be \emph{small}, and show that Stochastic MEC (SMEC) problem can be formulated as a QCQP. We obtain the optimal solution for SMEC and show that it generalizes the well-known Deterministic MEC problem by introducing novel stochastic variants of controllability and Gramian matrices and show that there exists a fundamental lower bound on the optimal control energy which cannot be overcome by increasing the time horizon of the problem. We then extend the formulation to systems with unknown dynamics using maximum-likelihood estimation and conformal calibration, and compare these approaches with direct sample-based estimation that do not incorporate structural information of SMEC problem into account. Further, with the help of bias-variance analysis, we show when incorporating structural information proves to be better than direct sample based approach. Finally, we establish finite-sample high-probability upper bounds on optimal-cost sub-optimality and original constraint-violation probability under the data-driven controller, quantifying their dependence on the number of experiments, number of samples per experiment, system dimension, input sequence dimension, and noise-to-signal ratio. Using simulations, we validate the theoretical results numerically.

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Topics: Controllability, Mathematical optimization, Upper and lower bounds, Mathematics, Sequence (biology), Optimal control

Is this paper real? This page was built from OpenAlex and arXiv records, not generated. Software can verify any reference in one call: GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.27599, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txt

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange