Constrained Reinforcement Learning in Hard Exploration Problems
DOI:
https://doi.org/10.1609/aaai.v37i12.26757Keywords:
GeneralAbstract
One approach to guaranteeing safety in Reinforcement Learning is through cost constraints that are dependent on the policy. Recent works in constrained RL have developed methods that ensure constraints are enforced even at learning time while maximizing the overall value of the policy. Unfortunately, as demonstrated in our experimental results, such approaches do not perform well on complex multi-level tasks, with longer episode lengths or sparse rewards. To that end, we propose a scalable hierarchical approach for constrained RL problems that employs backward cost value functions in the context of task hierarchy and a novel intrinsic reward function in lower levels of the hierarchy to enable cost constraint enforcement. One of our key contributions is in proving that backward value functions are theoretically viable even when there are multiple levels of decision making. We also show that our new approach, referred to as Hierarchically Limited consTraint Enforcement (HiLiTE) significantly improves on state of the art Constrained RL approaches for many benchmark problems from literature. We further demonstrate that this performance (on value and constraint enforcement) clearly outperforms existing best approaches for constrained RL and hierarchical RL.Downloads
Published
2023-06-26
How to Cite
Pankayaraj, P., & Varakantham, P. (2023). Constrained Reinforcement Learning in Hard Exploration Problems. Proceedings of the AAAI Conference on Artificial Intelligence, 37(12), 15055-15063. https://doi.org/10.1609/aaai.v37i12.26757
Issue
Section
AAAI Special Track on Safe and Robust AI