Simple and Fast Strong Cyclic Planning for Fully-Observable Nondeterministic Planning Problems.
Jicheng FuVincent NgFarokh B. BastaniI-Ling YenPublished in: IJCAI (2011)
Keyphrases
- planning problems
- fully observable
- heuristic search
- domain independent
- state space
- planning domains
- partial observability
- ai planning
- planning systems
- solving planning problems
- classical planning
- stochastic domains
- optimal planning
- search algorithm
- htn planning
- dynamic programming
- deterministic domains
- partially observable markov decision processes
- machine learning
- linear programming
- belief space
- markov decision problems
- general purpose
- hidden state
- nondeterministic domains