Journal of Shanghai Jiao Tong University (Science) ›› 2019, Vol. 24 ›› Issue (2): 233-242.doi: 10.1007/s12204-019-2057-7

• • 上一篇    下一篇

Research on a Task Planning Method for Multi-Ship Cooperative Driving

CHEN Yaojie* (陈姚节), XIANG Shanshan (项珊珊), CHEN Feixiang (陈飞翔)   

  1. (School of Computer Science and Technology, Wuhan University of Science and Technology, Wuhan 430065, China)
  • 出版日期:2019-04-30 发布日期:2019-04-01
  • 通讯作者: CHEN Yaojie* (陈姚节) E-mail: 378831830@qq.com

Research on a Task Planning Method for Multi-Ship Cooperative Driving

CHEN Yaojie* (陈姚节), XIANG Shanshan (项珊珊), CHEN Feixiang (陈飞翔)   

  1. (School of Computer Science and Technology, Wuhan University of Science and Technology, Wuhan 430065, China)
  • Online:2019-04-30 Published:2019-04-01
  • Contact: CHEN Yaojie* (陈姚节) E-mail: 378831830@qq.com

摘要: A new method for a cooperative multi-task allocation problem (CMTAP) is proposed in this paper, taking into account the multi-ship, multi-target, multi-task and multi-constraint characteristics in a multi-ship cooperative driving (MCD) system. On the basis of the general CMTAP model, an MCD task assignment model is established. Furthermore, a genetic ant colony hybrid algorithm (GACHA) is proposed for this model using constraints, including timing constraints, multi-ship collaboration constraints and ship capacity constraints. This algorithm uses a genetic algorithm (GA) based on a task sequence, while the crossover and mutation operators are based on similar tasks. In order to reduce the dependence of the GA on the initial population, an ant colony algorithm (ACA) is used to produce the initial population. In order to meet the environmental constraints of ship navigation, the results of the task allocation and path planning are combined to generate an MCD task planning scheme. The results of a simulated experiment using simulated data show that the proposed method can make the assignment more optimized on the basis of satisfying the task assignment constraints and the ship navigation environment constraints. Moreover, the experimental results using real data also indicate that the proposed method can find the optimal solution rapidly, and thus improve the task allocation efficiency.

关键词: multi-ship cooperative task allocation, path planning, multi-task, multi-objective, genetic ant colony hybrid algorithm (GACHA)

Abstract: A new method for a cooperative multi-task allocation problem (CMTAP) is proposed in this paper, taking into account the multi-ship, multi-target, multi-task and multi-constraint characteristics in a multi-ship cooperative driving (MCD) system. On the basis of the general CMTAP model, an MCD task assignment model is established. Furthermore, a genetic ant colony hybrid algorithm (GACHA) is proposed for this model using constraints, including timing constraints, multi-ship collaboration constraints and ship capacity constraints. This algorithm uses a genetic algorithm (GA) based on a task sequence, while the crossover and mutation operators are based on similar tasks. In order to reduce the dependence of the GA on the initial population, an ant colony algorithm (ACA) is used to produce the initial population. In order to meet the environmental constraints of ship navigation, the results of the task allocation and path planning are combined to generate an MCD task planning scheme. The results of a simulated experiment using simulated data show that the proposed method can make the assignment more optimized on the basis of satisfying the task assignment constraints and the ship navigation environment constraints. Moreover, the experimental results using real data also indicate that the proposed method can find the optimal solution rapidly, and thus improve the task allocation efficiency.

Key words: multi-ship cooperative task allocation, path planning, multi-task, multi-objective, genetic ant colony hybrid algorithm (GACHA)

中图分类号: