Back to Results
First PageMeta Content
Operations research / Control theory / Mathematical optimization / Reinforcement learning / Heuristic function / Markov decision process / Search algorithm / Dynamic programming / Algorithm / Statistics / Heuristics / Mathematics


Trial-based Heuristic Tree Search for Finite Horizon MDPs Thomas Keller University of Freiburg Freiburg, Germany [removed]
Add to Reading List

Document Date: 2013-09-16 03:52:59

Open Document

File Size: 253,49 KB

Share Result on Facebook

Company

Princeton University Press / MIT Press / Intel / AAAI Press / /

Country

Switzerland / Germany / /

/

Facility

Malte Helmert University of Basel Basel / Finite Horizon MDPs Thomas Keller University of Freiburg Freiburg / /

IndustryTerm

fixed search depth limitation / considered algorithm / search tree / search space / asymmetric search trees / search behavior / search algorithms / /

Organization

AI / Finite Horizon MDPs Thomas Keller University of Freiburg Freiburg / University of Basel Basel / IEEE Transactions Computational Intelligence / MIT / Princeton University / German Aerospace Center / V (nd ) / /

Person

Spyridon Samothrakis / Max Monte-Carlo / Peter Auer / Philipp Rohlfshagen / Monte-Carlo Tree / Thomas Keller / Simon M. Lucas / Andrew G. Barto / Edward J. Powley / Satinder P. Singh / Diego Perez / Levente Kocsis / Cameron Browne / Richard S. Sutton / Paul Fischer / Patrick Eyerich / Malte Helmert / Simon Colton / Steven J. Bradtke / Csaba Szepesv´ari / Daniel Whitehouse / Stephen Tavener / /

Position

ROST planner / representative / planner / representative of Monte-Carlo Tree / /

PublishedMedium

Machine Learning / /

Technology

main algorithm / Heuristic Search algorithms / DP-UCT algorithms / THTS algorithm / search algorithms / well-studied algorithms / UCT algorithm / Monte-Carlo Tree Search algorithms / asynchronous Dynamic Programming algorithm / Machine Learning / second algorithm / THTS algorithms / Monte-Carlo backup MCTS algorithms / /

SocialTag