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 条
  • [31] Greedy Decentralized Auction-based Task Allocation for Multi-Agent Systems
    Braquet, Martin
    Bakolas, Efstathios
    IFAC PAPERSONLINE, 2021, 54 (20): : 675 - 680
  • [32] Dynamic Multi-Agent Task Allocation with Spatial and Temporal Constraints
    Amador, Sofia
    Okamoto, Steven
    Zivan, Roie
    AAMAS'14: PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2014, : 1495 - 1496
  • [33] Fair multi-agent task allocation for large datasets analysis
    Quentin Baert
    Anne-Cécile Caron
    Maxime Morge
    Jean-Christophe Routier
    Knowledge and Information Systems, 2018, 54 : 591 - 615
  • [34] Equilibrium strategies for task allocation in dynamic multi-agent systems
    Sarne, D
    Hadad, M
    Kraus, S
    ECAI 2004: 16TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 110 : 1083 - 1084
  • [35] Dynamic Multi-Agent Task Allocation with Spatial and Temporal Constraints
    Amador, Sofia
    Okamoto, Steven
    Zivan, Roie
    PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2014, : 1384 - 1390
  • [36] Dynamic pricing algorithms for task allocation in multi-agent swarms
    Dasgupta, Prithviraj
    Hoeing, Matthew
    MASSIVELY MULTI-AGENT TECHNOLOGY, 2008, 5043 : 64 - 79
  • [37] Learning Task Allocation for Multiple Flows in Multi-agent Systems
    Xiao, Zheng
    Ma, Shengxiang
    Zhang, Shiyong
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMMUNICATION SOFTWARE AND NETWORKS, 2009, : 153 - 157
  • [38] Potential game for dynamic task allocation in multi-agent system
    Wu, Han
    Shang, Huiliang
    ISA TRANSACTIONS, 2020, 102 (102) : 208 - 220
  • [39] Negotiation-oriented task allocation in multi-agent environments
    Lou, P
    Zhou, ZD
    Xu, HZ
    Chen, YP
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2005, 1 : 223 - 227
  • [40] 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,