TY - GEN
T1 - Cooperative multiple task assignment considering precedence constraints using multi-chromosome encoded genetic algorithm
AU - Xu, Guangtong
AU - Liu, Li
AU - Long, Teng
AU - Wang, Zhu
AU - Cai, Ming
N1 - Publisher Copyright:
© 2018, American Institute of Aeronautics and Astronautics Inc, AIAA. All right reserved.
PY - 2018/1/1
Y1 - 2018/1/1
N2 - In the problem of cooperative multiple task assignment for heterogeneous unmanned aerial vehicles (UAVs), multiple consecutive tasks need to be performed on each target subject to task precedence constraints. An arbitrary task execution order might result in deadlock situations, i.e., one or multiple vehicles fall into an infinite waiting loop. In this paper, a multi-chromosome encoded genetic algorithm (MCE-GA) is proposed for avoiding the deadlock situations and assigning heterogeneous vehicles on multiple targets. The deadlock-free individuals are generated by considering the target identifiers and task precedence constraints in the multi-chromosome encoding process. Moreover, the specific crossover and mutation operators are designed to guarantee the feasibility of offspring individuals during the evolution process. The performance of MCE-GA is tested via comparing with random search method on simulation experiments. The comparison results from Monte Carlo simulations demonstrate that MCE-GA can produce better feasible solutions than random search method.
AB - In the problem of cooperative multiple task assignment for heterogeneous unmanned aerial vehicles (UAVs), multiple consecutive tasks need to be performed on each target subject to task precedence constraints. An arbitrary task execution order might result in deadlock situations, i.e., one or multiple vehicles fall into an infinite waiting loop. In this paper, a multi-chromosome encoded genetic algorithm (MCE-GA) is proposed for avoiding the deadlock situations and assigning heterogeneous vehicles on multiple targets. The deadlock-free individuals are generated by considering the target identifiers and task precedence constraints in the multi-chromosome encoding process. Moreover, the specific crossover and mutation operators are designed to guarantee the feasibility of offspring individuals during the evolution process. The performance of MCE-GA is tested via comparing with random search method on simulation experiments. The comparison results from Monte Carlo simulations demonstrate that MCE-GA can produce better feasible solutions than random search method.
UR - http://www.scopus.com/inward/record.url?scp=85141601475&partnerID=8YFLogxK
U2 - 10.2514/6.2018-1859
DO - 10.2514/6.2018-1859
M3 - Conference contribution
AN - SCOPUS:85141601475
SN - 9781624105265
T3 - AIAA Guidance, Navigation, and Control Conference, 2018
BT - AIAA Guidance, Navigation, and Control
PB - American Institute of Aeronautics and Astronautics Inc, AIAA
T2 - AIAA Guidance, Navigation, and Control Conference, 2018
Y2 - 8 January 2018 through 12 January 2018
ER -