Please use this identifier to cite or link to this item:
Title: A survey of inverse reinforcement learning techniques
Authors: Shao, Zhifei
Er, Meng Joo
Keywords: DRNTU::Engineering::Electrical and electronic engineering
Issue Date: 2012
Source: Shao, Z., & Er, M. J. (2012). A survey of inverse reinforcement learning techniques. International journal of intelligent computing and cybernetics, 5(3), 293-311.
Series/Report no.: International journal of intelligent computing and cybernetics
Abstract: This purpose of this paper is to provide an overview of the theoretical background and applications of inverse reinforcement learning (IRL). Reinforcement learning (RL) techniques provide a powerful solution for sequential decision making problems under uncertainty. RL uses an agent equipped with a reward function to find a policy through interactions with a dynamic environment. However, one major assumption of existing RL algorithms is that reward function, the most succinct representation of the designer's intention, needs to be provided beforehand. In practice, the reward function can be very hard to specify and exhaustive to tune for large and complex problems, and this inspires the development of IRL, an extension of RL, which directly tackles this problem by learning the reward function through expert demonstrations. In this paper, the original IRL algorithms and its close variants, as well as their recent advances are reviewed and compared. This paper can serve as an introduction guide of fundamental theory and developments, as well as the applications of IRL. This paper surveys the theories and applications of IRL, which is the latest development of RL and has not been done so far.
ISSN: 1756-378X
DOI: 10.1108/17563781211255862
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:EEE Journal Articles

Citations 5

Updated on Jan 24, 2023

Web of ScienceTM
Citations 5

Updated on Jan 14, 2023

Page view(s) 5

Updated on Jan 27, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.