1 citations · 2 across the 5 of their papers we have counts for
Showing cs.MAShow all
2 papers · 1 filter
cs.MA2024
From Space-Time to Space-Order: Directly Planning a Temporal Planning Graph by Redefining CBS
Yu Wu, Rishi Veerapaneni, Jiaoyang Li +1
The majority of multi-agent path finding (MAPF) methods compute collision-free space-time paths which require agents to be at a specific location at a specific discretized timestep…
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…