Back to Results
First PageMeta Content
Dynamic programming / Systems theory / Equations / Operations research / Stochastic control / Markov decision process / Reinforcement learning / Bellman equation / Automated planning and scheduling / Statistics / Mathematical optimization / Control theory


Reverse Iterative Deepening for Finite-Horizon MDPs with Large Branching Factors Andrey Kolobov? Peng Dai† ∗ Mausam? Daniel S. Weld?
Add to Reading List

Document Date: 2013-08-13 03:53:46


Open Document

File Size: 279,25 KB

Share Result on Facebook

City

Seattle / Mountain View / /

Company

Amazon / P ROST / Bellman / Tioga Publishing / Princeton University Press / Engineering Google Inc. / John Wiley & Sons / /

Country

United States / /

/

Event

Judicial Event / /

Facility

University of Freiburg / Amphitheater Pkwy Seattle / University of Washington / /

IndustryTerm

heuristic search / online version / heuristic search algorithms / on-line / online nature / backup operator / possible solution / fall-back solution / assignment operator / default solution / real-world systems / physical systems / search depth / style algorithms / /

Organization

University of Washington / National Science Foundation / Princeton University / Association for the Advancement / Artificial Copyright Intelligence / MDP V / University of Freiburg / /

Person

Max-Reward Heuristic / Thomas Keller / Andrey Kolobov / G LUTTON / Patrick Eyerich / /

Position

online planner / administrator / planner / controller / LR2 TDP-based planner / /

Product

LR2 TDP / LR2 TDPbased / /

PublishedMedium

Journal of Artificial Intelligence Research / /

Technology

RAM / LR2 TDP algorithm / pdf / style algorithms / main algorithm / heuristic search algorithms / artificial intelligence / caching / simulation / process end Algorithm / /

URL

http /

SocialTag