464 citations · 973 across the 14 of their papers we have counts for
15 papers
Enhancing Lifelong Multi-Agent Path-finding by Using Artificial Potential Fields
Arseniy Pertzovsky, Roni Stern, Ariel Felner +1
We explore the use of Artificial Potential Fields (APFs) to solve Multi-Agent Path Finding (MAPF) and Lifelong MAPF (LMAPF) problems. In MAPF, a team of agents must move to their g…
Multi-Agent Corridor Generating Algorithm
Arseniy Pertzovsky, Roni Stern, Roie Zivan +1
In this paper, we propose the Multi-Agent Corridor Generating Algorithm (MACGA) for solving the Multi-agent Pathfinding (MAPF) problem, where a group of agents need to find non-col…
Tightest Admissible Shortest Path
Eyal Weiss, Ariel Felner, Gal A. Kaminka
The shortest path problem in graphs is fundamental to AI. Nearly all variants of the problem and relevant algorithms that solve them ignore edge-weight computation time and its com…
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…
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…
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…