Researchers Compare CBS, LNS, PBS, and PIBT in the Race to Speed Up Multi-Agent Pathfinding

This section reviews key Multi-Agent Pathfinding (MAPF) algorithms designed to reduce computation time. It contrasts serial methods like CBS, LNS, and PBS with parallel approaches such as PIBT and LaCAM, detailing enhancements—heuristics, conflict prioritization, neighborhood search, and priority strategies—that improve scalability, efficiency, and solution quality across varying problem densities.