We introduce multi-goal multi agent path finding (MG-MAPF) which generalizes the standard discrete multi-agent (MAPF) problem. While task in MAPF is to navigate agents an undirected graph from their starting vertices one individual goal vertex per agent, MG-MAPF assigns each multiple and visit of them at least once. Solving not only requires collision free paths for but also determining order v...