Solving Multi-Agent Sokoban via LaCAM
2.60T1 sourcearXiv cs.MA
arXiv cs.MAoriginal source ↗
Source record
Published by arXiv cs.MA (T1 source). The original is at https://arxiv.org/abs/2609.39889.
Pipeline notes
The summary and note below are generated by the signal pipeline — they are Beyond Desk’s reading, not quotations from the source.
SummaryPaper presents Sokoban-LaCAM, a multi-agent Sokoban planner that adapts the LaCAM multi-agent pathfinding algorithm to handle tens of agents and boxes while preserving completeness and eventual optimality guarantees.
Why it mattersTangible evidence that MAPF techniques scale to integrated task assignment and collision-free planning, relevant to anyone tracking collective automation primitives beyond toy puzzles.
Cited by
No citations on record.