Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics tha...
Combined Target-Assignment and Path-Finding problem (TAPF) requires
simu...
The Flatland Challenge, which was first held in 2019 and reported in Neu...
With the rapid progress in Multi-Agent Path Finding (MAPF), researchers ...
The Multi-Objective Multi-Agent Path Finding (MO-MAPF) problem is the pr...
In this work, we consider the Multi-Agent Pickup-and-Delivery (MAPD) pro...
We formalize and study the multi-goal task assignment and path finding
(...
Multi-robot assembly systems are becoming increasingly appealing in
manu...
The Flatland competition aimed at finding novel approaches to solve the
...
Robots performing tasks in warehouses provide the first example of
wide-...
Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem t...
During Multi-Agent Path Finding (MAPF) problems, agents can be delayed b...
We present a scalable and effective multi-agent safe motion planner that...
Multi-Agent Path Finding (MAPF), i.e., finding collision-free paths for
...
We consider the problem of coordinating a fleet of robots in a warehouse...
Multi-Agent Path Finding (MAPF) is the problem of moving a team of agent...
The MAPF problem is the fundamental problem of planning paths for multip...
We study prioritized planning for Multi-Agent Path Finding (MAPF). Exist...
We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The obje...
We formalize the problem of multi-agent path finding with deadlines
(MAP...
The multi-agent path-finding (MAPF) problem has recently received a lot ...