用于时空综合被动定位的种子分裂算法  

Seed Dividing Algorithm Used for Space-time Integrated Location

作　　者：代志恒[1] 袁富宇[1] 杨大伟[1] 

机构地区：[1]中国船舶重工集团公司江苏自动化研究所,江苏连云港222006

出　　处：《指挥控制与仿真》2007年第2期33-37,共5页Command Control & Simulation

摘　　要：针对传统TMA方法的局限性,运用时空综合被动定位(STI)理论,探索如何利用拖线阵列声纳的基阵探测信息估算目标运动要素。采用种子分裂算法(SDA)原理,通过选取合适的初始种子,进行高效率的穷举,从而得出最优解。经过仿真计算及分析发现,与遗传算法相比较,计算量大大缩小;本艇不机动时,即使在低信噪比的情况下,该算法既满足了可靠性的要求,又缩短搜索迭代过程。Because of the limitation of TMA methods, this paper investigates the estimation of target component based on the detection information from towed linear array sonar by the theory of space-time integrated location （STI）, Adopting Seed Dividing Algorithm （SDA）, it selects the suitable initial seed, exhausting more efficiently, thereby obtaining the optimum solution. By simulation, it shows that the amount of calculation of SDA has been reduced comparing with the Genetic Algorithm; when the submarine is non-maneuver, the algorithm satisfies the requirement of reliability and also cuts short the process of search and iteration under the low signal noise rate （SNR）,

关 键 词：时空综合被动定位 种子分裂算法 遗传算法 

分 类 号：O242[理学—计算数学]