Answers are grounded in this paper and cite their sources.
In this study, we propose a complex distributed task allocation algorithm for “multiple agents versus multiple objects” for object transportation missions. This is achieved by combining a method for determining a set of objects that one agent can transport at once with a list for managing the start time of transportation. This reduces the transport start time and the agent's travel distance. We also aim to apply the proposed method to changing situations.
No takes yet. Share an insight, caveat, or question.
Takamizawa et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: