Shortest-Path Constrained Reinforcement Learning for Sparse Reward TasksDownload PDFOpen Website

2021 (modified: 16 Apr 2023)ICML 2021Readers: Everyone
Abstract: We propose the k-Shortest-Path (k-SP) constraint: a novel constraint on the agent’s trajectory that improves the sample efficiency in sparse-reward MDPs. We show that any optimal policy necessarily...
0 Replies

Loading