Zain Alabedeen Ali

2 accepted papers

2024

Improved Anonymous Multi-Agent Path Finding Algorithm

AAAI 2024technical

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 be reached by some agent. The problem is to find an assignment of the goals to the agents as well as the collision-free…

Cited by 7 Source ↗PDF ↗code ↗Scholar ↗

2023

Safe Interval Path Planning with Kinodynamic Constraints

Zain Alabedeen Ali, Konstantin Yakovlev

AAAI 2023technical

Safe Interval Path Planning (SIPP) is a powerful algorithm for solving a single-agent pathfinding problem where the agent is confined to a graph and certain vertices/edges of this graph are blocked at certain time intervals due to dynamic obstacles that populate the environment. The original SIPP al…

Cited by 14 Source ↗PDF ↗code ↗Scholar ↗