期刊文献+

基于TSP问题的远航程无人水下航行器路径规划研究

Research on Path Planning for Long Voyage UUV Based On TSP
下载PDF
导出
摘要 针对远航程无人水下航行器的路径规划问题,本文提出了一种基于旅行商(TSP)问题的路径规划的新方法。阐述了TSP问题的基本原理,并采用了模拟退火算法和遗传算法进行了仿真研究,获得较好的仿真结果。 Aiming to solve the problem in the path planning of long run unmanned underwater vehicles (U-UV), this paper proposes a new method based on the traveling salesman problem (TSP). We elaborate the basic principle of TSP, and carry out the simulation research by using the simulated annealing algorithm and genetic al-gorithm, and obtain good results.
作者 崔凯兴
出处 《科技广场》 2014年第3期10-13,共4页 Science Mosaic
关键词 路径规划 旅行商问题 模拟退火算法 遗传算法 Path Planning TSP Simulated Annealing Algorithm Genetic Algorithm
  • 相关文献

参考文献3

二级参考文献39

  • 1[1]曹江丽.军用水下智能机器人技术[R].中国国防科学技术报告,2003
  • 2[2]曹江丽.军用水下智能机器人技术[R].中国国防科学技术报告,2004
  • 3[1]Nigel C. OR topics: A brief history of TSP[EB/OL]. http://www. orsoc. org. uk/about/topic/news/tspjune. htm, 2000.
  • 4[3]Michael J, Gerhard R, Giovanni R. The traveling salesman problem [J]. Handbooks in OR&MS, 1995, 7:225 ~330.
  • 5[4]Karla H, Manfred P. Traveling salesman problem[EB/OL]. http://iris. gmu. edu/~khoffman/papers/trav_salesman. html,2002.
  • 6[5]Gerhard R. The Traveling Salesman Computational solutions for TSP Applications[J]. Lecture Notes in Computer Science, 1994,840:1 ~223.
  • 7[6]Wolsey L A. Heuristic analysis, linear programming and branch and bound [J]. Math. Program. Study, 1980,13:121~134.
  • 8[7]Shmoys M I, Williamson D P. Analyzing the Held - Karp TSP bound: A monotonicity property with application [J]. Inf.Process. Lett. 1990, 35:281 ~285.
  • 9[8]Goemans M X. Worst-case comparison of valid inequalities for the TSP [J]. Math. Program, 1995:335~349.
  • 10[9]Maurras J F. Some results on the convex hull of Hamiltonian cycles of symmetric complete graphs [A]. Roy B. Combinatorial Programming: Methods and Applications [M]. Reidel, Dordrech, 1975. 179 ~ 190.

共引文献25

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部