In this work we study a well-known and challenging problem of Multi-agen...
Heuristic search algorithms, e.g. A*, are the commonly used tools for
pa...
Conflict-Based Search (CBS) is a widely used algorithm for solving
multi...
We introduce POGEMA (https://github.com/AIRI-Institute/pogema) a sandbox...
Path finding is a well-studied problem in AI, which is often framed as g...
Conflict-Based Search (CBS) is a powerful algorithmic framework for opti...
Safe-interval path planning (SIPP) is a powerful algorithm for finding a...
Methods for centralized planning of the collision-free trajectories for ...
We study the navigation problem for a robot moving amidst static and dyn...
MAPF is the problem of finding paths for multiple agents such that every...
Problem of finding 2D paths of special shape, e.g. paths comprised of li...
We study the problem of planning collision-free paths for a group of
hom...
The problem of planning a set of paths for the coalition of robots (agen...
We introduce and empirically evaluate two techniques aimed at enhancing ...
The paper considers the problem of planning a set of non-conflict
trajec...