Pith. sign in

REVIEW 1 cited by

Extended Kalman Filtering for Recursive Online Discrete-Time Inverse Optimal Control

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 2403.10841 v1 pith:CP6LFZ3Y submitted 2024-03-16 eess.SY cs.SY

classification eess.SYcs.SY
keywords optimalcontrolinversekalmanonlineproblemdiscrete-timeenables
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We formulate the discrete-time inverse optimal control problem of inferring unknown parameters in the objective function of an optimal control problem from measurements of optimal states and controls as a nonlinear filtering problem. This formulation enables us to propose a novel extended Kalman filter (EKF) for solving inverse optimal control problems in a computationally efficient recursive online manner that requires only a single pass through the measurement data. Importantly, we show that the Jacobians required to implement our EKF can be computed efficiently by exploiting recent Pontryagin differentiable programming results, and that our consideration of an EKF enables the development of first-of-their-kind theoretical error guarantees for online inverse optimal control with noisy incomplete measurements. Our proposed EKF is shown to be significantly faster than an alternative unscented Kalman filter-based approach.

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. Recursive Deep Inverse Reinforcement Learning

    cs.LG 2025-04 conditional novelty 7.0 of 10

    RDIRL is an online deep inverse reinforcement learning method that updates a learned cost after each expert demonstration with a Kalman-style second-order Newton step, and it outperforms batch IRL baselines in simulat...

Pith tools