Project Details
Project Description
In this work we develop new algorithms for Multi-agent Path Finding (MAPF): ones that offer scalability, robustness and near-optimality. We will compute coordinated plans for up to hundreds of moving agents and we will guarantee that each plan can succeed even when every agent is affected by up to k unexpected failures, delays or other interruptions.
| Short title | AMAZON |
|---|---|
| Status | Finished |
| Effective start/end date | 29/03/21 → 28/03/24 |