Constraint satisfaction problem (CSP) is defined as a set of variables whose values need to
satisfies a set of constraints. Ant colony optimization (ACO) has been proved to be a …

This paper studies novel subgoaling relaxations for automated planning with propositional
and numeric state variables. Subgoaling relaxations address one source of complexity of the …

The standard PDDL language for classical planning uses several first-order features, such
as schematic actions. Yet, most classical planners ground this first-order representation into …

Temporal planning offers numerous advantages when based on an expressive
representation. Timelines have been known to provide the required expressiveness but at …

In this paper, we propose an improved filtering algorithm for regular constraint, which
demand that the sequence of all assignments for variables can be accepted by a …

In temporal planning, chronicles can be used to represent the predictive model of durative
actions. Unlike the classical state-oriented representation, the usage of chronicles allows a …

Automated temporal planning is the technology of choice when controlling systems that can
execute more actions in parallel and when temporal constraints, such as deadlines, are …

In this paper we give a high level overview of the Aries planner at the time of its participation
in the hierarchical track of the 2023 International Planning Competition (IPC). Aries is an …

Smart factories are on the verge of becoming the new industrial paradigm, wherein
optimization permeates all aspects of production, from concept generation to sales. To fully …

Given the model of a system with explicit temporal constraints, optimal temporal planning is
the problem of finding a schedule of actions that achieves a certain goal while optimizing an …