.png){kind=icon}
返回
Large-scale multi-robot task allocation via dynamic partitioning and distribution
.png){kind=icon}
PRE
AI
DOI：10.1007/s10514-012-9303-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces an approach that scales assignment algorithms to large numbers of robots and tasks. It is especially suitable for dynamic task allocations since both task locality and sparsity can be effectively exploited. We observe that an assignment can be computed through coarsening and partitioning operations on the standard utility matrix via a set of mature partitioning techniques and programs. The algorithm mixes centralized and decentralized approaches dynamically at different scales to produce a fast, robust method that is accurate and scalable, and reduces both the global communication and unnecessary repeated computation. An allocation results by operating on each partition: either the steps are repeated recursively to refine the generalized assignment, or each sub-problem may be solved by an existing algorithm. The results suggest that only a minor sacrifice in solution quality is needed for significant gains in efficiency. The algorithm is validated using extensive simulation experiments and the results show advantages over the traditional optimal assignment algorithms.
Keyword:
Assignment partitioning
Multi-robot task allocation
Dynamic assignment
期刊
IF:
4.3
论文数:
1.7K
被引数:
5.0K
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏Fabrication techniques for thin-walled, kink-resistant tubular structures for use in medical devices
PREAI
分享收藏Hydrothermal preparation and low temperature magnetic properties of TbOOH, DyOOH, HoOOH, ErOOH, and YbOOHTbOOH，DyOOH，HoOOH，ErOOH和YbOOH的水热制备和低温磁性
PREAI
分享收藏
查看更多内容