Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/22283
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLi, M-
dc.contributor.authorWang, Z-
dc.contributor.authorLi, K-
dc.contributor.authorLiao, X-
dc.contributor.authorHone, K-
dc.contributor.authorLiu, X-
dc.date.accessioned2021-02-15T01:21:56Z-
dc.date.available2021-02-15T01:21:56Z-
dc.date.issued2021-01-05-
dc.identifier.citationM. 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.en_US
dc.identifier.issn1089-778X-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/22283-
dc.description.abstractIEEE 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.en_US
dc.description.sponsorship10.13039/501100012166-National Key Research and Development Program of China (Grant Number: 2020YFB2104000); 10.13039/501100001809-National Natural Science Foundation of China (Grant Number: 61625202, 61751204 and 61860206011); European Union’s Horizon 2020 Research and Innovation Programme (Grant Number: 820776 (INTEGRADDE)); 10.13039/501100000288-Royal Society of the U.K.; 10.13039/100005156-Alexander von Humboldt Foundation of Germany.en_US
dc.format.extent842 - 855-
dc.format.mediumPrint-Electronic-
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.rightsCopyright © 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.-
dc.rights.urihttps://www.ieee.org/publications/rights/rights-policies.html-
dc.subjectevolutionary computationen_US
dc.subjectmany-objective optimizationen_US
dc.subjectmulti-agent systemsen_US
dc.subjecttask allocationen_US
dc.subjectdeep Q-learningen_US
dc.titleTask Allocation on Layered Multi-Agent Systems: When Evolutionary Many-Objective Optimization Meets Deep Q-Learningen_US
dc.typeArticleen_US
dc.identifier.doihttps://doi.org/10.1109/TEVC.2021.3049131-
dc.relation.isPartOfIEEE Transactions on Evolutionary Computation-
pubs.issue5-
pubs.publication-statusPublished-
pubs.volume25-
dc.identifier.eissn1941-0026-
dc.rights.holderIEEE-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 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 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.