TY - JOUR
T1 - An integrated multi-population genetic algorithm for multi-vehicle task assignment in a drift field
AU - Bai, Xiaoshan
AU - Yan, Weisheng
AU - Ge, Shuzhi Sam
AU - Cao, Ming
N1 - Publisher Copyright:
© 2018 Elsevier Inc.
PY - 2018/7
Y1 - 2018/7
N2 - This paper investigates the task assignment problem for a team of autonomous aerial/marine vehicles driven by constant thrust and maneuvering in a planar lateral drift field. The aim is to minimize the total traveling time in order to guide the vehicles to deliver a number of customized sensors to a set of target points with different sensor demands in the drift field. To solve the problem, we consider together navigation strategies and target assignment algorithms; the former minimizes the traveling time between two given locations in the drift field and the latter allocates a sequence of target locations to each vehicle. We first consider the effect of the weight of the carried sensors on the speed of each vehicle, and construct a sufficient condition to guarantee that the whole operation environment is reachable for the vehicles. Then from optimal control principles, time-optimal path planning is carried out to navigate each vehicle from an initial position to its given target location. Most importantly, to assign the targets to the vehicles, we combine the virtual coding strategy, multiple offspring method, intermarriage crossover strategy, and the tabu search mechanism to obtain a co-evolutionary multi-population genetic algorithm, short-named CMGA. Simulations on sensor delivery scenarios in both fixed and time-varying drift fields are shown to highlight the satisfying performances of the proposed approach against popular greedy algorithms.
AB - This paper investigates the task assignment problem for a team of autonomous aerial/marine vehicles driven by constant thrust and maneuvering in a planar lateral drift field. The aim is to minimize the total traveling time in order to guide the vehicles to deliver a number of customized sensors to a set of target points with different sensor demands in the drift field. To solve the problem, we consider together navigation strategies and target assignment algorithms; the former minimizes the traveling time between two given locations in the drift field and the latter allocates a sequence of target locations to each vehicle. We first consider the effect of the weight of the carried sensors on the speed of each vehicle, and construct a sufficient condition to guarantee that the whole operation environment is reachable for the vehicles. Then from optimal control principles, time-optimal path planning is carried out to navigate each vehicle from an initial position to its given target location. Most importantly, to assign the targets to the vehicles, we combine the virtual coding strategy, multiple offspring method, intermarriage crossover strategy, and the tabu search mechanism to obtain a co-evolutionary multi-population genetic algorithm, short-named CMGA. Simulations on sensor delivery scenarios in both fixed and time-varying drift fields are shown to highlight the satisfying performances of the proposed approach against popular greedy algorithms.
KW - Autonomous vehicles
KW - Drift field
KW - Multi-population genetic algorithm
KW - Task assignment
KW - Time-optimal path planning
UR - http://www.scopus.com/inward/record.url?scp=85045763784&partnerID=8YFLogxK
U2 - 10.1016/j.ins.2018.04.044
DO - 10.1016/j.ins.2018.04.044
M3 - 文章
AN - SCOPUS:85045763784
SN - 0020-0255
VL - 453
SP - 227
EP - 238
JO - Information Sciences
JF - Information Sciences
ER -