.png){kind=icon}
Return
Reinforcement Learning with Parameterized Actions
.png){kind=icon}
OA
AI
DOI：10.1609/aaai.v30i1.10226.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available