Online Multi-Agent Path Finding: New Results.

Jonathan Morag, Ariel Felner, Roni Stern, Dor Atzmon, Eli Boyarski

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


Online MAPF extends the classical Multi-Agent Path Find ingproblem (MAPF) by considering a more realistic problem in which new agents may appear over time. As online solvers arenot aware of which agents will join in the future, the notion of snapshot-optimal was defined, where only current knowledge is considered. In this paper, we perform an extensive com-parison between oracle-optimal solutions (where the solver is preinformed of future agents), snapshot-optimal solutions, and suboptimal solutions obtained by prioritised planning
Original languageAmerican English
Title of host publicationProceedings of the Fifteenth International Symposium on Combinatorial Search (SoCS2022)229
Number of pages5
StatePublished - 17 Jul 2022


  • Analysis Of Search Algorithms
  • Combinatorial optimization
  • Continuous Problem Solving


Dive into the research topics of 'Online Multi-Agent Path Finding: New Results.'. Together they form a unique fingerprint.

Cite this