ESO-MAPF: Bridging Discrete Planning and Continuous Execution in Multi-Agent Pathfinding

被引:0
|
作者
Chudy, Jan [1 ]
Surynek, Pavel [1 ]
机构
[1] Czech Tech Univ, Fac Informat Technol, Thaakurova 9, Prague 16000 6, Czech Republic
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present ESO-MAPF, a research and educational platform for experimenting with multi-agent path finding (MAPF). ESO-MAPF focuses on demonstrating the planning-acting chain in the MAPF domain. MAPF is the task of finding collision-free paths for agents from their starting positions to given individual goals. The standard MAPF uses the abstraction where agents move in an undirected graph via traversing its edges in discrete steps. The discrete abstraction simplifies the planning phase; however, resulting discrete plans often need to be executed in the real continuous environment. ESO-MAPF shows how to bridge discrete planning and the acting phase in which the resulting plans are executed on physical robots. We simulate centralized plans on a group of OZOBOT Evo robots using their reflex functionalities and outputs on the surface of the screen that serves as the environment. Various problems arising along the planning-acting chain are illustrated to emphasize the educational point of view.
引用
收藏
页码:16014 / 16016
页数:3
相关论文
共 50 条
  • [31] Thesis Summary: Optimal Multi-Agent Pathfinding Algorithms
    Sharon, Guni
    PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2015, : 4255 - 4256
  • [32] 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
  • [33] 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
  • [34] 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
  • [35] Push and Rotate: A complete Multi-agent Pathfinding algorithm
    DeWilde, Boris, 1600, AI Access Foundation (51):
  • [36] Diagnosis of multi-agent plan execution
    de Jonge, Femke
    Roos, Nico
    Witteveen, Cees
    MULTIAGENT SYSTEM TECHNOLOGIES, PROCEEDINGS, 2006, 4196 : 86 - +
  • [37] Effective Decoupled Planning for Continuous Multi-Agent Pickup and Delivery
    Nie, Zhenbang
    Zeng, Peng
    Yu, Haibin
    PROCEEDINGS OF THE 32ND 2020 CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2020), 2020, : 2667 - 2672
  • [38] A Compact Answer Set Programming Encoding of Multi-Agent Pathfinding
    Gomez, Rodrigo N.
    Hernandez, Carlos
    Baier, Jorge A.
    IEEE ACCESS, 2021, 9 : 26886 - 26901
  • [39] Continuous Approximation of a Discrete Situated and Reactive Multi-agent System: Contribution to Agent Parameterization
    Stuker, Simon
    Adreit, Francoise
    Couveignes, Jean-Marc
    Gleizes, Marie-Pierre
    PRIMA 2014: PRINCIPLES AND PRACTICE OF MULTI-AGENT SYSTEMS, 2014, 8861 : 365 - 380
  • [40] A Compact Answer Set Programming Encoding of Multi-Agent Pathfinding
    Gomez, Rodrigo N.
    Hernandez, Carlos
    Baier, Jorge A.
    IEEE Access, 2021, 9 : 26886 - 26901