Greedy priority-based search for suboptimal multi-agent path finding

Shao Hung Chan, Roni Stern, Ariel Felner, Sven Koenig

Research output: Contribution to journalConference articlepeer-review


Multi-Agent Path Finding (MAPF) is the problem of finding collision-free paths, one for each agent, in a shared environment, while minimizing their sum of travel times. Since solving MAPF optimally is NP-hard, researchers have explored algorithms that solve MAPF suboptimally but efficiently. Priority-Based Search (PBS) is the leading algorithm for this purpose. It finds paths for individual agents, one at a time, and resolves collisions by assigning priorities to the colliding agents and replanning their paths during its search. However, PBS becomes ineffective for MAPF instances with high densities of agents and obstacles. Therefore, we introduce Greedy PBS (GPBS), which uses greedy strategies to speed up PBS by minimizing the number of collisions between agents. We then propose techniques that speed up GPBS further, namely partial expansions, target reasoning, induced constraints, and soft restarts. We show that GPBS with all these improvements has a higher success rate than the state-of-the-art suboptimal algorithm for a 1-minute runtime limit, especially for MAPF instances with small maps and dense obstacles.

Original languageAmerican English
Pages (from-to)11-19
Number of pages9
JournalThe International Symposium on Combinatorial Search
Issue number1
StatePublished - 1 Jan 2023
Event16th International Symposium on Combinatorial Search, SoCS 2023 - Prague, Czech Republic
Duration: 14 Jul 202316 Jul 2023

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications


Dive into the research topics of 'Greedy priority-based search for suboptimal multi-agent path finding'. Together they form a unique fingerprint.

Cite this