In this work, we study an inverse reinforcement learning (IRL) problem where the experts are planning under a shared reward function but with different, unknown planning horizons. Without the knowledge of discount factors, the reward function has a larger feasible solution set, which makes it harder for existing IRL approaches to identify a reward function. To overcome this challenge, we develop algorithms that can learn a global multi-agent reward function with agent-specific discount factors that reconstruct the expert policies. We characterize the feasible solution space of the reward function and discount factors for both algorithms and demonstrate the generalizability of the learned reward function across multiple domains.
@article{arxiv.2409.18051,
title = {Inverse Reinforcement Learning with Multiple Planning Horizons},
author = {Jiayu Yao and Weiwei Pan and Finale Doshi-Velez and Barbara E Engelhardt},
journal= {arXiv preprint arXiv:2409.18051},
year = {2024}
}