Abstract
Benchmarking is central to the evaluation of multi-agent pathfinding (MAPF) solvers, yet benchmark instances are often manually designed and may not systematically expose differences between solving paradigms. Hence, gaining insight into the complementary strengths of different MAPF solving approaches is challenging. We present a preliminary study that explores the use of AutoIG, a constraint-based automated instance generation tool, as a means of generating MAPF benchmark instances that exhibit performance differences between solvers. We focus on a simple shelf based warehouse scenario and consider two representative MAPF solvers from the search-based and reduction-based paradigms, respectively. Our results indicate that, even in this restricted setting, AutoIG can identify instances with noticeable differences in solver performance. We also observe that the reduction-based solver (MAPF-encodings) tends to outperform the search-based solver (ICBS) on the generated instances, despite the latter paradigm being widely regarded as highly effective in many MAPF settings. Our work is an initial step toward a systematic understanding of the strengths and limitations of different MAPF solving paradigms through automated benchmark instance generation.
| Original language | English |
|---|---|
| Pages | 1-5 |
| Number of pages | 5 |
| Publication status | Published - 10 Feb 2026 |
| Event | UK PlanSIG 2026 - Edinburgh, United Kingdom Duration: 9 Feb 2026 → 10 Feb 2026 https://www.plansig.uk/2026 |
Workshop
| Workshop | UK PlanSIG 2026 |
|---|---|
| Country/Territory | United Kingdom |
| City | Edinburgh |
| Period | 9/02/26 → 10/02/26 |
| Internet address |
Fingerprint
Dive into the research topics of 'Towards generating discriminating instances for multi-agent pathfinding: a case study with shelf-based warehouse scenarios'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver