91 citations · 130 across the 7 of their papers we have counts for
4 papers · 1 filter
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments
Hang Ma, Jingxing Yang, Liron Cohen +2
Multi-agent path finding (MAPF) is a well-studied problem in artificial intelligence, where one needs to find collision-free paths for agents with given start and goal locations. I…
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…
The FastMap Algorithm for Shortest Path Computations
Liron Cohen, Tansel Uras, Shiva Jahangiri +3
We present a new preprocessing algorithm for embedding the nodes of a given edge-weighted undirected graph into a Euclidean space. The Euclidean distance between any two nodes in t…
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios
Hang Ma, Sven Koenig, Nora Ayanian +7
Multi-agent path finding (MAPF) is well-studied in artificial intelligence, robotics, theoretical computer science and operations research. We discuss issues that arise when genera…