期刊文献+

基于混合算法的多机器人协作任务均衡规划研究

Research on Multi-Robot Cooperative Task Equilibrium Planning Based on Hybrid Algorithm
下载PDF
导出
摘要 针对机器人完成任务不均衡问题展开分析,提出了基于混合算法的规划算法,包括适应度值分类的K-means聚类实现任务分配、黏菌算法提高整体搜索效率、头脑风暴算法机器人内进行局部更新操作和机器人间进行全局更新操作完成重规划操作、交叉操作和大规模邻域搜索操作用以更新个体.实验结果表明:基于混合算法的任务均衡规划方法能够均衡规划多机器人任务,优化任务规划结果,提升任务的完成效率. Based on the analysis of the problem of unbalanced tasks completed by robots,a planning algorithm based on hybrid algorithm is proposed.It includes fitness value classification of K-means clustering for task allocation,slime mold algorithm to improve the overall search efficiency,brainstorming algorithm for local update operation in robot and global update operation in robot for re-planning operation,crossover operation and large-scale neighborhood search operation to update individuals.The experimental results show that the task balancing planning method based on hybrid algorithm can balance multi-robot tasks,improve task planning results and improve task completion efficiency.
作者 王喜敏 袁杰 WANG Ximin;YUAN Jie(School of Electrical Engineering,Xinjiang University,Urumqi Xinjiang 830017,China)
出处 《新疆大学学报(自然科学版)(中英文)》 CAS 2023年第2期210-221,共12页 Journal of Xinjiang University(Natural Science Edition in Chinese and English)
基金 国家自然科学基金“非结构环境下机器人羽流寻源自主演进策略研究”(62263031),“机器人化单分子病毒可控侵染细胞及原位定量表征方法研究”(62073227) 新疆维吾尔自治区自然科学基金“非结构环境下机器人建图与主动安全方法研究”(2022D01C53)。
关键词 任务均衡 任务重规划 K-MEANS 黏菌算法 头脑风暴算法 大规模邻域搜索 task balancing task re-planning K-means slime mold algorithm brainstorming algorithm large-scale neighborhood search
  • 相关文献

参考文献14

二级参考文献93

  • 1张焕青,张学平,王海涛,刘彦涵.基于负载均衡蚁群优化算法的云计算任务调度[J].微电子学与计算机,2015,32(5):31-35. 被引量:35
  • 2王颖,谢剑英.一种自适应蚁群算法及其仿真研究[J].系统仿真学报,2002,14(1):31-33. 被引量:232
  • 3Lagoudakis M G, Markakis E, Hempe D, et al. Auctionbased multi-robot routing. In: Proceedings of the International Conference on Robotics: Science and Systems (ROBOTICS), Cambridge, Massachusetts, USA, 2005. 343-350.
  • 4Golfarelli M, Maio D, Rizzi S. Multi-agent path planning based on task-swap negotiation. In: Proceedings of the UK Planning and Scheduling SIG Workshop, Durham, UK, 1997. 69-82.
  • 5Gerkey B P, Mataric M J. Sold ! : Auction methods for multirobot coordination. IEEE Trans on Robotics and Automation, 2002,18(5) :758-768.
  • 6Lagoudakis M G, Berhault M, Koenig S, et al. Simple auctions with performance guarantees for multi-robot task allocation. In: Proceedings of 2004 IEEE/RSJ International Coference on Intelligent Robots and Systems, Sendal, Japan, 2004. 698-705.
  • 7Somhom S, Modares A, Enkawa T. Competition-based neural network for the multiple traveling salesmen problem with minmax objective. Computers & Operations Research, 1999, 26: 395 -407.
  • 8Gao P A, Cai Z X. Multi-robot task allocation for exploration. Journal of Central South University Technology, 2006, 13(5) :548-551.
  • 9Leung Y W, Wang Y P. An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans EC, 2001, 5(1) :41-53.
  • 10Ralphs T. Vehicle Routing Data Sets. http://www, coin-or. org/SYMPHONY/branchandcut/VRP/data/# A: Ted Ralphs, 2008.

共引文献90

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部