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