Dynamic Multi-Agent Path Finding based on Conflict Resolution using Answer Set Programming

被引：2
|
作者：
Atiq, Basem [1 ]
Patoglu, Volkan [1 ]
Erdem, Esra [1 ]
机构：
[1] Sabanci Univ, Fac Engn & Nat Sci, Istanbul, Turkey
来源：
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE | 2020年 / 325期
关键词：
D O I：
10.4204/EPTCS.325.27
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study a dynamic version of multi-agent path finding problem (called D-MAPF) where existing agents may leave and new agents may join the team at different times. We introduce a new method to solve D-MAPF based on conflict-resolution. The idea is, when a set of new agents joins the team and there are conflicts, instead of replanning for the whole team, to replan only for a minimal subset of agents whose plans conflict with each other. We utilize answer set programming as part of our method for planning, replanning and identifying minimal set of conflicts.
引用
收藏
页码：223 / 229
页数：7
相关论文
共 50 条
  • [1] Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming
    BOGATARKAN, A. Y. S. U.
    ERDEM, E. S. R. A.
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2020, 20 (06) : 974 - 989
  • [2] Incremental Conflict-Based Search for Multi-agent Path Finding in Dynamic Environment
    Wang, Yu
    Shi, Yuhong
    Liu, Jianyi
    Zheng, Xinhu
    [J]. ARTIFICIAL INTELLIGENCE APPLICATIONS AND INNOVATIONS, PT IV, AIAI 2024, 2024, 714 : 349 - 359
  • [3] Hierarchical decision making in multi-agent systems using answer set programming
    Van Nieuwenborgh, Davy
    De Vos, Marina
    Heymans, Stijn
    Vermeir, Dirk
    [J]. COMPUTATIONAL LOGIC IN MULTI-AGENT SYSTEMS, 2007, 4371 : 20 - +
  • [4] State Transition in Multi-agent Epistemic Domains Using Answer Set Programming
    Izmirlioglu, Yusuf
    Pham, Loc
    Son, Tran Cao
    Pontelli, Enrico
    [J]. LOGIC PROGRAMMING AND NONMONOTONIC REASONING, LPNMR 2022, 2022, 13416 : 273 - 286
  • [5] A Compact Answer Set Programming Encoding of Multi-Agent Pathfinding
    Gomez, Rodrigo N.
    Hernandez, Carlos
    Baier, Jorge A.
    [J]. IEEE Access, 2021, 9 : 26886 - 26901
  • [6] A Compact Answer Set Programming Encoding of Multi-Agent Pathfinding
    Gomez, Rodrigo N.
    Hernandez, Carlos
    Baier, Jorge A.
    [J]. IEEE ACCESS, 2021, 9 : 26886 - 26901
  • [7] Multi-objective Conflict-based Search for Multi-agent Path Finding
    Ren, Zhongqiang
    Rathinam, Sivakumar
    Choset, Howie
    [J]. 2021 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA 2021), 2021, : 8786 - 8791
  • [8] Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding
    Felner, Ariel
    Li, Jiaoyang
    Boyarski, Eli
    Ma, Hang
    Cohen, Liron
    Kumar, T. K. Satish
    Koenig, Sven
    [J]. TWENTY-EIGHTH INTERNATIONAL CONFERENCE ON AUTOMATED PLANNING AND SCHEDULING (ICAPS 2018), 2018, : 83 - 87
  • [9] Multi-agent Path Finding with Kinematic Constraints via Conflict Based Search
    Andreychuk, Anton
    [J]. ARTIFICIAL INTELLIGENCE, 2020, 12412 : 29 - 45
  • [10] Conflict-Based Steiner Search for Multi-Agent Combinatorial Path Finding
    Ren, Zhongqiang
    Rathinam, Sivakumar
    Choset, Howie
    [J]. ROBOTICS: SCIENCE AND SYSTEM XVIII, 2022,
12345