4 citations · 4 across the 2 of their papers we have counts for
3 papers
cs.AI2024
Improved Anonymous Multi-Agent Path Finding Algorithm
Zain Alabedeen Ali, Konstantin Yakovlev
We consider an Anonymous Multi-Agent Path-Finding (AMAPF) problem where the set of agents is confined to a graph, a set of goal vertices is given and each of these vertices has to…
cs.AI2023★ 4 cited
Safe Interval Path Planning With Kinodynamic Constraints
Zain Alabedeen Ali, Konstantin Yakovlev
Safe Interval Path Planning (SIPP) is a powerful algorithm for solving single-agent pathfinding problem when the agent is confined to a graph and certain vertices/edges of this gra…
cs.RO2021
Prioritized SIPP for Multi-Agent Path Finding With Kinematic Constraints
Zain Alabedeen Ali, Konstantin Yakovlev
Multi-Agent Path Finding (MAPF) is a long-standing problem in Robotics and Artificial Intelligence in which one needs to find a set of collision-free paths for a group of mobile ag…