most citedRanking alternatives from opinions on criteria

2 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing cs.MAShow all

1 paper · 1 filter

cs.MA2025

Polynomial-time Configuration Generator for Connected Unlabeled Multi-Agent Pathfinding

Takahiro Suzuki, Keisuke Okumura

We consider Connected Unlabeled Multi-Agent Pathfinding (CUMAPF), a variant of MAPF where interchangeable agents must be connected at all times. This problem is fundamental to swar…