Earticle

초록

영어

Multiple Unmanned Underwater Vehicles Is a typical combinatorial optimization problem, to achieve multiple AUV, coordinated, collaborative tasks to complete complex jobs subsea. Through analyzing the ant colony optimization algorithm, the paper proposed An Meta-heuristic ant colony optimization algorithm the Implementation to solve the multi AUVs to achieve the task allocation problem, and had simulation test based on the consolidated analyze the advantages of multiple unmanned underwater vehicle .results show that the ant colony optimization algorithms in solving multi-task allocation problem of multiple unmanned underwater vehicle showed a good performance.

목차

Abstract
 1. Introduction
 2. Ant Colony Optimization
  2.1. Aco Meta-Heuristic Algorithm
  2.2. ACO Mathematical Model
 3. Multi- Tasking AUVS
  3.1. Generalized Assignment
  3.2. Multiple AUVS Collaborative Planning Assignments
 4. Experimental Results and Analysis
  4.1. Multi-Tasking Comprehensive Superiority of AUVS
  4.2. Multi-Tasking AUVS Meta-Heuristic Ant Colony Algorithm
  4.3. Simulation
 5. Conclusions
 Acknowledgements
 References

키워드

저자

• Jian Jun Li [ College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China, School of Computer and Information Engineering, Harbin University of Commerce, Harbin 150028, China ]
• Ru Bo Zhang [ College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China, College of Electromechanical & Information Engineering, Dalian Nationalities University, Liaoning Dalian, 116600, China ]
• Yu Yang [ School of Computer and Information Engineering, Harbin University of Commerce, Harbin 150028, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605