Inverse Reinforcement Learning in Partially Observable Environments
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 1028-1032.
Abstract
Inverse reinforcement learning (IRL) is the problem of recovering the underlying reward function from the behaviour of an expert. Most of the existing algorithms for IRL assume that the expert's environment is modeled as a Markov decision process (MDP), although they should be able to handle partially observable settings in order to widen the applicability to more realistic scenarios. In this paper, we present an extension of the classical IRL algorithm by Ng and Russell to partially observable environments. We discuss technical issues and challenges, and present the experimental results on some of the benchmark partially observable domains.Jaedeug Choi, Kee-Eung Kim
@inproceedings{ijcai2009p174,
title = {Inverse Reinforcement Learning in Partially Observable Environments},
author = {Choi, Jaedeug and Kim, Kee-Eung},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {1028--1032},
year = {2009},
url = {https://ijcai.org/proceedings/2009/174},
}
TY - CPAPER TI - Inverse Reinforcement Learning in Partially Observable Environments AU - Choi, Jaedeug AU - Kim, Kee-Eung T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 1028 EP - 1032 UR - https://ijcai.org/proceedings/2009/174 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
