REVIEW 2 cited by
Inverse optimal control problem in the non autonomous linear-quadratic case
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Inverse optimal control problem emerges in different practical applications, where the goal is to design a cost function in order to approximate given optimal strategies of an expert. Typical application is in robotics for generation of human motions. In this paper we analyze a general class of non autonomous inverse linear quadratic problems. This class of problems is of particular interest because it arises as a linearization of a nonlinear problem around an optimal trajectory. The addressed questions are the injectivity of the inverse problem and the reconstruction. We show that the nonlinear problem admits the same characterization of the injectivity as the autonomous one. In the autonomous case we show moreover that the injectivity property is generic in the considered class. We also provide a numerical test of the reconstruction algorithm in the autonomous setting.
Forward citations
Cited by 2 Pith papers
-
Joint Identifiability and Conditioning in Finite-Horizon Continuous-Time Inverse LQR with Unknown Dynamics
Under a known proportional terminal cost, finite-horizon gain variation makes the open-loop dynamics and quadratic cost jointly identifiable in continuous time, and the CR-IOC algorithm recovers them consistently from...
-
A Convex Optimization Approach to Model-Free Inverse Optimal Control with Provable Convergence
A single-trajectory model-free inverse LQR method is reformulated as a convex conic feasibility problem and solved by BSUM with an O(1/k) sublinear convergence rate claim.
Discussion (0). Continue with ORCID to comment.