Showing cs.AIShow all
3 papers · 1 filter
cs.AI2018
Multi-Agent Path Finding with Deadlines
Hang Ma, Glenn Wagner, Ariel Felner +3
We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The objective is to maximize the number of agents that can reach their given goal vertices from their given start ve…
cs.AI2018
Multi-Agent Path Finding with Deadlines: Preliminary Results
Hang Ma, Glenn Wagner, Ariel Felner +3
We formalize the problem of multi-agent path finding with deadlines (MAPF-DL). The objective is to maximize the number of agents that can reach their given goal vertices from their…
cs.AI2017
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers
Liron Cohen, Glenn Wagner, T. K. Satish Kumar +2
Multi-Agent Path Finding (MAPF) is an NP-hard problem well studied in artificial intelligence and robotics. It has many real-world applications for which existing MAPF solvers use…