Project Details
Project Description
Multi-Agent Path Finding (MAPF) is a challenging optimi-sation problem which
asks to coordinate a team of moving agents. This topic is studied in a number
of different research communities. There is also considerable interest from
industry, with MAPF algorithms having become a technological enabler for a
variety of influential and newly emerging applications, such as the
automation of fulfilment centres. To focus the attention of this diverse
group, we propose to organise a MAPF competition: a computational challenge,
where participants solve MAPF problems as efficiently as possible using limited
computational resources. Expected benefits include the establishment of new
benchmarks and algorithmic baselines, the release of source codes for leading
implementations and a clear measure of advancement in the area. We also
believe that such a competition will attract further attention to the MAPF
problem and help grow the size of the community.
asks to coordinate a team of moving agents. This topic is studied in a number
of different research communities. There is also considerable interest from
industry, with MAPF algorithms having become a technological enabler for a
variety of influential and newly emerging applications, such as the
automation of fulfilment centres. To focus the attention of this diverse
group, we propose to organise a MAPF competition: a computational challenge,
where participants solve MAPF problems as efficiently as possible using limited
computational resources. Expected benefits include the establishment of new
benchmarks and algorithmic baselines, the release of source codes for leading
implementations and a clear measure of advancement in the area. We also
believe that such a competition will attract further attention to the MAPF
problem and help grow the size of the community.
| Short title | 2023 MAPF Competition |
|---|---|
| Acronym | 2023 MAPF Competition |
| Status | Active |
| Effective start/end date | 3/01/23 → … |