Multi-Agent Path Finding with Temporal Jump Point Search

Shuli Hu, Daniel Damir Harabor, Graeme Gange, Peter J. Stuckey, Nathan R. Sturtevant

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

Abstract

Temporal Jump Point Search (JPST) is a recently introduced algorithm for grid-optimal pathfinding among dynamic temporal obstacles. In this work we consider JPST as a low-level planner in Multi-Agent Path Finding (MAPF). We investigate how the canonical ordering of JPST can negatively impact MAPF performance and we consider several strategies which allow us to overcome these limitations. Experiments show our new CBS/JPST approach can substantially improve on CBS/SIPP, a contemporary and leading method from the area.
Original languageEnglish
Title of host publicationProceedings of the Thirty-Second International Conference on Automated Planning and Scheduling
EditorsAkshat Kumar, Sylvie Thiébaux, Pradeep Varakantham, William Yeoh
Place of PublicationPalo Alto CA USA
PublisherAssociation for the Advancement of Artificial Intelligence (AAAI)
Pages169-173
Number of pages5
ISBN (Electronic)9781577358749
DOIs
Publication statusPublished - 2022
EventInternational Conference on Automated Planning and Scheduling 2022 - Online, Singapore
Duration: 13 Jun 202224 Jun 2022
Conference number: 32nd
https://icaps22.icaps-conference.org (Website)
https://ojs.aaai.org/index.php/ICAPS/issue/view/505 (Proceedings)

Publication series

NameProceedings of the Thirty-Second International Conference on Automated Planning and Scheduling
PublisherAssociation for the Advancement of Artificial Intelligence (AAAI)
Number1
Volume32
ISSN (Print)2334-0835
ISSN (Electronic)2334-0843

Conference

ConferenceInternational Conference on Automated Planning and Scheduling 2022
Abbreviated titleICAPS 2022
Country/TerritorySingapore
Period13/06/2224/06/22
Internet address

Keywords

  • Multi-Agent Path Finding
  • Jump Point Search
  • Temporal Obstacles
  • Conflict-Based Search

Cite this