Finding Optimal Solutions in HTN Planning - A SAT-based Approach.
Gregor BehnkeDaniel HöllerSusanne BiundoPublished in: IJCAI (2019)
Keyphrases
- htn planning
- finding optimal solutions
- constraint satisfaction problems
- planning domains
- max sat
- planning problems
- planning systems
- classical planning
- sat problem
- sat solvers
- hierarchical task network
- satisfiability problem
- ai planning
- lower bound
- information retrieval
- phase transition
- search strategies
- domain independent
- heuristic search
- orders of magnitude
- search algorithm