Iterative Depth-First Search for Fully Observable Non-Deterministic Planning.
Ramon Fraga PereiraAndré Grahl PereiraFrederico MessaGiuseppe De GiacomoPublished in: CoRR (2022)
Keyphrases
- fully observable
- depth first search
- planning problems
- partial observability
- classical planning
- heuristic search
- belief space
- state space
- partially observable
- domain independent
- search tree
- planning domains
- markov decision problems
- decentralized control
- iterative deepening
- hidden state
- routing problem
- tree search
- ai planning
- partially observable markov decision processes
- markov decision processes
- branch and bound
- goal state
- reinforcement learning
- search space
- search algorithm
- belief state
- constraint satisfaction