Abstract—Multi-agent Pathfinding, also known as MAPF, is an Artificial Intelligence problem-solving. The aim is to direct each agent to find its path to reach its target, both individually and in groups. Of course, this path allows agents to move without colliding with each other. This MAPF application is implemented in many areas that require the movement of various agents, such as warehouse robots, autonomous cars, video games, traffic control, Unmanned Aerial Vehicles (UAV), Search and Rescue (SAR), many others. The use of multi-agent in exploring often assumes all areas to be explored are free of obstructions. However, the use of MAPF to achieve their goals often faces static barriers, and even other agents can also be considered dynamic barriers. Because it requires some constraints in the program, such as agents cannot collide with each other. The use of single-agent can find the shortest path through exploration. Still, multi-agent cooperation should shorten the time to find a target location, especially if there is more than one target. This paper explains the Systematic Literature Review (SLR) method to review research on various multi-agent pathfinding. The contribution of this paper is the analysis of multi-agent pathfinding and its potential application in solving maze problems based on an SLR.
 

Index Terms—systematic review, multi-agent, pathfinding, maze

Cite: Semuil Tjiharjadi, Sazalinsyah Razali, and Hamzah Asyrani Sulaiman, "A Systematic Literature Review of Multi-agent Pathfinding for Maze Research," Journal of Advances in Information Technology, Vol. 13, No. 4, pp. 358-367, August 2022.

Copyright © 2022 by the authors. This is an open access article distributed under the Creative Commons Attribution License (CC BY-NC-ND 4.0), which permits use, distribution and reproduction in any medium, provided that the article is properly cited, the use is non-commercial and no modifications or adaptations are made.