Abstract Conflict-Based Search (CBS) and its enhancements are among the strongest
algorithms for the multi-agent path-finding problem. However, existing variants of CBS do …

Abstract Conflict-Based Search (CBS) and its enhancements are among the strongest
algorithms for Multi-Agent Path Finding. Recent work introduced an admissible heuristic to …

Counterexample-guided abstraction refinement (CEGAR) is a method for incrementally
computing abstractions of transition systems. We propose a CEGAR algorithm for computing …

Cost partitioning is a method for admissibly combining a set of admissible heuristic
estimators by distributing operator costs among the heuristics. Computing an optimal cost …

Operator cost partitioning is a well-known technique to make admissible heuristics additive
by distributing the operator costs among individual heuristics. Planning tasks are usually …

Many heuristics for cost-optimal planning are based on linear programming. We cover
several interesting heuristics of this type by a common framework that fixes the objective …

Planning problems of practical relevance commonly include multiple objectives that are
difficult to weight a priori. Several heuristic search algorithms computing the Pareto front of …

Abstraction heuristics are the state of the art in optimal classical planning as heuristic
search. A popular method for computing abstractions is the counterexample-guided …

A pattern database (PDB) for a planning task is a heuristic function in the form of a lookup
table that contains optimal solution costs of a simplified version of the task. In this paper we …

In many cases several entities, such as commercial companies, need to work together
towards the achievement of joint goals, while hiding certain private information. To …