[an error occurred while processing this directive]
   
 
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2007, Vol. 33 Issue (04) :405-408    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
���ظ�ʹ������������켣��ʵʱ�Ż�
����, ������*
�Ͼ����պ����ѧ �����ѧԺ, �Ͼ� 210016
Near real-time optimization for reentry trajectory of RLV
Wang Qi, Ding Yunliang*
College of Aerospace Engineering, Nanjing University of Aeronautics & Astronautics, Nanjing 210016, China

ժҪ
�����
�������
Download: PDF (370KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ ��һ�����ظ�ʹ��������RLV(Reusable Launch Vehicle)����ʱӦ�߱���������������,��ʵ�ֵĹؼ����û��ؼ������ʵʱ��ʵʱ������һ���������Լ������������켣.����RLV������ص�,�������µļ���,������켣���̽��м򻯴���,�Ż��ѶȽ���,����������.����������Ż��켣�ĸ���,�Կ�����(ӭ�Ǻ͹�ת��)���Ż�����������,ÿ��ֻ�Ե���һ�������������Ż�.�����������ںܴ�̶��ϼӿ��㷨�������ٶ�.����������,ֻ��10��s���ҵ�ʱ����ܲ���һ�������ն�Լ��������������Լ�������ͼ�����Լ�������Ĵ��Ż��켣.�������нϺõĹ���Ӧ�ü�ֵ.
Service
�ѱ����Ƽ�������
�����ҵ����
�������ù�����
Email Alert
RSS
�����������
�ؼ����� ���ظ�ʹ��������   ����켣   ��ʵʱ�Ż�   ���ӷ�   ���Ż�     
Abstract�� Determining how to find the best controls of a re-entering reusable launch vehicle (RLV) so that it is able to safely reach the terminal area energy management (TAEM) involving the solution of a two-point boundary value problem. This problem, which is considered to be difficult, is traditionally solved on the ground prior to flight. The optimal controls are found regardless of computation time by most of algorithms. But it-s very necessary to find the optimal controls quickly for some flight tasks. Traditional trajectory optimal algorithm can not shoulder this fast optimization task. In that work, a new hypothesis was introduced according to the features of constrained three-dimensional reentry trajectory of RLV. The set of dynamics and kinematics equations of motion was divided into two sets and only one set equations participate in the optimization iteration algorithm, which improves the efficiency of optimization greatly. Then the methods of multipliers was used to deal with the terminal constraints. Later the conjugate-gradient method was applied to evaluate the optimal reentry trajectory. Successful results show the algorithm is able to generate a feasible reentry trajectory in 10 s on the desktop computer.
Keywords�� reusable launch vehicle   reentry trajectory   near real-time optimization   methods of multipliers   near optimization     
Received 2006-05-16;
About author: �� ��(1963-)��,�㽭������,��Ϊ�ϲ����չ�ҵѧԺ����,wangqi439@126.com.
���ñ���:   
����, ������.���ظ�ʹ������������켣��ʵʱ�Ż�[J]  �������պ����ѧѧ��, 2007,V33(04): 405-408
Wang Qi, Ding Yunliang.Near real-time optimization for reentry trajectory of RLV[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2007,V33(04): 405-408
���ӱ���:  
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2007/V33/I04/405
Copyright 2010 by �������պ����ѧѧ��