Generative adversarial networks-based dynamic multi-objective task allocation algorithm for crowdsensing

被引:6
作者
Ji, Jianjiao [1 ]
Guo, Yinan [2 ]
Yang, Xiao [3 ]
Wang, Rui [4 ]
Gong, Dunwei [5 ]
机构
[1] China Univ Min & Technol, Artificial Intelligence Res Inst, Xuzhou 221116, Peoples R China
[2] China Univ Min & Technol Beijing, Sch Electromech & Informat Engn, Beijing 100083, Peoples R China
[3] China Univ Min & Technol, Sch Informat & Control Engn, Xuzhou 221116, Peoples R China
[4] Natl Univ Def Technol, Coll Syst Engn, Changsha 410073, Peoples R China
[5] Qingdao Univ Sci & Technol, Sch Informat Sci & Technol, Qingdao 266061, Peoples R China
基金
中国国家自然科学基金;
关键词
Generative adversarial network; Dynamic multi-objective optimization; Task allocation; Crowdsensing; EVOLUTIONARY ALGORITHM; MOBILE; OPTIMIZATION;
D O I
10.1016/j.ins.2023.119472
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Task allocation of large-scale and widely-distributed mobile users in a crowdsensing system is a challenging issue, especially on time-varying sensing requirements and available users. In order to shrink the search space, the sensing area is evenly segmented into several subarea, and the tasks in a subarea are allocated to the users preferring it. Following that, a dynamic multi-objective task allocation model is formulated, and an end-to-end algorithm based on generative adversarial network (GAN) is proposed as its problem-solver, with the purpose of quickly generating the Pareto-optimal allocation schemes. Specifically, after decomposing multi-objective problem into a set of scalar subproblems, each subproblem in each subarea is modeled as a neural network, in which the outputs represent the probabilities of users assigned to tasks. In order to produce better solutions and jump out local optima, a new loss function is designed for the discriminator. Besides, a rapid response mechanism is developed to timely adjust the structure of generative nets once a dynamic event occurs, avoiding the time-consuming re-training. Extensive experiments have been conducted to analyze the performance of proposed algorithm. The statistical results expose the competitiveness of proposed algorithm in terms of running time and performance.
引用
收藏
页数:17
相关论文
共 38 条
  • [1] Discovering Pareto-Optimal Magnetic-Design Solutions via a Generative Adversarial Network
    Baldan, Marco
    Di Barba, Paolo
    [J]. IEEE TRANSACTIONS ON MAGNETICS, 2022, 58 (09)
  • [2] Bello I., 2017, arXiv, DOI 10.48550/arXiv.1611.09940
  • [3] Capponi A, 2019, IEEE COMMUN SURV TUT, V21, P2419, DOI [10.1109/COMST.2019.2914030, 10.1109/isscs.2019.8801767]
  • [4] A synergy of an evolutionary algorithm with slime mould algorithm through series and parallel construction for improving global optimization and conventional design problem
    Chauhan, Sumika
    Vashishtha, Govind
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 118
  • [5] Conglomeration of Reptile Search Algorithm and Differential Evolution Algorithm for Optimal Designing of FIR Filter
    Chauhan, Sumika
    Vashishtha, Govind
    Kumar, Anil
    Abualigah, Laith
    [J]. CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2023, 42 (05) : 2986 - 3007
  • [6] On blockchain integration into mobile crowdsensing via smart embedded devices: A comprehensive survey?
    Chen, Zhiyan
    Fiandrino, Claudio
    Kantarci, Burak
    [J]. JOURNAL OF SYSTEMS ARCHITECTURE, 2021, 115
  • [7] Goodfellow IJ, 2014, ADV NEUR IN, V27, P2672
  • [8] ActiveCrowd: A Framework for Optimized Multitask Allocation in Mobile Crowdsensing Systems
    Guo, Bin
    Liu, Yan
    Wu, Wenle
    Yu, Zhiwen
    Han, Qi
    [J]. IEEE TRANSACTIONS ON HUMAN-MACHINE SYSTEMS, 2017, 47 (03) : 392 - 403
  • [9] Guo YN, 2020, LECT NOTES COMPUT SC, V12145, P423, DOI 10.1007/978-3-030-53956-6_38
  • [10] Evolutionary Multiobjective Optimization Driven by Generative Adversarial Networks (GANs)
    He, Cheng
    Huang, Shihua
    Cheng, Ran
    Tan, Kay Chen
    Jin, Yaochu
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (06) : 3129 - 3142