恒星跟踪器
先验与后验
明星(博弈论)
星星
鉴定(生物学)
棱锥(几何)
天空
多边形(计算机图形学)
计算机科学
算法
导航星
空格(标点符号)
人工智能
天体物理学
物理
计算机视觉
数学
天文
航天器
几何学
哲学
帧(网络)
操作系统
认识论
生物
电信
植物
作者
Daniele Mortari,Malak Samaan,Christian Bruccoleri,John L. Junkins
标识
DOI:10.1002/j.2161-4296.2004.tb00349.x
摘要
ABSTRACT: A new highly robust algorithm, called Pyramid, is presented to identify the stars observed by star trackers in the general lost-in-space case, where no a priori estimate of pointing is available. At the heart of the method is the k-vector approach for accessing the star catalog, which provides a searchless means to obtain all cataloged stars from the whole sky that could possibly correspond to a particular measured pair, given the measured interstar angle and the measurement precision. The Pyramid logic is built on the identification of a four-star polygon structure—the Pyramid—which is associated with an almost certain star identification. Consequently, the Pyramid algorithm is capable of identifying and discarding even a high number of spikes (false stars). The method, which has already been tested in space, is demonstrated to be highly efficient, extremely robust, and fast. All of these features are supported by simulations and by a few ground test experimental results.
科研通智能强力驱动
Strongly Powered by AbleSci AI