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 …

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 …

In this planner abstract, we introduce the version of the Powerlifted (Corrêa et al. 2020)
planning system used in the IPC 2023. Powerlifted is a lifted planner that works directly on …

Classical planning tasks are modelled in PDDL which is a schematic language based on
first-order logic. Most of the current planners turn this lifted representation into a …

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 …

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 …

We consider the problem of synthesizing interpretable models that recognize the behaviour
of an agent compared to other agents, on a whole set of similar planning tasks expressed in …

Automated planning is a prominent area of Artificial Intelligence and an important
component for intelligent autonomous agents. A cornerstone of domain-independent …

Classical planning tasks are represented using a logical language. It is common to use a
first-order representation, as this makes the description of the tasks more compact. Planners …

We consider the problem of synthesizing interpretable models that recognize the behaviour
of an agent out of many others, on a whole set of planning problems expressed in PDDL …