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 条
  • [21] Multi-agent architecture for automating satellite control operations planning and execution
    Biancho, Adriana C.
    de Aquino, Andreia C.
    Ferreira, Mauricio G. V.
    da Silva, Jose Demisio S.
    Cardoso, Luciana S.
    KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 1, PROCEEDINGS, 2006, 4251 : 268 - 275
  • [22] Token-based Execution Semantics for Multi-Agent Epistemic Planning
    Engesser, Thorsten
    Mattmueller, Robert
    Nebel, Bernhard
    Ritter, Felicitas
    KR2020: PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2020, : 351 - 360
  • [23] On the Scalable Multi-Objective Multi-Agent Pathfinding Problem
    Weise, Jens
    Mai, Sebastian
    Zille, Heiner
    Mostaghim, Sanaz
    2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [24] Distributed trajectory planning for multi-agent discrete event systems
    Appel, Marcus
    Walther, Michael
    Konigorski, Ulrich
    AT-AUTOMATISIERUNGSTECHNIK, 2019, 67 (09) : 751 - 761
  • [25] Anytime Lifelong Multi-Agent Pathfinding in Topological Maps
    Song, Soohwan
    Na, Ki-In
    Yu, Wonpil
    IEEE ACCESS, 2023, 11 : 20365 - 20380
  • [26] The computational complexity of multi-agent pathfinding on directed graphs
    Nebel, Bernhard
    ARTIFICIAL INTELLIGENCE, 2024, 328
  • [27] 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
  • [28] 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
  • [29] 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
  • [30] 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