Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning.
Pascal LauerÁlvaro TorralbaDaniel FiserDaniel HöllerJulia WichlaczJörg HoffmannPublished in: IJCAI (2021)
Keyphrases
- ai planning
- planning domains
- planning problems
- planning systems
- derived predicates
- computational complexity
- optimal planning
- heuristic search
- temporal planning
- special case
- objective function
- planning tasks
- polynomial size
- plan generation
- graphical models
- worst case
- causal graph
- situation calculus
- probabilistic inference
- boolean functions
- probabilistic relaxation
- durative actions
- orders of magnitude