1 List of Supplemental Figures
- Fig. S1. The landmark Dijkstra algorithm in a maze.
- Fig. S2. Different ending capture configurations.
- Fig. S3. Initial navigation speed analysis.
- Fig. S4. Algorithmic robustness to multiple robot-cargo cluster merge scenarios.
- Fig. S5. Cargo capture when there is a shortage of robots.
2 Supplemental Movies
- Movie S1. Single cargo capture in free space.
- Movie S2. Single cargo capture in mazes of three different sizes.
- Movie S3. Multiple cargo capture in free space and a maze of size 164a×164a.
- Movie S4. Multiple cargo capture in a maze (passageway width 8a) with different numbers of robots.