伪目标动态可行域约束法中的观测站最优路线规划算法  

Optimal Observer Route Planning Algorithm in Pseudo-target Geometrical Constraint Method

作　　者：范丹丹[1] 黄开枝[1] 金梁[1] 

机构地区：[1]解放军信息工程大学信息工程学院信息技术研究所,郑州450002

出　　处：《电子与信息学报》2008年第12期2980-2983,共4页Journal of Electronics & Information Technology

基　　金：新世纪优秀人才支持计划;国家863计划项目(2007AA01Z434)资助课题

摘　　要：在针对非视距环境下单站机动定位的伪目标动态可行域约束法中,目标位置可行域大小直接影响到算法速度和最终定位结果的精度,因此该文提出了一种基于动态规划的观测站最优路线规划算法。该算法在当前测量时刻所测数据的基础上,以目标位置可行域收敛面积最大化为目标,分析出观测站运动到下一测量时刻的最优运动方向,从而达到缩短定位时间和抑制定位误差的目的,实现整个测量路线的最优化。In the pseudo-target geometrical constraint method, which aims at location using single observer in NLOS environment, the area of the target feasible region has direct effect on the speed and accuracy of the location algorithm. An optimal path planning algorithm of the observer is proposed in this paper, which is based on the dynamic programming. Based on the data measured at the current stage, the optimal moving direction of the observer at the next stage is calculated aiming at the maximum area of the target feasible region convergence. The optimized maneuvering path calculated by the proposed algorithm can improve the location precision and reduce the location time.

关 键 词：非视距 单次反射圆模型 方向角 方向角变化率 可行域 

分 类 号：TN929.53[电子电信—通信与信息系统]