Bringing Multi-agent Path Finding Closer to Reality

被引：0
|
作者：
Svancara, Jiri [1 ]
机构：
[1] Charles Univ Prague, Prague, Czech Republic
来源：
PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS (AAMAS' 18) | 2018年
关键词：
Multi-agent Path Finding; Satisfiability; Search Algorithms;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Multi-agent path finding is the problem of navigating multiple agents, located in a graph, from their current locations to their goal locations in such a way that there are no collisions between the agents. The classical definition of the problem assumes that the set of agents is unchangeable, and that the distances in the graph are homogeneous. We propose to add to the problem specification a set of new attributes to bring it closer to the real world. These attributes include varying distances, number of agents that can occupy an edge or node, and dynamic appearance of new agents.
引用
收藏
页码：1784 / 1785
页数：2
相关论文
共 50 条
  • [1] Bringing Multi-agent Path Finding Closer to Reality
    Svancara, Jiri
    [J]. PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 5787 - 5788
  • [2] Multi-Agent Path Finding - An Overview
    Stern, Roni
    [J]. ARTIFICIAL INTELLIGENCE, 2019, 11866 : 96 - 115
  • [3] Multi-Agent Path Finding with Deadlines
    Ma, Hang
    Wagner, Glenn
    Feiner, Ariel
    Li, Jiaoyang
    Kumar, T. K. Satish
    Koenig, Sven
    [J]. PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 417 - 423
  • [4] Incremental multi-agent path finding
    Semiz, Fatih
    Polat, Faruk
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2021, 116 : 220 - 233
  • [5] Robust Multi-Agent Path Finding
    Atzmon, Dor
    Stern, Roni
    Felner, Ariel
    Wagner, Glenn
    Bartak, Roman
    Zhou, Neng-Fa
    [J]. PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS (AAMAS' 18), 2018, : 1862 - 1864
  • [6] Multi-Agent Path Finding on Ozobots
    Bartak, Roman
    Krasicenko, Ivan
    Svancara, Jiri
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 6491 - 6493
  • [7] Robust Multi-Agent Path Finding and Executing
    Atzmon, Dor
    Stern, Roni Tzvi
    Felner, Ariel
    Wagner, Glenn
    Bartak, Roman
    Zhou, Neng-Fa
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2020, 67 : 549 - 579
  • [8] Multi-agent path finding with mutex propagation
    Zhang, Han
    Li, Jiaoyang
    Surynek, Pavel
    Kumar, T. K. Satish
    Koenig, Sven
    [J]. ARTIFICIAL INTELLIGENCE, 2022, 311
  • [9] Multi-Agent Path Finding with Kinematic Constraints
    Honig, Wolfgang
    Kumar, T. K. Satish
    Cohen, Liron
    Ma, Hang
    Xu, Hong
    Ayanian, Nora
    Koenig, Sven
    [J]. TWENTY-SIXTH INTERNATIONAL CONFERENCE ON AUTOMATED PLANNING AND SCHEDULING (ICAPS 2016), 2016, : 477 - 485
  • [10] Multi-agent Path Finding with Capacity Constraints
    Surynek, Pavel
    Kumar, T. K. Satish
    Koenig, Sven
    [J]. ADVANCES IN ARTIFICIAL INTELLIGENCE, AI*IA 2019, 2019, 11946 : 235 - 249
12345