91 citations · 201 across the 5 of their papers we have counts for
8 papers
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
Roni Stern, Nathan Sturtevant, Ariel Felner +9
The MAPF problem is the fundamental problem of planning paths for multiple agents, where the key constraint is that the agents will be able to follow these paths concurrently witho…
Measuring Territorial Control in Civil Wars Using Hidden Markov Models: A Data Informatics-Based Approach
Therese Anders, Hong Xu, Cheng Cheng +1
Territorial control is a key aspect shaping the dynamics of civil war. Despite its importance, we lack data on territorial control that are fine-grained enough to account for subna…
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…
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…