MAPFZ extends classical MAPF to non-unit integer costs on graphs with finite states, solved efficiently by CBS-NIC and Bayesian-optimized discretization, outperforming prior methods on benchmarks.
Optimized directed roadmap graph for multi-agent path finding using stochastic gradient descent,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multi-Agent Pathfinding with Non-Unit Integer Edge Costs via Enhanced Conflict-Based Search and Graph Discretization
MAPFZ extends classical MAPF to non-unit integer costs on graphs with finite states, solved efficiently by CBS-NIC and Bayesian-optimized discretization, outperforming prior methods on benchmarks.