Pith. sign in

REVIEW 1 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

arxiv 2406.14270 v1 pith:75OKO7BC submitted 2024-06-20 math.OC

classification math.OC
keywords autonomousprobleminverseoptimalclassinjectivitycasecontrol
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Convex Optimization Approach to Model-Free Inverse Optimal Control with Provable Convergence

    math.OC 2025-07 reject novelty 5.0 of 10

    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.

Pith tools