Pith. sign in

REVIEW 1 cited by

A Differential Dynamic Programming Framework for Inverse Reinforcement Learning

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 2407.19902 v1 pith:Z2QWRHGL submitted 2024-07-29 cs.RO cs.SYeess.SYmath.OC

classification cs.ROcs.SYeess.SYmath.OC
keywords frameworkfunctioninverseproposedclosed-loopconstraintslearningloss
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A differential dynamic programming (DDP)-based framework for inverse reinforcement learning (IRL) is introduced to recover the parameters in the cost function, system dynamics, and constraints from demonstrations. Different from existing work, where DDP was used for the inner forward problem with inequality constraints, our proposed framework uses it for efficient computation of the gradient required in the outer inverse problem with equality and inequality constraints. The equivalence between the proposed method and existing methods based on Pontryagin's Maximum Principle (PMP) is established. More importantly, using this DDP-based IRL with an open-loop loss function, a closed-loop IRL framework is presented. In this framework, a loss function is proposed to capture the closed-loop nature of demonstrations. It is shown to be better than the commonly used open-loop loss function. We show that the closed-loop IRL framework reduces to a constrained inverse optimal control problem under certain assumptions. Under these assumptions and a rank condition, it is proven that the learning parameters can be recovered from the demonstration data. The proposed framework is extensively evaluated through four numerical robot examples and one real-world quadrotor system. The experiments validate the theoretical results and illustrate the practical relevance of the 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. 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