Planning as Satisfiability with Relaxed $-Step Plans.
Martin WehrleJussi RintanenPublished in: Australian Conference on Artificial Intelligence (2007)
Keyphrases
- planning problems
- automated planning
- plan generation
- planning process
- plan execution
- planning domains
- partial order planning
- planning systems
- plan repair
- plan recognition
- macro actions
- domain independent
- satisfiability problem
- optimal plans
- classical planning
- planning under uncertainty
- enforced hill climbing
- case based planning
- propositional logic
- heuristic search
- reactive planning
- plan quality
- deterministic domains
- planning tasks
- sat solving
- state space
- belief space
- planning graph
- ai planning
- post processing
- np complete
- control rules
- decision theoretic
- orders of magnitude
- multiagent planning
- domain specific
- computational complexity
- planning under partial observability