4.7 Article

Task Allocation on Layered Multiagent Systems: When Evolutionary Many-Objective Optimization Meets Deep Q-Learning

Journal

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION
Volume 25, Issue 5, Pages 842-855

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TEVC.2021.3049131

Keywords

Deep Q-learning (DQL); evolutionary computation; many-objective optimization; multiagent systems (MAS); task allocation

Funding

  1. National Key Research and Development Program of China [2020YFB2104000]
  2. National Natural Science Foundation of China [61625202, 61751204, 61860206011]
  3. European Union's Horizon 2020 Research and Innovation Programme [820776]
  4. Royal Society of the U.K.
  5. Alexander von Humboldt Foundation of Germany

Ask authors/readers for more resources

This article introduces a novel layered MAS model that addresses the multitask multiagent allocation problem using deep Q-learning and MSDE methods. The MSDE-SPEA2-based method is proposed to tackle many-objective optimization problem with various objectives like task allocation, completion time, agent satisfaction, etc.
This article is concerned with the multitask multiagent allocation problem via many-objective optimization for multiagent systems (MASs). First, a novel layered MAS model is constructed to address the multitask multiagent 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 the existing allocation methods, the developed method in this article 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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available