Abstract
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.
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.
Original language | English GB |
---|---|
Number of pages | 7 |
State | Published - 2015 |
Event | 24th International Joint Conference on Artificial Intelligence, IJCAI 2015 - Buenos Aires, Argentina Duration: 25 Jul 2015 → 31 Jul 2015 |
Conference
Conference | 24th International Joint Conference on Artificial Intelligence, IJCAI 2015 |
---|---|
Country/Territory | Argentina |
City | Buenos Aires |
Period | 25/07/15 → 31/07/15 |