.png){kind=icon}
Return
Sample-Based Planning for Continuous Action Markov Decision Processes
.png){kind=icon}
OA
AI
DOI：10.1609/icaps.v21i1.13484.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present a new algorithm that integrates recent advances in solving continuous bandit problems with sample-based rollout methods for planning in Markov Decision Processes (MDPs). Our algorithm, Hierarchical Optimistic Optimization applied to Trees (HOOT) addresses planning in continuous-action MDPs. Empirical results are given that show that the performance of our algorithm meets or exceeds that of a similar discrete action planner by eliminating the problem of manual discretization of the action space.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available