Planning and Learning in Multi-Agent Path Finding


Panov A. Yakovlev K. Skrynnik A.


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.

External links

DOI: 10.1134/S1064562422060229

Download PDF from the SpringerLink publishing house website:

Read at the Russian Academy of Sciences publishing house website (in Russian, registration required):

Download PDF or read online at ResearchGate:

Download PDF from eLibrary (in Russian, registration required):

Reference link

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.