This paper studies an approach to planning with PDDL3 constraints involving mixed
propositional and numeric conditions, as well as metric time constraints. We show how the …

Bounded numeric planning, where each numeric variable domain is bounded, is PSPACE-
complete, but such a complexity result does not capture how hard it really is, since the same …

The LM-cut heuristic, both alone and as part of the operator counting framework, represents
one of the most successful heuristics for classical planning. In this paper, we generalize LM …

Heuristic search is a powerful approach for solving planning problems and numeric
planning is no exception. In this paper, we boost the performance of heuristic search for …

While numeric variables play an important, sometimes central, role in many planning
problems arising from real world scenarios, most of the currently available heuristic search …

In this paper, we first define numeric additive planning (NAP), a planning formulation
equivalent to Hoffmann's Restricted Tasks over Integers. Then, we analyze the minimal …

Numeric planning is known to be undecidable even under severe restrictions. Prior work has
investigated the decidability boundaries by restricting the expressiveness of the planning …

Restricted Tasks (RT) are a special case of numeric planning characterized by numeric
conditions that involve one numeric variable per formula and numeric effects that allow only …

When planning the tasks of some physical entities that need to perform actions in the world
(eg, a Robot) it is necessary to take into account quite complex models for ensuring that the …

Numeric planning is known to be undecidable even under severe restrictions. Prior work
investigated the decidability boundaries by restricting the expressiveness of the planning …