Cooperative Multiple Task Assignment Considering Precedence Constraints Using Multi-Chromosome Encoded Genetic Algorithm

Author(s):  
Xu Guangtong ◽  
Liu Li ◽  
Teng Long ◽  
Zhu Wang ◽  
Ming Cai
Author(s):  
Guangtong Xu ◽  
Teng Long ◽  
Zhu Wang ◽  
Li Liu

This paper presents a modified genetic algorithm using target-bundle-based encoding and tailored genetic operators to effectively tackle cooperative multiple task assignment problems of heterogeneous unmanned aerial vehicles. In the cooperative multiple task assignment problem, multiple tasks including reconnaissance, attack, and verification have to be sequentially performed on each target (e.g. ground control stations, tanks, etc.) by one or multiple unmanned aerial vehicles. Due to the precedence constraints of different tasks, a singular task-execution order may cause deadlock situations, i.e. one or multiple unmanned aerial vehicles being trapped in infinite waiting loops. To address this problem, a target-bundled genetic algorithm is proposed. As a key element of target-bundled genetic algorithm, target-bundle-based encoding is derived to fix multiple tasks on each target as a target-bundle. And individuals are generated by fixing the task-execution order on each target-bundle subject to task precedence constraints. During the evolution process, bundle-exchange crossover and multi-type mutation operators are customized to generate deadlock-free offspring. Besides, the time coordination method is developed to ensure that task-execution time satisfies task precedence constraints. The comparison results on numerical simulations demonstrate that target-bundled genetic algorithm outperforms particle swarm optimization and random search methods in terms of optimality and efficiency.


2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Zhipeng Li ◽  
Xiumei Wei ◽  
Xuesong Jiang ◽  
Yewen Pang

It is difficult to coordinate the various processes in the process industry. We built a multiagent distributed hierarchical intelligent control model for manufacturing systems integrating multiple production units based on multiagent system technology. The model organically combines multiple intelligent agent modules and physical entities to form an intelligent control system with certain functions. The model consists of system management agent, workshop control agent, and equipment agent. For the task assignment problem with this model, we combine reinforcement learning to improve the genetic algorithm for multiagent task scheduling and use the standard task scheduling dataset in OR-Library for simulation experiment analysis. Experimental results show that the algorithm is superior.


Author(s):  
Liangguang Wu ◽  
Yonghua Xiong ◽  
Kang-Zhi Liu ◽  
Jinhua She ◽  
◽  
...  

In crowdsensing, the diversity of the sensing tasks and an enhancement of the smart devices enable mobile users to accept multiple types of tasks simultaneously. In this study, we propose a new practical framework for dealing with the challenges of task assignment and user incentives posed by complex heterogeneous task scenarios in a crowdsensing market full of competition. First, based on the non-cooperative game property of mobile users, the problem is formulated into a Nash equilibrium problem. Then, to provide an efficient solution, a judgment method based on constraints (sensing time and sensing task dimension) is designed to decompose the problems into different situations according to the complexity. We propose a genetic-algorithm-based approach to find the combination of tasks that maximizes the utility of users and adopts a co-evolutionary model to formulate a stable sensing strategy that maintains the maximum utility of all users. Furthermore, we reveal the impact of competition between users and tasks on user strategies and use a cooperative weight to reflect it mathematically. Based on this, an infeasible solution repair method is designed in the genetic algorithm to reduce the search space, thus effectively accelerating the convergence speed. Extensive simulations demonstrate the effectiveness of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document