activity
20122019
most citedOverview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios

91 citations · 264 across the 8 of their papers we have counts for

collaborators

8 papers

cs.AI201917 cited

Automatic Algorithm Selection In Multi-agent Pathfinding

Devon Sigurdson, Vadim Bulitko, Sven Koenig +2

In a multi-agent pathfinding (MAPF) problem, agents need to navigate from their start to their goal locations without colliding into each other. There are various MAPF algorithms,…

cs.AI20194 cited

Position Paper: From Multi-Agent Pathfinding to Pipe Routing

Gleb Belov, Liron Cohen, Maria Garcia de la Banda +3

The 2D Multi-Agent Path Finding (MAPF) problem aims at finding collision-free paths for a number of agents, from a set of start locations to a set of goal positions in a known 2D e…

cs.AI201734 cited

AI Buzzwords Explained: Multi-Agent Path Finding (MAPF)

Hang Ma, Sven Koenig

Explanation of the hot topic "multi-agent path finding".

cs.AI201734 cited

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…

cs.AI201774 cited

Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks

Hang Ma, Jiaoyang Li, T. K. Satish Kumar +1

The multi-agent path-finding (MAPF) problem has recently received a lot of attention. However, it does not capture important characteristics of many real-world domains, such as aut…

cs.AI201791 cited

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…