A Differential Dynamic Programming Framework for Inverse Reinforcement Learning
<|reference_start|>A Differential Dynamic Programming Framework for Inverse Reinforcement Learning: 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.<|reference_end|>
@article{cao2024a,
    title={A Differential Dynamic Programming Framework for Inverse Reinforcement
  Learning},
    author={Kun Cao, Xinhang Xu, Wanxin Jin, Karl H. Johansson, Lihua Xie},
    journal={arXiv preprint arXiv:2407.19902},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.19902},
    primaryClass={cs.RO cs.SY eess.SY math.OC}
}