Shafakhatullah Khan Mohammed

ACBS: A Bounded-Suboptimal Multi-Agent Path Finding Solver for Search-Based Problems

Shafakhatullah Khan Mohammed & Pallavi Singhal · Asian Journal of Research in Computer Science · 2025

Multi-Agent Path Finding (MAPF) represents a critical computational challenge in robotics and logistics, requiring the coordination of multiple agents to reach their destinations while avoiding collisions. Traditional optimal algorithms, such as Conflict-Based Search (CBS), deliv...

Open access Research Article 10.9734/ajrcos/2025/v18i11778

The Speed vs Quality Spectrum in MAPF: A Unified Review of Suboptimal and Bounded-Suboptimal Pathfinding Solvers

Shafakhatullah Khan Mohammed & Pallavi Singhal · Journal of Engineering Research and Reports · 2025

The Multi-Agent Pathfinding (MAPF) problem, a core challenge in robotics and logistics, seeks collision-free paths for multiple agents while minimizing aggregated cost. Given the NP-hard nature of MAPF, optimal solvers often fail to scale to large or highly dense environments. Th...

Open access Research Article 10.9734/jerr/2025/v27i111697