M2M solves the many-to-many MAPD problem with two variants and outperforms prior one-to-one methods by completing up to 22,000 more tasks on average in 8-hour warehouse simulations.
Multiple hungarian method for k-assignment problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.RO 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Many-to-Many Multi-Agent Pickup and Delivery
M2M solves the many-to-many MAPD problem with two variants and outperforms prior one-to-one methods by completing up to 22,000 more tasks on average in 8-hour warehouse simulations.