Print Email Facebook Twitter A Guide to Solving Pathfinding Problems with Multiple Agents Title A Guide to Solving Pathfinding Problems with Multiple Agents Author Ionescu, Victor (TU Delft Electrical Engineering, Mathematics and Computer Science) van der Meer, Mike (TU Delft Electrical Engineering, Mathematics and Computer Science) van Kooten, Bram (TU Delft Electrical Engineering, Mathematics and Computer Science) Paardekooper, Gijs (TU Delft Electrical Engineering, Mathematics and Computer Science) Teunissen, Jasper (TU Delft Electrical Engineering, Mathematics and Computer Science) Contributor de Weerdt, Mathijs (mentor) Mulderij, Jesse (mentor) Degree granting institution Delft University of Technology Date 2020-04-15 Abstract Currently, literature regarding Multiagent Path Finding (MAPF) does not give a broad enough overview of all the different approaches. Many papers are hard to read and require proper knowledge of MAPF. The goal of this report is to give a global overview of MAPF. To achieve this goal, we provide a detailed explanation of what MAPF problems look like, as well as giving a clear overview of the strength and weaknesses of different solutions. Besides this theoretical analysis, we also analyse and critique benchmarking performed by other researchers. Following all this, we conclude that the field of MAPF lacks agreement on terminology. Furthermore, performance analysis is limited to researchers choice, skewing research in their own favour. Subject Multi-agentPath FindingAlgorithmMAPFCPFOverviewPerformance analysis To reference this document use: http://resolver.tudelft.nl/uuid:6e38c31f-8b43-44f5-b1cd-1654d24a8e8e Part of collection Student theses Document type student report Rights © 2020 Victor Ionescu, Mike van der Meer, Bram van Kooten, Gijs Paardekooper, Jasper Teunissen Files PDF MAPF_report_final.pdf 3.96 MB Close viewer /islandora/object/uuid:6e38c31f-8b43-44f5-b1cd-1654d24a8e8e/datastream/OBJ/view