Abstract
The Multi-Agent Path Finding problem (MAPF) aims to find conflict-free paths for a group of agents leading each agent to its respective goal. In this paper, we study the requirement of finding all optimal solutions in MAPF. We discuss the representation of all optimal solutions, propose three algorithms for finding them, and compare the algorithms experimentally.
| Original language | English |
|---|---|
| Pages (from-to) | 259-260 |
| Number of pages | 2 |
| Journal | The International Symposium on Combinatorial Search |
| Volume | 17 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Jan 2024 |
| Event | 17th International Symposium on Combinatorial Search, SoCS 2024 - Kananaskis, Canada Duration: 6 Jun 2024 → 8 Jun 2024 |
ASJC Scopus subject areas
- Computer Networks and Communications