Skip to content
Preprint

Joint Identifiability and Conditioning in Finite-Horizon Continuous-Time Inverse LQR with Unknown Dynamics

Aug 2026 · 0 citations · 35 references
Mathematics

Abstract

Inverse Optimal Control (IOC) aims to infer the underlying cost functional of an agent from observations of its expert behavior. This paper studies the finite-horizon continuous-time inverse LQR problem from closed-loop state--input trajectories, where both the system matrices and the quadratic cost are unknown. The finite horizon induces a time-varying optimal gain, and this endogenous excitation serves as the structural mechanism that makes joint recovery possible. We quantify this mechanism through three computable conditioning indices, which measure state richness, gain-variation richness, and injectivity of a structured cost operator. Using these indices, we establish joint identifiability conditions for the inverse problem considered here. Crucially, these conditions guarantee recovery of the ground-truth system matrices $(A,B)$ and the true cost weighting matrices, rather than merely a behaviorally equivalent surrogate. We also develop a conditioning-aware sampled-data reconstruction method that reconstructs the gain $K(\cdot)$ and the closed-loop dynamics matrix $A_c(\cdot)$ from noisy measurements, recovers $(A,B)$ in closed form, and identifies the quadratic weights through a convex semidefinite program. We further establish the non-asymptotic perturbation bounds and the consistency of the full reconstruction method under sub-Gaussian observation noise, with explicit dependence on the same conditioning indices. Numerical experiments support the theory and illustrate the diagnostic value of the conditioning indices.

View source

Similar papers

Preprint Sep 2026

Optimal input design via Frank-Wolfe

The Frank--Wolfe framework is extended to input design for system identification with unknown dynamics and adaptive online LQR, and an $\mathcal{O}(1/M)$ convergence rate is established for the objective value, while strong convexity yields an $\mathcal{O}(1/\sqrt{M})$ rate for the iterates.

Fethi Bencherki, Bruce D. Lee, Nikolai Matni et al. · 0 citations
Preprint Sep 2026

Characterizing Identifiability and Generalization for Inverse Receding-Horizon Linear-Quadratic Regulator Problems

We consider the problem of objective inference in the context of receding-horizon linear-quadratic regulator (LQR). In this setting, we are given sequential state-action observations, where each observed action is the first control of a newly solved finite-horizon LQR problem. We characterize when the objective of that...

Zhi-Yuan Jin, Jing-Qi Li, David Fridovich-Keil · 0 citations
#reinforcement learning Open access Sep 2026

Off-Policy Inverse Q-Learning Algorithm with Unobservable States

This paper investigates the output-feedback inverse reinforcement learning (IRL) problem and proposes a data-driven output-feedback off-policy inverse Q-learning algorithm that relies solely on input–output trajectory data from an expert system to address the problem of an unknown performance index in discrete-time lin...

Zheng-Lin Li, Li-Qi Zhang, Xi-Sheng Dai et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.