Solving planning domains with polytree causal graphs is NP-complete
Omer GiménezPublished in: CoRR (2006)
Keyphrases
- planning problems
- causal graph
- planning domains
- np complete
- pspace complete
- classical planning
- ai planning
- domain independent
- model checking
- heuristic search
- international planning competition
- state space
- planning systems
- htn planning
- satisfiability problem
- np hard
- plan generation
- orders of magnitude
- computational complexity
- domain specific
- causal models
- constraint satisfaction problems
- hierarchical task networks
- search strategies
- markov decision processes
- bayesian networks