This study investigates the multi-agent pathfinding (MAPF) problem in a topological map consisting only of narrow corridors. When two or more robots move in a corridor, general MAPF algorithms ...