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 条
  • [1] Online Multi-Agent Pathfinding
    Svancara, Jiri
    Vlk, Marek
    Stern, Roni
    Atzmon, Dor
    Bartak, Roman
    THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 7732 - 7739
  • [2] A Systematic Literature Review in Multi-Agent Systems: Patterns and Trends
    Falco, Mariana
    Robiolo, Gabriela
    2019 XLV LATIN AMERICAN COMPUTING CONFERENCE (CLEI 2019), 2019,
  • [3] Multi-Agent Pathfinding as a Combinatorial Auction
    Amir, Ofra
    Sharon, Guni
    Stern, Roni
    PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2015, : 2003 - 2009
  • [4] Learning to Schedule in Multi-Agent Pathfinding
    Ahn, Kyuree
    Park, Heemang
    Park, Jinkyoo
    2023 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2023, : 7326 - 7332
  • [5] Multi-Agent Pathfinding with Continuous Time
    Andreychuk, Anton
    Yakovlev, Konstantin
    Atzmon, Dor
    Stern, Roni
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 39 - 45
  • [6] Multi-agent pathfinding with continuous time
    Andreychuk, Anton
    Yakovlev, Konstantin
    Surynek, Pavel
    Atzmon, Dor
    Stern, Roni
    ARTIFICIAL INTELLIGENCE, 2022, 305
  • [7] A systematic review of argumentation techniques for multi-agent systems research
    Álvaro Carrera
    Carlos A. Iglesias
    Artificial Intelligence Review, 2015, 44 : 509 - 535
  • [8] A systematic review of argumentation techniques for multi-agent systems research
    Carrera, Alvaro
    Iglesias, Carlos A.
    ARTIFICIAL INTELLIGENCE REVIEW, 2015, 44 (04) : 509 - 535
  • [9] Design of Multi-Agent Pathfinding Robot Using Improved Flood Fill Algorithm in Maze Exploration
    Tjiharjadi, Semuil
    Razali, Sazalinsyah
    Sulaiman, H. A.
    Fernando, Gerry
    INTERNATIONAL JOURNAL OF MECHANICAL ENGINEERING AND ROBOTICS RESEARCH, 2022, 11 (08): : 631 - 638
  • [10] Multi-Agent Maze Exploration
    Kivelevitch, Elad H.
    Cohen, Kelly
    JOURNAL OF AEROSPACE COMPUTING INFORMATION AND COMMUNICATION, 2010, 7 (12): : 391 - 405