共查询到17条相似文献,搜索用时 62 毫秒
1.
2.
星敏感器作为高精度姿态测量单机,为高精度姿态控制提供前提保障。确保星敏感器空间指向正确性对姿控系统至关重要。基于此提出了一种在外场观星试验中,通过测试星敏感器地方时惯性指向来确认空间指向的方法,该方法结合格林尼治恒星时概念,通过地心赤道惯性坐标系与当地地理系之间的转换关系进行算法设计,是验证选用的星敏感器空间指向正确与否的重要手段。 相似文献
3.
4.
5.
6.
7.
8.
9.
船载星敏感器测星数据蒙气差实时修正方法 总被引:2,自引:0,他引:2
针对船载星敏感器安装在航天测量船上而引起的测星数据如何进行蒙气差实时修正问题,在分析船载经纬仪目前使用的蒙气差修正方法和中国天文年历提供的蒙气差修正方法的修正精度的基础上,提出船载星敏感器测星数据的蒙气差实时修正方法,给出蒙气差常数R0和温度变差乘数A的改正量α的计算公式,解决了工程应用上的高精度和实时性问题;同时,在分析大气温度、大气压力对船载星敏感器测星数据蒙气差影响的基础上,提出工程应用中的气象数据采集与使用的具体方案。 相似文献
10.
航天器在飞行过程中,星敏感器受到外界温度、地面标定精度等因素影响存在较大的安装误差,这将严重影响星敏感器的定姿精度。为提高星敏感器精度,对其安装误差进行严格的在轨实时标定与修正是确保星敏感器测量精度的关键。提出了一种SINS辅助的在线标定方法,将SINS/星敏感器输出的姿态信息进行配准,构建了组合导航系统的Kalman滤波模型。该方法只需航天器在飞行过程中做简单的机动,即可对星敏感器的安装误差角进行实时在线标定。仿真结果表明,采用该标定方法可使星敏感器和惯导的安装误差角的总体估计率达到95%以上,具有较高的工程应用价值。 相似文献
11.
12.
Jie Jiang Guangjun Zhang Xinguo Wei Xiao Li 《Aerospace and Electronic Systems Magazine, IEEE》2009,24(9):23-33
A rapid star tracking algorithm is proposed. In order to speed up the tracking, three techniques includng parallel star centroiding, sorting, and star catalogue partition are designed for three time-consuming portions in tracking algorithms. The parallel star centroiding is implemented with Field Programmable Gate Array (FPGA) which avoid image storage and transmission. Update rate of star sensor is improved. Sorting star coordinates in star image plane, and then matching, which avoid matching between stars with a long distance in image plane. Star catalogue partition divides the celestial sphere into many small partitions. In star mapping, guide stars are searched in the partitions near the direction of star sensor's boresight is not in the whole celestial sphere and therefore reduced the total number of searched guide stars. The software and hardware performance of tracking algorithms are simulated. Tracking robustness and the tracking speed comparison are tested in the software simulation. In hardware tests, the tracking time in every step is obtained. 相似文献
13.
14.
15.
To further extend study on celestial attitude determination with strapdown star sensor from static into dynamic field, one prerequisite is to generate precise dynamic simulating star maps. First a neat analytical solution of the smearing trajectory caused by spacecraft attitude maneuver is deduced successfully, whose parameters cover the geometric size of optics, three-axis angular velocities and CCD integral time. Then for the first time the mathematical law and method are discovered about how to synthesize the two formulae of smearing trajectory and the static Gaussian distribution function (GDF) model, the key of which is a line integral with regard to the static GDF attenuated by a factor 1/ L s (L s is the arc length of the smearing trajectory) along the smearing trajectory. The dynamic smearing model is then obtained, also in an analytical form. After that, three sets of typical simulating maps and data are simulated from this dynamic model manifesting the expected smearing effects, also compatible with the linear model as its special case of no boresight rotation. Finally, model validity tests on a rate turntable are carried out, which results in a mean correlation coefficient 0.920 0 between the camera images and the corresponding model simulated ones with the same parameters. The sufficient similarity verifies the validity of the dynamic smearing model. This model, after parameter calibration, can serve as a front-end loop of the ground semi-physical simulation system for celestial attitude determination with strapdown star sensor. 相似文献
16.
A Self-organizing Bearings-only Target Tracking Algorithm in Wireless Sensor Network 总被引:1,自引:0,他引:1
In the bearings-only target tracking, wireless sensor network (WSN) collects observations of the target direction at various nodes and uses an adaptive filter to combine them for target tracking. An efficient network management is necessary to gain an optimal tradeoff between locating accuracy and energy consumption. This article proposes a self-organizing target tracking algorithm to select the most beneficial subset of nodes to track the target at every snapshot. Compared with traditional methods, this scheme avoids the need for keeping global position information of the network as in greedy selection. Each node judges its future usefulness depending on the knowledge of its own position and using simple mathematics computation. Simulations indicate that this scheme has locating accuracy comparable to the global greedy algorithm. Also, it has good robustness against node failure and autonomous adaptability to the change of the network scale. Furthermore, this algorithm consumes limited energy because only a portion of nodes partakes in the selection at every snapshot. 相似文献