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 条
  • [41] The increasing cost tree search for optimal multi-agent pathfinding
    Sharon, Guni
    Stern, Roni
    Goldenberg, Meir
    Felner, Ariel
    ARTIFICIAL INTELLIGENCE, 2013, 195 : 470 - 495
  • [42] Conflict-based search for optimal multi-agent pathfinding
    Sharon, Guni
    Stern, Roni
    Felner, Ariel
    Sturtevant, Nathan R.
    ARTIFICIAL INTELLIGENCE, 2015, 219 : 40 - 66
  • [43] Multi-Agent Systems and Demand Response: A Systematic Review
    Li, Huan Aaron
    Nair, Nirmal-Kumar C.
    2015 AUSTRALASIAN UNIVERSITIES POWER ENGINEERING CONFERENCE (AUPEC), 2015,
  • [44] Continuous optimisation problem and game theory for multi-agent pathfinding
    Kuznetsov, Alexander V.
    Schumann, Andrew
    Rataj, Malgorzata
    INTERNATIONAL JOURNAL OF GAME THEORY, 2024, 53 (01) : 1 - 41
  • [45] PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning
    Sartoretti, Guillaume
    Kerr, Justin
    Shi, YunFei
    Wagner, Glenn
    Kumar, T. K. Satish
    Koenig, Sven
    Choset, Howie
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2019, 4 (03): : 2378 - 2385
  • [46] Using Hierarchical Constraints to Avoid Conflicts in Multi-Agent Pathfinding
    Walker, Thayne T.
    Chan, David M.
    Sturtevant, Nathan R.
    TWENTY-SEVENTH INTERNATIONAL CONFERENCE ON AUTOMATED PLANNING AND SCHEDULING, 2017, : 316 - 324
  • [47] Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding
    Okumura, Keisuke
    PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 243 - 251
  • [48] Formal development of multi-agent systems using MAZE
    Li, Qin
    Smith, Graeme
    SCIENCE OF COMPUTER PROGRAMMING, 2016, 131 : 126 - 150
  • [49] Literature review upon multi-agent supply chain management
    Tian, Jiang
    Tianfield, Huaglory
    PROCEEDINGS OF 2006 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2006, : 89 - +
  • [50] Perception field based imitation learning for unlabeled multi-agent pathfinding
    Wenjie CHU
    Ailun YU
    Wei ZHANG
    Haiyan ZHAO
    Zhi JIN
    Science China(Information Sciences), 2024, 67 (05) : 115 - 135