检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]长春理工大学光电工程学院,吉林长春130022 [2]中国科学院长春光学精密机械与物理研究所小卫星技术国家地方联合工程研究中心,吉林长春130033 [3]中国科学院大学,北京100039
出 处:《宇航学报》2015年第1期76-81,共6页Journal of Astronautics
基 金:国家自然科学基金项目(61008046)
摘 要:为了提高三角形星图识别算法的成功率,减少匹配过程中的计算量,进而提高星敏感器实时输出姿态的性能,提出一种星图匹配前"二次优化"选取观测三角形方法,该方法在在初选观测三角形的基础上,对观测三角形进行第二次优化筛选,进而提高星图识别环节的效率。优化选取观测三角形是基于QUEST定姿原理,将观测三角形的边与夹角的约束关系转换到像平面上。全天球遍历分析统计结果表明:在12°×12°视场中,采用本文提出的方法,可使一次匹配成功并输出可用于星图验证环节的较高精度姿态信息的概率提高60.9%,从总体上可大大减少星敏感器星图识别环节的计算量,并且每帧全天球定姿输出的时间一致性也被大大提高。A new secondary optimization of selected observation triangles algorithm before star pattern matching is proposed to improve the success rate of the triangle-based star pattern identification algorithm,to reduce the computational complexity of the matching process,and to improve the performance of the star sensors for providing real-time attitudes. The originally selected observation triangles are optimized again before matching and verification to improve the efficiency of star pattern identification. The observation triangles are optimized according to the Quarternion Estimation( OUEST) attitude determination principle,and the constraints with respect to the observation triangle edges and included angles are converted to the image plane. Statistical results of ergodic analysis of the whole celestial sphere show that in the 12 ° × 12°FOV,the proposed method can improve the success rate of 60. 9% that the match is established at the first attempt and the accurate attitude information for is provided star pattern verification. Meanwhile,our method can also significantly reduce the overall computational complexity of star pattern identification for star sensors and enhance the temporal consistency of the output attitude for the whole celestial sphere in each frame.
分 类 号:V448.22[航空宇航科学与技术—飞行器设计]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30