ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding

被引：0

作者：

Boyarski, Eli ^{[1
]}

Felner, Ariel ^{[2
]}

Stern, Roni ^{[2
]}

Sharon, Guni ^{[2
]}

Tolpin, David ^{[3
]}

Betzalel, Oded ^{[3
]}

Shimony, Eyal ^{[3
]}

机构：

[1] Bar Ilan Univ, CS Dept, Ramat Gan, Israel

[2] Ben Gurion Univ Negev, ISE Dept, Beer Sheva, Israel

[3] Ben Gurion Univ Negev, CS Dept, Beer Sheva, Israel

来源：

PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI) | 2015年

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Conflict-Based Search (CBS) and its enhancements, Meta-Agent CBS and bypassing conflicts are amongst the strongest newly introduced algorithms for Multi-Agent Path Finding. This paper introduces two new improvements to CBS and incorporates them into a coherent, improved version of CBS, namely ICBS. Experimental results show that each of these improvements further reduces the runtime over the existing CBS-based approaches. When all improvements are combined, an even larger improvement is achieved, producing state-of-the art results for a number of domains.

引用

页码：740 / 746

页数：7

共 50 条

[1] Conflict-based search for optimal multi-agent pathfinding
Sharon, Guni
Stern, Roni
Felner, Ariel
Sturtevant, Nathan R.
[J]. ARTIFICIAL INTELLIGENCE, 2015, 219 : 40 - 66
[2] Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem
Barer, Max
Sharon, Guni
Stern, Roni
Felner, Ariel
[J]. 21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 961 - +
[3] Parallel Hierarchical Composition Conflict-Based Search for Optimal Multi-Agent Pathfinding
Lee, Hannah
Motes, James
Morales, Marco
Amato, Nancy M.
[J]. IEEE ROBOTICS AND AUTOMATION LETTERS, 2021, 6 (04) : 7001 - 7008
[4] Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search
Li, Jiaoyang
Feiner, Ariel
Boyarski, Eli
Ma, Hang
Koenig, Sven
[J]. PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 442 - 449
[5] 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
[6] Conflict-Based Steiner Search for Multi-Agent Combinatorial Path Finding
Ren, Zhongqiang
Rathinam, Sivakumar
Choset, Howie
[J]. ROBOTICS: SCIENCE AND SYSTEM XVIII, 2022,
[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] An Improved Bounded Conflict-Based Search for Multi-AGV Pathfinding in Automated Container Terminals
Zhou, Xinci
Zhu, Jin
[J]. CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES, 2024, 139 (03): : 2705 - 2727
[9] 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
[10] LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding
Okumura, Keisuke
[J]. THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 10, 2023, : 11655 - 11662

← 1 2 3 4 5 →