Formalizes CT-TAPF problem and introduces CT-TCBS optimal solver using incremental expansion for team formation plus task-centric sub-optimal solvers that improve efficiency over agent-centric baselines.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.MA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multi-Agent Cooperative Transportation: Optimal and Efficient Task Allocation and Path Finding
Formalizes CT-TAPF problem and introduces CT-TCBS optimal solver using incremental expansion for team formation plus task-centric sub-optimal solvers that improve efficiency over agent-centric baselines.