[an error occurred while processing this directive]
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2009, Vol. 35 Issue (11) :1398-1402    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
ͯ��ΰ1, �ܽ�ƽ1, ������1, ������2*
1. �������պ����ѧ �ѧԺ, ���� 100191;
2. �й����˺��칤�̰칫��, ���� 100720
Generalized multiple-revolution Lambert algorithm for solving multiple-impulse rendezvous problem
Tong Kewei1, Zhou Jianping1, He Linshu1, Zhang Liyan2*
1. School of Astronautics, Beijing University of Aeronautics and Astronautics, Beijing 100191, China;
2. China Manned Space Engineering Office, Beijing 100720, China

Download: PDF (0KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ ����һ�ָ�Ч�߾��ȵ�Battin��ȦLambert�㷨���һ�ֿ��ǹ���㶯�Ĺ����ȦLambert�㷨.�������㷨���,���㷨��Ȼԭ���ӵ��������̷dz���,Ч�ʼ���,�ֱ�ͨ����������ѭ���Ϳ����㾫��Ҫ��.�����ȦLambert�㷨���һ�ֿ��н��������ģ�͹�����һ��ͨ�õĶ�Ȧ�����彻��滮���,Ӧ�����������˶�����ĸ��ӹ����Ż�����,�������ø�Ч�ʵĽ���ȫ���Ż��㷨�Լ��������ģ����ȫ������,Ȼ���������ж��ι滮�㷨�Լ��򻯸߾��ȹ������ģ�����ֲ�����,�˷������Ա�֤��Ч�߾��ȵ�����Ȧ�����彻������.���������˷����ر�����������ʵ�ʹ���Լ���Ľ���滮����.
Email Alert
�ؼ����� ����   �������ѧ   ���ת��   �����Թ滮     
Abstract�� Techniques based on a high efficient high precision Battin multiple-revolution Lambert algorithm were extended to a generalized multiple-revolution Lambert algorithm which can consider orbital perturbations. The approach is difficult to understand but is high efficient with a simple calculation flow which needs only several inner and outer iterations. A unified multiple-revolution multiple-impulse rendezvous planning framework was proposed by combining the generalized multiple-revolution Lambert algorithm and a feasible iteration rendezvous approach. A two-step optimization method was used to solve this difficult multi-variable engineering optimization problem which first utilizing a high efficient evolutionary algorithm with an analytical orbit model for global search, then a sequential quadratic programming algorithm was used with a simplified high precision orbit model for local optimization. The proposed method can guarantee to solve multiple-revolution multiple-impulse rendezvous problem with high efficiency and precision. The demonstration validates that it is very suitable for rendezvous planning problem with practical engineering constraints.
Keywords�� rendezvous   orbit dynamics   orbit transfer   nonlinear programming     
Received 2008-11-07;
About author: ͯ��ΰ(1982-),��,���ϳ�����,��ʿ��,tongkewei@126.com.
ͯ��ΰ, �ܽ�ƽ, ������, ������.�����ȦLambert�㷨�����������Ž�������[J]  �������պ����ѧѧ��, 2009,V35(11): 1398-1402
Tong Kewei, Zhou Jianping, He Linshu, Zhang Liyan.Generalized multiple-revolution Lambert algorithm for solving multiple-impulse rendezvous problem[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2009,V35(11): 1398-1402
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2009/V35/I11/1398
Copyright 2010 by �������պ����ѧѧ��