Multi-Pass Q-Networks for Deep Reinforcement Learning with Parameterised Action Spaces

10 May 2019  ยท  Craig J. Bester, Steven D. James, George D. Konidaris ยท

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.

PDF Abstract

Datasets


  Add Datasets introduced or used in this paper
Task Dataset Model Metric Name Metric Value Global Rank Result Benchmark
Control with Prametrised Actions Half Field Offence MP-DQN Goal Probability 0.913 # 1
Control with Prametrised Actions Platform MP-DQN Return 0.987 # 1
Control with Prametrised Actions Robot Soccer Goal MP-DQN Goal Probability 0.789 # 1

Methods


No methods listed for this paper. Add relevant methods here