Don't split, try to work it out: Bypassing conflicts in multi-agent pathfinding

Eli Boyarski, Ariel Feiner, Guni Sharon, Roni Stern

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

Conflict-Based Search (CBS) is a recently introduced algorithm for Multi-Agent Path Finding (MAPF) whose runtime is exponential in the number of conflicts found between the agents' paths. We present an improved version of CBS that bypasses conflicts thereby reducing the CBS search tree. Experimental results show that this improvement reduces the runtime by an order of magnitude in many cases.

Original languageEnglish
Title of host publicationICAPS 2015 - Proceedings of the 25th International Conference on Automated Planning and Scheduling
EditorsPatrik Haslum, Carmel Domshlak, Ronen Brafman, Shlomo Zilberstein
PublisherAAAI press
Pages47-51
Number of pages5
ISBN (Electronic)9781577357315
StatePublished - 1 Jan 2015
Event25th International Conference on Automated Planning and Scheduling, ICAPS 2015 - Jerusalem, Israel
Duration: 7 Jun 201511 Jun 2015

Publication series

NameProceedings International Conference on Automated Planning and Scheduling, ICAPS
Volume2015-January
ISSN (Print)2334-0835
ISSN (Electronic)2334-0843

Conference

Conference25th International Conference on Automated Planning and Scheduling, ICAPS 2015
Country/TerritoryIsrael
CityJerusalem
Period7/06/1511/06/15

Cite this