91 citations · 129 across the 5 of their papers we have counts for
9 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…
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…
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…
Overview: A Hierarchical Framework for Plan Generation and Execution in Multi-Robot Systems
Hang Ma, Wolfgang Hönig, Liron Cohen +5
The authors present an overview of a hierarchical framework for coordinating task- and motion-level operations in multirobot systems. Their framework is based on the idea of using…
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…