Learn all about Multi-Agent Path Finding (MAPF)
J. Morag, A. Felner, R. Stern, D. Atzmon and E. Boyarski. Online Multi-Agent Path Finding: New Results. In Proceedings of the Symposium on Combinatorial Search (SoCS), pages 229-233, 2022.
Abstract: Online MAPF extends the classical Multi-Agent Path Finding problem (MAPF) by considering a more realistic problem in which new agents may appear over time. As online solvers are not 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 comparison between oracle-optimal solutions (where the solver is preinformed of future agents), snapshot-optimal solutions, and suboptimal solutions obtained by prioritised planning.