1 citations · 1 across the 3 of their papers we have counts for
Showing cs.MAShow all
2 papers · 1 filter
cs.MA2024
Work Smarter Not Harder: Simple Imitation Learning with CS-PIBT Outperforms Large Scale Imitation Learning for MAPF
Rishi Veerapaneni, Arthur Jakobsson, Kevin Ren +3
Multi-Agent Path Finding (MAPF) is the problem of effectively finding efficient collision-free paths for a group of agents in a shared workspace. The MAPF community has largely foc…
cs.MA2024★ 1 cited
Improving Learnt Local MAPF Policies with Heuristic Search
Rishi Veerapaneni, Qian Wang, Kevin Ren +3
Multi-agent path finding (MAPF) is the problem of finding collision-free paths for a team of agents to reach their goal locations. State-of-the-art classical MAPF solvers typically…