.png){kind=icon}
返回
Multi-task allocation with an optimized quantum particle swarm method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2020.106603.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multi-task allocation in multi-agent systems aims to accomplish tasks efficiently and successfully, while obtaining more rewards to enhance the entire system operation at the same time. Most existing assignment methods are based on agent coalitions, which cannot balance the profit distribution and task execution success rate or ignore the coalition stability, leading to a low execution level and assignment failures. Few coalition scheduling methods exist for multi-task allocation based on a fixed agent population. In this paper, we propose an effective stability quantum particle swarm optimization (SQPSO) algorithm which includes high rewards obtaining, benefit dividing, coalition stability insuring, and a historical task mechanism for search acceleration. Secondly, we design an efficient establishment quantum particle swarm optimization (EQPSO) algorithm for coalition scheduling, which is equipped with coalition similarity judgment to reduce the coalition formation time cost. The experiment results show that SQPSO guarantees a superior coalition for every task and earlier convergence in the whole task set allocation, and EQPSO gives the optimal scheduling order which reduces the total execution time. (C) 2020 Published by Elsevier B.V.
Keyword:
Coalition scheduling
EQPSO
MAS
Multi-task allocation
SQPSO
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
分享收藏分享收藏Mutual trust-based subtask allocation for human-robot collaboration in flexible lightweight assembly in manufacturing制造柔性轻量化装配中基于互信的人机协作子任务分配.png)
MECHATRONICS
OAAI
MECHATRONICSIF3.1
OAAI分享收藏Convergence properties of quantum evolutionary algorithms on high dimension problemsNEUROCOMPUTINGOAAI
NEUROCOMPUTINGIF6.5
OAAI分享收藏
查看更多内容