paper-with-me

홈 › Papers

GPU-Parallel Linearization Error Bounds for Real-Time Robust Optimal Control of Nonlinear and Neural Network Dynamics

2026-07-01 · Jeffrey Fang, Keyi Shen, Anutam Srinivasan, Glen Chou arxiv

This paper studies real-time robust optimal control for uncertain nonlinear systems, where linear time-varying (LTV) approximations make planning tractable but require sound linearization error bounds (LEBs) to guarantee robust constraint satisfaction. We develop tight, differentiable, GPU-parallel LEBs for LTV approximations of nonlinear and neural network (NN) dynamics. For analytic dynamics, we introduce path-based Hessian bounds that are tighter than standard interval methods. For NN dynamics, we derive certified LEBs using NN verifier-generated affine relaxations and local Jacobian corrections. We adapt a GPU-parallel system-level synthesis LTV-based robust control solver to be compatible with these LEBs by extending it to handle right-invertible disturbance matrices and non-zero-centered disturbance sets for tight zonotopic uncertainty propagation. Our method, GPUSLS-LEO, enables online optimization of robust feedback policies that account for linearization error, producing tight, formally verified reachable tubes. On complex nonlinear and NN dynamics up to 168 state dimensions, our method can compute robust control policies on the GPU at rates up to 67 Hz, reducing solve times and conservativeness relative to baselines while preserving formal guarantees and real-time performance.

📄 PDF Abstract BibTeX arXiv:2607.01203

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Moment Propagation of Discrete-Time Stochastic Polynomial Systems using Truncated Carleman Linearization

2019-11-28

We propose a method to compute an approximation of the moments of a discrete-time stochastic polynomial system. We use the Carleman linearization technique to transform this finite-dimensional polynomial system into an i…

Moment Propagation of Polynomial Systems Through Carleman Linearization for Probabilistic Safety Analysis

2022-01-21 · Sasinee Pruekprasert, Jérémy Dubut, Toru Takisaka, Clovis Eberhart 외

We develop a method to approximate the moments of a discrete-time stochastic polynomial system. Our method is built upon Carleman linearization with truncation. Specifically, we take a stochastic polynomial system with f…

High-Order Error Bounds for Markovian LSA with Richardson-Romberg Extrapolation

2025-08-07 · Ilya Levin, Alexey Naumov, Sergey Samsonov arxiv

In this paper, we study the bias and high-order error bounds of the Linear Stochastic Approximation (LSA) algorithm with Polyak-Ruppert (PR) averaging under Markovian noise. We focus on the version of the algorithm with …

Carleman Lifting for Nonlinear System Identification with Guaranteed Error Bounds

2022-05-30 · Moad Abudia, Joel A. Rosenfeld, Rushikesh Kamalapurkar

This paper concerns identification of uncontrolled or closed loop nonlinear systems using a set of trajectories that are generated by the system in a domain of attraction. The objective is to ensure that the trajectories…

Bounding Regression Errors in Data-driven Power Grid Steady-state Models

2019-10-30 · Yuxiao Liu, Bolun Xu, Audun Botterud, Ning Zhang 외

Data-driven models analyze power grids under incomplete physical information, and their accuracy has been mostly validated empirically using certain training and testing datasets. This paper explores error bounds for dat…

regression