Anonymous MAPF is cast as a Markovian multi-marginal optimal transport problem that reduces to a feasible totally unimodular LP, with Schrödinger bridges yielding an entropic regularization solved iteratively by Sinkhorn for near-optimal integral non-overlapping transports at reduced complexity.
SIAM Journal on Scientific Computing , volume =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal and Scalable MAPF via Multi-Marginal Optimal Transport and Schr\"odinger Bridges
Anonymous MAPF is cast as a Markovian multi-marginal optimal transport problem that reduces to a feasible totally unimodular LP, with Schrödinger bridges yielding an entropic regularization solved iteratively by Sinkhorn for near-optimal integral non-overlapping transports at reduced complexity.