Cost-optimal planning has not seen many successful approaches that work well across all
domains. Some costoptimal planners excel on some domains, while exhibiting less exciting …

As classical planning is known to be computationally hard, no single planner is expected to
work well across many planning domains. One solution to this problem is to use online …

We address the problem of propositional planning extended with the class of soft temporally
extended goals supported in PDDL3, also called qualitative preferences since IPC-5. Such …

In our research, we explore two orthogonal but related methodologies of solving planning
instances: planning algorithms based on direct but lazy, incremental heuristic search over …

This thesis proposes, analyzes and tests different exploration-based techniques in Greedy
Best-First Search (GBFS) for satisficing planning. First, we show the potential of exploration …

Sequential planning portfolios are very powerful in exploiting the complementary strength of
different automated planners: for each planning task there are one or more base planners …

Resumen La Planificación Automática puede ser definida como el problema de encontrar
una secuencia de acciones (un plan) para conseguir una meta, desde un punto inicial …

Resumen La Planificación Automática puede ser definida como el problema de encontrar
una secuencia de acciones (un plan) para conseguir una meta, desde un punto inicial …