Multi-Pass Q-Networks for Deep Reinforcement Learning with Parameterised Action Spaces
About
Parameterised actions in reinforcement learning are composed of discrete actions with continuous action-parameters. This provides a framework for solving complex domains that require combining high-level actions with flexible control. The recent P-DQN algorithm extends deep Q-networks to learn over such action spaces. However, it treats all action-parameters as a single joint input to the Q-network, invalidating its theoretical foundations. We analyse the issues with this approach and propose a novel method, multi-pass deep Q-networks, or MP-DQN, to address them. We empirically demonstrate that MP-DQN significantly outperforms P-DQN and other previous algorithms in terms of data efficiency and converged policy performance on the Platform, Robot Soccer Goal, and Half Field Offense domains.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Half Field Offense | Half Field Offense (HFO) (evaluation) | P(Goal)0.913 | 7 | |
| Platform Control | Platform (Evaluation) | Return98.7 | 5 | |
| Robot Soccer | Robot Soccer Goal (Evaluation) | P(Goal)78.9 | 5 | |
| Reinforcement Learning | HFO | P(Goal)0.913 | 3 | |
| Reinforcement Learning | Platform | Return98.7 | 2 | |
| Reinforcement Learning | Goal | P(Goal)78.9 | 2 |