Reverse Iterative Deepening for Finite-Horizon MDPs with Large Branching Factors.
Andrey KolobovPeng Dai MausamDaniel S. WeldPublished in: ICAPS (2012)
Keyphrases
- finite horizon
- iterative deepening
- search tree
- markov decision processes
- infinite horizon
- optimal policy
- tree search
- depth first search
- branch and bound
- evaluation function
- multistage
- memory efficient
- search algorithm
- search space
- search problems
- markov decision process
- heuristic search algorithms
- state space
- optimal control
- average cost
- branch and bound algorithm
- b tree
- alpha beta
- dynamic programming
- finite state
- long run
- sat solvers