检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:罗成强 胡秋平[2] 张华[2] 胡文华 LUO Chengqiang;HU Qiuping;ZHANG Hua;HU Wenhua(Shijiazhuang Campus of Army Engineering University,Shijiazhuang 050003,China;Huayin Ordnance Test Center of China,Shaanxi Huayin 714200,China)
机构地区:[1]陆军工程大学石家庄校区,石家庄050003 [2]中国华阴兵器试验中心,陕西华阴714200
出 处:《弹箭与制导学报》2019年第5期27-30,共4页Journal of Projectiles,Rockets,Missiles and Guidance
摘 要:针对外弹道组网测量模式下,中心引导数据交会算法坐标解算精度不能满足10 m、时间大于50 ms的情况,提出一种基于距离估计的交会算法,采用基于立体网格的实时求解方法,通过限定待求目标空间坐标范围,使目标大概率位于以初值为中心,以3倍精度为半径的保精度立体网格内,采用遍历法求出似然函数值最大的网格点。仿真结果表明,坐标解算精度与多站最小二乘相当,6站交会解算时间优于15 ms,精度优于3 m。In external ballistic networking measurement mode, the coordinate precision of the center-guided data rendezvous algorithm cannot meet the requirement of 10 meters and the solving time is more than 50 ms. To solve this problem,this paper proposed a distance-based rendezvous algorithm, which uses a real-time solution method based on solid mesh to obtain the target’s probabilistic position by limiting the space coordinate range of the target to be solved. In the three-dimensional mesh with the initial value as the center and a radius which is 3 times of the accuracy, the maximum vaule of likelihood function in the mesh can be obtained by the ergodic method. The simulation results show that the coordinate solution precision is equivalent to that of multi station least square method. The calculation time of 6-station intersection is better than 15 ms and the precision is higher than 3 m.
关 键 词:外弹道测量 测元数据 极大似然交会 立体网格 遍历法
分 类 号:TP274.2[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15