Reinforcement Learning with Parameterized Actions

09/05/2015
by   Warwick Masson, et al.
0

We introduce a model-free algorithm for learning in Markov decision processes with parameterized actions-discrete actions with continuous parameters. At each step the agent must select both which action to use and which parameters to use with that action. We introduce the Q-PAMDP algorithm for learning in these domains, show that it converges to a local optimum, and compare it to direct policy search in the goal-scoring and Platform domains.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset