Planning with PDDL3 Qualitative Constraints for Cost-Optimal Solutions Through Compilation (Short Paper).
Luigi BonassiEnrico ScalaAlfonso Emilio GereviniPublished in: IPS/RiCeRcA/SPIRIT@AI*IA (2022)
Keyphrases
- ai planning
- planning domains
- total cost
- optimal solution
- optimal planning
- planning problems
- planning systems
- derived predicates
- np hard
- temporal planning
- situation calculus
- heuristic search
- planning tasks
- classical planning
- search space
- domain independent
- planning process
- web service composition
- partially observable
- optimal plans
- blocks world
- iterative procedure
- efficient solutions
- objective function
- search algorithm
- orders of magnitude
- feasible solution
- linear programming
- lower bound
- dynamic programming
- knapsack problem
- model checking