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 条
  • [1] 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
  • [2] Multi-agent pathfinding with continuous time
    Andreychuk, Anton
    Yakovlev, Konstantin
    Surynek, Pavel
    Atzmon, Dor
    Stern, Roni
    ARTIFICIAL INTELLIGENCE, 2022, 305
  • [3] Multi-agent planning, execution and monitoring
    Budenske, J
    Bonney, J
    Wu, J
    Newhouse, J
    Gini, M
    Reilly, M
    IC-AI'2000: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 1-III, 2000, : 665 - 671
  • [4] Multi-agent opportunistic planning and plan execution
    Lawton, JH
    Domshlak, C
    ICTAI 2004: 16TH IEEE INTERNATIONALCONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, : 408 - 415
  • [5] 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
  • [6] Continuous optimisation problem and game theory for multi-agent pathfinding
    Alexander V. Kuznetsov
    Andrew Schumann
    Małgorzata Rataj
    International Journal of Game Theory, 2024, 53 : 1 - 41
  • [7] 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
  • [8] When to Switch: Planning and Learning for Partially Observable Multi-Agent Pathfinding
    Skrynnik, Alexey
    Andreychuk, Anton
    Yakovlev, Konstantin
    Panov, Aleksandr I.
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024, 35 (12) : 17411 - 17424
  • [9] 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
  • [10] 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