Planning as Satisfiability in Nondeterministic Domains.
Paolo FerrarisEnrico GiunchigliaPublished in: AAAI/IAAI (2000)
Keyphrases
- nondeterministic domains
- deterministic domains
- planning problems
- symbolic model checking
- planning domains
- htn planning
- plan execution
- partial observability
- satisfiability problem
- stochastic domains
- ai planning
- domain independent
- heuristic search
- model checking
- goal oriented
- classical planning
- domain specific
- np complete
- binary decision diagrams
- formal verification
- fully observable
- description language
- search strategies