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.
Christopher and Sven Koenig and Ferdinando Fioretto , title =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
A diffusion-based multi-robot planner trained on few agents generalizes to larger numbers during deployment using inter-agent attention and temporal convolution.
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.
-
Train-Small Deploy-Large: Leveraging Diffusion-Based Multi-Robot Planning
A diffusion-based multi-robot planner trained on few agents generalizes to larger numbers during deployment using inter-agent attention and temporal convolution.