425 citations · 779 across the 15 of their papers we have counts for
19 papers
Embedding Directed Graphs in Potential Fields Using FastMap-D
Sriram Gopalakrishnan, Liron Cohen, Sven Koenig +1
Embedding undirected graphs in a Euclidean space has many computational benefits. FastMap is an efficient embedding algorithm that facilitates a geometric interpretation of problem…
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses
Jiaoyang Li, Andrew Tinka, Scott Kiesel +3
Multi-Agent Path Finding (MAPF) is the problem of moving a team of agents to their goal locations without collisions. In this paper, we study the lifelong variant of MAPF, where ag…
Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers
Ngai Meng Kou, Cheng Peng, Hang Ma +2
In this paper, we study the one-shot and lifelong versions of the Target Assignment and Path Finding problem in automated sortation centers, where each agent needs to constantly as…
Multi-Agent Path Finding with Capacity Constraints
Pavel Surynek, T. K. Satish Kumar, Sven Koenig
In multi-agent path finding (MAPF) the task is to navigate agents from their starting positions to given individual goals. The problem takes place in an undirected graph whose vert…
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…
Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery
Hang Ma, Wolfgang Hönig, T. K. Satish Kumar +2
The Multi-Agent Pickup and Delivery (MAPD) problem models applications where a large number of agents attend to a stream of incoming pickup-and-delivery tasks. Token Passing (TP) i…