A Guide to Solving Pathfinding Problems with Multiple Agents

Student report (2020)

Authors

V. Ionescu Electrical Engineering, Mathematics and Computer Science
M. van der Meer Electrical Engineering, Mathematics and Computer Science
B.T. van Kooten Electrical Engineering, Mathematics and Computer Science
G.W.K. Paardekooper Electrical Engineering, Mathematics and Computer Science
J. Teunissen Electrical Engineering, Mathematics and Computer Science

Contributors

M.M. de Weerdt Algorithmics - EEMCS (mentor)
J. Mulderij Algorithmics - EEMCS (mentor)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
Copyright: © 2020 Victor Ionescu, Mike van der Meer, Bram van Kooten, Gijs Paardekooper, Jasper Teunissen
More Info
expand_more

Published Date

15-04-2020

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

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.