Skip to main navigation Skip to search Skip to main content

An end-to-end inverse reinforcement learning by a boosting approach with relative entropy

  • Tao Zhang
  • , Ying Liu
  • , Maxwell Hwang
  • , Kao Shing Hwang
  • , Chun Yan Ma
  • , Jing Cheng
  • Northwestern Polytechnical University Xian
  • Zhejiang University
  • National Sun Yat-sen University
  • Xi'an Technological University

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Abstract

Inverse reinforcement learning (IRL) involves imitating expert behaviors by recovering reward functions from demonstrations. This study proposes a model-free IRL algorithm to solve the dilemma of predicting the unknown reward function. The proposed end-to-end model comprises a dual structure of autoencoders in parallel. The model uses a state encoding method to reduce the computational complexity for high-dimensional environments and utilizes an Adaboost classifier to determine the difference between the predicted and demonstrated reward functions. Relative entropy is used as a metric to measure the difference between the demonstrated and the imitated behavior. The simulation experiments demonstrate the effectiveness of the proposed method in terms of the number of iterations that are required for the estimation.

Original languageEnglish
Pages (from-to)1-14
Number of pages14
JournalInformation Sciences
Volume520
DOIs
StatePublished - May 2020

Keywords

  • Adaboost
  • Imitation learning
  • Inverse reinforcement learning
  • Relative entropy
  • State encoding

Fingerprint

Dive into the research topics of 'An end-to-end inverse reinforcement learning by a boosting approach with relative entropy'. Together they form a unique fingerprint.

Cite this