Anytime Constraint-based Multi-agent Pathfinding

Project: Research

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 titleAMAZON
StatusActive
Effective start/end date29/03/2128/03/24