跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.17213 · v1

Collaborative Task Allocation for Heterogeneous Multi-Robot Systems Through Iterative Clustering

异构多机器人系统通过迭代聚类的协作任务分配

首次提交 2026-11-13 02:10
版本更新 2026-11-13 02:10
雷达观测 2026-11-13 14:15
arXiv ↗PDF ↗

摘要

Multi-robot systems face the challenge of efficiently allocating teams of heterogeneous robots to tasks. The task allocation problem is complicated by collaborative interactions between robots where teams of robots develop emergent capabilities that enable them to complete tasks that would be inefficient or impossible for individual robots. To address these challenges, we present an iterative clustering algorithm for collaborative task allocation in heterogeneous multi-robot systems. This approach partitions the computationally intractable global optimization problem into smaller, tractable subproblems by iteratively forming clusters of robots and tasks, then optimizing assignments within each cluster. By ensuring robots remain clustered with their currently assigned tasks, we guarantee monotonic improvement in overall utility with each iteration. We analyze the convergence of the algorithm and characterize how cluster size constraints determine which suboptimal assignments could trap the algorithm. In simulation, iterative clustering consistently outperforms simulated annealing, and a group-based auction in both computation time and solution quality, and outperforms a hedonic game approach in solution quality.

作者备注:8 pages, 4 figures, Published in IEEE Robotics and Automation Letters (RA-L) and presented at 2026 IEEE International Conference on Robotics and Automation (ICRA)

期刊信息:IEEE Robotics and Automation Letters, vol. 11, no. 1, pp. 33-40, Jan. 2026

AI 论文解读

基于摘要 · 非全文审阅

提出一种迭代聚类算法,将异构多机器人协作任务分配这一全局优化问题分解为可处理的子问题,并在仿真中与多种基线方法比较。

正在读取账号与研究记录…

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-13 02:10 · 最新观测版本

Collaborative Task Allocation for Heterogeneous Multi-Robot Systems Through Iterative Clustering

Multi-robot systems face the challenge of efficiently allocating teams of heterogeneous robots to tasks. The task allocation problem is complicated by collaborative interactions between robots where teams of robots develop emergent capabilities that enable them to complete tasks that would be inefficient or impossible for individual robots. To address these challenges, we present an iterative clustering algorithm for collaborative task allocation in heterogeneous multi-robot systems. This approach partitions the computationally intractable global optimization problem into smaller, tractable subproblems by iteratively forming clusters of robots and tasks, then optimizing assignments within each cluster. By ensuring robots remain clustered with their currently assigned tasks, we guarantee monotonic improvement in overall utility with each iteration. We analyze the convergence of the algorithm and characterize how cluster size constraints determine which suboptimal assignments could trap the algorithm. In simulation, iterative clustering consistently outperforms simulated annealing, and a group-based auction in both computation time and solution quality, and outperforms a hedonic game approach in solution quality.

查看此版本解读 →查看此版本原文 ↗