Multi-Agent Task Allocation Based on Discrete DEPSO in Epidemic Scenarios

被引:1
|
作者
Ma, Xinyao [1 ,2 ]
Zhang, Chunmei [1 ,2 ]
Yao, Fenglin [3 ]
Li, Zhanlong [3 ]
机构
[1] Taiyuan Univ Sci & Technol, Sch Elect Informat, Taiyuan 030024, Shanxi, Peoples R China
[2] Shanxi Key Lab Adv Control & Equipment Intelligenc, Taiyuan 030024, Shanxi, Peoples R China
[3] Taiyuan Univ Sci & Technol, Sch Mech Engn, Taiyuan 030024, Shanxi, Peoples R China
来源
IEEE ACCESS | 2022年 / 10卷
基金
中国国家自然科学基金;
关键词
Multi-agent systems; Resource management; Robots; Epidemics; Mathematical models; Particle swarm optimization; Metaheuristics; Multi-agent; task allocation problem; metaheuristic algorithms; D-DEPSO; epidemic scenario; PARTICLE SWARM OPTIMIZATION; DIFFERENTIAL EVOLUTION;
D O I
10.1109/ACCESS.2022.3228918
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multi-Agent Task Allocation is an emerging technology that changes the world in the epidemic scenario through its power to serve the needs of any hospital that requires unmanned operation. In this environment, the end user may want to have a better quality of unmanned service at low loss and high efficiency. We defined a new multi-agent task allocation problem (MATAP) in the epidemic scenario, and then MATAP was formulated. This paper presents a novel hybrid discrete approach that is based on the Differential Evolution Algorithm (DE) and Partial Swarm Optimization (PSO), namely D-DEPSO, for handling this problem. First, the initial personal population was handled by "mutation operation ". Modulus operations in the "mutation operation " modify the numerical overflow of a variable. Second, when updating the speed matrix, the speed matrix is discretized using the "round " function we have defined. Then, a random permutation was used to delete repeated numbers and to reinsert integers in the "crossover operation ". The diversity of the population was expanded by introducing the discrete mutation operation of the DE into the PSO and preserving the optimal solution for each generation using the properties of PSO. It can be used for optimizing a single objective function. Experimental results are compared with other existing metaheuristic algorithms, such as discrete DE, discrete PSO, improved discrete DE, improved discrete PSO, and improved discrete genetic algorithm, in terms of running time and loss. The experiments show that the optimal solutions obtained by D-DEPSO are better than those obtained by other five algorithms. For the actual problem, D-DEPSO can generate an optimal solution by optimal parameter setting to allocate tasks rationally. It can achieve a rational distribution of tasks in the prevention of disease.
引用
收藏
页码:131181 / 131191
页数:11
相关论文
共 50 条
  • [1] Study on multi-agent task allocation based on the contract net
    Li Tiejun
    Peng Yuqing
    Wu Jianguo
    2007 IEEE INTERNATIONAL CONFERENCE ON CONTROL AND AUTOMATION, VOLS 1-7, 2007, : 425 - +
  • [2] Multi-Agent Task Allocation for Robot Soccer
    Baghaei, Khashayar
    Agah, Arvin
    JOURNAL OF INTELLIGENT SYSTEMS, 2007, 16 (03) : 207 - 240
  • [3] Task Allocation and Evaluation Model for Holonic Manufacturing System Based on Multi-agent System
    Zhao, Fuqing
    Zhang, Qiuyu
    Wang, Lianxiang
    2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 4906 - +
  • [4] Nearest Neighbour Based Task Allocation with Multi-Agent Path Planning in Dynamic Environments
    Biswas, Sumana
    Anavatti, Sreenatha G.
    Garratt, Matthew A.
    2017 INTERNATIONAL CONFERENCE ON ADVANCED MECHATRONICS, INTELLIGENT MANUFACTURE, AND INDUSTRIAL AUTOMATION (ICAMIMIA), 2017, : 181 - 186
  • [5] Task Allocation in Multi-Agent Systems with Grammar-Based Evolution
    Samarasinghe, Dilini
    Barlow, Michael
    Lakshika, Erandi
    Kasmarik, Kathryn
    PROCEEDINGS OF THE 21ST ACM INTERNATIONAL CONFERENCE ON INTELLIGENT VIRTUAL AGENTS (IVA), 2021, : 175 - 182
  • [6] A multi-agent based manufacturing resource planning and task allocation system
    Miyamoto, T
    Ichimura, D
    Kumagai, S
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2003, E86A (04) : 806 - 812
  • [7] Multi-Agent Task Allocation with Interagent Distance Constraints
    Choi, Euihyeon
    Chang, Woohyuk
    JOURNAL OF AEROSPACE INFORMATION SYSTEMS, 2024, 21 (02): : 168 - 177
  • [8] A Bayesian Formulation for Auction Based Task Allocation in Heterogeneous, Multi-Agent Teams
    Pippin, Charles E.
    Christensen, Henrik
    GROUND/AIR MULTISENSOR INTEROPERABILITY, INTEGRATION, AND NETWORKING FOR PERSISTENT ISR II, 2011, 8047
  • [9] Information sharing in multi-agent search and task allocation problems
    Minos-Stensrud, Mathias
    Moen, Hans Jonas Fossum
    Bjerknes, Jan Dyre
    2021 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2021), 2021,
  • [10] Fast Consensus for Fully Distributed Multi-Agent Task Allocation
    Turner, Joanna
    Meng, Qinggang
    Schaefer, Gerald
    Soltoggio, Andrea
    33RD ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, 2018, : 832 - 839