Key points are not available for this paper at this time.
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.
Bardugo et al. (Sat,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: