Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/22283
Title: | Task Allocation on Layered Multi-Agent Systems: When Evolutionary Many-Objective Optimization Meets Deep Q-Learning |
Authors: | Li, M Wang, Z Li, K Liao, X Hone, K Liu, X |
Keywords: | evolutionary computation;many-objective optimization;multi-agent systems;task allocation;deep Q-learning |
Issue Date: | 5-Jan-2021 |
Publisher: | IEEE |
Citation: | M. Li, M., Wang, Z., Li, K., Liao, X., Hone, K. and Liu, X. (2021) 'Task Allocation on Layered Multi-Agent Systems: When Evolutionary Many-Objective Optimization Meets Deep Q-Learning', IEEE Transactions on Evolutionary Computation, 25 (5), pp. 842 - 855. doi: 10.1109/TEVC.2021.3049131. |
Abstract: | IEEE This paper is concerned with the multi-task multi-agent allocation problem via many-objective optimization for multi-agent systems (MASs). First, a novel layered MAS model is constructed to address the multi-task multi-agent allocation problem that includes both the original task simplification and the many-objective allocation. In the first layer of the model, the deep Q-learning method is introduced to simplify the prioritization of the original task set. In the second layer of the model, the modified shift-based density estimation (MSDE) method is put forward to improve the conventional Strength Pareto Evolutionary Algorithm 2 (SPEA2) in order to achieve many-objective optimization on task assignments. Then, an MSDE-SPEA2-based method is proposed to tackle the many-objective optimization problem with objectives including task allocation, makespan, agent satisfaction, resource utilization, task completion, and task waiting time. As compared with existing allocation methods, the developed method in this paper exhibits an outstanding feature that the task assignment and the task scheduling are carried out simultaneously. Finally, extensive experiments are conducted to 1) verify the validity of the proposed model and the effectiveness of two main algorithms; and 2) illustrate the optimal solution for task allocation and efficient strategy for task scheduling under different scenarios. |
URI: | https://bura.brunel.ac.uk/handle/2438/22283 |
DOI: | https://doi.org/10.1109/TEVC.2021.3049131 |
ISSN: | 1089-778X |
Appears in Collections: | Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FullText.pdf | Copyright © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | 529.98 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.