期刊文献+

UUV编队协同最优扩方应召搜索方法 被引量:5

Optimal extended position call-search method for UUVs' formation
下载PDF
导出
摘要 针对螺旋应召搜索方法理论上可行但实际上无法实现的问题,提出了基于改进的粒子群优化(parti-cle swarm optimization,PSO)算法的无人水下航行器(unmanned underwater vehicle,UUV)编队协同最优扩方应召搜索水下匀速直线运动目标的方法。首先,根据UUV的搜索宽度,建立了最优转向角模型,给出了采用改进的PSO算法的具体求解流程,并在此基础上继续探讨当目标速度未知情况下的搜索计划。然后,根据投放方式的不同,探讨了UUV编队的几种协同搜索方法。最后,通过仿真实验,证明了该方法的有效性,并根据仿真结果给出了对未来UUV装备技术发展方向的建议。 According to the problem that the spiral call-search method is only feasible in theory, a novel op- timal extended position search method based on improved particle swarm optimization (PSO) algorithm is pro- posed for the unmanned underwater vehicle (UUV) to search the uniform linear motion target. Firstly, based on the UUV's search width the model of optimal steering angle is established, and it is optimized by the im- proved PSO algorithm, then on that basis, another search method with unknown velocity of target is also ana- lyzed. Secondly, several cooperative search methods of formation of the UUV based on different projection are discussed. Finally, the feasibility of the proposed method is proved by the results of simulation, and some sug- gestions are proposed for future development directions of the UUV.
作者 陈盼 吴晓锋
出处 《系统工程与电子技术》 EI CSCD 北大核心 2013年第5期987-992,共6页 Systems Engineering and Electronics
基金 国家自然科学基金(60674049 61074012)资助课题
关键词 无人水下航行器 应召搜索 扩方搜索 粒子群优化算法 最优转向角 unmanned underwater vehicle (UUV) call-search extended position search (EPS) particleswarm optimization (PSO) algorithm optimal steering angle
  • 相关文献

参考文献15

二级参考文献56

共引文献105

同被引文献68

  • 1白晶,韩亮.舰载直升机吊声的搜潜方法探讨[J].北京航空航天大学学报,2007,33(3):282-285. 被引量:26
  • 2张跟鹏,刘忠,田晓东.基于UUV组群的水下协同探雷搜索与仿真[J].兵工自动化,2007,26(4):62-64. 被引量:11
  • 3朱清新,卿利,彭博.随机运动目标搜索问题的最优控制模型[J].控制理论与应用,2007,24(5):841-845. 被引量:4
  • 4Koopman B O. The theory of search[J]. Operation Research, 1956, 4(3): 324-346.
  • 5Stone L D. Theory of optimal search [M]. New York: Academic Press, 1975.
  • 6Brown S S. ()primal .~earch for moving target in discrete time and space[ J]. Operations Research , 1980, 28(6) : 1275 - 1289.
  • 7Trummel K E, Weisinger J R. The complexity of the optimal searcher path problem[J]. Operations Research , 1986, 34 (2) : 324 - 327.
  • 8Eagle J N, Yee J R. An optimal branch-and-bound procedure for the constrained path, moving target search problem[J]. Opera- tionsResearch, 1990, 38(1): 110-114.
  • 9Lau H, Huang S, Dissanayake G. Discoumed MEAN bound for lhe opmnal searcher path problem with non-uniform travel times[J]. European Journal of Operatiunal Research, 2008,190 ( 2 ) : 383 - 397.
  • 10Sato H, Royset J O. Path optimization for the resource con- slrained searcher[J]. Naval Researctz Logistics, 2010,57 (5) : 422 - 440.

引证文献5

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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