TY - GEN
T1 - A GA-ACO hybrid algorithm for the multi-UAV mission planning problem
AU - Shang, Ke
AU - Karungaru, Stephen
AU - Feng, Zuren
AU - Ke, Liangjun
AU - Terada, Kenji
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2015/1/15
Y1 - 2015/1/15
N2 - Multi-UAV mission planning is a combinational optimization problem, that aims at planning a set of paths for UAVs to visit targets in order to collect the maximum surveillance benefits, while satisfying some constraints. In this paper, a genetic algorithm and ant colony optimization hybrid algorithm is proposed to solve the multi-UAV mission planning. The basic idea of the proposed hybrid algorithm is replacing the bad individuals of the GA's population by new individuals constructed by ant colony algorithm. Also, an efficient recombination operator called path relinking is used for mating. A population partition strategy is adopted for improving the evolving efficiency. Experimental results suggested that the proposed hybrid algorithm can solve the test instances effectively in a reasonable time. The comparison study with several existing algorithms shows that the proposed algorithm is competitive and promising.
AB - Multi-UAV mission planning is a combinational optimization problem, that aims at planning a set of paths for UAVs to visit targets in order to collect the maximum surveillance benefits, while satisfying some constraints. In this paper, a genetic algorithm and ant colony optimization hybrid algorithm is proposed to solve the multi-UAV mission planning. The basic idea of the proposed hybrid algorithm is replacing the bad individuals of the GA's population by new individuals constructed by ant colony algorithm. Also, an efficient recombination operator called path relinking is used for mating. A population partition strategy is adopted for improving the evolving efficiency. Experimental results suggested that the proposed hybrid algorithm can solve the test instances effectively in a reasonable time. The comparison study with several existing algorithms shows that the proposed algorithm is competitive and promising.
UR - https://www.scopus.com/pages/publications/84922954724
U2 - 10.1109/ISCIT.2014.7011909
DO - 10.1109/ISCIT.2014.7011909
M3 - 会议稿件
AN - SCOPUS:84922954724
T3 - 14th International Symposium on Communications and Information Technologies, ISCIT 2014
SP - 243
EP - 248
BT - 14th International Symposium on Communications and Information Technologies, ISCIT 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 14th International Symposium on Communications and Information Technologies, ISCIT 2014
Y2 - 24 September 2014 through 26 September 2014
ER -