[an error occurred while processing this directive]
   
 
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2006, Vol. 32 Issue (07) :764-768    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
���������������Ӿ�ϵͳ���������㷨
�����, ����, ����*
�������պ����ѧ �ѧԺ, ���� 100083
New algorithm of solving for ranges during final approach of spacecraft rendezvous
Zhu Renzhang, Lin Yan, Zhang Lei*
School of Astronautics, Beijing University of Aeronautics and Astronautics, Beijing 100083, China

ժҪ
�����
�������
Download: PDF (379KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ �Ժ���������Խ����ձƽ���Ӧ�õļ�����Ӿ�ϵͳ,���Ŀ�꺽������־����������㷨.�÷������ݱ�־�㹹�ͼ�������,���������Բ�෽���鲢�����ȨĿ�꺯��,����С��������,����Gauss-Newton��ֵ��������������ֵ.��ò���,����Ӧ����Ԫ�����㷨(QUEST)ȷ�������̬�����λ��.�Էǹ����־�㹹��(��3��T����5��׶��)�͹����־�㹹��(�������Ρ����Ρ�����),Ŀ�꺯��������־������ʹ�ϵ��;�Թ��湹��,Ŀ�꺯������������������.�Թ����־���ı��ι���,���öԽ��߽������Ӱ������ȷ�������������ֵ.����ģ�����������,����IJ������㷨�Թ�����ǹ�����ֱ�־�㹹���ձ�����,�������ձƽ������״̬ȷ��Ҫ��.
Service
�ѱ����Ƽ�������
�����ҵ����
�������ù�����
Email Alert
RSS
�����������
�ؼ����� ����������   ��������������   ������Ӿ�     
Abstract�� A new algorithm of solving for ranges during the final translation phase of spacecraft rendezvous and docking using computer vision system was presented to determine relative attitude and position between target and chase spacecraft by Quaternion Estimation. In this algorithm for ranges, a weighted objective function was constructed according to target pattern and geometry feature and used for solving for ranges. For both non-planar (such as three-point T-type and five-point pyramid type) and co-planar patterns (such as square, rectangle and rhombus), the objective function contained terms concerning ratios of distances between the target spots; but for co-planar targets, the objective function had another terms which describe co-planar feature. Gauss-Newton method was applied to solve for the optimum range solutions of the least squares problem. For quadrilateral patterns, the initial values for iterations were given by coordinates of virtual image of the intersection point of two diagonal lines. Extensive simulations, conducted for various target patterns with image coordinates errors, show that the range algorithm presented is quite effective for the relative state determination.
Keywords�� spacecraft rendezvous   spacecraft navigation aids   computer vision     
Received 2005-08-09;
About author: �����(1941-),��,����������,����, rz zhu@tom.com.
���ñ���:   
�����, ����, ����.���������������Ӿ�ϵͳ���������㷨[J]  �������պ����ѧѧ��, 2006,V32(07): 764-768
Zhu Renzhang, Lin Yan, Zhang Lei.New algorithm of solving for ranges during final approach of spacecraft rendezvous[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2006,V32(07): 764-768
���ӱ���:  
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2006/V32/I07/764
Copyright 2010 by �������պ����ѧѧ��