Multi-agent path finding arises, on the one hand, in numerous applied areas. A classical example is automated warehouses with a large number of mobile goods-sorting robots operating simultaneously. On the other hand, for this problem, there are no universal solution methods that simultaneously satisfy numerous (often contradictory) requirements. Examples of such criteria are a guarantee of finding optimal solutions, high-speed operation, the possibility of operation in partially observable environments, etc. This paper provides a survey of modern methods for multi-agent path finding. Special attention is given to various settings of the problem. The differences and between learnable and nonlearnable solution methods and their applicability are discussed. Experimental programming environments necessary for implementing learnable approaches are analyzed separately.
DOI: 10.1134/S1064562422060229
Download PDF from the SpringerLink publishing house website: https://link.springer.com/content/pdf/10.1134/S1064562422060229.pdf
Read at the Russian Academy of Sciences publishing house website (in Russian, registration required): https://sciencejournals.ru/view-article/?j=danmiup&y=2022&v=508&n=1&a=DANMIUp2207022Yakovlev
Download PDF or read online at ResearchGate: https://www.researchgate.net/publication/367275091_Planning_and_Learning_in_Multi-Agent_Path_Finding
Download PDF from eLibrary (in Russian, registration required): https://elibrary.ru/item.asp?id=49991314
Yakovlev, K. S., Andreychuk, A. A., Skrynnik, A. A., Panov, A. I. (2022). Planning and Learning in Multi-Agent Path Finding // Doklady Mathematics, Vol. 106, pp. 79–84. https://doi.org/10.1134/S1064562422060229