A map-graph min-cost flow assigns tasks and routes simultaneously, reportedly serving over 20,000 agents within a one-second planning budget.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.MA 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Flow-Based Task Assignment for Large-Scale Online Multi-Agent Pickup and Delivery
A map-graph min-cost flow assigns tasks and routes simultaneously, reportedly serving over 20,000 agents within a one-second planning budget.