Planning models are usually defined in lifted, ie first order formalisms, while most solvers
need (variable-free) grounded representations. Though techniques for grounding prune …

Classical planning problems are defined using some specification language, such as PDDL.
The domain expert defines action schemas, objects, the initial state, and the goal. One key …

While state-of-the-art planning systems need a grounded (propositional) task representation,
the input model is provided “lifted”, specifying predicates and action schemas with variables …

Most planners are based on grounding, that is, generating all instances of a parameterized
action during a preprocessing phase. For some problems the number of ground actions is …

Heuristics for lifted planning are not yet as informed as the best heuristics for ground
planning. Recent work introduced the idea of using Datalog programs to compute the …

It has been shown recently that successful techniques in classical planning, such as goal-
oriented heuristics and landmarks, can improve the ability to compute planning programs for …

Most classical planners use grounding as a preprocessing step, essentially reducing
planning to propositional logic. However, grounding involves instantiating all rules and …

Classical planning tasks are commonly described in a first-order language. However, most
classical planners translate tasks by grounding them and then rewriting them into a …

Lifted planners are useful to solve tasks that are too hard to ground. Still, computing
informative lifted heuristics is difficult: directly adapting ground heuristics to the lifted setting …

Lifted planning is usually defined as planning directly over a first-order representation. From
the mid-1990s until the late 2010s, lifted planning was sidelined, as most of the state-of-the …