The multi-agent pathfinding (MAPF) problem has attracted considerable attention because
of its relation to practical applications. In this paper, we present a constraint-based …

Portfolio-based algorithm selection can help in choosing the best suited algorithm for a
given task while leveraging the complementary strengths of the candidates. Solving the Multi …

Abstract The problem of Multi-Agent Path Finding (MAPF) is to find paths for a fixed set of
agents from their current locations to some desired locations in such a way that the agents …

Target searching in an unknown environment is a traditional research issue in the
multiagent area. In some real cases, the agents do not only discover the targets; instead …

Abstract The Connected Multi-Agent Path Finding (CMAPF) problem asks for a plan to move
a group of agents in a graph while respecting a connectivity constraint. We study a …

Abstract The Connected Multi-Agent Path Finding (CMAPF) problem asks for a plan to move
a group of agents in a graph while respecting a connectivity constraint. We study a …

Path planning is the task of devising a sequence steps for a mobile entity to follow. This task
is required at the center of numerous real-world problems. The study of autonomous …

This thesis presents algorithms for multi-agent robotic assembly planning in automated
manufacturing contexts. Our work touches on many pieces of the" factory autonomy stack." …

Tato práce se zaměřuje na problém plánování trasy pro více robotů, v této práci nazývaných
agenty. Jedná se o úlohu nalezení bezkolizních tras pro více agentů z jejich startovních míst …

The original theme of our project was “Pick-up and Delivery using Multi-agent Path Finding
(MAPF)”. It was planned to create a set of tasks in which robot, to whom would be the task …