An Application of Improved PSO Algorithm in Cooperative Search Task Allocation

Author(s):  
Han Qingtian
2009 ◽  
Vol 29 (8) ◽  
pp. 2245-2249 ◽  
Author(s):  
Xiang XU ◽  
Dong-bo ZHANG ◽  
Hui-xian HUANG ◽  
Zi-wen LIU

2013 ◽  
Vol 33 (2) ◽  
pp. 319-322
Author(s):  
Min ZHANG ◽  
Qiang HUANG ◽  
Zhouzhao XU ◽  
Baizhuang JIANG

Author(s):  
Chen Chen ◽  
Bingjie Li ◽  
Wei Zhang ◽  
Hongda Zhao ◽  
Ciwei Gao ◽  
...  

Author(s):  
Na Geng ◽  
Zhiting Chen ◽  
Quang A. Nguyen ◽  
Dunwei Gong

AbstractThis paper focuses on the problem of robot rescue task allocation, in which multiple robots and a global optimal algorithm are employed to plan the rescue task allocation. Accordingly, a modified particle swarm optimization (PSO) algorithm, referred to as task allocation PSO (TAPSO), is proposed. Candidate assignment solutions are represented as particles and evolved using an evolutionary process. The proposed TAPSO method is characterized by a flexible assignment decoding scheme to avoid the generation of unfeasible assignments. The maximum number of successful tasks (survivors) is considered as the fitness evaluation criterion under a scenario where the survivors’ survival time is uncertain. To improve the solution, a global best solution update strategy, which updates the global best solution depends on different phases so as to balance the exploration and exploitation, is proposed. TAPSO is tested on different scenarios and compared with other counterpart algorithms to verify its efficiency.


2021 ◽  
Vol 1820 (1) ◽  
pp. 012185
Author(s):  
Shunjie Han ◽  
Xinchao Shan ◽  
Jinxin Fu ◽  
Weijin Xu ◽  
Hongyan Mi

Sign in / Sign up

Export Citation Format

Share Document