TY - GEN
T1 - Studying Online Multi-Agent Path Finding
AU - Morag, Jonathan
AU - Stern, Roni
AU - Felner, Ariel
AU - Atzmon, Dor
AU - Boyarski, Eli
N1 - Publisher Copyright:
Copyright © 2021, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2021/1/1
Y1 - 2021/1/1
N2 - Multi-agent path finding (MAPF) is the problem of planning a set of non-conflicting plans on a graph, for a set of agents. Online MAPF extends MAPF by considering a more realistic problem in which new agents may appear over time. While planning, an online solver does not know whether and which agents will join in the future. Therefore, in online problems the notion of snapshot-optimal was defined, where only current knowledge is considered. The quality of such a solution may be weaker than the quality of a solution to an equivalent offline MAPF problem (offline-optimality), where the solver is preinformed of all the agents that will appear in the future. In this paper we explore, theoretically and empirically, the quality of snapshot-optimal solutions compared to offline-optimal solutions.
AB - Multi-agent path finding (MAPF) is the problem of planning a set of non-conflicting plans on a graph, for a set of agents. Online MAPF extends MAPF by considering a more realistic problem in which new agents may appear over time. While planning, an online solver does not know whether and which agents will join in the future. Therefore, in online problems the notion of snapshot-optimal was defined, where only current knowledge is considered. The quality of such a solution may be weaker than the quality of a solution to an equivalent offline MAPF problem (offline-optimality), where the solver is preinformed of all the agents that will appear in the future. In this paper we explore, theoretically and empirically, the quality of snapshot-optimal solutions compared to offline-optimal solutions.
UR - http://www.scopus.com/inward/record.url?scp=85124609155&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85124609155
T3 - 14th International Symposium on Combinatorial Search, SoCS 2021
SP - 228
EP - 230
BT - 14th International Symposium on Combinatorial Search, SoCS 2021
A2 - Ma, Hang
A2 - Serina, Ivan
PB - Association for the Advancement of Artificial Intelligence
T2 - 14th International Symposium on Combinatorial Search, SoCS 2021
Y2 - 26 July 2021 through 30 July 2021
ER -