Solutions to more-agents-with-obstacles (#88)

User Algorithm Version Cost Fastest time
thom ICTS (branch-and-bound) 0.1.0 159 2.096171365s View
jesse BCP-MAPFM in-matching 1 159 2.519266591s View
jesse BCP-MAPFM 1 159 3.20882363s View
thom A* + OD + ID with Hungarian heuristic 1.6.0 159 21.881564139s View