期刊
INFORMATION SCIENCES
卷 453, 期 -, 页码 227-238出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2018.04.044
关键词
Task assignment; Time-optimal path planning; Drift field; Autonomous vehicles; Multi-population genetic algorithm
资金
- National Natural Science Foundation of China [51579210, 61633002]
- China Scholarship Council [201506290081]
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. (C) 2018 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据