Advertisement

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

  • Yaojie Chen (陈姚节)Email author
  • Shanshan Xiang (项珊珊)
  • Feixiang Chen (陈飞翔)
Article
  • 1 Downloads

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) 

CLC number

TP 301 

Document code

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    LI J, SUN Q R, ZHOU M C, et al. A new multiple traveling salesman problem and its genetic algorithmbased solution [C]//IEEE International Conference on Systems, Man, and Cybernetics. [s.l.]: IEEE, 2013: 627–632.Google Scholar
  2. [2]
    NECULA R, BREABAN M, RASCHIP M. Tackling the bi-criteria facet of multiple traveling salesman problem with ant colony systems [C]//IEEE International Conference on Tools with Artificial Intelligence. Vietri sul Mare, Italy: IEEE, 2015: 873–880.Google Scholar
  3. [3]
    CHIN T J, KEE Y H, ERIKSSON A, et al. Guaranteed outlier removal with mixed integer linear programs [C]//IEEE International Conference on Computer Vision and Pattern Recognition. Las Vegas, NV, USA: IEEE, 2016: 5858–5866.Google Scholar
  4. [4]
    VIELMA J P. Mixed integer linear programming formulation techniques [J]. SIAM Review, 2015, 57(1): 3–57.MathSciNetCrossRefzbMATHGoogle Scholar
  5. [5]
    WANG X Y, CHOI T M, LIU H K, et al. Novel ant colony optimization methods for simplifying solution construction in vehicle routing problems [J]. IEEE Transactions on Intelligent Transportation Systems, 2016, 17(11): 3132–3141.CrossRefGoogle Scholar
  6. [6]
    KUMAR S N, PANNEERSELVAM R. A survey on the vehicle routing problem and its variants [J]. Intelligent Information Management, 2012, 4(3): 66–74.CrossRefGoogle Scholar
  7. [7]
    MORADY R, DAL D. A multi-population based parallel genetic algorithm for multiprocessor task scheduling with communication costs [C]//IEEE Symposium on Computers and Communication. Messina, Italy: IEEE, 2016: 766–772.Google Scholar
  8. [8]
    ZANDIEH M, KHATAMI A R, RAHMATI S H A. Flexible job shop scheduling under condition-based maintenance: Improved version of imperialist competitive algorithm [J]. Applied Soft Computing, 2017, 58: 449–464.CrossRefGoogle Scholar
  9. [9]
    BARONI M D V, VAREJ˜AO F M. A shuffled complex evolution algorithm for the multidimensional knapsack problem using core concept [C]//IEEE Congress on Evolutionary Computation. Vancouver, Canada: IEEE, 2016: 2718–2723.Google Scholar
  10. [10]
    SAVIć A, TOšIć D, MARIć M, et al. Genetic algorithm approach for solving the task assignment problem [J]. Serdica Journal of Computing, 2008, 2(2): 267–276.zbMATHGoogle Scholar
  11. [11]
    ALGETHAMI H, PINHEIRO R L, LANDA-SILVA D. A genetic algorithm for a workforce scheduling and routing problem [C]//IEEE Congress on Evolutionary Computation. Vancouver, Canada: IEEE, 2016: 927–934.Google Scholar
  12. [12]
    GUO L Z, SHAO G J, ZHAO S G. Multi-objective task assignment in cloud computing by particle swarm optimization [C]//International Conference on Wireless Communications, Networking and Mobile Computing. Shanghai, China: IEEE, 2012: 1–4.Google Scholar
  13. [13]
    SUN C L, JIN Y C, CHENG R, et al. Surrogateassisted cooperative swarm optimization of highdimensional expensive problems [J]. IEEE Transactions on Evolutionary Computation, 2017, 21(4): 644–660.CrossRefGoogle Scholar
  14. [14]
    ALAYA I, SOLNON C, GHéDIRA K. Ant colony optimization for multi-objective optimization problems [C]//IEEE International Conference on Tools with Artificial Intelligence. Washington, USA: IEEE, 2007: 450–457.Google Scholar
  15. [15]
    WANG Z N, LI S, WANG Y, et al. The research of task assignment based on ant colony algorithm [C]//International Conference on Mechatronics and Automation. Changchun, China: IEEE, 2009: 2334–2339.Google Scholar
  16. [16]
    QIN L S, WANG J W, LI H X, et al. An approach to improve the performance of simulated annealing algorithm utilizing the variable universe adaptive fuzzy logic system [J]. IEEE Access, 2017, 5(99): 18155–18165.CrossRefGoogle Scholar
  17. [17]
    LIN Q Z, CHEN J Y, ZHAN Z H, et al. A hybrid evolutionary immune algorithm for multiobjective optimization problems [J]. IEEE Transactions on Evolutionary Computation, 2016, 20(5): 711–29.Google Scholar
  18. [18]
    QIAN Y P, XIA J, LIU T Y. Task assignment scheme based on contract net [J]. Journal of System Simulation, 2011, 23(8): 1672–1676 (in Chinese).Google Scholar
  19. [19]
    ZHANG T, LIU Y, ZHANG Y J, et al. PSO-ACS mixed algorithm for vehicle routing problem with simultaneous pick-up and delivery [J]. Journal of System Simulation, 2010, 22(3): 777–782 (in Chinese).Google Scholar
  20. [20]
    PREMALATHA K, NATARAJAN A M. Hybrid PSO and GA for global maximization [J]. International Journal of Open Problems in Computer Science and Mathematics, 2009, 2(4): 597–608.MathSciNetGoogle Scholar
  21. [21]
    LIN L, SUN Q B, WANG S G, et al. Research on PSO based multiple UAVs real-time task assignment [C]//Chinese Control and Decision Conference. Guiyang, China: IEEE, 2013: 1530–1536.Google Scholar
  22. [22]
    SUI Z Z, PU Z Q, YI J Q. Optimal UAVs formation transformation strategy based on task assignment and particle swarm optimization [C]//IEEE International Conference on Mechatronics and Automation. Takamatsu, Japan: IEEE, 2017: 1804–1809.Google Scholar
  23. [23]
    WANG Q, ZHANG A, SONG Z J. Simulation study on improved discrete particle swarm optimization algorithm for multiple UAV cooperation task assignment [J]. Journal of System Simulation, 2014, 26(5): 1149–1155 (in Chinese).Google Scholar
  24. [24]
    DU J Y, ZHANG F M, YANG J, et al. Cooperative task assignment for multiple UCAV using particle swarm optimization [J]. Control and Decision, 2012, 27(11): 1751–1755 (in Chinese).MathSciNetGoogle Scholar
  25. [25]
    LI W, ZHANG W. Method of tasks allocation of multi-UAVs based on particles swarm optimization [J]. Control and Decision, 2010, 25(9): 1359–1363 (in Chinese).Google Scholar
  26. [26]
    SU F, CHEN Y, SHEN L C. UAV cooperative multitask assignment based on ant colony algorithm [J]. Acta Aeronautica Et Astronautica Sinica, 2008, 29(Sup 1): 184–191 (in Chinese).Google Scholar
  27. [27]
    SHIMA T, RASMUSSEN S J, SPARKS A G, et al. Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms [J]. Computers & Operations Research, 2006, 33(11): 3252–3269.CrossRefzbMATHGoogle Scholar
  28. [28]
    EDISON E, SHIMA T. Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms [J]. Computers & Operations Research, 2011, 38(1): 340–356.MathSciNetCrossRefzbMATHGoogle Scholar
  29. [29]
    YAO M, WANG X Z, ZHAO M. Cooperative combat task assignment optimization design for unmanned aerial vehicles cluster [J]. Journal of University of Electronic Science and Technology of China, 2013, 42(5): 723–727 (in Chinese).Google Scholar
  30. [30]
    OZCAN C Y, HACIOMEROGLU M. A path-based multi-agent navigation model [J]. Visual Computer, 2015, 31(6/7/8): 863–872.CrossRefGoogle Scholar
  31. [31]
    CHEN Y J, HUANG L W. An automatic multiobjective collision avoiding approach [C]//IEEE 11th Conference on Industrial Electronics and Applications. Hefei, China: IEEE, 2016: 134–139.Google Scholar

Copyright information

© Shanghai Jiao Tong University and Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  • Yaojie Chen (陈姚节)
    • 1
    Email author
  • Shanshan Xiang (项珊珊)
    • 1
  • Feixiang Chen (陈飞翔)
    • 1
  1. 1.School of Computer Science and TechnologyWuhan University of Science and TechnologyWuhanChina

Personalised recommendations