A Systematic Literature Review of Multi-agent Pathfinding for Maze Research

被引:9
|
作者
Tjiharjadi, Semuil [1 ,2 ]
Razali, Sazalinsyah [2 ]
Sulaiman, Hamzah Asyrani [2 ]
机构
[1] Maranatha Christian Univ, Comp Syst Dept, Fac Engn, Bandung, Indonesia
[2] Univ Teknikal Malaysia Melaka, Fak Teknol Maklumat Komunikasi, Ctr Robot & Ind Automat, Durian Tunggal, Malaysia
关键词
systematic review; multi-agent; pathfinding; maze; CONSENSUS;
D O I
10.12720/jait.13.4.358-367
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:358 / 367
页数:10
相关论文
共 50 条
  • [21] The computational complexity of multi-agent pathfinding on directed graphs
    Nebel, Bernhard
    ARTIFICIAL INTELLIGENCE, 2024, 328
  • [22] Modeling and Solving the Multi-Agent Pathfinding Problem in Picat
    Bartak, Roman
    Zhou, Neng-Fa
    Stern, Roni
    Boyarski, Eli
    Surynek, Pavel
    2017 IEEE 29TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2017), 2017, : 959 - 966
  • [23] Comparison of Algorithms for Multi-agent Pathfinding in Crowded Environment
    Hudziak, Mariusz
    Pozniak-Koszalka, Iwona
    Koszalka, Leszek
    Kasprzak, Andrzej
    Intelligent Information and Database Systems, Pt I, 2015, 9011 : 229 - 238
  • [24] Branch-and-Cut-and-Price for Multi-Agent Pathfinding
    Lam, Edward
    Le Bodic, Pierre
    Harabor, Daniel D.
    Stuckey, Peter J.
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 1289 - 1296
  • [25] Multi-Agent Pathfinding for Deadlock Avoidance on Rotational Movements
    Chan, Frodo Kin Sun
    Law, Yan Nei
    Lu, Bonny
    Chick, Tom
    Lai, Edmond Shiao Bun
    Ge, Ming
    2022 17TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS AND VISION (ICARCV), 2022, : 765 - 770
  • [26] Thesis Summary: Optimal Multi-Agent Pathfinding Algorithms
    Sharon, Guni
    PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2015, : 4255 - 4256
  • [27] Ensembling Prioritized Hybrid Policies for Multi-agent Pathfinding
    Tang, Huijie
    Berto, Federico
    Park, Jinkyoo
    2024 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS 2024), 2024, : 8047 - 8054
  • [28] Push and Rotate: a Complete Multi-agent Pathfinding Algorithm
    de Wilde, Boris
    ter Mors, Adriaan W.
    Witteveen, Cees
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2014, 51 : 443 - 492
  • [29] A Practical Evaluation of Multi-Agent Pathfinding in Automated Warehouse
    Park, Chanwook
    Nam, Moonsik
    Moon, Hyeong Il
    Kim, Youngjae
    2024 21ST INTERNATIONAL CONFERENCE ON UBIQUITOUS ROBOTS, UR 2024, 2024, : 112 - 117
  • [30] Push and Rotate: A complete Multi-agent Pathfinding algorithm
    DeWilde, Boris, 1600, AI Access Foundation (51):