Task assignment strategy for multi-robot based on improved Grey Wolf Optimizer

被引:32
作者
Li, Jing [1 ]
Yang, Fan [1 ]
机构
[1] Hebei Univ Technol, Sch Elect & Informat Engn, Tianjin 300401, Peoples R China
基金
中国国家自然科学基金;
关键词
Task allocation; Multi-robot; Gray wolf algorithm; Kent chaos; MTSP problem; ALGORITHM;
D O I
10.1007/s12652-020-02224-3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-robot task allocation (MRTA) is the basis of a multi-robot system to perform tasks automatically, which directly affects the execution efficiency of the whole system. A distributed cooperative task allocation strategy based on the algorithm of the improved Grey Wolf Optimizer (IGWO) was proposed to quickly and effectively plan the cooperative task path with a large number of working task points. The MRTA problem was transformed into multiple traveling salesman problems (MTSPs), and the task target points were clustered by the K-means clustering algorithm and divided into several traveling salesman problems (TSPs). The Grey Wolf Optimizer (GWO) was improved by the Kent chaotic algorithm to initialize the population and enhance the diversity of the population. Furthermore, an adaptive adjustment strategy of the control parameter (a) over right arrow was proposed to balance exploration and exploitation. The individual speed and position updates in PSO were introduced to enable the gray wolf individual to preserve its optimal location information and accelerate the convergence speed. The IGWO was used to solve the optimal solutions to multiple TSP problems. Finally, the optimal solution space was integrated to get the optimal solution of MTSP, and 16 international classical test functions simulated the IGWO. The results showed that the IGWO algorithm has faster convergence speed and higher accuracy. The task allocation strategy is reasonable, with roughly equal path length, small planning cost, fast convergence speed, and excellent stability.
引用
收藏
页码:6319 / 6335
页数:17
相关论文
共 21 条
[1]   Analysis of K-Means and K-Medoids Algorithm For Big Data [J].
Arora, Preeti ;
Deepali ;
Varshney, Shipra .
1ST INTERNATIONAL CONFERENCE ON INFORMATION SECURITY & PRIVACY 2015, 2016, 78 :507-512
[2]  
Das S, 2009, STUD COMPUT INTELL, V203, P23, DOI 10.1007/978-3-642-01085-9_2
[3]   Ant colony optimization -: Artificial ants as a computational intelligence technique [J].
Dorigo, Marco ;
Birattari, Mauro ;
Stuetzle, Thomas .
IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE, 2006, 1 (04) :28-39
[4]  
[江虹 Jiang Hong], 2018, [激光与红外, Laser and Infrared], V48, P396
[5]   Improved GWO algorithm for optimal design of truss structures [J].
Kaveh, A. ;
Zakian, P. .
ENGINEERING WITH COMPUTERS, 2018, 34 (04) :685-707
[6]   Multi-objective optimization using genetic algorithms: A tutorial [J].
Konak, Abdullah ;
Coit, David W. ;
Smith, Alice E. .
RELIABILITY ENGINEERING & SYSTEM SAFETY, 2006, 91 (09) :992-1007
[7]   基于Kent映射的混合混沌优化算法 [J].
刘建军 ;
石定元 ;
武国宁 .
计算机工程与设计, 2015, 36 (06) :1498-1503
[8]  
Liu Wen-bing, 2019, Electronics Optics & Control, V26, P35, DOI 10.3969/j.issn.1671-637X.2019.03.008
[9]  
[龙文 Long Wen], 2019, [电子学报, Acta Electronica Sinica], V47, P169
[10]  
MathWorks, 2019, HYBR GWOPSO OPT