On the Hardness of Planning Problems with Simple Causal Graphs.
Omer GiménezAnders JonssonPublished in: ICAPS (2007)
Keyphrases
- planning problems
- causal graph
- heuristic search
- domain independent
- state space
- ai planning
- planning domains
- plan generation
- partial observability
- causal models
- np hardness
- planning systems
- htn planning
- classical planning
- strips planning
- np complete
- solving planning problems
- partially observable markov decision processes
- learning algorithm
- lower bound