Counterexample guided abstraction refinement (CEGAR) represents a powerf...
Multi-agent path finding (MAPF) is a task of finding non-conflicting pat...
We study the planning and acting phase for the problem of multi-agent pa...
In multi-agent path finding (MAPF), the task is to find non-conflicting ...
Multi-agent path finding (MAPF) attracts considerable attention in artif...
Path planning for multiple robots (MRPP) represents a task of finding
no...
We introduce multi-goal multi agent path finding (MAPF^MG) which
general...
The At-Most-One (AMO) constraint is a special case of cardinality constr...
Multi-agent path finding in continuous space and time with geometric age...
In multi-agent path finding (MAPF) the task is to navigate agents from t...
We discuss milestones on the tour towards DPLL(MAPF), a multi-agent path...
This paper addresses a variant of multi-agent path finding (MAPF) in
con...
In the multi-agent path finding problem (MAPF) we are given a set of age...
We address item relocation problems in graphs in this paper. We assume i...
We study practical approaches to solving the token swapping (TSWAP) prob...
We address a problem of area protection in graph-based scenarios with
mu...
We address a problem of area protection in graph-based scenarios with
mu...
In multi-agent path finding (MAPF) the task is to find non-conflicting p...
The problem of makespan optimal solving of cooperative path finding (CPF...
The problem of solving (n^2-1)-puzzle and cooperative path-finding (CPF)...