Proceedings:
SOCS-22 Volume 15
Volume
Issue:
Vol. 15 No. 1 (2022): Fifteenth International Symposium on Combinatorial Search
Track:
Short Papers
Downloads:
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.
DOI:
10.1609/socs.v15i1.21772
SOCS
Vol. 15 No. 1 (2022): Fifteenth International Symposium on Combinatorial Search
Published by , . All rights reserved.
Copyright ,